{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"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":"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"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":"name-matcher.matchMethodCall (cyclomatic 454): name-matcher.matchMethodCall has cyclomatic complexity 454 (threshold 15). Of this number, 315 points are the body\u0027s own statements and 139 belong to 15 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e831a72a70422fa7a343fc794c09732c763991483565f4a472dc42f15aae32f3"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractCall (cyclomatic 338): TreeSitterExtractor.extractCall has cyclomatic complexity 338 (threshold 15). Of this number, 332 points are the body\u0027s own statements and 6 belong to 2 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace273b9f528e2a878b43ef7fbff7f1b3c947c258c5a364210710efdb99a1f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleExplore (cyclomatic 321): ToolHandler.handleExplore has cyclomatic complexity 321 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ToolHandler.handleExplore::shrinkCluster) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe7812e89dd07f0ad529cf4a4f94c986e21741c3777376f8744b12e5190c1f5"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchByExactName (cyclomatic 214): name-matcher.matchByExactName has cyclomatic complexity 214 (threshold 15). Of this number, 88 points are the body\u0027s own statements and 126 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf03fd9178d7cb6199b9ee3bdf6672327dd4a5d07f2c7a7bfca0df3a963cd1b"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.buildSteps (cyclomatic 202): steps.buildSteps has cyclomatic complexity 202 (threshold 15). Of this number, 189 points are the body\u0027s own statements and 13 belong to 7 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":"src/ui-server/api/steps.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d7ec134f5b4fa8044d56f0844a4a478b109d7f1f3d125626920bbe8c96478a"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextBuilder.findRelevantContext (cyclomatic 183): ContextBuilder.findRelevantContext has cyclomatic complexity 183 (threshold 15). Of this number, 163 points are the body\u0027s own statements and 20 belong to 10 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":"src/context/index.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f2b6614e6595bfa5736a9512e51f315fd907dd5da47331b267da51825c00e"}},{"ruleId":"D1","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges (cyclomatic 158): c-fnptr-synthesizer.cFnPointerDispatchEdges has cyclomatic complexity 158 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts, c-fnptr-synthesizer.cFnPointerDispatchEdges::processUnit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0f8e9dd5f8ab94918c49a7428fb81c8861749c83a64976438a355062c06c62"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.resolveOneInner (cyclomatic 150): ReferenceResolver.resolveOneInner has cyclomatic complexity 150 (threshold 15). Of this number, 146 points are the body\u0027s own statements and 4 belong to 4 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":"src/resolution/index.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5455f035076b3d6b576fb0b175b3fe077bd96e82ef8001f95c9ce855d563d3d0"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractVariable (cyclomatic 145): TreeSitterExtractor.extractVariable has cyclomatic complexity 145 (threshold 15). Of this number, 135 points are the body\u0027s own statements and 10 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72208ef55633974abb8c3e1cc575d4329763d64d207f9ded447e860a1cd31b"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeGraph.sync (cyclomatic 133): CodeGraph.sync has cyclomatic complexity 133 (threshold 15). Most of this is not in the body itself: 1 of the 133 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 1128, 1227, 1438, \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":"src/index.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ca574f704d9dad010b3720a329a077137d254b63490d148f471d6aa394304c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchFuzzy (cyclomatic 131): name-matcher.matchFuzzy has cyclomatic complexity 131 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 68 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31921}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd19d95373b6a59f5b891a93fd5442043957289c6e23ca51536dcc91a7d5255"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.dispatchNode (cyclomatic 123): TreeSitterExtractor.dispatchNode has cyclomatic complexity 123 (threshold 15). Of this number, 120 points are the body\u0027s own statements and 3 belong to 2 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"571c5752aed4e838ec06d7c8cead67775f4827d25bac810b5b698f074c3588f6"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractInheritance (cyclomatic 116): TreeSitterExtractor.extractInheritance has cyclomatic complexity 116 (threshold 15). Of this number, 115 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7890}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed2fbc4b299019ee790e4cca27b69236809c710c79fc9e773e6c8af4b66d276"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchReferenceInner (cyclomatic 111): name-matcher.matchReferenceInner has cyclomatic complexity 111 (threshold 15). Of this number, 104 points are the body\u0027s own statements and 7 belong to 4 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86799c575869fb0944bb300b1366cb74763be6b2dcb6762af309ce2dc596acb"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.goImplementsEdges (cyclomatic 111): callback-synthesizer.goImplementsEdges has cyclomatic complexity 111 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 68 belong to 15 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f3ee5b734a89cb8dbe4f7ad333f6c14ff34101c99c9142a1b05f4d56bb0003"}},{"ruleId":"D1","level":"warning","message":{"text":"rust-scopes.readRustBindings (cyclomatic 104): rust-scopes.readRustBindings has cyclomatic complexity 104 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 41 belong to 12 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a492fbf9314f3ab56e86b18e992739dab71f4f316d6b5c41e5acaea6d8170a2"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy.runLocalHandshakeProxy (cyclomatic 96): proxy.runLocalHandshakeProxy has cyclomatic complexity 96 (threshold 15). Most of this is not in the body itself: 3 of the 96 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 432, serveLocally, a function literal at line 554, \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":"src/mcp/proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b7eb50c680951453983889c9e9e7788a409dbe0d6ae98dc286d379d7526b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionOrchestrator.indexAll (cyclomatic 93): ExtractionOrchestrator.indexAll has cyclomatic complexity 93 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 37 belong to 12 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":"src/extraction/index.ts"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3c278cfb7af4a9dd6cbeceb3eaeb26d156ffff5cbf1331ff060bcbf4b228ad"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchEnclosingScopeMember (cyclomatic 92): name-matcher.matchEnclosingScopeMember has cyclomatic complexity 92 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 66 belong to 20 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14092}}}],"partialFingerprints":{"codehealthFindingId/v1":"127661b87b7e9a0444b7adfb989d037f94d4a89c5cb45906e61297a2afb4844f"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.resolveViaImport (cyclomatic 87): import-resolver.resolveViaImport has cyclomatic complexity 87 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 4 belong to 4 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"be240067748da73e7afc4abf3b3d791943324dedfaa79cf98d01b98ca1a6e6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.createContext (cyclomatic 87): ReferenceResolver.createContext has cyclomatic complexity 87 (threshold 15). Most of this is not in the body itself: 1 of the 87 points is its own statement and the rest belongs to 27 function literals inside it that branch (lines 923, 1097, 1006, \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":"src/resolution/index.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a187281c336536b3a374d47dc9b3325571ee0b3bec72ba14e81d97cb2656bbbe"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.resolveAndPersistBatched (cyclomatic 85): ReferenceResolver.resolveAndPersistBatched has cyclomatic complexity 85 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 23 belong to 8 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":"src/resolution/index.ts"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"38858c2d41f7c709feb326f53432520dfa7b95735fd01549902f522b4192cb47"}},{"ruleId":"D1","level":"warning","message":{"text":"function-ref.normalizeSpecial (cyclomatic 80): function-ref.normalizeSpecial has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/function-ref.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeff7313956700e648e99009544e32c312b0ed3ceeb9bb6501029acb3b553e4"}},{"ruleId":"D1","level":"warning","message":{"text":"react.scanRoutes.unit (cyclomatic 80): react.scanRoutes.unit has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1cc6007ed48d1df6da48985658dfc38ef2ce8667cccd32b3a7a3ba2c428f18"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.reactJsxChildEdges (cyclomatic 80): callback-synthesizer.reactJsxChildEdges has cyclomatic complexity 80 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 17 belong to 11 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada2cd358bab62c35dcc53ab04eb5f01b8481c64106be68a7f709156c66f278"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionOrchestrator.sync (cyclomatic 76): ExtractionOrchestrator.sync has cyclomatic complexity 76 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 4 belong to 2 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":"src/extraction/index.ts"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5b252185e8fd3ce97d87255a9cbeee625c0dc2b09b2e9650980f2e2388a4f5"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-template-calls.scanExpression (cyclomatic 73): vue-template-calls.scanExpression has cyclomatic complexity 73 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 6 belong to 4 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88e43466c61f1de1a06d2a11423e511389f03c9df0a1ef1de2cb95ded9996cf"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isRustNameInScope (cyclomatic 73): name-matcher.isRustNameInScope has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10807}}}],"partialFingerprints":{"codehealthFindingId/v1":"34911bb2db4f53437b0e0764c4f41cae62fdd04fa11ed5a767b1e5153dde6572"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-brace-scopes.scanCppBraceScopes (cyclomatic 72): cpp-brace-scopes.scanCppBraceScopes has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f91f0391d2e72a1368598caec87fd1a53807750f13e599d59b5080224a7603"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.inferCppReceiverType (cyclomatic 70): name-matcher.inferCppReceiverType has cyclomatic complexity 70 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20087}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5d95107b59dccd7a061787c8befa683b586436787e447b5618f9af057a075d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.inferLocalReceiverType (cyclomatic 69): name-matcher.inferLocalReceiverType has cyclomatic complexity 69 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 26 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a02c8fdb0c69f4ac86607541a1c0cc120e973fd7a2dbfc30bc5d718e3bbc82"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.visitFunctionBody::visitForCallsAndStructure (cyclomatic 69): TreeSitterExtractor.visitFunctionBody::visitForCallsAndStructure has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7602}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e910c1ee1c04c3b629273d9e96425a7aa681c956b2a9f03a33b3d61f5cbc214"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.rnEventEdges (cyclomatic 68): callback-synthesizer.rnEventEdges has cyclomatic complexity 68 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 4 belong to 3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19972e2d6ca2874efd493d656842e916092456f351a3760c271bb63484c26c6"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeGraph.indexAll (cyclomatic 67): CodeGraph.indexAll has cyclomatic complexity 67 (threshold 15). Most of this is not in the body itself: 1 of the 67 points is its own statement and the rest belongs to one function literal inside it that branches (line 649). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a3afe1c4e7943585b0c191e583ae7f81d70255a2c3df21981f4cf0ae17a2b1"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.statementsShape (cyclomatic 66): pascal-preparse.statementsShape 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb3c2d57314e43c0a5de0cd3f521c23859a38b57f55f3eb3346fb6d27a5b1fa"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchFunctionRef (cyclomatic 65): name-matcher.matchFunctionRef has cyclomatic complexity 65 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 19 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"da237d608292eb2ea1283b576a27f77b8274ac1b0db863b838bd32053305b20c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.resolveMethodOnType (cyclomatic 61): name-matcher.resolveMethodOnType has cyclomatic complexity 61 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 16 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd6c0c0378d2aabf458072a48842af946b607bccb06d908abe884b06e44818"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.flushValueRefs (cyclomatic 61): TreeSitterExtractor.flushValueRefs has cyclomatic complexity 61 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bab33a549f5be1002cce10721819adce41155cc81e19c451fe4d69e3ce97db"}},{"ruleId":"D1","level":"warning","message":{"text":"query-paths.extractQueryPaths (cyclomatic 61): query-paths.extractQueryPaths has cyclomatic complexity 61 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-paths.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"166d61331edf6074e43ad91d8115188b2b5dea2eb1bc3a59506feeed8ebd5192"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::ccpp::brace_scopes::scan (cyclomatic 61): codegraph_kernel::ccpp::brace_scopes::scan 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":"codegraph-kernel/src/ccpp/brace_scopes.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"528a5897766f6d5c8d28d65239026043ee1354afa8b419a67cd4e3cce07ae1c6"}},{"ruleId":"D1","level":"warning","message":{"text":"java.synthesizeLombokMembers (cyclomatic 60): java.synthesizeLombokMembers has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/java.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d42dd4801dfcac5c8bd6c8b6d32bd1c1b88cfd322648d69daec5319f6a91dc4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustValueType (cyclomatic 60): name-matcher.rustValueType has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca04dd7e44ab9d2d1ded60fc7c4783580ea3ebb67176fa936a6ba7a7ca7e7b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchMemberFunctionRef (cyclomatic 59): name-matcher.matchMemberFunctionRef has cyclomatic complexity 59 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 13 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce4a41fa6034daf47a98121e05c133ff5f0417932ed402335b653430109730a"}},{"ruleId":"D1","level":"warning","message":{"text":"steps-model.packRegions (cyclomatic 59): steps-model.packRegions has cyclomatic complexity 59 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 40 belong to 15 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e01907b0700e7436d5e351d470990fbbb4bf787748f674e10e792fcbdd0c80c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isVisibleAcrossFiles (cyclomatic 58): name-matcher.isVisibleAcrossFiles has cyclomatic complexity 58 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4192}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df91befbe2430104b7c72e197f86231e7873de480bea5231d0912d28cd3149"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.buildPolymorphicBoundaries (cyclomatic 58): ToolHandler.buildPolymorphicBoundaries has cyclomatic complexity 58 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 34 belong to 8 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":"src/mcp/tools.ts"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2296b8fb2445feefa7ead98566a4dbdddd22af196be9c9f72b7ddabd50dffa5"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppExpressionType (cyclomatic 57): name-matcher.cppExpressionType 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17592}}}],"partialFingerprints":{"codehealthFindingId/v1":"381fcff91eb754c02457ac6fb426797dc728d3fac3bb5ad6085abd7824bfa926"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.isBuiltInOrExternal (cyclomatic 57): ReferenceResolver.isBuiltInOrExternal has cyclomatic complexity 57 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 8 belong to 2 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":"src/resolution/index.ts"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e07c7f8a7b152669e2b80002d07e04fe502a92f11c8c2fa6f66e03c6ea7629"}},{"ruleId":"D1","level":"warning","message":{"text":"ambient-modules.tokenize (cyclomatic 56): ambient-modules.tokenize has cyclomatic complexity 56 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26373c05aa348cc1b1607092f977006a7ee394679abd2eae838233c4d36d358"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustTypedMethodCall (cyclomatic 56): name-matcher.rustTypedMethodCall has cyclomatic complexity 56 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 8 belong to 4 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c4cfa05359e12257507c0f67875e685019ff2a35c013a511b09da702fb800b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.resolveAwaitedCallType (cyclomatic 55): name-matcher.resolveAwaitedCallType has cyclomatic complexity 55 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 16 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2141ed38263333d0f5614d03392075833cb7c0283c26a5525589b6b0ee35b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::synthesize_lombok_members (cyclomatic 55): Walker::synthesize_lombok_members 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10defc5a5ffd9cc1c44315b50eeb15379da554dd5413f2f6f030afa2903da25"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankCUnbalancedConditionalBranches (cyclomatic 54): c-cpp.blankCUnbalancedConditionalBranches has cyclomatic complexity 54 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ec43b6052c087103075ce1c69428a8d21c7c7be1e55bf8bb723a5cc8e2ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri-synthesizer.readFrontend (cyclomatic 54): tauri-synthesizer.readFrontend has cyclomatic complexity 54 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 17 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f3917825eed3ff89b46f259be62be962f8b7e88465d0b89d7eb79cac53a25"}},{"ruleId":"D1","level":"warning","message":{"text":"JsxLexer.code (cyclomatic 54): JsxLexer.code has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/jsx-code.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc21520a4bcd8044d9182c932dd38a411880ff689e70c22f82410f94c963d79"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonStatementBindsAt (cyclomatic 52): name-matcher.pythonStatementBindsAt has cyclomatic complexity 52 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86acb9ecef2b4b83b26e75bf9890c7eb328351ff8f3123d3ae6ff271c0c0890"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.interfaceOverrideEdges (cyclomatic 52): callback-synthesizer.interfaceOverrideEdges has cyclomatic complexity 52 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 8 belong to 5 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb2033c17a392b27fb423c85310a73e887774973f7429efdcecfb9f6dcd0db"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goReceiverChainType (cyclomatic 51): name-matcher.goReceiverChainType has cyclomatic complexity 51 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3728375ab8ea1393e54573aaad2bb1d1fc40f6264b344751b1ba1ef8c0230b88"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.readGoScopes (cyclomatic 50): name-matcher.readGoScopes has cyclomatic complexity 50 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 5 belong to 3 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c583f0da4e1ce85bc8493c27a614d22da8752d0dd5bcf962121f40d4991aa69"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby.extractScopedRailsRoutes (cyclomatic 50): ruby.extractScopedRailsRoutes has cyclomatic complexity 50 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da0c3ac0fbfcf8509feba7a2fc8bce4736925358fad14bd7d59e156bde2274d"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractImport (cyclomatic 50): TreeSitterExtractor.extractImport has cyclomatic complexity 50 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 5 belong to 3 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e8d3dcc09708886e2aa36fec879eed9a1414d68ee17270bb5c04149a0dcd4"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-template-synthesizer.angularTemplateEdges (cyclomatic 50): angular-template-synthesizer.angularTemplateEdges has cyclomatic complexity 50 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 8 belong to 4 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"57583fd52a284a1806cfcb22d5c194d8ff36a2359c3065288996ba59c90a2916"}},{"ruleId":"D1","level":"warning","message":{"text":"dead-code.buildDeadCodeReport (cyclomatic 50): dead-code.buildDeadCodeReport has cyclomatic complexity 50 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 7 belong to 5 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":"src/graph/dead-code.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d638773525a76c16a1fcd62bf56e9072ca6b2374cac364dfebc0dcfc65450ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isJavaTypeVisible (cyclomatic 49): name-matcher.isJavaTypeVisible has cyclomatic complexity 49 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7371a8bbda6c1aa783a472afabd6f40143475633368a05261cea6854884d7c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleFileView (cyclomatic 49): ToolHandler.handleFileView has cyclomatic complexity 49 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 10 belong to 3 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":"src/mcp/tools.ts"},"region":{"startLine":8256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f170457d6cebdcb3dcba17fd9d90431e8c3f751381884f8830d69482358c496f"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.findExportedSymbolWalk (cyclomatic 48): import-resolver.findExportedSymbolWalk has cyclomatic complexity 48 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4291}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f2531afd91c051c651adc9488ba5aae82abb35620ddfb3f6ccb80a1c77990b"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-visibility.walkTranslationUnit::scan (cyclomatic 46): cpp-macro-visibility.walkTranslationUnit::scan has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be1b4f0d2f6dc9913474fd79e85c78bc59ff81a4334bb1ed8c1a07e6a0b4623"}},{"ruleId":"D1","level":"warning","message":{"text":"react-native.buildRNMaps (cyclomatic 46): react-native.buildRNMaps has cyclomatic complexity 46 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b8c5881f5cc6e9df5d6628435b5d4e7ab9aedc30de2f5c1cc65c7216a7cc2c"}},{"ruleId":"D1","level":"warning","message":{"text":"map-model.buildMapLayout (cyclomatic 46): map-model.buildMapLayout has cyclomatic complexity 46 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 15 belong to 5 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":"ui/src/lib/map-model.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"051ee4ef26b90391abd908e51ee1a7ede6b688eb7e388f544f348ccb0b36836e"}},{"ruleId":"D1","level":"warning","message":{"text":"rust-scopes.readRustScopes (cyclomatic 44): rust-scopes.readRustScopes has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/rust-scopes.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cf125e2fefd9bc0b6a77a110a35c2416cc10ca58ed83593070840f18777533"}},{"ruleId":"D1","level":"warning","message":{"text":"flow-model.buildFlowLayout (cyclomatic 44): flow-model.buildFlowLayout has cyclomatic complexity 44 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/flow-model.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5dfd719b6bfd0cfdd5b72d85837792fa8d8f4051e4781c8a5ddd549c8da6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankCStatementMacroCalls (cyclomatic 43): c-cpp.blankCStatementMacroCalls 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf59f45bf5a23e0f5b71d947ea090560b9c25a04ca738eebce112476524611c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppUnnamedNamespaceSpans (cyclomatic 43): name-matcher.cppUnnamedNamespaceSpans 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa033239ef75f8abe7ec609e5760cfa359cb97f368027ceff0fb3a1328d6a176"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.erlangBehaviourDispatchEdges (cyclomatic 43): callback-synthesizer.erlangBehaviourDispatchEdges has cyclomatic complexity 43 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 10 belong to 3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68c7739e79fea216853350cda7a07d9588745b265968d01949148e9eb567a41"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby-parameter-flow.readArgumentList (cyclomatic 43): ruby-parameter-flow.readArgumentList 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa222d9de1ba47e506dfd88e8e7e8f3e770307590ba84abcad00ec8ea76dcea"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.gateTargetKind (cyclomatic 43): ReferenceResolver.gateTargetKind 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":"src/resolution/index.ts"},"region":{"startLine":4299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd418b6729b947a1a25f857a69f59bf101e32a0ca4d8e2af6e07dbbc8625e956"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.preParsePascal (cyclomatic 42): pascal-preparse.preParsePascal 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062ae339c54ca4549ba66849c38bfb380946477a0ac20da901ddb34b688091d"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-methods.cppCodeScan (cyclomatic 42): cpp-macro-methods.cppCodeScan 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0d7f709bf1aeff50e85ed8901a49495f172092efd4c6ab92d6d61fbfa0f544"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractTypeAlias (cyclomatic 42): TreeSitterExtractor.extractTypeAlias 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"af236979cd37d145eceae6d2f5c6a8874cda26e78aecda8c133261dcd0bac38c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.resolveOneIn (cyclomatic 42): ReferenceResolver.resolveOneIn has cyclomatic complexity 42 (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":"src/resolution/index.ts"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8171208ac4d71fcc90a90937c226618716d27b88675cea40d694dbb541a5cbca"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.buildScreens (cyclomatic 42): screens.buildScreens has cyclomatic complexity 42 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/screens.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3580ae24d761223ba294e7f697a8b41a9d84830c63fc2f80299fc5818dc7e60a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonAttrStatementsUncached (cyclomatic 41): name-matcher.pythonAttrStatementsUncached has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28098}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84350554d00710b68635a72230e1c8628e2f5935c1acd86d67fec122bd6b6da"}},{"ruleId":"D1","level":"warning","message":{"text":"branch-guards.memberTypesInTree (cyclomatic 41): branch-guards.memberTypesInTree has cyclomatic complexity 41 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 17 belong to 5 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":"src/graph/branch-guards.ts"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"480d56fcca8a48382717a96214b694c1758b82a3d561cacdd96d598e3856a177"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleNode (cyclomatic 41): ToolHandler.handleNode has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 5 belong to 3 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":"src/mcp/tools.ts"},"region":{"startLine":8069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5e4efbfa75422f04aca36f82fda3320ecfc52c826a4d74d06351d85c1da521"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractStaticMemberRef (cyclomatic 40): TreeSitterExtractor.extractStaticMemberRef 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6813}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edbc7e83f12d18c3ff88dc0d71ff17f737d511c5a4f138c816a26c8d2411969"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.visitPascalNode (cyclomatic 40): TreeSitterExtractor.visitPascalNode 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc604743c425eb6d365d23fd2d2a2f9c55a6821cc9ae1c2cc57a0e8163ebc0"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.synthesizeCallbackEdges (cyclomatic 40): callback-synthesizer.synthesizeCallbackEdges has cyclomatic complexity 40 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 24 belong to 9 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5471}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf81f9d0b60199c2371e683c2d352b6058f7102517b3acee298384703a2d030"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runInstallerWithOptions (cyclomatic 40): index.runInstallerWithOptions has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82b0aeb8ea0b2e4b19d83df2d2a1acc893a635d6bd7f651aee1962025f93e44"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalParenlessName (cyclomatic 39): TreeSitterExtractor.extractPascalParenlessName has cyclomatic complexity 39 (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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9603}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebf7fa156cb6d7b540e297365a89ea77508f68c9e73216887ab4a4a2893d566"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri-synthesizer.readBindings (cyclomatic 39): tauri-synthesizer.readBindings 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f6538c558b6eed3d90617cfe08613bc66c5b6325772e980092e6189cc8c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.execute (cyclomatic 39): ToolHandler.execute 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":"src/mcp/tools.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"817259a7da49a752d177f3e7768b4e2877ca7c791e1c19fde5e42f4b81680ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.buildFlowFromNamedSymbols (cyclomatic 39): ToolHandler.buildFlowFromNamedSymbols 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. This shape REPEATS in the file: one other method here (ToolHandler.buildFlowFromNamedSymbols::collectSynthLinks) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a561ad9ad4d17a49bec288e608078656937dc387383e9ae178b352f53e72f46"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankCTypeKeywordArgs (cyclomatic 38): c-cpp.blankCTypeKeywordArgs 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"719e208d0f74513d9ca9f9d3219c71b37e8427031b1dc2553a3a28c146c62111"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustTypeLookup (cyclomatic 38): name-matcher.rustTypeLookup has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e178ba805dfa689d763a16bc5e22fb329d7392f338e57f84cd37a1198bcdb0ca"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.inferJavaFieldReceiverType (cyclomatic 38): name-matcher.inferJavaFieldReceiverType has cyclomatic complexity 38 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 12 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee23b0f0e9cca30b83e7ba04ba61da4b4d3657a7cb993db1cb999eec081cf1a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchReference (cyclomatic 38): name-matcher.matchReference has cyclomatic complexity 38 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32100}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae7593df44ce14c716b5fa1ffb6891826d7dcca355f3cda7cb39cc8c8d9ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"parameter-flow.planFlows (cyclomatic 38): parameter-flow.planFlows has cyclomatic complexity 38 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 19 belong to 7 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff30225defcb394bbf19b9c247410de9e486657512e3eac7ca8d9ab9be1047f"}},{"ruleId":"D1","level":"warning","message":{"text":"branch-guards.triggerInTree (cyclomatic 38): branch-guards.triggerInTree 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":"src/graph/branch-guards.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac67603408b07eef9a7152de4c9e9ba67dd85d2229a106e4bebad9814082a41"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.templateLiteralTextAt (cyclomatic 37): strip-comments.templateLiteralTextAt has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/strip-comments.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2caee1c3e5edce90727006f231e2e552ea1bbf93f5670fb2bf1e252305c3021"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-local-scope.blankDartLiterals (cyclomatic 37): dart-local-scope.blankDartLiterals has cyclomatic complexity 37 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7d62a298aee29e96cd0d7e5fd1ad85ea17fe88ddcc690f45e4bfaad14181c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.blankDartCode (cyclomatic 37): name-matcher.blankDartCode has cyclomatic complexity 37 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e007755f72d8f20d15228ff870b50cc93b4a37cb2bbba44c1d969dd263b653b9"}},{"ruleId":"D1","level":"warning","message":{"text":"explore-diagnostics.renderTable (cyclomatic 37): explore-diagnostics.renderTable has cyclomatic complexity 37 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 5 belong to 4 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":"src/mcp/explore-diagnostics.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4525958ffcf87dfd603f9d14917693be4cb81bc334e30da8a0664ea92b1f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runUninstaller (cyclomatic 37): index.runUninstaller has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7801c6897dd248646c2853e9c487f446f38e6a56d2275323f0130262ee6682a"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_variable (cyclomatic 37): Walker::extract_variable has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e208a9f90e592405896c11193c78efca586a072f9e67bf9df5ed0eea7f9898"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-template-calls.scanMarkup (cyclomatic 36): vue-template-calls.scanMarkup has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/vue-template-calls.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50220927c281396bc9f5629b2d3075c27d24464e8376796d5d090323e326f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ambient-modules.scanNamespaceBlocks (cyclomatic 36): ambient-modules.scanNamespaceBlocks has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 2 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 337). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb2048de06eb9cedb11afc621d3bba1a8e12a5dcb367a8b361c15c9ee4ecca"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonLineBindings (cyclomatic 36): name-matcher.pythonLineBindings has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3a0e6dc8ba230033d0547354720c91b774c94bb20d5a8a4c338517dded48f7"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppForBodyEncloses (cyclomatic 36): name-matcher.cppForBodyEncloses has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17813}}}],"partialFingerprints":{"codehealthFindingId/v1":"94efc608841be62d669092705d265463810cf2b0a01b5defcf00bc067b0add8b"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.parseAngularRoutes::walk (cyclomatic 36): angular-router.parseAngularRoutes::walk has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a0aebb725ebfe0932eabd0363ab5df86018a06baa5a194621bbc8f5512646e"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractField (cyclomatic 36): TreeSitterExtractor.extractField has cyclomatic complexity 36 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 9 belong to 2 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa59de24b4ce79d710795eef96d9c9a456d2f641d42e196bef415daaed61b6"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.pascalNameMode (cyclomatic 36): TreeSitterExtractor.pascalNameMode has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":9859}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb07b89f8a73b511f3a76c0ded9c0b6125298ee8792c515ade3bd45fad2c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-sitter.extractNameRaw (cyclomatic 36): tree-sitter.extractNameRaw has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5ef7538132054bf8b03a74aadb76d9a971c32d7c5e77604354858af2b36953"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.vueTemplateEdges (cyclomatic 36): callback-synthesizer.vueTemplateEdges has cyclomatic complexity 36 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 9 belong to 4 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"db07eeb5046d60203292b16f6f96e98cfb310eaae4b35b2f56eeed28239edf95"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.springEventEdges (cyclomatic 36): callback-synthesizer.springEventEdges has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b841a59f97117f66eaf95b3c10f6df53f608715047567b19afc8d1f977744b"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.mediatrDispatchEdges (cyclomatic 36): callback-synthesizer.mediatrDispatchEdges has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 4 belong to 3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3f2a787c664bd7cfaf588d8ff9adbe88d01d80deaae2673755fd6091a8b405"}},{"ruleId":"D1","level":"warning","message":{"text":"synthesized-hop.describeSynthesizedHop (cyclomatic 36): synthesized-hop.describeSynthesizedHop has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/synthesized-hop.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"092591ad527ac5c4e634f60dbf01d8208ca12943eecc2f0c5a40a423bc741eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.attribute (cyclomatic 36): screens.attribute has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/screens.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3cbbd7a371932d2b10c63e64bc101f2fa6a0dc6467b3e074571a1efb719be4"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::dispatch_node (cyclomatic 36): Walker::dispatch_node has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c56244ed63d35a4099fc124b2154af328a44a5437ebb2e2b8743119f7662553"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 36): Walker::visit_node has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"242f0cb7f148324b65f2bbe149c321b72157f9c342590256e4b09fd891c646ad"}},{"ruleId":"D1","level":"warning","message":{"text":"rust-scopes.blankRustCode (cyclomatic 35): rust-scopes.blankRustCode has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/rust-scopes.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21d78452e14f9baff73f953276cbfe2a07b4f0bdb084c3c6772dfbdfd5d6917"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustItemOf (cyclomatic 35): name-matcher.rustItemOf has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12835}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccd4c651511f3107f2f3578e1188b978f2f55219c4a74ce67cbb00a9d4a4c74"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.resolvePythonModuleMember (cyclomatic 35): import-resolver.resolvePythonModuleMember has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":3698}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa85d672694b933e30ac312f67c244893d6311dbb2605637f350b5d414ee73ba"}},{"ruleId":"D1","level":"warning","message":{"text":"react.scanRoutes.jsx (cyclomatic 35): react.scanRoutes.jsx has cyclomatic complexity 35 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a63f72da3d89b81d2f168f2d9f8290534c343a3f227f410bc3d8ea0e2c966f"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-template-synthesizer.templateMemberUses (cyclomatic 35): angular-template-synthesizer.templateMemberUses has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"127c40a742fc458ffcf30dff22ca2ee815ff4f9c49712aab632717fe347c4285"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.nixOptionPathEdges (cyclomatic 35): callback-synthesizer.nixOptionPathEdges has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 4 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4875}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4280321842f8ac26082cb86221607565b889ef5bee26a894ef719d1826c7e7"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isLexicallyReachable (cyclomatic 34): name-matcher.isLexicallyReachable has cyclomatic complexity 34 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6acc69b8a46156ce6eeb090cbd16c1b5bed4b08fefaf318aee98fc7abded6b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppDeclaratorsAfterFirst (cyclomatic 34): name-matcher.cppDeclaratorsAfterFirst 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16780}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce4586be2d517ad7f171c69741739554d635d8c379f6334ed5d1b528685700e"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchJavaStaticFieldCall (cyclomatic 34): name-matcher.matchJavaStaticFieldCall has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21553}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bb00044252c7fff7c037e8d8ac859e8b3fc7c9bf4d7be2207052cac5a84334"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.readRequestPath (cyclomatic 34): tier-synthesizer.readRequestPath 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"b453d1b47d274fa9fb0e51afde859c557d88bed0cce509e0b22650fff9f13851"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri-synthesizer.readRustSide (cyclomatic 34): tauri-synthesizer.readRustSide has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58826f9c744fd78a23b4db91e27a1f10f5ba71d671ed903dee77c3ccb917eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.laravelEventEdges (cyclomatic 34): callback-synthesizer.laravelEventEdges has cyclomatic complexity 34 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 5 belong to 4 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a5bdfc7cef2207fdceef7e0c8b74a5918bd81b5c5d9405de51ba0c13742e3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_call (cyclomatic 34): Walker::extract_call 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d324370fed16e3f292d2d50151cf8df25c568dadcb742219c2e11c2f1ae22"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 34): Walker::visit_node 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e72328066ebd344cb13f0eb0471597fe767341097071d3f460ab920fa5403"}},{"ruleId":"D1","level":"warning","message":{"text":"function-ref.captureFnRefCandidates (cyclomatic 33): function-ref.captureFnRefCandidates 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":"src/extraction/function-ref.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c36faa5eb7d456ff3bea7ff7c39ef70c8ff708ff6bf9bb6c9f22799ad00286f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goSignature (cyclomatic 33): name-matcher.goSignature has cyclomatic complexity 33 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 11 belong to 3 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2477e3dd5ccec4cdb61702fd78d07bf03bc65978aac41980751e0dec051e04"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchRustUseBoundName (cyclomatic 33): name-matcher.matchRustUseBoundName 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10991}}}],"partialFingerprints":{"codehealthFindingId/v1":"454df0a7649ee367c6810327654c59abd8b076299359b4651dae40dcbdd9f1e2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustPathTarget (cyclomatic 33): name-matcher.rustPathTarget has cyclomatic complexity 33 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4339d6e84c684e6977699db76084b78093db8f7c4a8a3a6d78d01bb24cfa43"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustReadType (cyclomatic 33): name-matcher.rustReadType has cyclomatic complexity 33 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 2 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12263}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fd27ead63b983ed7fd053d47f7d9ee6a8a616b4f8c061dfdb70541db1a0d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppLibraryElementOf (cyclomatic 33): name-matcher.cppLibraryElementOf has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8553f4e4cd7be867980394bdf3c1665f31c82c539c99edc29963761459be03"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.walkComponentWrapper (cyclomatic 33): TreeSitterExtractor.walkComponentWrapper 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a993ab649a3ac81e321894a339fef88723a18b83ee60634d81619e6c8ed41cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"const-alias-synthesizer.readTopLevel (cyclomatic 33): const-alias-synthesizer.readTopLevel 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc53ff3f0f7baa80077c8ac16ab451863f1ac6b3adf0f483a1c561a9bc4b8c2"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.closureCollectionEdges (cyclomatic 33): callback-synthesizer.closureCollectionEdges has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f510d3aa0a99f9e212db0f8eee26601190003e33fdabb82f871d13755c1999"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cyclomatic 33): Walker::visit_for_calls_and_structure 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc30ffdad00938813c771ed971e0a7f5a4e7862cd5e6e389f20d79a11b3fd636"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.recoverSingleArgMacroDefinedName (cyclomatic 32): c-cpp.recoverSingleArgMacroDefinedName 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"655a7e28e9cdeebc74e64a54caab7d0ad8817b10f91d4037afd0b2098f7c037d"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.stripGo (cyclomatic 32): strip-comments.stripGo 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":"src/resolution/strip-comments.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf89c6133ebbda6de5772f15f900d5d3084e9a5e0ef86f57fd14c3cce7bd9d9"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.matchVbMemberRead (cyclomatic 32): vbnet-receivers.matchVbMemberRead has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"415dcbf710c53d87b831d2f51bc4fe05535e5b32d116453a63c5c2de7121180b"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-raw-strings.cppNonCodeLines (cyclomatic 32): cpp-raw-strings.cppNonCodeLines has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 9 belong to 2 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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce25efb871b881c7fa72e9ef56e01aa4547dc6c68abbfa0f562133c038350c4"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-supertypes.lookUpCppClass (cyclomatic 32): cpp-supertypes.lookUpCppClass has cyclomatic complexity 32 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 6 belong to 4 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"34be944dae46ed963faa365d4a80076f0b77d409d551e477c87456a56f90e1e8"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.objcFileMembers (cyclomatic 32): name-matcher.objcFileMembers 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8380eb8067c3b19994d1e624170ca25e951fe67b51970a914ab4034043c11cf"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustCrateGraph (cyclomatic 32): name-matcher.rustCrateGraph has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 9 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9630}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6bf330e1719b63709cb71daf04be8bb4e278e6c825ef300cfb134f8db84ca2"}},{"ruleId":"D1","level":"warning","message":{"text":"java.extractSpringConfig (cyclomatic 32): java.extractSpringConfig has cyclomatic complexity 32 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 13 belong to 3 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6d8246baa5cf0673a82106935388644c3b80dddefa0789f7038548d7d451f1"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.arkuiEmitterEdges (cyclomatic 32): callback-synthesizer.arkuiEmitterEdges has cyclomatic complexity 32 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 6 belong to 4 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b27b7223775c7eec9eab308eea0c7c7e142e38f1e61598943bf5b4dbb24a79"}},{"ruleId":"D1","level":"warning","message":{"text":"dead-code.byNameHookCandidates (cyclomatic 32): dead-code.byNameHookCandidates has cyclomatic complexity 32 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 5 belong to 4 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":"src/graph/dead-code.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfafafb4a40cd787537d5f1de194a0de88c2df050a0c28192cb9bc8697b9bac7"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 32): Walker::flush_value_refs has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c442669c69b401c4e73fe9ce02d4524f0e72658e1a081c323d70c9cf631b48d2"}},{"ruleId":"D1","level":"warning","message":{"text":"function-ref.goLocalBindings (cyclomatic 31): function-ref.goLocalBindings has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. 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":"src/extraction/function-ref.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ba6469743d05d3871d668f9893234992fff1ce321813deb728ec8a53be7a00"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.javaLambdaParameterType (cyclomatic 31): name-matcher.javaLambdaParameterType 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14710}}}],"partialFingerprints":{"codehealthFindingId/v1":"962bdeeda8877aa4c63f8540e147ebdf8dcad87d4b13a6ff01c27c73d2e207f2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppLocalBindings (cyclomatic 31): name-matcher.cppLocalBindings has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19798}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6deb9cb61984a167b0d660dab023baa75552c9267de23bdde8eb82e9f7234b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.jsBindingSites (cyclomatic 31): name-matcher.jsBindingSites 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23848}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32fe0dd0e6f406be03354b152c3a62943fdf297f2b5e92131134a8d2e4a643c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonFactoryTypeUncached (cyclomatic 31): name-matcher.pythonFactoryTypeUncached has cyclomatic complexity 31 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28443}}}],"partialFingerprints":{"codehealthFindingId/v1":"052263b619ef9cb144050f08aeffc9fa5dd70424c33b742823de9b46eb1b687e"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.destructuredKeyTarget (cyclomatic 31): name-matcher.destructuredKeyTarget has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 31459, a function literal at line 31462, a function literal at line 31460, \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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31443}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf63a2d57c9fd536bba5ed821e2e1e892b4468bce5705eb2468725e98153b9"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.retargetSelfOverload (cyclomatic 31): name-matcher.retargetSelfOverload has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaf9487050e651891e0dc823f372df1920480d4079636245c0cf4d146195419"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.resolvePythonModule (cyclomatic 31): import-resolver.resolvePythonModule has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c8efe7fcb685f4f158dd4ee07328df36571dbd0c5ecb1b3a6abab72ae11483"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.cppStackConstructions (cyclomatic 31): TreeSitterExtractor.cppStackConstructions has cyclomatic complexity 31 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":6739}}}],"partialFingerprints":{"codehealthFindingId/v1":"5763037f88a7a4526e3ebd76b94815aa6ba337bcee7594d01afd6d4aa78756e0"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.fieldChannelEdges (cyclomatic 31): callback-synthesizer.fieldChannelEdges has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1066a7aadd016304661c45bb0650e101087f358e755865e125a239bd0b6ec1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"symbol-lookup.matchesSymbol (cyclomatic 31): symbol-lookup.matchesSymbol has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"src/graph/symbol-lookup.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ae2e405f80ce80377701511c583e17262b453684db0b03f0f780181fc3ab28"}},{"ruleId":"D1","level":"warning","message":{"text":"branch-guards.abbreviateArgument (cyclomatic 31): branch-guards.abbreviateArgument 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":"src/graph/branch-guards.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b081791f287b5bd12e70b8dc6642d5bc94332f6304073e81e47eba18c8e45fd"}},{"ruleId":"D1","level":"warning","message":{"text":"trail-store.parseTrail (cyclomatic 31): trail-store.parseTrail 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":"src/ui-server/api/trail-store.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e379f789c6d8cef957b6b125bc4dbabf3756d4a66af78ee6ecf9de6e422daa"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 31): Walker::flush_value_refs 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d7e8c22ac483578e6dcc09e54cb36e7aafc62c09692cd6a3621d10b1e356b3"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.flattenMidStatementConditionals (cyclomatic 30): c-cpp.flattenMidStatementConditionals 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"90299f9f64341e8419d8fb7876ae6442dc9c8563cf50510b5b8815ab6fc09dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchDartAnnotation (cyclomatic 30): name-matcher.matchDartAnnotation has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6413}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b1bbacee8935dd2d2d8df410ebc37611736af44b315ef447446af3a23bc61d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchByQualifiedName (cyclomatic 30): name-matcher.matchByQualifiedName has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 4 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15058}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b18705d78e4d86c6f110cb79c7c5c679ee3902a01db9f5d5ddaf58a61b88543"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goChainLinks (cyclomatic 30): name-matcher.goChainLinks has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 4 belong to 3 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01a326c52a8ed466f9f4fe0ec37662b49d8297e8f42c818c34d8e87833b5ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonLocalClassUncached (cyclomatic 30): name-matcher.pythonLocalClassUncached has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e62e465fd7f9e4182ecfbb0eadf2edb6e8d91319241bdfbf579dae4b98949db"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.findBestMatch (cyclomatic 30): name-matcher.findBestMatch 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb547fa50ca7ada5f08c058b6eb259545419c6720931220946670d8f3ce3bd"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.buildPythonModuleIndex (cyclomatic 30): import-resolver.buildPythonModuleIndex has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to 2 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":"src/resolution/import-resolver.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0580cd7cf93fc52a381d64bfe740f544c19f54e54ae657ace226cdb51a45ab3"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.resolveCfmlComponentPath (cyclomatic 30): ReferenceResolver.resolveCfmlComponentPath has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"05df3e98e8ef8a730a55e5212d570838b4635385511cbd4c384cc773d9f7d35e"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.resolveDeferredThisMemberRefs (cyclomatic 30): ReferenceResolver.resolveDeferredThisMemberRefs has cyclomatic complexity 30 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 8 belong to 3 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":"src/resolution/index.ts"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f892df6cbf9022d07488de670fc06e18f868fd7a7a921d6bb35b5ff6734a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"named-symbol-flow.walkBidirectional (cyclomatic 30): named-symbol-flow.walkBidirectional has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/named-symbol-flow.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd5f7429f9b5ec30d78abe770522d40b88af9d5882fb46d2fea3f197aa3b5e4"}},{"ruleId":"D1","level":"warning","message":{"text":"screens-model.entryLayering.\u003Creturned closure\u003E (cyclomatic 30): screens-model.entryLayering.\u003Creturned closure\u003E has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"710aed28e636ed514d73d5229523c40863838ffec981cc18c0e52a22618d5c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"router.svelte.parseHash (cyclomatic 30): router.svelte.parseHash has cyclomatic complexity 30 (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":"ui/src/lib/router.svelte.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a6ce21bf1deca4e4e3af98fc9b5a80462f3a2fd628cf8d810927e4fa1fcab6"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryBuilder.searchNodes (cyclomatic 29): QueryBuilder.searchNodes has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e794561750461a40140d6a96ceb93798620c7504e3b44ab3dbbc70697ab4710"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.stripRuby (cyclomatic 29): strip-comments.stripRuby 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":"src/resolution/strip-comments.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a94f771b0dbf44fd407f403464727a3cd21947b46795db56427d2201f745ac"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.stripRust (cyclomatic 29): strip-comments.stripRust 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":"src/resolution/strip-comments.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"663baaf8df2427ad3db484c3e484486948c07cb0df42ced87fe96cbefa66a550"}},{"ruleId":"D1","level":"warning","message":{"text":"ambient-modules.scanAmbientModules::blockToken (cyclomatic 29): ambient-modules.scanAmbientModules::blockToken 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. This shape REPEATS in the file: one other method here (ambient-modules.scanAmbientModules::token) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad2ae4a090b3e0ee6647f67e1c8040da48962df29376a22956cc88064ce2164"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isSwiftCallTarget (cyclomatic 29): name-matcher.isSwiftCallTarget 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91319535d8998fe5859d85976deae99fdb54acc625643cb9f3a7291e59b152d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.javaArgumentType (cyclomatic 29): name-matcher.javaArgumentType has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14856}}}],"partialFingerprints":{"codehealthFindingId/v1":"691cf3d59f63b38bef651502085207e01ddd3ec2e4bdb10599915f98c2731ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.javaArgumentFit (cyclomatic 29): name-matcher.javaArgumentFit has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ef067ac33f758706b48c5c347264a51ce3ab09eeb79b91fdbcb2fbd9917c5"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goExprType (cyclomatic 29): name-matcher.goExprType 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27206}}}],"partialFingerprints":{"codehealthFindingId/v1":"63769ae368e2d99a4a06560e585870a36c41f9acdfde888173bf137bbfcbd8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"react.exportedComponent (cyclomatic 29): react.exportedComponent has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"901dc314caef923ad0db5a6b515d2226c523dc3b319d7a425b09f2f3c2575c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.constantText (cyclomatic 29): angular-router.constantText has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7307935d05b946ac7327e04bb4b672855753c21283de120f84806780cd7011"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.flushFnRefCandidates (cyclomatic 29): TreeSitterExtractor.flushFnRefCandidates 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"670f6a73e40f7fe33088bbcdc5ee796ee72b187ba4cff28235f82578f1264306"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.eventEmitterEdges (cyclomatic 29): callback-synthesizer.eventEmitterEdges has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a44dc9e7d15e5cda822afa9892a3ee13d4dee4ebe4661eb5b38a8ea2204abfc"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextBuilder.buildCallPathsSection (cyclomatic 29): ContextBuilder.buildCallPathsSection has cyclomatic complexity 29 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 10 belong to 5 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":"src/context/index.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5965c6e7db27d9868e53ce9122e0fd23d24965a5c7dcc5b9bddb23d1f1b543ca"}},{"ruleId":"D1","level":"warning","message":{"text":"cobol.walkDataEntries (cyclomatic 28): cobol.walkDataEntries has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 belong to 4 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db0f3fa3121e895cdc4af0d42a6c296689e7d46f677e619a92c42384c06ae75"}},{"ruleId":"D1","level":"warning","message":{"text":"decode.decodeExtractBuffers (cyclomatic 28): decode.decodeExtractBuffers 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":"src/extraction/kernel/decode.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b0acf2ca56576946bfc340e433528942a429a68d2250e84b3b8d6bd712d793"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-libraries.addDirective (cyclomatic 28): dart-libraries.addDirective 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc1089be64921ce32e75694abf2ccf88d6ca0431e4025ebde9bc5425d5eb14b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isScalaMemberInScope (cyclomatic 28): name-matcher.isScalaMemberInScope has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7662}}}],"partialFingerprints":{"codehealthFindingId/v1":"402638f376a38e21f5bf07c386bba68ed0ae94047bb7e641598054f91383f389"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustUsesOf (cyclomatic 28): name-matcher.rustUsesOf has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 9 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 9787, a function literal at line 9762, bind). 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9748}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca47792e27ec43881bdb867ec4ff88cd5e184dfb64c5694b4ee73263dd58e32"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppDataMemberIn (cyclomatic 28): name-matcher.cppDataMemberIn 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45403d1d4e1855716b1c56ebe927487df10303376bc56096bc32c4484f784c0"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonParamAnnotation (cyclomatic 28): name-matcher.pythonParamAnnotation 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28822}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c869bd6cec8b10cfc0d2c2fae9fa4fa44839f163d6ee0e045622dc1197a382"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchGoFieldChainCall (cyclomatic 28): name-matcher.matchGoFieldChainCall has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29043}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db7361eaa19b596e37b363c86fd362a4766486897f86b7d36ba0f999c804b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.vbReceiverPath (cyclomatic 28): TreeSitterExtractor.vbReceiverPath 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be544f1e600c31cbbbec7e5a5264a53976925815c2f0778e1fa7d10c65ccd9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionOrchestrator.storeExtractionResult (cyclomatic 28): ExtractionOrchestrator.storeExtractionResult has cyclomatic complexity 28 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. 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":"src/extraction/index.ts"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d8f339945a0dc52e021243edc2bb72008ff67eec0634e7effff251e05e1ea6"}},{"ruleId":"D1","level":"warning","message":{"text":"type-parameters.gateTypeParameter (cyclomatic 28): type-parameters.gateTypeParameter has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/type-parameters.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcc2f1abca1fcd1b70104e2fe8013f86f04549bf80237e64c257e33a10f750b"}},{"ruleId":"D1","level":"warning","message":{"text":"named-symbol-flow.resolveNamedTokens (cyclomatic 28): named-symbol-flow.resolveNamedTokens has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/named-symbol-flow.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83903c6f4fa0029ffef36f87e9fd2d6c446c53072b3342466a3cdec744b7039"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runUpgrade (cyclomatic 28): index.runUpgrade 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":"src/upgrade/index.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7775cbee24fc65488484ab6d5221d026e429d79c97f4dd0ee59811f17de63756"}},{"ruleId":"D1","level":"warning","message":{"text":"query-utils.getStemVariants (cyclomatic 27): query-utils.getStemVariants has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-utils.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3127d9c93276e98157394a5d827ffbeaf6a8839ac138894f0b77d05b780018a7"}},{"ruleId":"D1","level":"warning","message":{"text":"dart.dartMisparsedGenericCall (cyclomatic 27): dart.dartMisparsedGenericCall has cyclomatic complexity 27 (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":"src/extraction/languages/dart.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae77268a74a2c7653b9c8ff5499a1686c6c53e5f0fa14d5b9cc85b5a4097e44d"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.holdsBody (cyclomatic 27): pascal-preparse.holdsBody 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caf167699f9f8be24e55a62a704611d934c17ab690fdda083c9be95a60808d4"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-methods.bodyOpenAfter (cyclomatic 27): cpp-macro-methods.bodyOpenAfter 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"633e8d0ccb7f25038de40469cc8152fe2207afaeb8af2262bec5e10e1c21c6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"sfc-script.foldScriptResult (cyclomatic 27): sfc-script.foldScriptResult has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/sfc-script.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbd5bfa95522edfd5e7ef81b0d20834224cf5b5504aeb5ab355cf6edf4716c2"}},{"ruleId":"D1","level":"warning","message":{"text":"ambient-modules.scanGlobalScope (cyclomatic 27): ambient-modules.scanGlobalScope has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to one function literal inside it that branches (line 270). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"15587ef9a3bc25073305c3130accd0c46cc4a56ea689f6181a9d2defc5c02f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonGlobalReceiverTarget (cyclomatic 27): name-matcher.pythonGlobalReceiverTarget has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b3e6c835024cb09525c86355b482d074417c3b99af706a8e403c5018b4ec73"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.readDartChain (cyclomatic 27): name-matcher.readDartChain has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63ed23fdd4c0817a191c97520c3be92d849b3b072d6e0bd3c00f39401a9fa22"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchRustSelfPath (cyclomatic 27): name-matcher.matchRustSelfPath has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 11686, pick, a function literal at line 11684). 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bf8cb6768d7ed571a17bbe2285454650eb510fedd57eca6631775c5adea728"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustSiteType (cyclomatic 27): name-matcher.rustSiteType 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12883}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9839ae1ecb3cc0ad37cdb27344a9566031129088de420c2d32e0ab2b346050"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.readRustDeclaredFields (cyclomatic 27): name-matcher.readRustDeclaredFields has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12953}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634e875d25f3dce3965f0b9524f6611ecc9167cb6a4d2254e6474216e49ef52"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.inferMemberReceiverType (cyclomatic 27): name-matcher.inferMemberReceiverType has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22818}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b08105a556efa857b4a79158817641170c0d725e0b9f5c357ec4b1383c927a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustFieldChainAt (cyclomatic 27): name-matcher.rustFieldChainAt 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ad5159437a8027c25232d22815c80f22117dddd5cfd272ee681a7778eb50e9"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.swiftOverloadForClosure (cyclomatic 27): name-matcher.swiftOverloadForClosure has cyclomatic complexity 27 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff47e4789308a7e0ecef256f312b78ac189975dd497399297243fda5e096968e"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.angularRouteTable (cyclomatic 27): angular-router.angularRouteTable 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb284dde41c8dd32ab718bd2b42088db23c4c99410faaf458ace1ccdb35ef80"}},{"ruleId":"D1","level":"warning","message":{"text":"module-importers.passedOn (cyclomatic 27): module-importers.passedOn has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 5 belong to 3 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":"src/resolution/module-importers.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"db36780688e0b1adafb71c26503c9fa41cde2695582453eaaf9ef5942f300867"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.goListItems (cyclomatic 27): callback-synthesizer.goListItems 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"10492d4edf79d3ea4eb90c01aaba2dcd4c5e60b89eeb77e3e537f7b469273686"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.ginMiddlewareChainEdges (cyclomatic 27): callback-synthesizer.ginMiddlewareChainEdges has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3062e05b399d40657173acf12d45381bef480752161e475366dc0a237ad65e98"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.objectRegistryEdges (cyclomatic 27): callback-synthesizer.objectRegistryEdges 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"f002cb18bac5990b488508f470cb233f51b2977253edd2f81f49fe9e1fb9337c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby-parameter-flow.afterCalledName (cyclomatic 27): ruby-parameter-flow.afterCalledName has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6df96b0ddee425ec3bc9dfc9cfb582dc0ddab733ba097b4354107d860f5fb40"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.hasAnyPossibleMatch (cyclomatic 27): ReferenceResolver.hasAnyPossibleMatch has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313ede996629605b00e650d8abe1517b0a16858878a6790c3c0520a7330c5f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.pythonAttrRetryCandidates (cyclomatic 27): ReferenceResolver.pythonAttrRetryCandidates has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1528, assignedCallees, a function literal at line 1478). 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":"src/resolution/index.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbca91b426a68090aeb7a3d6e72ef3a66b9fb6050d60d64bc2b46a58e623d30"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.manifestScope (cyclomatic 27): ReferenceResolver.manifestScope 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":"src/resolution/index.ts"},"region":{"startLine":4688}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5420fece2553487348cb458004878a9cbb6d64531f1ea7982fdca22ac9ebae"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleStatus (cyclomatic 27): ToolHandler.handleStatus 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":"src/mcp/tools.ts"},"region":{"startLine":8558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5a3078abf922ec84431021759cb2b0b8abceedacad1b22d3fee059b1dc8874"}},{"ruleId":"D1","level":"warning","message":{"text":"effects.modelOf (cyclomatic 27): effects.modelOf 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":"src/ui-server/api/effects.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a529dcc4f7a54cfbb0d14e6210f73d0110794c7054573949df5d9bd5490d84"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.buildSteps.link (cyclomatic 27): steps.buildSteps.link has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to 2 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":"src/ui-server/api/steps.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"6081d0321b856b350debb47032d9595486a8be4da4b6ec671f8f64fbe27ee9d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 27): Walker::flush_value_refs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"acef61d910a54024cbc7f1319eb9ec59b35f3ea4480f9668a3810d64f09ecbfa"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 27): Walker::flush_value_refs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d51d316c129ad1f74e8b490227b8dd6f6966d490c2d46021a503fec50c66640"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 27): Walker::flush_value_refs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a4665730fea879bf58db26b26b060f5257c635f0c6a570eecb841cfc9b5485"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 27): Walker::flush_value_refs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df3b8de95b1d2db8e76434f5ab2f10a257987f738163ab3443cc7635cede41e"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-options-api.objectMembers (cyclomatic 26): vue-options-api.objectMembers 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa97339debf681275d4167fb7dfad329d3ac676a427e4ca8bc88df2bfa5563f"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace-packages.collectPathDeps (cyclomatic 26): workspace-packages.collectPathDeps 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6367ca3d6563a0382d3594a23a9bac15b079cf238d990403fbaa498bba0cfce0"}},{"ruleId":"D1","level":"warning","message":{"text":"c-feature-variants.evaluate (cyclomatic 26): c-feature-variants.evaluate has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to 5 function items inside it that branch (shape::term, term, shape, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-feature-variants.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d313cb4fd9c926154a6c7f17562b9017ce771211a4e003b0f89e2324874b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.typeDartChain (cyclomatic 26): name-matcher.typeDartChain 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5662}}}],"partialFingerprints":{"codehealthFindingId/v1":"80118b0d1f9e2a6948f49b696171ca9ed1163e2fe199d158a0c3d4d4e249b8c1"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchDottedSupertype (cyclomatic 26): name-matcher.matchDottedSupertype has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 15019, a function literal at line 15013, closeness). 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15006}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac67ac43b4de0fffeeba082a2aa4d270302da029527efb0987ce3b334790fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.resolveObjectLiteralBinding (cyclomatic 26): name-matcher.resolveObjectLiteralBinding has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f98806c328880bbd37684ebf1f31ee983fc42a1b8e5588a08e049d91c85b28"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isCppLocalCallableCall (cyclomatic 26): name-matcher.isCppLocalCallableCall has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19879}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fe5e71bfc60a9759c92b4c3bda07acd7a966968fc3ed0506e0ff3c060b41ce"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinChainDeclaredType (cyclomatic 26): name-matcher.kotlinChainDeclaredType has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22144}}}],"partialFingerprints":{"codehealthFindingId/v1":"075902ecf99d3d1ff06cc6b0d3381688b0a1bdbdaf04f110b6f2efcf105ae9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.declaredPythonRoots (cyclomatic 26): import-resolver.declaredPythonRoots has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"356885206df4cb1650ab13464835a63c370d01c27f97e0631b6b812e8697393c"}},{"ruleId":"D1","level":"warning","message":{"text":"express.regexLiteralEndAt (cyclomatic 26): express.regexLiteralEndAt has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/express.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7639e15ea2391bf38bce4d862c5a17c05d010bff36ac6d7753d5317815d77d80"}},{"ruleId":"D1","level":"warning","message":{"text":"react.tableRoutes (cyclomatic 26): react.tableRoutes has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 2 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"b660372184f0a3fc58682c2f307212faa930259b0e0fabfaa9f4614b5ae19582"}},{"ruleId":"D1","level":"warning","message":{"text":"java.annotatedMethodName (cyclomatic 26): java.annotatedMethodName has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/java.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d6b583afc079ad3aab9b2ccfa29952ea0119d54493c7827ec47035103596e"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalCall (cyclomatic 26): TreeSitterExtractor.extractPascalCall 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9268}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e8671e071d75fdf14af27cb2a63a4f73ab0eceaf8ef9682a47562a377d0778"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby-constant-paths.matchRubyConstantPathRef (cyclomatic 26): ruby-constant-paths.matchRubyConstantPathRef 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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"317d3628e387d2dad1e7e0699a03626ee1e589c8003445cfb11f9d1bd7a5cbb4"}},{"ruleId":"D1","level":"warning","message":{"text":"next-router-synthesizer.nextLinkEdges (cyclomatic 26): next-router-synthesizer.nextLinkEdges 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"96090b15f2b686f09690e571fa120308626ff13b57b2ac1c3c185dcf200e6d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.collectTestRequests (cyclomatic 26): tier-synthesizer.collectTestRequests has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 1167, add, a function literal at line 1152, \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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9063a474b0fbb11f431d14426a47740d5edde118f28fa87594e7cf9e72326d4"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.erlangArityAt (cyclomatic 26): callback-synthesizer.erlangArityAt 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4773}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b49d364b1f45f737af6f8d444cba4fc75e8dce7b74c67f2da7e02c7ca00a593"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby-parameter-flow.readBindings (cyclomatic 26): ruby-parameter-flow.readBindings has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a952eb4e49f2e04e54197ca5a013868cb26b0e111820a449f505102c56badd"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.reopenNavigationsFor (cyclomatic 26): ReferenceResolver.reopenNavigationsFor has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c0e72557121f5ccd511dd94d3a6d8f0c9992d47567496b458dc2eb60bddb2b"}},{"ruleId":"D1","level":"warning","message":{"text":"named-symbol-flow.resolveNamedSymbolFlow (cyclomatic 26): named-symbol-flow.resolveNamedSymbolFlow has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cd4c5e50b0a9617e88da797bdf46e61bbc99e550d0846c489ff80c81ab3142"}},{"ruleId":"D1","level":"warning","message":{"text":"effects.responseStatus (cyclomatic 26): effects.responseStatus 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":"src/ui-server/api/effects.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fed424843764d9c90ecdf3b51a17117dffa4361e988062302d423ed7ac8068"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.buildSteps.effectLink (cyclomatic 26): steps.buildSteps.effectLink has cyclomatic complexity 26 (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":"src/ui-server/api/steps.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"114f11ba7192bad423fc9f0975477a14cdd669f72dcfeb34179b07a9638f9cd8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 26): Walker::maybe_capture_fn_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"832875a764a83fbff09d292b0e08ac49393c25cf3d8a9f02be2c111bf36e04e3"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.cStatementLines (cyclomatic 25): c-cpp.cStatementLines 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb632bd7fa32d62693c071f215e8b9c2dd8495af3d2a4b036915e1ccb9fd544"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.blankStringContents (cyclomatic 25): strip-comments.blankStringContents 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":"src/resolution/strip-comments.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d561022a781ece07421e9ced728e1b6a7b48c1ef9435a50c4658ff9aed74f85"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.stripPhp (cyclomatic 25): strip-comments.stripPhp 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":"src/resolution/strip-comments.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7225d3599d4582bff1d9db55602d52356451d238ad99b92270c1d74a063235f"}},{"ruleId":"D1","level":"warning","message":{"text":"swift-type-visibility.resolveSwiftTypePathCall (cyclomatic 25): swift-type-visibility.resolveSwiftTypePathCall has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 3 function items inside it that branch (onPath, a function literal at line 401, a function literal at line 392). 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"54084619ea36a9c4996734b30ed3051c3a54da8ed56c71e641d855767f71c42d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonExternalWrites (cyclomatic 25): name-matcher.pythonExternalWrites has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 1266). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f6c9a147796d0597b8490d22ed1edb511d837baad7f436c4d723db1ea97ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.withinCppTranslationUnit (cyclomatic 25): name-matcher.withinCppTranslationUnit has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e0860a109ba644125c3a6c3b702bcf11a17e78da167ee13b7458b4f1e169ff"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinDeclaredTypeIn (cyclomatic 25): name-matcher.kotlinDeclaredTypeIn 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21882}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f91fb0e5e2ecc93a16b70f9a049b18b80aa3b2df25f24a0e30c9ee6aa9a4e7"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goFileConstraint (cyclomatic 25): name-matcher.goFileConstraint has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26348}}}],"partialFingerprints":{"codehealthFindingId/v1":"035eb1a0b3b825ff938001817073b62041639a3b7a97fd57053bbbb378eebe53"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.tsFieldElementType (cyclomatic 25): name-matcher.tsFieldElementType has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30024}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc2bb758a348800015c0381dc228bf1b99002047adb94d7abf90663c3d8e97d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.tsFieldCall (cyclomatic 25): name-matcher.tsFieldCall has cyclomatic complexity 25 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 11 belong to 4 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2ad3e02db67cfe3a38875c7db2a8a015a95eb9552460e496db111981945598"}},{"ruleId":"D1","level":"warning","message":{"text":"express.handlerRefs (cyclomatic 25): express.handlerRefs 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5176c725bd1b3ba5adec4139b16f83e9c6f87395cb4af562a95cf3db1d78bf"}},{"ruleId":"D1","level":"warning","message":{"text":"react.readObjectPath (cyclomatic 25): react.readObjectPath has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (skipValue, skipString). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779c7a5225370310126347cdd81015dd016b2766a2e64e5f592c6eec57657f8"}},{"ruleId":"D1","level":"warning","message":{"text":"react.statementEnd (cyclomatic 25): react.statementEnd 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1c0d3b9de39c485cd3dde77ac3e1d6415cf71e7cf5bf8610c7fa65188fc754"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-router.parseVueRoutes::visit (cyclomatic 25): vue-router.parseVueRoutes::visit 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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8433ae6a1851e2ce99cec50d08ea96afdcf0062f7e4bfa61f5195a313fb4d34"}},{"ruleId":"D1","level":"warning","message":{"text":"swift.resolveVaporHandler (cyclomatic 25): swift.resolveVaporHandler has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 536, 495, 504, \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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dc6e6211cde5e6ff3d35f1d13f1db787a353232773e72d90b5a7466fcc50c1"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.curriedWrapperBoundName (cyclomatic 25): TreeSitterExtractor.curriedWrapperBoundName has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7554}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1130893cecd7a90764a832696280a9fcbc81796aabc7b3308a3bb68dc70997"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractTypeAnnotations (cyclomatic 25): TreeSitterExtractor.extractTypeAnnotations has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":8412}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca1b4296da5b48c1a348185938a7864c8ed21273a2cff2d3b81c312ef7c9725"}},{"ruleId":"D1","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts (cyclomatic 25): c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts 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. This shape REPEATS in the file: 2 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges, c-fnptr-synthesizer.cFnPointerDispatchEdges::processUnit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e4e27f55eee3ea8fc1c8af5b2ff86cadf95a8e662782a887fc64d23ad8fccf"}},{"ruleId":"D1","level":"warning","message":{"text":"goframe-synthesizer.goframeRouteEdges (cyclomatic 25): goframe-synthesizer.goframeRouteEdges 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":"src/resolution/goframe-synthesizer.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"955b8bcb6ca78e4009bcb0fcccf220afd92c54d667d6369baa70ffb5e1b43c73"}},{"ruleId":"D1","level":"warning","message":{"text":"react-router-synthesizer.reactRouterLinkEdges (cyclomatic 25): react-router-synthesizer.reactRouterLinkEdges 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":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b66bfd61acdde6cc79af7badd08ad4e72fd8745e43337b952714d9b2249e64f"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-router-synthesizer.vueRouterLinkEdges (cyclomatic 25): vue-router-synthesizer.vueRouterLinkEdges 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":"src/resolution/vue-router-synthesizer.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21fa47f75a7df965e8ce868dcae3b14918ecc3555df2a29e4c82360f2ebd792"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.piniaStoreEdges (cyclomatic 25): callback-synthesizer.piniaStoreEdges has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b889d720fafabd3247e10ea437157eecde54297447c7728935a80e46644a8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowPass.flow (cyclomatic 25): FlowPass.flow has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 belong to 2 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b61b0ebfe1cd695e5923b6cdad9bdb86ac565e862bf4d9390f6e1cf1582a2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::recover_single_arg_macro_defined_name (cyclomatic 25): Walker::recover_single_arg_macro_defined_name 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f735c51606688e835bcc9e5ee8dfd0662e6a72726d5d3c8e77f8fa94e5e356e"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::misparsed_generic_call (cyclomatic 25): Walker::misparsed_generic_call has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8b6f9d5d3c1354217d0b0bd05f2b4d818888dd5335513817d0f8e035366681"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 25): Walker::flush_value_refs 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1335840055333c56d1cf4a1fb7dbf76614412f9393b7486c11cd6da36cd5d8a"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_call (cyclomatic 25): Walker::extract_call 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e3749d2920096ab7540b05a5538b4f1971569e63fdfc8adffba440dd282722"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankCppAnnotationMacroCalls (cyclomatic 24): c-cpp.blankCppAnnotationMacroCalls 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5201c013b317c23440b813d826b5913f2dd4f922b248ed1d5552e539d887a4"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-template-calls.parseOpenTag (cyclomatic 24): vue-template-calls.parseOpenTag has cyclomatic complexity 24 (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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5271ca8128329b52d989b3a29f71278dbebb7e500c4866b714b69153cc8e1ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.stripPython (cyclomatic 24): strip-comments.stripPython 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":"src/resolution/strip-comments.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8602a7e001561d99ea7e456d584df9bda006f829378a84b43e3158ba20b3946"}},{"ruleId":"D1","level":"warning","message":{"text":"strip-comments.stripCStyle (cyclomatic 24): strip-comments.stripCStyle 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":"src/resolution/strip-comments.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"753b909136c0bbe372a05fb10a14816c0c0f9744cd100c7c568b2ba7857f78da"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinLambdaReceiver (cyclomatic 24): name-matcher.kotlinLambdaReceiver has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8371418965c86541efd6201fee927bc09c4d461d98817cf360d943c1e2de0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.objcMemberReceiverType (cyclomatic 24): name-matcher.objcMemberReceiverType has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff0e9ce868c040002330ca679e13908a8d430728891b70b2f47acb0e1544f8a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.jsBodyEnd (cyclomatic 24): name-matcher.jsBodyEnd has cyclomatic complexity 24 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65a61457c5b097a7d029739e91d77e755a2fe650aa726080e2bb8977d7888b2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.javaOverloadsFitting (cyclomatic 24): name-matcher.javaOverloadsFitting 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14952}}}],"partialFingerprints":{"codehealthFindingId/v1":"38afc68a9ad8130cc961d9973d8d3e5a45a99b742c071d0a93d311584920ad05"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.resolveObjectLiteralMember (cyclomatic 24): name-matcher.resolveObjectLiteralMember has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 11 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 15308, valueMember, a function literal at line 15293, \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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d23b15528534e6ccd0428a91856b19b9fe212d032c34344096beba1a2708a4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppScopeMethod (cyclomatic 24): name-matcher.cppScopeMethod has cyclomatic complexity 24 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 9 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18955}}}],"partialFingerprints":{"codehealthFindingId/v1":"b092cca3d2287120d5026331f159c85e866e6d35c3099d9c1c727c3fe05af830"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinQualifiedCallResultType (cyclomatic 24): name-matcher.kotlinQualifiedCallResultType has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21949}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7e0447604a22d3122d1613291561e39ee1644095c93acd14815cb94b76319b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchGoPackageValueCall (cyclomatic 24): name-matcher.matchGoPackageValueCall has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1355516914ee295b9ba371e17994788611e7666911f87a528e0507bc3fbe0"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.isExternalImport (cyclomatic 24): import-resolver.isExternalImport 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c789ac9949a613941ef02e6b35423b2c216c5a07ceb6d1feb152d377f5022b"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.resolveJavaImportedReference (cyclomatic 24): import-resolver.resolveJavaImportedReference has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8e952de0cf03020b69eb2f197b8ec8fd5c3eb20913a915036d4e29145ee468"}},{"ruleId":"D1","level":"warning","message":{"text":"react.readObjectValue (cyclomatic 24): react.readObjectValue has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 2 function items inside it that branch (skipValue, skipString). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3278ba3467be5379762535aac0148be06673c1e9fd7b50fb651eb027b2049bf"}},{"ruleId":"D1","level":"warning","message":{"text":"react.valueOf (cyclomatic 24): react.valueOf has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd989f6f001a9f9e7fda0908e5b88b980d762b130838e4b1d36ff0f08e5ade3"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractMethod (cyclomatic 24): TreeSitterExtractor.extractMethod has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adf334869088fcdc33d3b2dfea3a6df6f3da3c236fb5c76d4248f7a993f5f81"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractDecoratorsFor::consider (cyclomatic 24): TreeSitterExtractor.extractDecoratorsFor::consider 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. This shape REPEATS in the file: one other method here (TreeSitterExtractor.extractDecoratorsFor) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7655d898e84fdb40bac3495f48ebbedfd2c865d4b4da55a537915283813331"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractDecoratorsFor (cyclomatic 24): TreeSitterExtractor.extractDecoratorsFor 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. This shape REPEATS in the file: one other method here (TreeSitterExtractor.extractDecoratorsFor::consider) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7195}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd17761e1408264b62f858177627908d4efee3e3080abd1fa52f78db028ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-sitter.extractFromSource (cyclomatic 24): tree-sitter.extractFromSource has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":9977}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c18dc32e4416407e748ee41377ad3467cd4c78dbfb64c583853f1302b287c0b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionOrchestrator.getChangedFiles (cyclomatic 24): ExtractionOrchestrator.getChangedFiles 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":"src/extraction/index.ts"},"region":{"startLine":4197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3146b787a5c3f57986cd39136e5f8f9cc105edc55bee291ebb13b9175bacb45f"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-constructor.matchCppConstructor (cyclomatic 24): cpp-constructor.matchCppConstructor has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa70ef35df69264e569893e7e64ea27062539f8c15094cbf6521e0d0c9b44b"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-scope.matchPascalParenlessRef (cyclomatic 24): pascal-scope.matchPascalParenlessRef 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe36b895533f02ef4e36983a8f7f9e43b9e1b938272e4f29ebeb6ea7adb6fa60"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.createEdges (cyclomatic 24): ReferenceResolver.createEdges has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 2102, 2166). 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":"src/resolution/index.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace729c3752f25ffd30c8bccbc33414c0115d37b4e05ab7abcc812ba36df8010"}},{"ruleId":"D1","level":"warning","message":{"text":"branch-guards.returnsInTree (cyclomatic 24): branch-guards.returnsInTree has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 belong to 2 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":"src/graph/branch-guards.ts"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"583326eeacdcddc91cad87ae0579bcdccc01e761ed6f2a51115ce53673712481"}},{"ruleId":"D1","level":"warning","message":{"text":"type-hierarchy.walkDescendants (cyclomatic 24): type-hierarchy.walkDescendants 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":"src/graph/type-hierarchy.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c993f5327386d3f5f87ec4592ae6b39643770cab72d5e7ec7333a7b77e56204"}},{"ruleId":"D1","level":"warning","message":{"text":"named-symbol-flow.walkCalls (cyclomatic 24): named-symbol-flow.walkCalls has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 2 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f1f28a857edf0303ca0826ddff8f3a7d2a380a578a83cea097f5e6a3e1eca5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleExplore::shrinkCluster (cyclomatic 24): ToolHandler.handleExplore::shrinkCluster 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. This shape REPEATS in the file: one other method here (ToolHandler.handleExplore) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":7129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ed75acafb64dfbed060400c47c1b7695a01ab2f86ae8f13cd2c2da7b3df68b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.extractSymbolsFromQuery (cyclomatic 24): index.extractSymbolsFromQuery 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":"src/context/index.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"990f3e8eef9fdb5aa4007c397f6bd2d38cb6315ce434ec0e93f933c9f5f717f2"}},{"ruleId":"D1","level":"warning","message":{"text":"node.buildNode (cyclomatic 24): node.buildNode has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 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":"src/ui-server/api/node.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c273c0194f355220f455800f8de13e61e24614951a25ba3421a7e0b053096e"}},{"ruleId":"D1","level":"warning","message":{"text":"effects.classifyEffect (cyclomatic 24): effects.classifyEffect 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":"src/ui-server/api/effects.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f52192bd1d8482e7fd9a68c85fe5abb63b62d446eefe397546cbc3dee612be4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleRequest (cyclomatic 24): index.handleRequest 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":"src/ui-server/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfe74fabc5cc48eba6ef156bd14e796be68c98a67ac7e3d7768bf0767dfe02e"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_type_alias (cyclomatic 24): Walker::extract_type_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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"11300647525d64d4b9428ab50709a358e5bec975d8917caf0576cdb6a7202622"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 24): Walker::flush_value_refs 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7bf93a538ec836048c963d6d29f8f0d61f6d3c116424b70f8ee7e051e45ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 24): Walker::flush_value_refs 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d8ef9dbfcfe224b10cc711a5411fcfb716dcf4b42f82984d4b02156c0d0121"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 24): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"751b710a3771ceeead067ed94fea73a6d53db5a1964c0ed4817dcedcc7a2bc11"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 24): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b44cd24149c7a62ef3500d90cf7f6913032cb75134fb3abd25d8ceb0034c45"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::go::go_local_bindings (cyclomatic 24): codegraph_kernel::go::go_local_bindings 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1363ad2c61553b59af0db35b8950f5fc937ba62ec6ff7dff3d3f39f17825bfd0"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.scanForInVariable (cyclomatic 23): pascal-preparse.scanForInVariable 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae0dd40b003143ee8fd8997c818767a1bf6e58e81acc0b5f2be55789c582d87"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace-packages.loadWorkspacePackages (cyclomatic 23): workspace-packages.loadWorkspacePackages 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a891d6d836d169df92851774c0351efc5805d12bb08ec9241fc005d96a9955ff"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-local-scope.bindParameters (cyclomatic 23): dart-local-scope.bindParameters 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c18cec178f7d4f55896a04c5478876b41af34ab020bb932dc1c874c55988d"}},{"ruleId":"D1","level":"warning","message":{"text":"ambient-modules.scanAmbientModules::token (cyclomatic 23): ambient-modules.scanAmbientModules::token 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. This shape REPEATS in the file: one other method here (ambient-modules.scanAmbientModules::blockToken) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed967df57389bff8c17ba5b2cc630b316b915f0d37183c065381896fc4056c2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonAssignment (cyclomatic 23): name-matcher.pythonAssignment 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77f9a46dea89e2258106a56913820067764a6254de8d4c91d42dc73cdd4a5b4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonConstructorCall (cyclomatic 23): name-matcher.pythonConstructorCall 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"479321dbaf3d5741388f080ae4a01519a63d00e175347209f7f79aff56c269db"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.luaAliasExpr (cyclomatic 23): name-matcher.luaAliasExpr has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 9 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dacbe0c24ef748f937b9da7dcb94c1b773ce2c6a45051d7a455c191cd324860"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppDeclaratorMayEndAt (cyclomatic 23): name-matcher.cppDeclaratorMayEndAt has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a9b9e364312ee91c558baf83905a492fd84a87c9bd8508c909253afecdf1e4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppMethodOf (cyclomatic 23): name-matcher.cppMethodOf has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb55335df78e795a8c604d250751c450c5abe9167a9b925db46ac38019b9c28"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinSupertypeNames (cyclomatic 23): name-matcher.kotlinSupertypeNames 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21731}}}],"partialFingerprints":{"codehealthFindingId/v1":"823c82e94fab3762ab5bfc2687bf90b727e39e19d854e16495e628f2bba08882"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goClosingBracket (cyclomatic 23): name-matcher.goClosingBracket 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26544}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e6b05076a4008608217f10ab68b4128e7aa552233a5b5ad927a73cee4c20d8"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonExprScan (cyclomatic 23): name-matcher.pythonExprScan 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27770}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc09b262a548317c04d4ae29ebe217aa810445ed5b14e35ed6405fb563c37dc"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchTsThisFieldCall (cyclomatic 23): name-matcher.matchTsThisFieldCall has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 30705, held, a function literal at line 30680, \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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0334d868d535659edd0cf6375474e771f6f0b9c66a578092cf9fa0b942e9d177"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.importBindingTail (cyclomatic 23): import-resolver.importBindingTail 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4651}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdbb44cc927b5830970326bd6437d5fa269b170decaef50d3fa760cd0a0d401"}},{"ruleId":"D1","level":"warning","message":{"text":"express.scanCall (cyclomatic 23): express.scanCall 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"10217a03b249bfd1fd29ec691eb431989311bf0b73a7c91604a355d332276548"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.destinationOf (cyclomatic 23): angular-router.destinationOf 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"056d6c08222aa58563f1cc8f70265e220724c97a9906d6f410507068f9cfef95"}},{"ruleId":"D1","level":"warning","message":{"text":"terraform.resolveScopedModuleRef (cyclomatic 23): terraform.resolveScopedModuleRef has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/frameworks/terraform.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef9f3cea8728746666016bd1f87d071453527892e3b7f1931cfeb813cefb060"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extract (cyclomatic 23): TreeSitterExtractor.extract 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5737517238b03d1c1ea11fe1922dc2a7a6ea3386ec37bedd50425be2b756c1e"}},{"ruleId":"D1","level":"warning","message":{"text":"type-parameters.scalaMemberInScope (cyclomatic 23): type-parameters.scalaMemberInScope has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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":"src/resolution/type-parameters.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f823afe950ed298ca3415e52f78309a9b1c506081453f58fb1a9a8aeb13d250f"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.vuexDispatchEdges (cyclomatic 23): callback-synthesizer.vuexDispatchEdges has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 9 belong to 3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8993d7080f15ef449dc210a7610e95b486f129ecf4432eedcc703be47080889c"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.celeryDispatchEdges (cyclomatic 23): callback-synthesizer.celeryDispatchEdges has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 belong to 3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f20923cbca1f4cbb049c638edf1170b81745a26591030fe8522ee97dc72732"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.sidekiqDispatchEdges (cyclomatic 23): callback-synthesizer.sidekiqDispatchEdges has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 5 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dc8399fdd2f769dbe4fc77337cc781dca2cf78f5bbf64a7c1ad00458d0f731"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.withStalenessNotice (cyclomatic 23): ToolHandler.withStalenessNotice 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":"src/mcp/tools.ts"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d67101bee5a0b8abcef87d427bff7877bf1667cfea8c520bdc54d0a42be317"}},{"ruleId":"D1","level":"warning","message":{"text":"route-roots.routeRoots (cyclomatic 23): route-roots.routeRoots has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 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":"src/ui-server/api/route-roots.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1e137b951c766df6806d3702f594dc754604fd9d4b0207b604de2d4a4c4fad"}},{"ruleId":"D1","level":"warning","message":{"text":"map.buildMap (cyclomatic 23): map.buildMap has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 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":"src/ui-server/api/map.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7405320ea9a094a66cf4d91901386d7dc8ab24859162a05c4824827b7495669"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph.main::printIndexResult (cyclomatic 23): codegraph.main::printIndexResult 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":"src/bin/codegraph.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad84a45cdb7eb78a8b3eb9755d20e0c8a697b9ea18891b95f490583163ab8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 23): Walker::flush_value_refs 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c69e2c33b1592568941ffa38b8a1070f63051220fad2eb70eefc04c00907a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit (cyclomatic 23): Walker::visit 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c25ef3e7ff9051aedb6f441baedf214ca9d1d29e010fd85ebff6b3377fd9237"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 23): Walker::flush_value_refs 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48e2c8cf132944c2e9390ec8f12e3cbf53a854f669c20e1038822ce7c6c164"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_component_wrapper (cyclomatic 23): Walker::walk_component_wrapper 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1042f56740c774e24b40fef3c7c01309ad8bee66b55ed8d2600cab2162e84bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::flush_value_refs (cyclomatic 23): Walker::flush_value_refs 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d70862c9b0f81a0d60fc1f936b4fd185b21489c1f988ca389f6da8c8769f0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"grammars.detectLanguage (cyclomatic 22): grammars.detectLanguage has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"053c7cb926b54f4ab76cf4b408848d17a3743d1b0806cf1088da7cc1195a6dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.followsDeclaredName (cyclomatic 22): c-cpp.followsDeclaredName has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de6033b3f842940f39c1a51acc2bd4783440524cd6a7db9a6a62e7db8a16a10"}},{"ruleId":"D1","level":"warning","message":{"text":"object-literal.readFields (cyclomatic 22): object-literal.readFields 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":"src/resolution/frameworks/object-literal.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1108d02d6f504291ead7f4cb13307443e07572a59fd819d735973680a46f9cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.extensionFor (cyclomatic 22): vbnet-receivers.extensionFor has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf310da0d3011397c5d0169a9704f5022f8cf5a8016a5cd1569ad1695ec783"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isUnexportedModuleBinding (cyclomatic 22): name-matcher.isUnexportedModuleBinding 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e906596b56f59f285eabdaad79fea572fb1f4256d044169e39a15cfa635770dd"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.luaLocalDecl (cyclomatic 22): name-matcher.luaLocalDecl has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad591f8ce73c451350e362642a289ebc944960ac28a8bdc8019787e8d3f331a0"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.dartLocalType (cyclomatic 22): name-matcher.dartLocalType 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5980}}}],"partialFingerprints":{"codehealthFindingId/v1":"179313aac9b000d5d6796d24c752ab507f2ffb4c89d655ef10e8a370891a7e95"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isKotlinMemberReachable (cyclomatic 22): name-matcher.isKotlinMemberReachable 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7262}}}],"partialFingerprints":{"codehealthFindingId/v1":"881e51ecb74f57ed697f31fd43a2103998c82ed361d9e0733e1c4480949ec026"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustUseTreeBindings::read (cyclomatic 22): name-matcher.rustUseTreeBindings::read 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9853}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b3ec9a7961ddbbdf6946728e46ed57fa637549d79c35180793b1b1fbc9c602"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustCrateRootModule (cyclomatic 22): name-matcher.rustCrateRootModule has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7bc2fa84ef815822d66f77dad3462f8008915dbbac222a3fa049e155f85aa1"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustShadowingLocal (cyclomatic 22): name-matcher.rustShadowingLocal 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11084}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a07d7d804290b05701e9d083c2c19cd8ac8388b0e747aac5dced949cb09a171"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchKotlinCallResultCall (cyclomatic 22): name-matcher.matchKotlinCallResultCall has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 4 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b158535487127d52b81e8f375444b100a2c998143472246f97554c0bd3061"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.destructuredParameterBody (cyclomatic 22): name-matcher.destructuredParameterBody 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23938}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bc3131f7e6514d0a0ea8908f6f90840c0bdd59bd9ae10a5f1281e6617ab0c4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppTemplateArgumentsEnd (cyclomatic 22): name-matcher.cppTemplateArgumentsEnd 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32888}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b6917a74bc2557fc7e3940568ebe2b0a7a3e5d12050fbc635e7632ef522905"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.resolveAliasedImport (cyclomatic 22): import-resolver.resolveAliasedImport 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1145b1e12724226d68b6839c034d3f251f711f24dc6d86ae5f6ec091db3bba"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.jvmImportedMember (cyclomatic 22): import-resolver.jvmImportedMember has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 3 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"305399133d28334ccbf457c4dfe11ab78525f188b41d7075e715a7680ef59df5"}},{"ruleId":"D1","level":"warning","message":{"text":"package-deps.declaredDependencies (cyclomatic 22): package-deps.declaredDependencies 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":"src/resolution/frameworks/package-deps.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff8678470a6dbd215a1a05e87f1ed9c3c00cdfbc2d1ed175f2eabc2c1aad352"}},{"ruleId":"D1","level":"warning","message":{"text":"react.blockValue (cyclomatic 22): react.blockValue 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fdbcfd6144f844e196d61c3aa79fffaf5a204843a82f780d82f24739e3b720"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.emitRustUseBindingRefs (cyclomatic 22): TreeSitterExtractor.emitRustUseBindingRefs has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (collect, join). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":5112}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb9076f9a7824d29e26920e506a551c1eedcef035cb79299cdcacfd50339dd"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalDefProc (cyclomatic 22): TreeSitterExtractor.extractPascalDefProc has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":9040}}}],"partialFingerprints":{"codehealthFindingId/v1":"92328de6e4a7fd20d4d2fd4e7c86a851af1b11dbac52f300135d5e7c92740a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"module-importers.reopenNameMatchedImports (cyclomatic 22): module-importers.reopenNameMatchedImports 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":"src/resolution/module-importers.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6236c57e92da401511dec95733cd7fe58074a9cf0030caf6fc363cd50757d7b0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.collectIncludedFiles (cyclomatic 22): index.collectIncludedFiles has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (walk, consider). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"0879c8da6d617167fda356dfef7e9a3a9bbb3bbb45acb806ad6505d1d51c303b"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-constructor.constructorShape (cyclomatic 22): cpp-constructor.constructorShape has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"760c6e567f89e3e023713b9cea293fabb0a49b273f1f68356a833be356fc9c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"tanstack-router-synthesizer.tanstackLinkEdges (cyclomatic 22): tanstack-router-synthesizer.tanstackLinkEdges 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":"src/resolution/tanstack-router-synthesizer.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"798409b5f20547ceaeab8d8d9d957cfa6dd3af321b94925f7caa7136d6dd7de6"}},{"ruleId":"D1","level":"warning","message":{"text":"sveltekit-synthesizer.svelteKitLinkEdges (cyclomatic 22): sveltekit-synthesizer.svelteKitLinkEdges 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":"src/resolution/sveltekit-synthesizer.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d2f10ef8e113ecc0ffdcecf7916d297c46a383fa807f696bf769ae71ae5344"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.collectQueue (cyclomatic 22): tier-synthesizer.collectQueue has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bfbc9eab1c1220f4f4afd3d050143c12c3a4ff27fd2f2646ac6781a7f03439"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.changedDefaultExports (cyclomatic 22): ReferenceResolver.changedDefaultExports has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d629aa1f7d452584e52eef32bf80e92f313722370fc8194beba99e6906c591da"}},{"ruleId":"D1","level":"warning","message":{"text":"FileWatcher.flush (cyclomatic 22): FileWatcher.flush 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":"src/sync/watcher.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69e3f20f13e54d2b85acedf4740988092b632c0e66c9e2740be15a74ebe7faf"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphTraverser.traverseBFS (cyclomatic 22): GraphTraverser.traverseBFS has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 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":"src/graph/traversal.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3b3fa8f538ae8fc297a43aa85f1532256746843bbe0f87fc9747eee464ba40"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphTraverser.getImpactRecursive (cyclomatic 22): GraphTraverser.getImpactRecursive 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":"src/graph/traversal.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2085b75082e653e3f48b238f5bc27b069c9fdaf007d1f4c6f3be5f7d5244d679"}},{"ruleId":"D1","level":"warning","message":{"text":"tools.allocateExploreBudget (cyclomatic 22): tools.allocateExploreBudget has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 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":"src/mcp/tools.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe63dc02f746ff3572548fefedb9431c02bccc1e19c9999f4aeab3132027c75"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.buildSteps.stepFor (cyclomatic 22): steps.buildSteps.stepFor 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":"src/ui-server/api/steps.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9b77782105649eb8f068c8cdad0fbf9ad11c3dba488bf9f7f98154d6b4dae0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow.buildFlow (cyclomatic 22): flow.buildFlow has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/flow.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f65d4a82022280680c8da61533e31315c95e9f19fcb54b068f9d4f8260584b7"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver-worker.port.on(\u0022message\u0022) (cyclomatic 22): resolver-worker.port.on(\u0022message\u0022) has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/resolver-worker.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cf7655df9a0c9f41519cc434bc7a2c10375c281151f21ad280496e72af9157"}},{"ruleId":"D1","level":"warning","message":{"text":"render-check.main (cyclomatic 22): render-check.main has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 5 function items inside it that branch. 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":"telemetry-dashboard/scripts/render-check.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a6bdf9322e01956bc61f606673c5dcfa393381a3dd8a03619ae1c104fdf44c"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 22): Walker::visit_node 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f225f91d61c33b6b3e7e2f36af5b2ad255b4ef5a7c4034caac4b29d5a5e188af"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cyclomatic 22): Walker::normalize_fn_ref_value 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c2841084ef2b0180933f71f7ce63332e8c95e8255bf525c6d35cfb14b4a356"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::hook (cyclomatic 22): Walker::hook 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e48c15f911a5d7285c06fb17a2639fe882c96a1ac40b688b216bc6712ad8eef"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::cfnptr::strip_c (cyclomatic 22): codegraph_kernel::cfnptr::strip_c 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1e35dd22f7987718c78871a4a710a2b01b3379b6fbd2453fd531353fcb523c"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::cfnptr::alias_line (cyclomatic 22): codegraph_kernel::cfnptr::alias_line 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33b59b3d7fa7de6e04505f69549e6bef48b36fd686a2574ba405e5c2848196"}},{"ruleId":"D1","level":"warning","message":{"text":"writer-lock.tryAcquireWriterLock (cyclomatic 21): writer-lock.tryAcquireWriterLock has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/writer-lock.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53016694d36ffbd4820c1c5c2c8efe0e9927ce13f61883fa967767ac1edf0e"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-methods.cppDefinitionHeads (cyclomatic 21): cpp-macro-methods.cppDefinitionHeads 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ad207a71b0e78c0fdc8f55e9b23a9934e01ff9c6b33dad8b5b1fcfe1cc9a3"}},{"ruleId":"D1","level":"warning","message":{"text":"drupal.extractDrupalServices (cyclomatic 21): drupal.extractDrupalServices has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 3 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc6cd2e5623b8d8210200727eed94b6bf210e6cb63d153a1e3d3c33f5a530c3"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-libraries.readString (cyclomatic 21): dart-libraries.readString 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2745ac040ea7435b9d237867be704b73b3627f9b5325b5cc704473f7ab2dab"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-raw-strings.cppLiteralsBlanked (cyclomatic 21): cpp-raw-strings.cppLiteralsBlanked has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a7cca2103f3e9aaf4b2f2edf7211f0869c8091ff5907bad908fb38908f9761"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.localDeclarationScope (cyclomatic 21): name-matcher.localDeclarationScope 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f8ec44eda604dfae763c4ef3ada8eda9f95856abf0a48594eb196adf01d63"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonFixtureReturnType (cyclomatic 21): name-matcher.pythonFixtureReturnType has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"21be6f427ee72df39cc82d867a27a4ed4ba01552d592d143b7a9668be71dccc4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinHierarchyAt (cyclomatic 21): name-matcher.kotlinHierarchyAt 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7094}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b425bc2ec34b594b866f3e2d2584717558daea81bb94cfa5ac5c54aa45600"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustReadPathDecls (cyclomatic 21): name-matcher.rustReadPathDecls 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10092}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c77347b1c4dcd0f45a7ae71657406b3c8474e4b07743ad24c615bcc68b8ed96"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustSelfParamBounds (cyclomatic 21): name-matcher.rustSelfParamBounds has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e134d385918b5beba270064574e06af109f63ee2152db78f5c5e076401a6a71a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustTraitImplemented (cyclomatic 21): name-matcher.rustTraitImplemented has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13094}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f15f895ca8d7a7ef33cd1b6c89388f75e9dc82d03944d692ef61e43734e3afa"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppRangeElementOf (cyclomatic 21): name-matcher.cppRangeElementOf has cyclomatic complexity 21 (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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719c4661e798456c5305edc17864e9fa5b4086e4e498f4aadf3bef5b0392b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchDottedCallChain (cyclomatic 21): name-matcher.matchDottedCallChain 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20797}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb40d0babcff9a920f7013fc9d77f36bf5f1f0fc5adebd06398b0472fe31c945"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchGoIndexedCall (cyclomatic 21): name-matcher.matchGoIndexedCall has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26722}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cfbb1ac2d6ece1f6099d8db5fca0a05ca390f31f240060d6aadade79d8ca4d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goCalledType (cyclomatic 21): name-matcher.goCalledType has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27073}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d47608276d2c913ff65da58e28ae7b91ddb9e288d4a44850000d6c2b1b55ab"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.readDestructuredBindings (cyclomatic 21): name-matcher.readDestructuredBindings 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9935a4d25ddc150600a5ea25850075495adb6156484e7a52e7e37e281ca57e6f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.splitCppTopLevel (cyclomatic 21): name-matcher.splitCppTopLevel 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32853}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbb3d4339140cd2f5f309024063167b444fd4802673c1a1210cb66e2bf1e481"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.pythonPackageImporters (cyclomatic 21): import-resolver.pythonPackageImporters has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8546632a29e8bc306a5693585a639f92d63e8f66b3a5fec1fa140a784165b16"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.pythonImportsInScope (cyclomatic 21): import-resolver.pythonImportsInScope has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 3671, binds, a function literal at line 3668, \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":"src/resolution/import-resolver.ts"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5b6872c9fa754d0781ee268620257d9d4a008e0385955d5b07a9a13044e2a3"}},{"ruleId":"D1","level":"warning","message":{"text":"react.ownReturns (cyclomatic 21): react.ownReturns has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b53eb141cc5676d594e16aa83cc88e070317acd24250a139681c28deed5c7ab"}},{"ruleId":"D1","level":"warning","message":{"text":"tanstack-router.parseTanstackRoutes (cyclomatic 21): tanstack-router.parseTanstackRoutes has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"55531d942c503ead38fba27ab33afe464191e5cd16c70040e48f234328dc32ea"}},{"ruleId":"D1","level":"warning","message":{"text":"index.scanDirectoryWalk::walk (cyclomatic 21): index.scanDirectoryWalk::walk 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":"src/extraction/index.ts"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"be569e042387b3c4391cc482120933e628122822b82cd8b973bc1598379f037e"}},{"ruleId":"D1","level":"warning","message":{"text":"c-fnptr-synthesizer.evalConditionals (cyclomatic 21): c-fnptr-synthesizer.evalConditionals has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"387dbe8629786ada178f88d3e4b7815b4afdc4056e62b2ef6e95d084713afef9"}},{"ruleId":"D1","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges::processUnit (cyclomatic 21): c-fnptr-synthesizer.cFnPointerDispatchEdges::processUnit 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. This shape REPEATS in the file: 2 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges, c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb0e48625e6731763d704d657d20b3750743b046b880cac4b5e6406089de43d"}},{"ruleId":"D1","level":"warning","message":{"text":"const-alias-synthesizer.constAliasEdges (cyclomatic 21): const-alias-synthesizer.constAliasEdges 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"beadf894e276d3c3357ea25d14962a2285ffd9adb91736939cad488d04feb2ec"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri-synthesizer.findForwarders (cyclomatic 21): tauri-synthesizer.findForwarders has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (forwardersIn, aliasesOf). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"0beb2a1c40f828dc473d5f10077f531eef149a50992f2d0050593c410af5acc5"}},{"ruleId":"D1","level":"warning","message":{"text":"override-parameters.topLevelIndex (cyclomatic 21): override-parameters.topLevelIndex has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/override-parameters.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccb89887bb639d6bc0f019d23c95b55087b43153d0198dabb9daa2904eb78ab"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.constantEventName (cyclomatic 21): callback-synthesizer.constantEventName has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"c665be480a796828fe485bbd0cc212dc8ce552ebe6bb0a794fdcf604c7997657"}},{"ruleId":"D1","level":"warning","message":{"text":"query-paths.stripWrapping (cyclomatic 21): query-paths.stripWrapping 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":"src/search/query-paths.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"277a756eb3cd46d59cae578c772447b1da3e42d7076cc6607ca6f9a5e3d874d0"}},{"ruleId":"D1","level":"warning","message":{"text":"project-lifecycle.activate (cyclomatic 21): project-lifecycle.activate has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/project-lifecycle.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c614db43af2cf8eb88a3f662ebc128525f98e57c358993cd066376053e40a40"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.mentionsOf (cyclomatic 21): screens.mentionsOf has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/screens.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"8024cf7c50421e492683f749624763c43b12fae0b37cc3a55f2485a13f77d57b"}},{"ruleId":"D1","level":"warning","message":{"text":"program-model.buildOrderModel (cyclomatic 21): program-model.buildOrderModel has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 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":"ui/src/lib/program-model.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd73f774990fb7616d632bc13871ccff32a1e962cca1306a2dd14eee4c27f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cyclomatic 21): Walker::normalize_fn_ref_value 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c49fdabb99f84e0e7e925e09220d5199f0773208bd0ec478658b3e708bd1ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_call (cyclomatic 21): Walker::extract_call 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d627368867ed5e2d2f23d5af6161dc822cc2b13539d215cc471a3dcfffdb8210"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 21): Walker::visit_node 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa7d0a203bcc3f5e6278af8d3639ac3d26f74fdd7318fc212b490801af282e"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cyclomatic 21): Walker::visit_for_calls_and_structure 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb598905c50be1ba1671cddda982a8788cdaa968d10b933571d1beed5e3685"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-registry.daemonStopFailureMessage (cyclomatic 20): daemon-registry.daemonStopFailureMessage 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"87641e3f32ae9d39d664b32c77702069defed08abcdb2ed95528291f6f989d8a"}},{"ruleId":"D1","level":"warning","message":{"text":"query-parser.parseQuery (cyclomatic 20): query-parser.parseQuery 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":"src/search/query-parser.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b10d8eddf8bb62de34356553cb57dcec9f6b20ca475447d1904f33da9608901"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-sitter-helpers.getPrecedingDocstring (cyclomatic 20): tree-sitter-helpers.getPrecedingDocstring has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter-helpers.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d3e368d0594fc0bdb7101f45e5aaeadc2dc1e3ee4a11bd3f0efea1705c62b5"}},{"ruleId":"D1","level":"warning","message":{"text":"function-ref.normalizeValue (cyclomatic 20): function-ref.normalizeValue 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":"src/extraction/function-ref.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f356a071e03ff283a894216ae49b92845fbf9f687d26decf58ca22503bfeebdd"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankLoneMacroLines (cyclomatic 20): c-cpp.blankLoneMacroLines 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec11eef37e61cd43cc01e5cd11c3a68a3f915e7daf952e4b0eddcf6af32eab4"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.wrapAlternativeStatements (cyclomatic 20): pascal-preparse.wrapAlternativeStatements 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"026e5ef76452234236fa03daf4adbbfd1d03847f1b45aa46f14b989fad72858f"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.recordEnd (cyclomatic 20): pascal-preparse.recordEnd 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433669d342a89bcc5f18ab1618e7f95186123d71c7a1f60b1f7ea2542f9e290"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-methods.cppMacroMethods (cyclomatic 20): cpp-macro-methods.cppMacroMethods has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0fd2ae1a24fe45d7b76d8b00c27984dbae9466d7698ad006edfe8d442365b7"}},{"ruleId":"D1","level":"warning","message":{"text":"CfmlExtractor.delegateScriptTag (cyclomatic 20): CfmlExtractor.delegateScriptTag has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602c2a787423ea42f64dd87d38791a13f0b9d86758b257bcc1b39ea9816f964"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-local-scope.gateDartLocal (cyclomatic 20): dart-local-scope.gateDartLocal has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dbe5ac125b31774db79ddfe11d5dc41be162d63c8e5c7fbbb95deb5ce93478"}},{"ruleId":"D1","level":"warning","message":{"text":"ambient-modules.kindRank (cyclomatic 20): ambient-modules.kindRank has cyclomatic complexity 20 (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":"src/resolution/ambient-modules.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e7d7a214f19a7525b280e57049919439a9ea84806c384dc92a9c573a6383a4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonScopeText (cyclomatic 20): name-matcher.pythonScopeText 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 2 function literals inside it that branch (lines 824, 835). 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9c1831fc11d23c670a049b4afcd7139dea5a11e9a32ac93a622677f3c4dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonFieldType (cyclomatic 20): name-matcher.pythonFieldType has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4479574f6cc186c714ea78930debe3102a54e8805c23ecef1f1b194364621be"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.typeDartHead (cyclomatic 20): name-matcher.typeDartHead has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5737}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c9c4df5187a7de1b65e5420baba5904544dca99b533f2af957480ee2a2e922"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustOutsideTypeCall (cyclomatic 20): name-matcher.rustOutsideTypeCall has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 belong to 4 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13281}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ceff9636a410c1cba424539e0a6b0558858d9f1a9ee93a7101ee3b036cd4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchCppDeclaredTypeCall (cyclomatic 20): name-matcher.matchCppDeclaredTypeCall 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08805fa6adcb35c0df5c53ce13913b842807328167c8789b3da7ebeabb07778"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinCallResultType (cyclomatic 20): name-matcher.kotlinCallResultType has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20965}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d3e62ae2e9da50f6189294160fed8169053e8f5fc1b5f54eeaa8c0a259f16a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchRustSelfCall (cyclomatic 20): name-matcher.matchRustSelfCall has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42dee4f9b3a7fde02810835c9b61a7121162fd00dd1960d40fff38c27d5aff"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.resolveStoreAction (cyclomatic 20): name-matcher.resolveStoreAction has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31091}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145f7c3438eca15a56fc5bfcd9dafbc391065006adb088f312c1da4d9c53fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppOverloadFit (cyclomatic 20): name-matcher.cppOverloadFit has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":33048}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab57bc2c7eadfdbe51923f62a5db865932426dba3001e5c32e5af5451d2655fc"}},{"ruleId":"D1","level":"warning","message":{"text":"express.topLevelArgs (cyclomatic 20): express.topLevelArgs 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2d1e0db18855a526b12e97b4ec320187d61e583aa99d0f7cec221a74a6a020"}},{"ruleId":"D1","level":"warning","message":{"text":"react.conditionalBranches (cyclomatic 20): react.conditionalBranches 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b22a6286c8292ec10134c3118a82a003934ec57d3d1a97da1e8e622c4d53edc"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.commandsHref (cyclomatic 20): angular-router.commandsHref has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10883d48b1749bd1b25c59e8813e81e64bd4333a25610dc932c45ee75fc9393"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.findRtkEndpointsObject (cyclomatic 20): TreeSitterExtractor.findRtkEndpointsObject 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1afd5eab31fea40d46bffd63aab5d045ade0dfd9eb88e1c40b55205add4fc5c"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.resolveErlangGenServerTarget (cyclomatic 20): TreeSitterExtractor.resolveErlangGenServerTarget 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29a2669998eae39c7604abe1c7aea87741ffb21e4b57957b71cf178f9c63153"}},{"ruleId":"D1","level":"warning","message":{"text":"module-importers.reopenReferencesThroughBarrels (cyclomatic 20): module-importers.reopenReferencesThroughBarrels has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/module-importers.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d51a9053d68790797ddf1580f345bbbbe1bdd0a3e68b4792bf0d28898666af"}},{"ruleId":"D1","level":"warning","message":{"text":"module-importers.addPythonImporters (cyclomatic 20): module-importers.addPythonImporters has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 3 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":"src/resolution/module-importers.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"b457f44528dd0acc57e856287bacbeb1514d26d900845bf27a5b0bf9bc18d5ec"}},{"ruleId":"D1","level":"warning","message":{"text":"index.collectGitStatus (cyclomatic 20): index.collectGitStatus has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee31e00557383516dd2c60a9ab2bec9fc903c57430ea51eea37285f829d7beb"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-template-synthesizer.readMicrosyntax (cyclomatic 20): angular-template-synthesizer.readMicrosyntax has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"538e74386d560d370493379050b9920436836c37ea82b3aca948728072104338"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.operandEnd (cyclomatic 20): tier-synthesizer.operandEnd 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fed8954e250293cbe6abbe0e24ad9e87b3b89e222b6b480962aff3218148bd"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.crossTierEdges (cyclomatic 20): tier-synthesizer.crossTierEdges 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"84544137645eae817e7bbd718b5fd81d44e62d204d5298234ea57ac498cac12c"}},{"ruleId":"D1","level":"warning","message":{"text":"override-parameters.blankCsharpTrivia (cyclomatic 20): override-parameters.blankCsharpTrivia 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":"src/resolution/override-parameters.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5296ddb406ed724a08e1c248156d5d217f6e698f172c7ebdf64e9323a14b20d1"}},{"ruleId":"D1","level":"warning","message":{"text":"JsxLexer.tag (cyclomatic 20): JsxLexer.tag 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":"src/resolution/jsx-code.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"362809ac284dce2ce867b39f6b53897c34977ea71e1e2d02672643bda9b5fa12"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.arkuiRouterEdges (cyclomatic 20): callback-synthesizer.arkuiRouterEdges has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to 5 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e78308332d9de74892d8b1b5f36c169982cbd0c2fc11f70510d63541b53f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.goGrpcStubImplEdges (cyclomatic 20): callback-synthesizer.goGrpcStubImplEdges has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a51a9e911b2d7cc7072320f6838bf01d4ba903e0d2683caffbc3ed5da06e01e"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.hasSynthesisPattern (cyclomatic 20): callback-synthesizer.hasSynthesisPattern has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"add0b300ad80cb2a6402ec6ba7e6f1c94e5b9d78281fc0aed9721b4433198305"}},{"ruleId":"D1","level":"warning","message":{"text":"parameter-flow.namesToReview (cyclomatic 20): parameter-flow.namesToReview 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6402ed8b472a3ee9e37778931af6701444bdeb7b68bbb64b527ad8095904de25"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleCallers (cyclomatic 20): ToolHandler.handleCallers has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3407}}}],"partialFingerprints":{"codehealthFindingId/v1":"130a2a3b17a2e5ca95e86865bd0a5168b378bc7cefac148da770dd4c8e11b30b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleCallees (cyclomatic 20): ToolHandler.handleCallees has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3496}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbe7dc1e1ce601fcbeaf746301610ca85f4691bd2f95c856be36768f72bb34f"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.handleImpact (cyclomatic 20): ToolHandler.handleImpact has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb0106694726f9fbebc2a272ec88ce509d0d48b7e14cff518a0c4cbda8536cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.computeGraphRelevance (cyclomatic 20): ToolHandler.computeGraphRelevance has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d3ad2b049dc752e35f796c63c174c964e0f72021624d26679aa04ffe17566"}},{"ruleId":"D1","level":"warning","message":{"text":"dead-code.overrideCandidates (cyclomatic 20): dead-code.overrideCandidates 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":"src/graph/dead-code.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"5603009e8ef502325745b90006b4aefcb214fa1ef258cdaa5e34bd5c0ee5d426"}},{"ruleId":"D1","level":"warning","message":{"text":"search.buildSearch (cyclomatic 20): search.buildSearch has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: search.kindRank (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/search.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3765fe5b8c525c7d16f8b3fbff85a4c714f31bb4d30df7cfc69bf8b782adcbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"api.breakdown (cyclomatic 20): api.breakdown has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46ffb92aa87d01c6a3faf37f54b4e3d0ce2f8811e58879b3254e544470000db"}},{"ruleId":"D1","level":"warning","message":{"text":"program-model.orderGraph::flow (cyclomatic 20): program-model.orderGraph::flow 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":"ui/src/lib/program-model.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"335fce02114da32a07146153acc0409147a2e6ad61eccc31403288707c40a502"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_inheritance (cyclomatic 20): Walker::extract_inheritance 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4e62782074d57cb101d02db5560930b450a92cc397feb450d7046f7a4aa23"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 20): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b428a4ada8fb36057944747975697e2bb3dd06ddbdaef878b516a30986d055"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 20): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef244bdee6d8878de7603ffb80f9fd43a5795938c694fa28145487d5a8e7ffb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::create_node (cyclomatic 20): Walker::create_node 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb81638a41397172857624527bd2c9256137d34b1cf857b87756f41eae74fc67"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::hook_binary_operator (cyclomatic 20): Walker::hook_binary_operator 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":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14d245ecf07cb562ec80fd5a75a9fdf4ad1479c11d5fc06602e82d80ba1d56a"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_class_members (cyclomatic 20): Walker::extract_class_members 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":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc07482de5c409c5cda8855e8e5c10fc989f935a5fb8aa93d10313ff3cc6d53e"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryBuilder.searchNodesFuzzy (cyclomatic 19): QueryBuilder.searchNodesFuzzy 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":"src/db/queries.ts"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac25cb76e47332e2e15ff3b144beffd14d5788a2bcb5592797c6a2cbb12eab5"}},{"ruleId":"D1","level":"warning","message":{"text":"java.synthesizeRecordComponents (cyclomatic 19): java.synthesizeRecordComponents 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":"src/extraction/languages/java.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac03d470fc2d35abd0ee47d59ca2ac575b429d457a43ebce3cf69b57a5d60a2"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.blankDuplicateBegins (cyclomatic 19): pascal-preparse.blankDuplicateBegins 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc22348de1f0d7b3165fb063c40934ffe5a4a48a6126d5402a2de6140558c154"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.anonymousRecordDeclStart (cyclomatic 19): pascal-preparse.anonymousRecordDeclStart 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28648b7be4b7f2e79f39cd589918711e731c55d0bc3e27266edd2445c588df0"}},{"ruleId":"D1","level":"warning","message":{"text":"RazorExtractor.matchBrace (cyclomatic 19): RazorExtractor.matchBrace 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1017492cad52f1bc3001cc71a92296f2bdb180a59fa21b44895ad27b46be3cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"vue-options-api.matchClose (cyclomatic 19): vue-options-api.matchClose 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5897f63ad5579e06e73653decab5d8b2b2b88bbffcc0dd89ff6dd303b11d6601"}},{"ruleId":"D1","level":"warning","message":{"text":"swift-type-visibility.declarationFor (cyclomatic 19): swift-type-visibility.declarationFor 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"302fca1a0d85f6ebd44801f58b0ce193249f104391db5313733331181eb34815"}},{"ruleId":"D1","level":"warning","message":{"text":"rust-scopes.walkPattern (cyclomatic 19): rust-scopes.walkPattern 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fff6ddedc4955d6d8f71ed00346f6d806601b92d86bcd85694cb5f5b42a2f2b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.hasBridgeEvidence (cyclomatic 19): name-matcher.hasBridgeEvidence 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d8b76c69213d8c4529f0ba0f907bbe2124c8eb3141579efc80a3a98a5d2f09"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonCaseCaptures (cyclomatic 19): name-matcher.pythonCaseCaptures has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ce2c908e0a011168597dfc9ee192fe1175494d4a6effe373331b3e1b01c633"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.luaMemberIn (cyclomatic 19): name-matcher.luaMemberIn has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 4 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f99404eaa4de4186da43b1fd18c2503ac672a199cf5593ac67377e5e6f4b801"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchDartChainLink (cyclomatic 19): name-matcher.matchDartChainLink 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3885ceb4161d6bfa507ba45bff89feca8790e59162e16efd51f35fc063c00"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.dartInitializerType (cyclomatic 19): name-matcher.dartInitializerType 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6081}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d7915e263bb037b8d7e94f97e5ed9b8b68c41e44e99544011ca425fe05f73e"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustManifestDependencies (cyclomatic 19): name-matcher.rustManifestDependencies has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9537}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aac8ad9a861e5d91c87c2e0651c5c20ea7219e71c9d252b4dbf55cf71d6065"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustPlacedByName (cyclomatic 19): name-matcher.rustPlacedByName 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13cc8d551aaa83496ce3a0208f7d9528b21d47e8c6cbec0744ba5e63664e77a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustFunctionReturn (cyclomatic 19): name-matcher.rustFunctionReturn has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12512}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff4afe4eb49841bf38ac6ef58a6454572816f98ce74cd3f46d26d7c08beb3f1"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isImportShadowedByJsBinding (cyclomatic 19): name-matcher.isImportShadowedByJsBinding has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13768}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1c23a1fc1ed200f9d8d83b364a6d8c37aa71ad79782973d3f52c27cc73e3b8"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.bindsAtSites (cyclomatic 19): name-matcher.bindsAtSites 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13979}}}],"partialFingerprints":{"codehealthFindingId/v1":"82df39239902b6b5d3b21b6e02d92117b1f313746114cc82bc8de57c7e56fdec"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppArgumentType (cyclomatic 19): name-matcher.cppArgumentType 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19339}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc071fe863f51bdf7b21cf51883608dc609d7c82ac901612e8480fcd380ec761"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppUnqualifiedTypeFit (cyclomatic 19): name-matcher.cppUnqualifiedTypeFit has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fece6ecca7dbbc8de943a22f2497912e93df9d4f7559168e9fdfec609a51e0"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.javaTypeRef (cyclomatic 19): name-matcher.javaTypeRef has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21436}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3651dbbc5237c32d89fae5e5c18fe293b0be8935570a01ec30a6aaa7866b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.inferEsmAwaitedCallType (cyclomatic 19): name-matcher.inferEsmAwaitedCallType 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94499b4b7ed12ee67a1f8c45ca690cc17d0ce53276ca9f2230b0caf9c7e05e4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.preferGoBuildTwin (cyclomatic 19): name-matcher.preferGoBuildTwin has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe7fc5bf2b17777882cedfd86bb481ff36476e5fde1465bea67bf92996141b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonClassNamed (cyclomatic 19): name-matcher.pythonClassNamed has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb76c6e8490ef444cd3b4581a6bca413220d4c74d58e1c98ca4583c9b2b4574"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustWrittenCallReceiver (cyclomatic 19): name-matcher.rustWrittenCallReceiver 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38b66f981ac2cf2368485e23765147efd86ce0293b7d9b8fbfde4574623d533"}},{"ruleId":"D1","level":"warning","message":{"text":"nestjs.splitTopLevelObjects (cyclomatic 19): nestjs.splitTopLevelObjects 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7de0d38838693c332e0fc2c776c79313ae0abcdf3c00db402f8dc8912dc7e76"}},{"ruleId":"D1","level":"warning","message":{"text":"expo-router.indexAtDepth0 (cyclomatic 19): expo-router.indexAtDepth0 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0894af6f3f05725c8e3b9ef2b49884f6d356faf3292bb74a074bc93ea52a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"expo-modules.nativeBinding (cyclomatic 19): expo-modules.nativeBinding 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":"src/resolution/frameworks/expo-modules.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e062e98cc286acbbff32cde403c8b5e90093f33fb14d11373688ed84f6bd21d"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractFunction (cyclomatic 19): TreeSitterExtractor.extractFunction 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95548c64736fa9c8e7eeac4f2f2ddd5f140a24ec0b124d2818d14f5f393d7cb"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.rtkEndpointHandler (cyclomatic 19): TreeSitterExtractor.rtkEndpointHandler 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4a1071583f4b3276c741f2706ac3018bf7c84744f98a3abec3e4599b7ed69"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractInstantiation (cyclomatic 19): TreeSitterExtractor.extractInstantiation 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac5b953ccee3e530e53edfc296459a6a569004f3005c24037a100ba6465857c"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.reactHookBoundName (cyclomatic 19): TreeSitterExtractor.reactHookBoundName has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7727cf11fca3dda9cedd7d305b29f80d75c3247d8276d96ba216932d6d04d22f"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseWorkerPool.drain (cyclomatic 19): ParseWorkerPool.drain has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/parse-pool.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fab61fc91a1b6b693fbc113620e9d1cedf5b20ffb75bb52dfd2d9ee105cccd"}},{"ruleId":"D1","level":"warning","message":{"text":"type-parameters.declaredTypeParameters (cyclomatic 19): type-parameters.declaredTypeParameters 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":"src/resolution/type-parameters.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e3c3ce53c83aad61a846a76909ee3ad75447c313a9cd6f76266efdc6d2245d"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.pairEvents (cyclomatic 19): tier-synthesizer.pairEvents has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2b4395581eff89e5bf342068f7037d34f1ed7e70134427a2fb3b2715e80281"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.fabricNativeImplEdges (cyclomatic 19): callback-synthesizer.fabricNativeImplEdges 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d1413e346aeecddca6ddda1fe3a80ffe4c046ebb4d3c5e6faaf1fcbc5428b8"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.mybatisJavaXmlEdges (cyclomatic 19): callback-synthesizer.mybatisJavaXmlEdges 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041a2c5eaf009042cd19462dba2886c19a7e6eb6096d7203fdea049b7b7fb3d"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.buildFlowFromNamedSymbols::collectSynthLinks (cyclomatic 19): ToolHandler.buildFlowFromNamedSymbols::collectSynthLinks 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. This shape REPEATS in the file: one other method here (ToolHandler.buildFlowFromNamedSymbols) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28255b382052e2cf819f637207c71044480a8fb86090f770d371f980192e46c"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.buildBlastRadiusSection (cyclomatic 19): ToolHandler.buildBlastRadiusSection has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b83b1144f78b2de60fd64f9f74dcc9925182c19aec28fcabfaf4f4d4c2acaa0"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.formatFilesTree (cyclomatic 19): ToolHandler.formatFilesTree has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (renderNode, a function literal at line 8927). 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":"src/mcp/tools.ts"},"region":{"startLine":8874}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b665d950db28df9ef7f657c56c13b94e860a124d28c102742799647f3c4e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Daemon.start (cyclomatic 19): Daemon.start has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"src/mcp/daemon.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a22204468165d32de1431db6310eb5c664cb0771d17584926e784232afde590"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeGraph.getSegmentMatches (cyclomatic 19): CodeGraph.getSegmentMatches has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 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":"src/index.ts"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9be8e930c85122069edb0b9cafeaddc3e5317378d40ffba9c3bd2b7a00c95"}},{"ruleId":"D1","level":"warning","message":{"text":"when.annotateWhen (cyclomatic 19): when.annotateWhen has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 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":"src/ui-server/api/when.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7652b5859979c7b2f986a9ec6d7701923a19fcd9edc5fe93e63d6402324c3e"}},{"ruleId":"D1","level":"warning","message":{"text":"toml.layoutOf (cyclomatic 19): toml.layoutOf has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 321, blockOf). 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":"src/installer/targets/toml.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a8fd02857c9eda9584b6b6b891f82a0160bd27b93c12d59b202d147e03dc0b"}},{"ruleId":"D1","level":"warning","message":{"text":"export-svg.flowSvg (cyclomatic 19): export-svg.flowSvg has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"3508c20ac43003a931fb16f59aaf92930789df4a05a28dd3f8dcd0560e355249"}},{"ruleId":"D1","level":"warning","message":{"text":"screens-model.trackedCurves (cyclomatic 19): screens-model.trackedCurves has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0861f88646e2e72b7897dfc0618c692fc65451cb80ea4e4d8f55a455600dad6b"}},{"ruleId":"D1","level":"warning","message":{"text":"screens-model.placeLabels (cyclomatic 19): screens-model.placeLabels has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 785, restLabels, a function literal at line 784, \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":"ui/src/lib/screens-model.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bd655e630204ca89538193abca1b28ba5d8dea7991c00f5714830d4bd60be2"}},{"ruleId":"D1","level":"warning","message":{"text":"steps-model.buildStepsModel (cyclomatic 19): steps-model.buildStepsModel has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/steps-model.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f169614a9898ac8f3562cbd2baab8fcb65db13f4e8395289f0560d7f38749069"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_name_raw (cyclomatic 19): Walker::extract_name_raw 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c379ecec0259c7de6b5c700b6d211a81106ea79c4e2d785c2a5a0f66baf9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 19): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e50cd7e30b4aff8398308d07a93605c187ac4a93db1b5cb984fc863fd076c65"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 19): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdf46be6cd9193f4a1f27e23f4719d4c7f4828e53977f33b6b8187454d65cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_object_literal (cyclomatic 19): Walker::extract_object_literal 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"86081652220b24fe611b96f9ab180fe180b1e5dd7f93cd2f2b5ab4cf601a9f04"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_import (cyclomatic 19): Walker::extract_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":"codegraph-kernel/src/php.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"012fb196eea2925f450aa6caf880919d99c67c82af63dfb7f859cbc57d2179d6"}},{"ruleId":"D1","level":"warning","message":{"text":"directory.planFrontload (cyclomatic 18): directory.planFrontload 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":"src/directory.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e06c39da240bb560e4047330e851b481294ebdba3af97164d796972ce22dca"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryBuilder.findNodesByExactName (cyclomatic 18): QueryBuilder.findNodesByExactName 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":"src/db/queries.ts"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c284db4cbc8cbbb84bef02d59507e32f8e26e4d45e171dd2b41ddeb95fe8afd"}},{"ruleId":"D1","level":"warning","message":{"text":"kotlin.kotlinPropertyKind (cyclomatic 18): kotlin.kotlinPropertyKind 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcb48400e8f81b03dcae8eae7562a5143b8d44d03b66b1c37039c8898fb902d"}},{"ruleId":"D1","level":"warning","message":{"text":"cobol.collectRefs (cyclomatic 18): cobol.collectRefs 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1099554bb35bdc1db04e5616a53802f784badc17fb283645e91974fc2debecbf"}},{"ruleId":"D1","level":"warning","message":{"text":"erlang.handleFunDecl (cyclomatic 18): erlang.handleFunDecl 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":"src/extraction/languages/erlang.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dfa7c0cc5053df8000ca3e88b6f0692fe8f51b1e44d5c7e490f29d10983cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"erlang.handleAppResourceTuple (cyclomatic 18): erlang.handleAppResourceTuple has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/erlang.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"229ffe864bfb85a337027a974e060194fe78e06652e3ea74cee510a32445c42e"}},{"ruleId":"D1","level":"warning","message":{"text":"arkts.collectDecoratorNames (cyclomatic 18): arkts.collectDecoratorNames has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/arkts.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"871f856c3de58ef5f86da62b5ecfee14af09de6376ad3469d96d46984eaede74"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-methods.qualifiedCallableAt (cyclomatic 18): cpp-macro-methods.qualifiedCallableAt 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c90b46a4881c3444928ed929f3172bca80e6cd00761b977cb6da9a7531e7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-methods.cppMacroInvocations (cyclomatic 18): cpp-macro-methods.cppMacroInvocations 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9473de76430bedd8b80c61141707e1e533913c06f2f4f02a11fb0dde703150a9"}},{"ruleId":"D1","level":"warning","message":{"text":"razor-script.blankRazor (cyclomatic 18): razor-script.blankRazor 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":"src/extraction/razor-script.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6830f43ed9b2d589b481919096b14601ef11f859a98ba838ec9eefb48d21b94"}},{"ruleId":"D1","level":"warning","message":{"text":"path-aliases.loadProjectAliases (cyclomatic 18): path-aliases.loadProjectAliases has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/path-aliases.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71836e45e652ffdcdae20ad695eec234c110deb17b7b170e95a1267a6fbe36"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-local-scope.splitParameters (cyclomatic 18): dart-local-scope.splitParameters 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a9f8530ab4b02cf8b7b756619c19eab6f8b31193cb8b9b00b58fd2414be427"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.bindingOn (cyclomatic 18): vbnet-receivers.bindingOn 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2594317223fd57aa1672097fb48989b710c26e0d676b1ef1f9b2a081e05ca3f5"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.headMemberOf (cyclomatic 18): vbnet-receivers.headMemberOf 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"85af1d0ab4840629503821bd086a859187fef0845f2df0965d4dc961a6958133"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-namespaces.cppNamespaceMacros (cyclomatic 18): cpp-namespaces.cppNamespaceMacros 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":"src/resolution/cpp-namespaces.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a41c1100788a694679f564b3c10c1fcf3d4e0a128d3ca3114260665f5d3119f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.scalaBlockOf (cyclomatic 18): name-matcher.scalaBlockOf has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"273c8e5147cb1450a67b1a29a430bfd1b3aba90d649087cdb6a69afdbfc29ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinReceiverTypes (cyclomatic 18): name-matcher.kotlinReceiverTypes has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7032}}}],"partialFingerprints":{"codehealthFindingId/v1":"2638daf35766f98d6df92a8f984bf21a1e7027196fc90b9a5a894be8c60a249e"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.kotlinBraceFrames (cyclomatic 18): name-matcher.kotlinBraceFrames 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7140}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c3bb58314fa23be201b01dbb75f54b74e7ba47466a2ba6aaa5a78b024fdc18"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.scalaSupertypesOf (cyclomatic 18): name-matcher.scalaSupertypesOf 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7814}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d8a515f8b527fbd9fceb703757651bbf1017be2f7df46c5ada1814427765c6"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.csharpProjectUsings (cyclomatic 18): name-matcher.csharpProjectUsings 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8066}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bed569b0e1ad3ffabe5f1b5b513e820332df83f1e004834360bd64f4815d88"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rubyMixinsOf (cyclomatic 18): name-matcher.rubyMixinsOf has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8905}}}],"partialFingerprints":{"codehealthFindingId/v1":"da131b880edc89cbd3abdc9e6e70980a01f81b7eb5d59b9007d9b28e76c7003f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustNameRead (cyclomatic 18): name-matcher.rustNameRead has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10935}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae174b9f82c2dbbe62948859d4b4109e50febda3c70da525f8e75038db8d296"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustTypeMember (cyclomatic 18): name-matcher.rustTypeMember has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef041bcbd52d6da74c50fb3fd3dcc1c399f4d9af4dc9ad3e18d46ff9c2408b5"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustFirstArgIs (cyclomatic 18): name-matcher.rustFirstArgIs 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d748b19f0fb9a385391759b86abd3fc72a68481068e4d3adc1142ef27559b0d9"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustReturnInstance (cyclomatic 18): name-matcher.rustReturnInstance has cyclomatic complexity 18 (threshold 15). 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: 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12610}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c785cb934e2a9e0d18715290ee022b28b35f885ee56e0b1792ad5a3b0ce542"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.objectLiteralProperty (cyclomatic 18): name-matcher.objectLiteralProperty 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3051140216c5a1f823d3f8bfc6602289bcee5d820575334071984869220f1c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.resolveObjectPathMember (cyclomatic 18): name-matcher.resolveObjectPathMember has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15940}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7689ba5d7388f0d422cabf0a9a004e3dac38cee8ad4505b5e6442e735f8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.javaReceiverDeclaredType (cyclomatic 18): name-matcher.javaReceiverDeclaredType has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1bdcaa1cab1689d4bd9f0319d69c9494755d9e0a8c02d8dc8a262a10daa73b"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.inferPhpAssignedPropertyType (cyclomatic 18): name-matcher.inferPhpAssignedPropertyType has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1af7574fe7239b481d0d04258b39d939828a5c2a99d6be46f0925fc9ff6931"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goFieldTypeOf (cyclomatic 18): name-matcher.goFieldTypeOf 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02378a8c648d0388a8d4df2bf04e96d240c3939bb614eaacddbc432dd8764bd"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonDefStatements (cyclomatic 18): name-matcher.pythonDefStatements 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb5e0f5930ef00e888535c345a590a9dcbd35c4016da24b52a582cac3496755"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchPythonAttrCall (cyclomatic 18): name-matcher.matchPythonAttrCall 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28615}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e0bf309fa395625f1b3152049f7dc09f7ccf037a1f12bf4617a0a0215f57e1"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.tsFieldDeclaration (cyclomatic 18): name-matcher.tsFieldDeclaration 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fcc0dd7cbb610f18fcd57cd577308e744e26babb5689fe1f6661cff421102d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchCppMacroNamespaced (cyclomatic 18): name-matcher.matchCppMacroNamespaced has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32817}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1c6477a9ceb1053cb41a5dbb5bbab852e762973f5370a98319bf1241b4e8ff"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.readCompileDbIncludeDirs (cyclomatic 18): import-resolver.readCompileDbIncludeDirs 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b19d3d8ec817d847dbe184a54c05b09aed8ad6f179e14b63d4c23148077453"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.stripJsComments (cyclomatic 18): import-resolver.stripJsComments 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb4c7acded5653007201b056a623c486d50b9fb4e0fba970d8249af8da2846d"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.resolvePhpQualifiedClassRef (cyclomatic 18): import-resolver.resolvePhpQualifiedClassRef has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbff9e8d82a5824cee82a3bb7102f575415d6797511ec277cd51bac004698f12"}},{"ruleId":"D1","level":"warning","message":{"text":"nestjs.matchingClose (cyclomatic 18): nestjs.matchingClose 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"7538af9211ae6ea9de4ee0fadffea8527a15e99b4ae64c8049728e9235a34dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"react.scanRoutes (cyclomatic 18): react.scanRoutes has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1370, 1378, 1383). 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"22523272b71b79822655332f108e7a957b2cbe8bb4c8a50709aaeec59e2074d1"}},{"ruleId":"D1","level":"warning","message":{"text":"react.elementTags (cyclomatic 18): react.elementTags 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b7861fd853193a115d8dbdb8acc6a5cced7d00e35d1e1eb457a45bb627be1"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.routeFilesLoadedBy (cyclomatic 18): angular-router.routeFilesLoadedBy 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a24ba7f0706045000aaf967f6acd3061df276360693886645e0207c64a4115f"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.captureValueRefScope (cyclomatic 18): TreeSitterExtractor.captureValueRefScope has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"072a1633e3bba8c5b2138381d0d5504cf5e8a125d208997edfca7d11c3003ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.visitPatternDefaults (cyclomatic 18): TreeSitterExtractor.visitPatternDefaults 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7ad79e2cb41c64fbe55d14533f4bd1dbb99d2ed0a7c3fdbdbee230b5738297"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractProperty (cyclomatic 18): TreeSitterExtractor.extractProperty has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fec2f0483595c86247d48c21b8e0f2ae6d1dac53a68af133d2abc4754074b90"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.readPascalTextRoutines (cyclomatic 18): TreeSitterExtractor.readPascalTextRoutines 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3166ffe8f6a8c278dbdef3e4443300069422f55967938dc9ad6be0dddb02562"}},{"ruleId":"D1","level":"warning","message":{"text":"module-importers.importersOf (cyclomatic 18): module-importers.importersOf has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/module-importers.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8401fffc372229851c4188a7017c12b2508aadea2a93a65bf78060bc06d36c06"}},{"ruleId":"D1","level":"warning","message":{"text":"index.collectGitFiles (cyclomatic 18): index.collectGitFiles 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":"src/extraction/index.ts"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fd3941b277db0d701982809abf4a5278fbe23ffb98b9a99c563f08e146fc5c"}},{"ruleId":"D1","level":"warning","message":{"text":"expo-router-synthesizer.screensInBody (cyclomatic 18): expo-router-synthesizer.screensInBody 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":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3f3fb9e917ff4f3503bbc51b9773b5d485160e20111863bb99d0eb7fd523d7"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-template-synthesizer.expressionEnd (cyclomatic 18): angular-template-synthesizer.expressionEnd has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f3659a4ebf1eef37c5c65582a7e76d4214b3d607ea7fc3bbf6531bbe52ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.argumentsAt (cyclomatic 18): tier-synthesizer.argumentsAt has cyclomatic complexity 18 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"33206594e8befc525f8f170564fdf762d05df35e54c8f9cef2637889a02c2a41"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.bindingElementAt (cyclomatic 18): callback-synthesizer.bindingElementAt 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7668eed8d6c3a9bdc6b02dd2a8bd1516cd3414b10ba3aa09426c1ee0480ba0bf"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.reduxThunkEdges (cyclomatic 18): callback-synthesizer.reduxThunkEdges has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aa57aa99315640d83f8c952a0d4d37c475817fa6e2d0b1f5eb2f2cbc520e20"}},{"ruleId":"D1","level":"warning","message":{"text":"dynamic-boundary-report.findDynamicBoundaries (cyclomatic 18): dynamic-boundary-report.findDynamicBoundaries 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":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"719525a7b8aff9e2259fa215fa281b1c4a0ae44d2284f50b114157c1cf80a5af"}},{"ruleId":"D1","level":"warning","message":{"text":"claude.removeHookCommandsMatching (cyclomatic 18): claude.removeHookCommandsMatching has cyclomatic complexity 18 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/claude.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cebf8bf7e183ef41b86c10ca823a1a0ba849db47d424840aac47fa67e51ab1b"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPServer.startDaemonProcess (cyclomatic 18): MCPServer.startDaemonProcess 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":"src/mcp/index.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca254601847160a3d4a76714141eb8de9e2a0543b2ceca69da396b644e5b7e5"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.buildSteps.chainFor (cyclomatic 18): steps.buildSteps.chainFor 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":"src/ui-server/api/steps.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c657f6ca851e0c048b4098fae04c641b0507cd6a5d0a7476bc23d755c82b411"}},{"ruleId":"D1","level":"warning","message":{"text":"trails.parseSaveRequest (cyclomatic 18): trails.parseSaveRequest 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":"src/ui-server/api/trails.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8a86c322f32e19985e03aadc0b7d989bc8bd23971b4edda4f97e90dcb2ff8c"}},{"ruleId":"D1","level":"warning","message":{"text":"screens-model.buildScreensModel (cyclomatic 18): screens-model.buildScreensModel 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0916e96a73593f7517cca1f7a5670713eab6185ea6d7ea3f692c7a864483cc1"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::cpp_stack_constructions (cyclomatic 18): Walker::cpp_stack_constructions 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7453751832ed4dbacbed6a25a830333735836d5692e5bac65248804bf8b01"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 18): Walker::visit_node 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6114d83d97d64133948dbf60a347d0dcc797f45dbcce9c96fb2bfabe05611b95"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_import (cyclomatic 18): Walker::extract_import 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f6044034a26176fce1e0c1a22578f5272264298dde7cd870d17e59a8003dd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::hook_call (cyclomatic 18): Walker::hook_call 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":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35e1077f6e372af34e8582a33aabf22b987e4cb3d0cb60f2781c49a7655b103"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cyclomatic 18): Walker::normalize_fn_ref_value 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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc99c553a0858721d3c73d26e4190a0588bafcc4088fb6489ca86ba8b6fe963b"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_fn_or_method (cyclomatic 18): Walker::extract_fn_or_method 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ec84ce2ef7ff7cef4cdd169896f9f47e68ad474e87cb8c0c72548b4ad86e85"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::emit_use_binding_refs (cyclomatic 18): Walker::emit_use_binding_refs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (collect, join). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4da8f57ff27683ff04dc99a8fe5c4b714b2cdcab0f1ae5d9c62a89daf7e025c"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::find_rtk_endpoints_object (cyclomatic 18): Walker::find_rtk_endpoints_object 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f65bcf6ef075e9afe1ff895209165835b23e8831c0d85d6c4a2e0e233574ef"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankCppInlineAnnotationMacros (cyclomatic 17): c-cpp.blankCppInlineAnnotationMacros 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"42810547d62ba9089a272fdc5106df51ab5415371cd00d4b91d754cb7c7ebd1c"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-preparse.scanParameterList (cyclomatic 17): pascal-preparse.scanParameterList 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"687176e71497705a3861781c0de8932443b676aafd63f3a20deae3f832da84fe"}},{"ruleId":"D1","level":"warning","message":{"text":"r.extractClassMembers (cyclomatic 17): r.extractClassMembers 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":"src/extraction/languages/r.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd95796f7f0412d73b952134e197b3e99da9fd04e5a43c586d3d624b80f00fa1"}},{"ruleId":"D1","level":"warning","message":{"text":"VueExtractor.addOptionsMembers (cyclomatic 17): VueExtractor.addOptionsMembers has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 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":"src/extraction/vue-extractor.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"944d302f9db714bedb294c0e5fb3b68a825678432b7dd3acd786db2ab74f87ed"}},{"ruleId":"D1","level":"warning","message":{"text":"CfmlExtractor.visitTag (cyclomatic 17): CfmlExtractor.visitTag 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19c20df8db0e76d173582c44c3bf46be77270a7c6bfbf5b0c218dfa25e5fd68"}},{"ruleId":"D1","level":"warning","message":{"text":"laravel.routeFileMounts (cyclomatic 17): laravel.routeFileMounts has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac3b2d18e1b42170b124ac0564cf7b39e9c2fbedf07309c65ec2fc5499258a1"}},{"ruleId":"D1","level":"warning","message":{"text":"laravel.splitArgs (cyclomatic 17): laravel.splitArgs 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"69516be98ec38e04cfba3cc703d1be05ce8052c350ae5efbfa496c540117b504"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-libraries.skipTrivia (cyclomatic 17): dart-libraries.skipTrivia 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"14de17dbe92cb849916936dbf7f5f343d2ac6fbfc13e69c7407ff9a1cf920454"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-libraries.resolveDartUri (cyclomatic 17): dart-libraries.resolveDartUri has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b12213bf26b5cc84579645606a9673c8691d13a5a0ee68b0375add2f44563ec"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.scopeStartLine (cyclomatic 17): vbnet-receivers.scopeStartLine has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c7fc0426b0ee927b2b05211de861e7ea04d1dc42d0e1452d36d618364e6fb4"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.supertypesOf (cyclomatic 17): vbnet-receivers.supertypesOf has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9db8ebd36864069a862cd691823763c6bf39e3fa93f7b28be2a2abe812dab1"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet-receivers.typesNamedAt (cyclomatic 17): vbnet-receivers.typesNamedAt 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f84b99902d88f4972381eaff51eb83f7b8ac8d00a036d5e5ba2c1914c062cb"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-macro-visibility.directiveLines (cyclomatic 17): cpp-macro-visibility.directiveLines 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f5894eee18b0d9f3054dc8360f593cea4934b8bc096fd243e814717b615165"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-supertypes.writtenBase (cyclomatic 17): cpp-supertypes.writtenBase has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a55c52ba1a161345decc4af973a6e261376ca151c75df04ffd6f31df20eb97"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonStatementStarts (cyclomatic 17): name-matcher.pythonStatementStarts 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce293e87a2cd21468232c984e9f9e9190a01567f928383ddbfc595b5e1b2799"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isSfcPrivate (cyclomatic 17): name-matcher.isSfcPrivate has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"625dd6763b6f26021b5fda41b592cce92b1b7d66cd3c35efa804cab12eb14960"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.dartPrefixedCallSite (cyclomatic 17): name-matcher.dartPrefixedCallSite 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f794dc7028a29e8d9df131ec4d7280d6514dc448ca771447aeb59e0b46aad620"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustGoReceiverName (cyclomatic 17): name-matcher.rustGoReceiverName 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9802a24e5dafb637a84f678ebee7ef600033ad5e8cdbc9510d8b598dae42d60"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.csharpAncestorNames (cyclomatic 17): name-matcher.csharpAncestorNames has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"85be058f8431f1a1abb55ab8cebe6d1fe3b3d86bda9d6c4c3a7c71eb13db95a2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustSubmodule (cyclomatic 17): name-matcher.rustSubmodule has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d936a5e9cf7aecb8e7f20bca7d347cfe12bac4c33f61601f90c750e9e32a57"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.parseRustImplHeader (cyclomatic 17): name-matcher.parseRustImplHeader 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11373}}}],"partialFingerprints":{"codehealthFindingId/v1":"57adee3f2a609b4691b7b4abfa4a5ef0ad82e875011e4a98eb63a6b28fbba948"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustAssociatedReturn (cyclomatic 17): name-matcher.rustAssociatedReturn 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71241e887a3f82994169325df0c18a670126c7590d4174d217a0a63e7641cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.readRustMethodReturn (cyclomatic 17): name-matcher.readRustMethodReturn 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e77d021ddec150cd9907b34ffa154e7ccc9fe7abbd8b097eddbf8476a627f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppFunctionOverload (cyclomatic 17): name-matcher.cppFunctionOverload has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19112}}}],"partialFingerprints":{"codehealthFindingId/v1":"283146bac1eb571ef00f665ce808cc241621ace905359d3a91fccee9e67c22dc"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchCppConstruction (cyclomatic 17): name-matcher.matchCppConstruction has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5143929c0cb448c1b186caaad8f00bb8dc69c0d7359d784c2622b545a070f6ae"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goParseBuildExpr (cyclomatic 17): name-matcher.goParseBuildExpr has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (not, or, and). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26291}}}],"partialFingerprints":{"codehealthFindingId/v1":"499a1a4ba3e20b3a38670cc3b03e42957b78c7bcdd5ec229bf019c9440b058a5"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchGoChainedCall (cyclomatic 17): name-matcher.matchGoChainedCall has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f46a029689adfb72603087447cb542c0193a44662352a4db32811731a5830"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goTypeParamsAt (cyclomatic 17): name-matcher.goTypeParamsAt has cyclomatic complexity 17 (threshold 15). Of this number, 12 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27544}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f4c3559c636b9e657dd11f6148268cbc586609aba336aa801e394a882cce2c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonValueEvidence (cyclomatic 17): name-matcher.pythonValueEvidence 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27839}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9f9d19a8e01788907b8a9d5fb5a11ddd984a671b0bfcaeeb50e9b7d2a7ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonAssignTargets (cyclomatic 17): name-matcher.pythonAssignTargets 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27930}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e96b81b9c72fe52175409d3bd45e80cf1e0f7685a83f81709a74bad4ad4a13"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchPythonFactoryChain (cyclomatic 17): name-matcher.matchPythonFactoryChain 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28969}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df9389549e6123ee8c31c61ca2657b5721facaf9d57d3a35b411a8b4cf59b79"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchRustAsMutChainCall (cyclomatic 17): name-matcher.matchRustAsMutChainCall 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29395}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f18312a74ad113727de43044802dd9170d6160f8559115db3c0129a949ad20"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchRustWrittenReceiverCall (cyclomatic 17): name-matcher.matchRustWrittenReceiverCall 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29444}}}],"partialFingerprints":{"codehealthFindingId/v1":"85feddcdbd8ad8347f4632f7a415394b0fd1093f569ba40aa3746cd9b7f3ee9b"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.pythonStarExports (cyclomatic 17): import-resolver.pythonStarExports 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bbd34fd2b4e817643506372a3999fac9297bb8c34f8d9241a2e089b074bbb8"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.extractGoImports (cyclomatic 17): import-resolver.extractGoImports has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaac8e56dd89068fb04405a56f50141396a8d14f185b2cf3ca7abba2255c144"}},{"ruleId":"D1","level":"warning","message":{"text":"react.configHrefExpression (cyclomatic 17): react.configHrefExpression has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb29f30caf719f4ede98873feaffd97cc6d076492094ab91c49a24bcb98df54"}},{"ruleId":"D1","level":"warning","message":{"text":"react.initializerAt (cyclomatic 17): react.initializerAt 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49b943c8793ce643eef81c71e9e27e47520f8ca053c1457a3b5ab7e53f15dfd"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.staticString (cyclomatic 17): angular-router.staticString 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"164ca325c458055edddd15c8512c0073da74716ecb70a9e92aab63d62271ca40"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.findVueStoreCollectionObjects (cyclomatic 17): TreeSitterExtractor.findVueStoreCollectionObjects 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3863}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c1fa3a8f84c4393060646f92fc60a7030c1788ddf90ef99097c1ff66c431d6"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractTsTupleContractNames (cyclomatic 17): TreeSitterExtractor.extractTsTupleContractNames has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9d9569d87226d21edbe2c229187b86cf07d5db6b949ea89ed24b328c9934a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.commonJsExportName (cyclomatic 17): TreeSitterExtractor.commonJsExportName has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7684a5204db5bc7bdbd1bac0918ca9cc76e8cd49ae8482dfbe4dde6cf525c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.declarePascalInline (cyclomatic 17): TreeSitterExtractor.declarePascalInline has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8fe3e59e01302157c50e438a2d625799a9e5d4e7f28aa120a8c55e08ba5756"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionOrchestrator.buildDetectionContext (cyclomatic 17): ExtractionOrchestrator.buildDetectionContext has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (probe, a function literal at line 2274, a function literal at line 2256, \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":"src/extraction/index.ts"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e80260ae5b85d2f059444d73f3763b49328bdb175aff76afa3d8fc78453198"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-scope.nestedRoutineInScope (cyclomatic 17): pascal-scope.nestedRoutineInScope 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"58006d3f6b632e60c40521b5d9b7f031c4f27fd8001cdf273669760650d1dcce"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal-scope.memberAtPath (cyclomatic 17): pascal-scope.memberAtPath 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2c5188f72417411a1ed90478be10de21ba6eff34790f242ab3c84802bf0cda"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.clientPath (cyclomatic 17): tier-synthesizer.clientPath has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8992333dd3f827573e42c8bb23bd3972ce1b15f92fc186e9ca7f41ffd5d20a"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.pairQueue (cyclomatic 17): tier-synthesizer.pairQueue has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edc95bf06f6a5da8fea454a31c9c7559b1bd1560d90ed3b83c273655292a479"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.collectEvents (cyclomatic 17): tier-synthesizer.collectEvents 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed8e594047a393d0f8c73256e13bdd1dab3d08780c6d96d3ed58cf6cd79d2cb"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri-synthesizer.pairEvents (cyclomatic 17): tauri-synthesizer.pairEvents 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"777654b63393ab34aef4b8fd54335bfbf1929a643b2a23c67fac5a6ab6a7820a"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.reactRenderEdges (cyclomatic 17): callback-synthesizer.reactRenderEdges has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c55456f13f87040264d0498cb4f6326292c89596bbc6d8a68aa88cdb70a8d83"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.jsxChild (cyclomatic 17): callback-synthesizer.jsxChild has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b675af060d9d26da77f92d1558e9d6950200cc7ae95fc2216e59a78c88d789e7"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.rnCrossPlatformEdges (cyclomatic 17): callback-synthesizer.rnCrossPlatformEdges has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc536c9d7913f99bca2b5e28b02dc23ce8fa54febed769c3e477dae8f4f636fb"}},{"ruleId":"D1","level":"warning","message":{"text":"branch-guards.hasTopLevelOr (cyclomatic 17): branch-guards.hasTopLevelOr 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":"src/graph/branch-guards.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad151796cf1ff0623930e3e07b19ad3122d6db53e4a473314cd9180d38006cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"claude.writePromptHookEntry (cyclomatic 17): claude.writePromptHookEntry has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/claude.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa08dc2987a8f22e5d13f21066a051dcecd4c5196d951ba3a7336b49c16ae5c4"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPSession.handleMessage (cyclomatic 17): MCPSession.handleMessage 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":"src/mcp/session.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8230bbe6bd75e88940c1c0cafeec5367c2c75f8f1eb02dd3e6a02db2c60714a4"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon.readClientHello (cyclomatic 17): daemon.readClientHello has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 985, 1014, 1040). 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":"src/mcp/daemon.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd7b118744ea449c1fd8ba6a2f86d66801d61f0cc9205cc4ed3eb6003ca0137"}},{"ruleId":"D1","level":"warning","message":{"text":"entrypoints.withoutPreviews (cyclomatic 17): entrypoints.withoutPreviews has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 2 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":"src/ui-server/api/entrypoints.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa04f8ff1bd50eed2b69d33553964710a22459ad000991d1e10be77145a0576a"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.hopLabel (cyclomatic 17): steps.hopLabel 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":"src/ui-server/api/steps.ts"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ca81d7d20f1731cddf857acc616a7cd265da332980ba15d596c84057784f46"}},{"ruleId":"D1","level":"warning","message":{"text":"flow.toWireFlow (cyclomatic 17): flow.toWireFlow 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":"src/ui-server/api/flow.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cfd0c2dabe64f3d959bfaae96540bf8a5e4317178dc3d55d8dbf3ec71f4f49"}},{"ruleId":"D1","level":"warning","message":{"text":"export-svg.flowCardSvg (cyclomatic 17): export-svg.flowCardSvg has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9fe351e3920e3c120c490b76886795388a467851e0cdb28f54ba51abe65066"}},{"ruleId":"D1","level":"warning","message":{"text":"export-svg.capRows (cyclomatic 17): export-svg.capRows has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/export-svg.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cfd8a4fb8012b982eb9a7308f356bec53ebddaa9c4ad7cef56b2dbca1a2bd2"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 17): Walker::visit_node 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf039963022194ecec119d0258f122c18e3e721734294d28003f7551cbedfff8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_static_member_ref (cyclomatic 17): Walker::extract_static_member_ref 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e848e5d3df91b5899473f36076ff7dc502a7c564f75143d9eb19d88f658d8af"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 17): Walker::maybe_capture_fn_refs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f11c543f1841829bf5e21a2b5a251081e5517c93aed1c78d66394f24a19ab3b"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::rtk_endpoint_handler (cyclomatic 17): Walker::rtk_endpoint_handler 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec360fc3a7fe9538995a092d58b0e8ce7cf93fa000cb54afde40cf7ac8d239"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_ts_tuple_contract_names (cyclomatic 17): Walker::extract_ts_tuple_contract_names has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed1354e543729d542263a69285e9763f3387e843ac67426333d83f2281a51f5"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::docstring::preceding_docstring_with (cyclomatic 17): codegraph_kernel::docstring::preceding_docstring_with 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":"codegraph-kernel/src/docstring.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca7044c0e6fbdec4213c5b44f216ce615bb3507494353086b0d12644b84dc22"}},{"ruleId":"D1","level":"warning","message":{"text":"query-utils.extractSearchTerms (cyclomatic 16): query-utils.extractSearchTerms 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. This is NOT this file\u0027s highest cyclomatic complexity: query-utils.readsAsTestPath (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-utils.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed5b028dca391419f883b063ad810c2b91746131b323209246dadcc1ff1fdb4"}},{"ruleId":"D1","level":"warning","message":{"text":"name-substring-index.searchNameSubstring (cyclomatic 16): name-substring-index.searchNameSubstring has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 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":"src/db/name-substring-index.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9d86b2d36b54a26c932a1d6175da3845692fa7be2ae5f354699d081cbf7bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.recoverCppMacroDefinedName (cyclomatic 16): c-cpp.recoverCppMacroDefinedName has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f62ba2784f8affebcd567fc7c0a089e497b53f7ff7cd713cb7ec3e1a710793"}},{"ruleId":"D1","level":"warning","message":{"text":"c-cpp.blankCFileScopePrefixedDeclMacros (cyclomatic 16): c-cpp.blankCFileScopePrefixedDeclMacros 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab3676533203fa5d93d8d4db0f6605aebda88122dd425ceda5340923e39424c"}},{"ruleId":"D1","level":"warning","message":{"text":"path-aliases.stripJsonc (cyclomatic 16): path-aliases.stripJsonc 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":"src/resolution/path-aliases.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaeab0cef5c711ec98414cfbcd4b50a3ea3d742df2f716db688c6cb2d2f156d"}},{"ruleId":"D1","level":"warning","message":{"text":"dart-local-scope.bindLocals (cyclomatic 16): dart-local-scope.bindLocals has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ac69b5f8ba5b006b9e1c10a3ca65ed0b18d93ec2e40c784166aafef80c1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-type-aliases.readCppTypeName (cyclomatic 16): cpp-type-aliases.readCppTypeName 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"878dd0c1e8e965e87e69b8e16f26aa3f53f14d56632d23ecff259df856c98f34"}},{"ruleId":"D1","level":"warning","message":{"text":"cpp-type-aliases.baseClassesOf (cyclomatic 16): cpp-type-aliases.baseClassesOf 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfa187dbcd5cf6fd65e672c7b709f9382cf363f68c16479a92766e7012086fd"}},{"ruleId":"D1","level":"warning","message":{"text":"rust-scopes.walkTop (cyclomatic 16): rust-scopes.walkTop 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51a98b5fef0d6203f07065dd881bec389b9fd9d45bc7e28df0a6d1433cd1f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonBaseList (cyclomatic 16): name-matcher.pythonBaseList 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2b2244d203edeb52c2684130d07c8a7d42764c32d4bbb81737a735c462876a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goParamNames (cyclomatic 16): name-matcher.goParamNames 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3598}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55baa8519d8a8b2417920ffdd339151f3bbe0d7af665c578ddd6c1d7e6a2e76"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.usesNameOnlyAsReceiver (cyclomatic 16): name-matcher.usesNameOnlyAsReceiver has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd31eb58c40d060ddada8727e53f81baf9f8a822d8314e1d6d93f11e693d89e"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isReceiverLessCall (cyclomatic 16): name-matcher.isReceiverLessCall 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ffbea4125615ec58e72cffbad1f13de2e854e3ac9219d365802a66c4ea4009"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.isDotNetTypeRef (cyclomatic 16): name-matcher.isDotNetTypeRef 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87f37e0732290781dc573464b042857be4c2eb3937bc8a1f7c8c3e5b853ecb5"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.typeDartLink (cyclomatic 16): name-matcher.typeDartLink 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5797}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aa7452e8f5dfadd2cb7155ee81506ccd71975a62fa2dbd9009eb11df04f438"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.dartMemberOf (cyclomatic 16): name-matcher.dartMemberOf 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5b22940f12563dd4610f2e9238fb7f2320a4c1fbfd59d9dafab0ed2bfc6106"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.csharpProjectStaticUsings (cyclomatic 16): name-matcher.csharpProjectStaticUsings 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7992}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7c50c4a3cdae9c15a7dbfd4bd2b14e5cd7fac2fdd42ef6ed851f0001abbe6"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustWalkModules (cyclomatic 16): name-matcher.rustWalkModules 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10435}}}],"partialFingerprints":{"codehealthFindingId/v1":"55157752cd673f895fd469f6e6c2c18ec4086688dc1c4f45fa67303837d21a0c"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.expandRustUse (cyclomatic 16): name-matcher.expandRustUse 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12088}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc8477ea6074b467eb93a2f7b1fb37022bda96eec1b921f90da7496ee76f5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.rustFieldValue (cyclomatic 16): name-matcher.rustFieldValue has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12685}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c9a64a7636e890f241792bfdc9fb6893394d744ce59b68e82e906fc5d8498"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.cppWrittenTypeFit (cyclomatic 16): name-matcher.cppWrittenTypeFit has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc62d46fc0231a3d0b21667bb496c9c5146ab150191eecfc4f02e4b25ac458"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.jsDeclarationReading (cyclomatic 16): name-matcher.jsDeclarationReading 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24025}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae2ccbf6e13324fa3c55947b1f80bb24e045c831083d33a6ccb58612c9290c0"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.dynamicImportScan (cyclomatic 16): name-matcher.dynamicImportScan 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2473a7caa4b2a5c3bdea1af7b21821c803e0a868bb6728d8a88a96f4a0ac5253"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goDeclaredValueType (cyclomatic 16): name-matcher.goDeclaredValueType 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27269}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec062caa652e832b910c2541688a35251c42e7bec72e0cc4c35c928f1a8a745"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.goElementOf (cyclomatic 16): name-matcher.goElementOf 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4b937fdc64ec80eafee1abe69f584ea026383be59813ae25a024c70d120fb"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonConditionalArms (cyclomatic 16): name-matcher.pythonConditionalArms 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00276622beae5352c9bb678dc67ffff37ddf3d08aff8b929737129740ae978a"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.pythonAttrClassWalk (cyclomatic 16): name-matcher.pythonAttrClassWalk has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28545}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7e67e47d8277f74b8f5e5b233f73b91eeeaf0618e1454dce2290a493f99178"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.tsCallEndsStatement (cyclomatic 16): name-matcher.tsCallEndsStatement 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e0f38299a901fe3a1bbe33979044f96ecbab8eafbf606e08992983494cf09f"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.tsNamedType (cyclomatic 16): name-matcher.tsNamedType has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6e4d08325df7af98ea45db320accd614512aa7150df86a31e05d6ff3e103aa"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.tsClassTypeParameter (cyclomatic 16): name-matcher.tsClassTypeParameter 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. This is NOT this file\u0027s highest cyclomatic complexity: name-matcher.buildLocalReceiverTypePatterns (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/resolution/name-matcher.ts holds 202 of the 742 methods over the threshold \u2014 including the worst \u2014 and 2993 of the 10720 points over it (28%), 2.6\u00D7 the next-largest file (src/extraction/tree-sitter.ts at 1159). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30618}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6df5ba4cedfc66abf720a842d0b194e5e87e40d955fc8cf3ee3f286e29ddaf6"}},{"ruleId":"D1","level":"warning","message":{"text":"import-resolver.extractImportMappings (cyclomatic 16): import-resolver.extractImportMappings has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad784cd706b09a8803104eecb8c33542ad9479c908b45a088b9db3a5d1852c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"nestjs.splitTopLevel (cyclomatic 16): nestjs.splitTopLevel 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"7620f322c987f23b818a2c68121bed450c687869f3f5eba9537b8fe943f2e7a6"}},{"ruleId":"D1","level":"warning","message":{"text":"react.routeRender (cyclomatic 16): react.routeRender 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90b43e428dd479d8a4242440b7d48bb9f01e4320ba0ce24bedcdadf736d5c0"}},{"ruleId":"D1","level":"warning","message":{"text":"react.exportedTable (cyclomatic 16): react.exportedTable 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab60203b64136b9852e14cac69e839e7c2ca957ebddfe5a05176d573b4e626f7"}},{"ruleId":"D1","level":"warning","message":{"text":"react.functionBody (cyclomatic 16): react.functionBody has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f22dd646db798751e017ba75308308ba9ceca7786da34696c3dc2154cf25c7b"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-router.angularMounts (cyclomatic 16): angular-router.angularMounts has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4ab3e4f93cfab9ce7a4930050136bd5638cc9396847b672467d25522f1fd5f"}},{"ruleId":"D1","level":"warning","message":{"text":"python.extractFlaskUrlRules (cyclomatic 16): python.extractFlaskUrlRules 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cb39bc01c0466aa7f2e85bfb48f88b88afd8fd84156d13a8cf1a5d79f274ee"}},{"ruleId":"D1","level":"warning","message":{"text":"csharp.endpointGroupRoutes (cyclomatic 16): csharp.endpointGroupRoutes 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f03a0a4e0dbd7b0b1b7bfca7283c6245c0af3f442a83ee46cb25d9f2677305"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractVbMemberRead (cyclomatic 16): TreeSitterExtractor.extractVbMemberRead 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6926}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39103d32cfb4fc5df6cd3108949280a99dbc308eecaca510df98d449632dfec"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalDeclType (cyclomatic 16): TreeSitterExtractor.extractPascalDeclType 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8902}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cd8e06666d56a30619a8133bfe8f9c6f367e2814166306e63e4db2d7ea1b87"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeIgnore.ignores (cyclomatic 16): ScopeIgnore.ignores 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":"src/extraction/index.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e91e45836ca25a2d6f668af79c30f47e2627b9acdfa7914deb3aaef6285446"}},{"ruleId":"D1","level":"warning","message":{"text":"index.discoverEmbeddedRepoRoots (cyclomatic 16): index.discoverEmbeddedRepoRoots has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (visit). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"35de976bcc73761f4adc065997a23d78b8c0518bc41056899237c367f30c6039"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolverPool.constructor (cyclomatic 16): ResolverPool.constructor has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 245, 284, 288). 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":"src/resolution/resolver-pool.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3597cd320cfed091c6f423d4a2fc1f60238ca6409de8057137c5cb2e720a599e"}},{"ruleId":"D1","level":"warning","message":{"text":"next-proxy.compileMatcher (cyclomatic 16): next-proxy.compileMatcher 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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee720e07c8a12d7769bd23deac5d95cc574b506c6c23fb9308e57d392c1aa0c"}},{"ruleId":"D1","level":"warning","message":{"text":"next-router-synthesizer.nextProxyEdges (cyclomatic 16): next-router-synthesizer.nextProxyEdges has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3282d536d1505e11321f94f577983d11f6178aa8efd0bf806ae525c1197332bf"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-template-synthesizer.componentsIn (cyclomatic 16): angular-template-synthesizer.componentsIn has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"05adc08a41cfceacd34d30b7e29c7e5a9592cbdf4f8ab5713036fca3910d600f"}},{"ruleId":"D1","level":"warning","message":{"text":"angular-template-synthesizer.fieldValue (cyclomatic 16): angular-template-synthesizer.fieldValue 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"22024277407db237237efe17117f99fae971bbe346c1655da0fe5deb662fc3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"tier-synthesizer.collectHttpSites (cyclomatic 16): tier-synthesizer.collectHttpSites has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (add). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b67971dbfa9063da4eff61244dfc0e01652985ffe6369405ac9cddbd1285e6"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri-synthesizer.tauriEdges (cyclomatic 16): tauri-synthesizer.tauriEdges has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2a50803df70c0122a97bc66ac7bf53132a2aa201539ab6c898b1ec2ad9f11"}},{"ruleId":"D1","level":"warning","message":{"text":"JsxLexer.children (cyclomatic 16): JsxLexer.children 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":"src/resolution/jsx-code.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"815c20021f1c6d4b78e26633117844ba8cfb774d59d437f9059eb6cdb98dd54b"}},{"ruleId":"D1","level":"warning","message":{"text":"callback-synthesizer.nixLeadingPlainSegments (cyclomatic 16): callback-synthesizer.nixLeadingPlainSegments 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4837}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410b13eabe116d69eeb443d4ecd11edd166b582ef283b67ca396af8a7d8a589"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby-parameter-flow.splitTopLevel (cyclomatic 16): ruby-parameter-flow.splitTopLevel 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1c7f09c6a7e6404c74bfe15f565b8db519acce40debf6eb383d94cd47bb6ac"}},{"ruleId":"D1","level":"warning","message":{"text":"FileWatcher.refreshWatchTree (cyclomatic 16): FileWatcher.refreshWatchTree has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/watcher.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf3a622f11a2b4d9b9a40146fd40f2bf7f4bbe95a181c43d2f89308254888b1"}},{"ruleId":"D1","level":"warning","message":{"text":"branch-guards.guardsInTree (cyclomatic 16): branch-guards.guardsInTree 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":"src/graph/branch-guards.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec6cd8d68b1b8596276bb340978a247c195d91bbde103cc2b0d9db6d8d7d625"}},{"ruleId":"D1","level":"warning","message":{"text":"dynamic-boundaries.scanDynamicDispatch (cyclomatic 16): dynamic-boundaries.scanDynamicDispatch 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. This is NOT this file\u0027s highest cyclomatic complexity: dynamic-boundaries.commentLang (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f04491a5ba455f19c7addfea34d845918cc3a7c35973bef56215b8b6af24e"}},{"ruleId":"D1","level":"warning","message":{"text":"toml.scanTomlLine (cyclomatic 16): toml.scanTomlLine 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":"src/installer/targets/toml.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd57f9ddaf7ed0f10d0afa9dc49a32cfe881346fb5b6d7f94cc9e603ac000e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"export-svg.mapSvg (cyclomatic 16): export-svg.mapSvg has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/export-svg.ts"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"5626ead9f91f71f1b6484dae3fe962629a5289db7e1f6493b5df634acb5a4c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"conditions.splitTop (cyclomatic 16): conditions.splitTop 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":"ui/src/lib/conditions.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"643e9630b5d40200cbc7e08bcd86d0c79784861aeb5e4ee6e9c8c1c5366bef6f"}},{"ruleId":"D1","level":"warning","message":{"text":"steps-model.kindWords (cyclomatic 16): steps-model.kindWords 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e803b1ac69da7dfa3389b6727eaf4607423debacea000578f1decf9271872c"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_variable (cyclomatic 16): Walker::extract_variable 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efdb71b762a48bbd71a23f7770ae809a37ad3d0ba28f15085ffee60864945e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::create_node (cyclomatic 16): Walker::create_node 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a036f2842035fb74daa017799e1b8a45414a42150773455481f1bb8bb44a040b"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_variable (cyclomatic 16): Walker::extract_variable 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"736fdcd06a52d945d871badd40fc07aff9b67789fb8c7235a7a4285f3f85a57f"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_call (cyclomatic 16): Walker::extract_call 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"848776fe444f67267b74bef20b5e82ad55493a634bdcb11f125d015face9e5a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cyclomatic 16): Walker::visit_for_calls_and_structure 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d901a259f443d51c27e72fd8a90ada2c61589a5acc17f961799bd87df422dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit (cyclomatic 16): Walker::visit 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7d2b9e7cc1eddd43f5840e2470d516c56b262dd2a45640d0667ca69acdd97f"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 16): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a82548aa5dc52553ea73143223dc5eaf2d3c041baef67e19bb6442c6b278d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit_node (cyclomatic 16): Walker::visit_node 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf31e0c79f8d45cd231f1485fcbf3df0ea9c1b9b7a117e39760c6b4455a04e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cyclomatic 16): Walker::maybe_capture_fn_refs 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b83957ed251a4cf87ceb2cbc70dc3de304cb99a52863728c3bcfd29c66f3e52"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::extract_call (cyclomatic 16): Walker::extract_call 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a3c3aadd241c116b66e97ce40b3459b88d9f7689f5b2daa5864361f2b97a89"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::find_vue_store_collection_objects (cyclomatic 16): Walker::find_vue_store_collection_objects 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f38b61769e2dac0847f692137e84b349c1a98e3d25aa0f005887281e201b691"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::create_node (cyclomatic 16): Walker::create_node 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefa9f6dac7968d53c6a4b20effcbdcf5ed80dfe852ffbf19edc77a7c9e758e1"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_inline_structs (cyclomatic 16): codegraph_kernel::cfnptr::scan_inline_structs 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbda2440d9ea53e845f5ec745c202fe0cac0c11975a7cdab421f632b16532434"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_file (cyclomatic 16): codegraph_kernel::cfnptr::scan_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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1afe3e43309d67ea9ae0c2f3ad642d1da3df7e7913c87ce58927553c42aee"}},{"ruleId":"D1","level":"warning","message":{"text":"codegraph_kernel::tsjs::fnref::capture (cyclomatic 16): codegraph_kernel::tsjs::fnref::capture 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":"codegraph-kernel/src/tsjs/fnref.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d995ff9ff4f1fdbaa03602f44339ee86370667d3ca1f9455a5d18ed381778222"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractCall (cognitive 688): TreeSitterExtractor.extractCall has cognitive complexity 688 (threshold 15). Drivers by points: if/else 161 (434 pts), ternaries 30 (129 pts), boolean chains 85, loops 11 (40 pts) (nesting depth added 401). Of this number, 675 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f80f3c8c314b64827c18830f9d8e3f482d0d5cb7f2c68590fa223c7473a64c6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchMethodCall (cognitive 622): name-matcher.matchMethodCall has cognitive complexity 622 (threshold 15). Drivers by points: if/else 174 (396 pts), boolean chains 147, ternaries 28 (73 pts), loops 3 (6 pts) (nesting depth added 270). Of this number, 425 points are the body\u0027s own statements and 197 belong to 15 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24215}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bf79aa955179a7cb43921defa0f35e8c083e1dee3c1e6fa0cfa009e2585b70"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleExplore (cognitive 614): ToolHandler.handleExplore has cognitive complexity 614 (threshold 15). Drivers by points: if/else 243 (555 pts), ternaries 84 (204 pts), loops 85 (171 pts), boolean chains 157, error handling 16 (27 pts) (nesting depth added 529). 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 shape REPEATS in the file: 3 other methods here (ToolHandler.handleExplore::prio, ToolHandler.handleExplore::sectionRangesOf, ToolHandler.handleExplore::shrinkCluster) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"79100e7f0d6d22f5bc9aa438e17b5f8b9504bdfe5f7125d67fbbb56132f4acfe"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps (cognitive 505): steps.buildSteps has cognitive complexity 505 (threshold 15). Drivers by points: if/else 71 (304 pts), ternaries 15 (70 pts), boolean chains 68, loops 20 (58 pts), error handling 1 (5 pts) (nesting depth added 330). Of this number, 497 points are the body\u0027s own statements and 8 belong to 7 function literals inside it that branch. 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":"src/ui-server/api/steps.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf4fa9a505d6deb4b0deaf22599c61e4a1e4a50e029cedc866eab9dc7aaf6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges (cognitive 396): c-fnptr-synthesizer.cFnPointerDispatchEdges has cognitive complexity 396 (threshold 15). Drivers by points: if/else 153 (373 pts), loops 58 (126 pts), ternaries 29 (68 pts), boolean chains 50 (nesting depth added 327). To reduce it, split the body into named stages: move each independent 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: 4 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges::parseStructFieldsRaw, c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts, c-fnptr-synthesizer.cFnPointerDispatchEdges::registerStructValue, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"851aecb2c1b323989612d7c74b5758f33ee79c724f39812ff4239c1a3b8bab65"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextBuilder.findRelevantContext (cognitive 394): ContextBuilder.findRelevantContext has cognitive complexity 394 (threshold 15). Drivers by points: if/else 86 (224 pts), loops 48 (109 pts), boolean chains 33, ternaries 11 (24 pts), error handling 3 (4 pts) (nesting depth added 213). Of this number, 364 points are the body\u0027s own statements and 30 belong to 10 function items 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":"src/context/index.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed10f2f118230a4fb021bff7877af319206af307d9992dff9220ac0f6fbf574"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractVariable (cognitive 386): TreeSitterExtractor.extractVariable has cognitive complexity 386 (threshold 15). Drivers by points: if/else 57 (200 pts), ternaries 34 (134 pts), boolean chains 34, loops 6 (18 pts) (nesting depth added 255). Of this number, 367 points are the body\u0027s own statements and 19 belong to 3 function literals inside it that branch. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"d539605aa233bb3cb007de7daa1e15f90a0a056de6c617c24f964a8852ff245e"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractInheritance (cognitive 299): TreeSitterExtractor.extractInheritance has cognitive complexity 299 (threshold 15). Drivers by points: if/else 51 (151 pts), ternaries 16 (67 pts), loops 18 (58 pts), boolean chains 23 (nesting depth added 191). Of this number, 298 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7890}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9b4701aac36fc51536a9a052318049c7b0b7f887ec82ac5d16f0510eae9b40"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGraph.sync (cognitive 218): CodeGraph.sync has cognitive complexity 218 (threshold 15). Drivers by points: if/else 65 (121 pts), boolean chains 33, ternaries 13 (33 pts), loops 8 (23 pts), error handling 6 (8 pts) (nesting depth added 93). None of this is in the body itself: all 218 points belong to 11 function literals inside it that branch (lines 1128, 1227, 1200, \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":"src/index.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1e45c3ccb349a6c2e7c650bcea0ce80920dc0af226c9020e794f671fa8f514"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.rnEventEdges (cognitive 190): callback-synthesizer.rnEventEdges has cognitive complexity 190 (threshold 15). Drivers by points: if/else 32 (118 pts), loops 17 (49 pts), ternaries 3 (12 pts), boolean chains 11 (nesting depth added 127). Of this number, 185 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f1e221ccaa67643752e57f84d4e7d24f4a860f18adf4656d44d484f15ebbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.reactJsxChildEdges (cognitive 188): callback-synthesizer.reactJsxChildEdges has cognitive complexity 188 (threshold 15). Drivers by points: if/else 36 (121 pts), loops 10 (33 pts), boolean chains 18, ternaries 5 (16 pts) (nesting depth added 119). Of this number, 172 points are the body\u0027s own statements and 16 belong to 11 function items inside it that branch. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f122818f88731e467b2bab9a0585a13b2008fe245fea4a3ddf4987a25914be"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.dispatchNode (cognitive 187): TreeSitterExtractor.dispatchNode has cognitive complexity 187 (threshold 15). Drivers by points: if/else 68 (112 pts), boolean chains 32, ternaries 10 (28 pts), loops 5 (15 pts) (nesting depth added 72). Of this number, 177 points are the body\u0027s own statements and 10 belong to 2 function items 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d94646ce4cf71d652058312f0bf71627b8d6a88ee5685a26cf4a57360f3ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolveViaImport (cognitive 179): import-resolver.resolveViaImport has cognitive complexity 179 (threshold 15). Drivers by points: if/else 48 (131 pts), ternaries 9 (24 pts), boolean chains 23, loops 1 (nesting depth added 98). Of this number, 175 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1d2e4559e6dc70c580ea141a62cfdf02bf132d8da97f90f56331f75e6a87b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveOneInner (cognitive 165): ReferenceResolver.resolveOneInner has cognitive complexity 165 (threshold 15). Drivers by points: if/else 71 (97 pts), boolean chains 38, ternaries 17 (29 pts), loops 1 (nesting depth added 38). Of this number, 157 points are the body\u0027s own statements and 8 belong to 4 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":"src/resolution/index.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb812bdf8bd7577bfb74ab4dfe1b53c1865c96822971169112bc716779ed9a25"}},{"ruleId":"D2","level":"warning","message":{"text":"rust-scopes.readRustBindings (cognitive 156): rust-scopes.readRustBindings has cognitive complexity 156 (threshold 15). Drivers by points: if/else 46 (94 pts), boolean chains 26, ternaries 9 (21 pts), loops 10 (15 pts) (nesting depth added 65). Of this number, 117 points are the body\u0027s own statements and 39 belong to 12 function items 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7428319a69600ab085ac74ab8182938df5271fed0de833bcad55cc3cf1915"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchByExactName (cognitive 151): name-matcher.matchByExactName has cognitive complexity 151 (threshold 15). Drivers by points: boolean chains 91, ternaries 20 (43 pts), if/else 12 (17 pts) (nesting depth added 28). Of this number, 95 points are the body\u0027s own statements and 56 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":14329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc65d10ffa21d993333ee6e2afa9c256bcee83f20ddc262f2f30eafe8318a85f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchReferenceInner (cognitive 141): name-matcher.matchReferenceInner has cognitive complexity 141 (threshold 15). Drivers by points: if/else 52 (92 pts), boolean chains 31, ternaries 6 (18 pts) (nesting depth added 52). Of this number, 136 points are the body\u0027s own statements and 5 belong to 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32403}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0c2b379e1cc5c6ece2af36a2f0f8232b76601c1b72015ad24287f95cdab4c"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.interfaceOverrideEdges (cognitive 138): callback-synthesizer.interfaceOverrideEdges has cognitive complexity 138 (threshold 15). Drivers by points: if/else 24 (87 pts), loops 10 (27 pts), boolean chains 14, ternaries 2 (10 pts) (nesting depth added 88). Of this number, 129 points are the body\u0027s own statements and 9 belong to 5 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3379ce968cf057353a0860a04e872f0a2a8ba510d3f6af800d5a317eb496223"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.createContext (cognitive 136): ReferenceResolver.createContext has cognitive complexity 136 (threshold 15). Drivers by points: if/else 49 (85 pts), loops 9 (18 pts), boolean chains 16, ternaries 10 (14 pts), error handling 2 (3 pts) (nesting depth added 50). None of this is in the body itself: all 136 points belong to 27 function literals inside it that branch (lines 923, 1097, 1006, \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":"src/resolution/index.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c7b1bcf38155d8fbb3fa0811f602a3979b3dfd2cbb12595109edb7ef9accab"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::ccpp::brace_scopes::scan (cognitive 131): codegraph_kernel::ccpp::brace_scopes::scan has cognitive complexity 131 (threshold 15). Drivers by points: if/else 37 (95 pts), boolean chains 16, loops 5 (11 pts), match/switch 3 (9 pts) (nesting depth added 70). 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":"codegraph-kernel/src/ccpp/brace_scopes.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed8e7b2056585bb9b40dfbb7696ed90c85052f10fa64fc55373e9cab090fbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-template-calls.scanExpression (cognitive 128): vue-template-calls.scanExpression has cognitive complexity 128 (threshold 15). Drivers by points: if/else 37 (96 pts), boolean chains 21, loops 7 (11 pts) (nesting depth added 63). Of this number, 122 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"da739ff7a7148214b2c321eb8610b411c7c2980e486218c79813ac1230992efc"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-brace-scopes.scanCppBraceScopes (cognitive 127): cpp-brace-scopes.scanCppBraceScopes has cognitive complexity 127 (threshold 15). Drivers by points: if/else 37 (87 pts), boolean chains 21, loops 5 (11 pts), ternaries 3 (8 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d454f027c36eb109af9a41726b5c335cbbf16d88d8ad6450a90e625af48db3"}},{"ruleId":"D2","level":"warning","message":{"text":"react-native.buildRNMaps (cognitive 127): react-native.buildRNMaps has cognitive complexity 127 (threshold 15). Drivers by points: if/else 36 (99 pts), loops 7 (19 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 77). Of this number, 126 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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3ca5c4a2d27bea928d8f67a14dfbafb9446ffc2c0bf20f63aeeebaad68a894"}},{"ruleId":"D2","level":"warning","message":{"text":"react.scanRoutes.unit (cognitive 123): react.scanRoutes.unit has cognitive complexity 123 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 28, ternaries 12 (26 pts), loops 6 (17 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"07032d54b88413878627a1129ad720e6ba31e5dec8d6fd7cbafed967d8d4fa76"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveAndPersistBatched (cognitive 122): ReferenceResolver.resolveAndPersistBatched has cognitive complexity 122 (threshold 15). Drivers by points: if/else 43 (69 pts), ternaries 8 (16 pts), boolean chains 15, loops 7 (13 pts), error handling 5 (9 pts) (nesting depth added 44). Of this number, 93 points are the body\u0027s own statements and 29 belong to 8 function items 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":"src/resolution/index.ts"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe16e416a3eb34dde3af91211f5ad705623500f225c68ed9593672205f77cf85"}},{"ruleId":"D2","level":"warning","message":{"text":"function-ref.normalizeSpecial (cognitive 121): function-ref.normalizeSpecial has cognitive complexity 121 (threshold 15). Drivers by points: if/else 35 (78 pts), ternaries 8 (19 pts), boolean chains 17, loops 3 (6 pts), match/switch 1 (nesting depth added 57). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/function-ref.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"5787960ebc6e6ee3fd7b9b7aa2fe9453db0019a13a3b1ac75731a43e0048fe75"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveMethodOnType (cognitive 119): name-matcher.resolveMethodOnType has cognitive complexity 119 (threshold 15). Drivers by points: if/else 29 (69 pts), ternaries 8 (20 pts), boolean chains 16, loops 4 (14 pts) (nesting depth added 62). Of this number, 65 points are the body\u0027s own statements and 54 belong to 2 function literals inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f576d2efa1a252aa1f7b461429d38be896a0d9d8bf76c8302c1556cb223879a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferCppReceiverType (cognitive 119): name-matcher.inferCppReceiverType has cognitive complexity 119 (threshold 15). Drivers by points: if/else 29 (74 pts), boolean chains 22, ternaries 7 (19 pts), loops 3 (4 pts) (nesting depth added 58). Of this number, 118 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20087}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae7905f91101881e09fb0386cf3730746858d7803c7660fb6987c270015e48c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.sync (cognitive 119): ExtractionOrchestrator.sync has cognitive complexity 119 (threshold 15). Drivers by points: if/else 36 (70 pts), loops 14 (19 pts), ternaries 11 (13 pts), boolean chains 12, error handling 2 (5 pts) (nesting depth added 44). Of this number, 115 points are the body\u0027s own statements and 4 belong to 2 function items 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":"src/extraction/index.ts"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e872b173a75db71363a8ac6a135c356bfea4fc0c4ddceac2f79cb9c206f68"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy.runLocalHandshakeProxy (cognitive 115): proxy.runLocalHandshakeProxy has cognitive complexity 115 (threshold 15). Drivers by points: if/else 48 (63 pts), error handling 16 (23 pts), boolean chains 19, loops 5, ternaries 2 (5 pts) (nesting depth added 25). Most of this is not in the body itself: 2 of the 115 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 432, serveLocally, a function literal at line 554, \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":"src/mcp/proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4b3883842560dd00fb7236558199b9467fb51ccb4e7e871f7024122b0e759"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.indexAll (cognitive 114): ExtractionOrchestrator.indexAll has cognitive complexity 114 (threshold 15). Drivers by points: if/else 57 (111 pts), error handling 6 (17 pts), ternaries 6 (14 pts), boolean chains 12, loops 7 (12 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent 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 (ExtractionOrchestrator.indexAll::storeResult) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8865d0722ab86d3a31979b8ce909ebf84f232261426a176eaa314ba863e3c31"}},{"ruleId":"D2","level":"warning","message":{"text":"ambient-modules.tokenize (cognitive 110): ambient-modules.tokenize has cognitive complexity 110 (threshold 15). Drivers by points: if/else 26 (67 pts), loops 9 (27 pts), boolean chains 16 (nesting depth added 59). Of this number, 97 points are the body\u0027s own statements and 13 belong to one function item 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0acc5d86a220098d9f45e5da4a2c507bcdf463b3f5f70054798df71c509de3"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCStatementMacroCalls (cognitive 109): c-cpp.blankCStatementMacroCalls has cognitive complexity 109 (threshold 15). Drivers by points: if/else 22 (71 pts), loops 8 (26 pts), boolean chains 9, ternaries 2 (3 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5348def215b08d5741852846f6b48c1e2f8f49b3fdd92ecf2afaaa39420974"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractImport (cognitive 109): TreeSitterExtractor.extractImport has cognitive complexity 109 (threshold 15). Drivers by points: if/else 32 (86 pts), boolean chains 9, loops 3 (8 pts), ternaries 2 (6 pts) (nesting depth added 63). Of this number, 97 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"803029c25ba0fb2678f3a820016140a5475d5541b6b692cc1e1c607c955e35c6"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.angularTemplateEdges (cognitive 107): angular-template-synthesizer.angularTemplateEdges has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (55 pts), loops 12 (27 pts), ternaries 5 (13 pts), boolean chains 12 (nesting depth added 56). Of this number, 97 points are the body\u0027s own statements and 10 belong to 4 function items 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e23f0ec258f4dc26592182605540ada26beee6dafb82b64994b7db69c4fee8"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::synthesize_lombok_members (cognitive 107): Walker::synthesize_lombok_members has cognitive complexity 107 (threshold 15). Drivers by points: if/else 43 (87 pts), boolean chains 17, loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ff0fe09f97edab9d9db16ff59abdb5336b4ce1331fc9afbd48eefe7961430a"}},{"ruleId":"D2","level":"warning","message":{"text":"query-paths.extractQueryPaths (cognitive 105): query-paths.extractQueryPaths has cognitive complexity 105 (threshold 15). Drivers by points: if/else 28 (69 pts), boolean chains 16, loops 8 (15 pts), ternaries 3 (5 pts) (nesting depth added 50). Of this number, 100 points are the body\u0027s own statements and 5 belong to one function item 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":"src/search/query-paths.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec4d553acdc533f438f5ebd104843b90dd90c7df2ad668420cf2f1c82db4ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.visitFunctionBody::visitForCallsAndStructure (cognitive 100): TreeSitterExtractor.visitFunctionBody::visitForCallsAndStructure has cognitive complexity 100 (threshold 15). Drivers by points: if/else 46 (72 pts), boolean chains 15, loops 3 (8 pts), ternaries 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46d42c48a0f5dfebcd414676cb126e185f3dde7eefce5b00de754dfc97e621d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 96): Walker::extract_call has cognitive complexity 96 (threshold 15). Drivers by points: if/else 29 (78 pts), loops 3 (11 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"867e2447b9f70515accf1ecc1ec794ea1b06d3ed251760d432523fa90cc977fb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppUnnamedNamespaceSpans (cognitive 95): name-matcher.cppUnnamedNamespaceSpans has cognitive complexity 95 (threshold 15). Drivers by points: if/else 19 (53 pts), loops 5 (18 pts), boolean chains 12, ternaries 3 (12 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c1c2bea4af90e36b6b9a6163424fff99717840c987f72448f3731ee122b3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"steps-model.packRegions (cognitive 95): steps-model.packRegions has cognitive complexity 95 (threshold 15). Drivers by points: loops 26 (41 pts), if/else 11 (28 pts), ternaries 10 (17 pts), boolean chains 9 (nesting depth added 39). Of this number, 29 points are the body\u0027s own statements and 66 belong to 15 function items 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a37b56b8b9cc45f2e5509d984fcb203ada37a344e9211a4d8b8f2d5432d4db3"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 95): Walker::flush_value_refs has cognitive complexity 95 (threshold 15). Drivers by points: if/else 22 (75 pts), loops 7 (15 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"9675075357183225566e41eda66502597f23cda5911543430ff673d53239266b"}},{"ruleId":"D2","level":"warning","message":{"text":"java.synthesizeLombokMembers (cognitive 92): java.synthesizeLombokMembers has cognitive complexity 92 (threshold 15). Drivers by points: ternaries 11 (38 pts), if/else 18 (35 pts), boolean chains 14, loops 3 (5 pts) (nesting depth added 46). Of this number, 90 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/extraction/languages/java.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e17dc692c29ac6d925d714f2eb115971e537522923cb0da47903b6d8655f92"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby.extractScopedRailsRoutes (cognitive 92): ruby.extractScopedRailsRoutes has cognitive complexity 92 (threshold 15). Drivers by points: ternaries 11 (44 pts), if/else 19 (33 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 50). Of this number, 90 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdb6ef359bd08bad5335dc510326fbe2be8631465e11c93724bd36be6e652f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 92): Walker::flush_value_refs has cognitive complexity 92 (threshold 15). Drivers by points: if/else 22 (75 pts), loops 7 (15 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5b35b3e0931d774d2686fb55434ae149b6903b0000636bdb5daed3790c4792"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustValueType (cognitive 88): name-matcher.rustValueType has cognitive complexity 88 (threshold 15). Drivers by points: if/else 28 (51 pts), boolean chains 22, ternaries 7 (14 pts), loops 1 (nesting depth added 30). Of this number, 86 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12366}}}],"partialFingerprints":{"codehealthFindingId/v1":"44933c377b8e214bb540b2f92e29c1e5e7cc2770c7833213c8ccbeb9d2940971"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.buildScreens (cognitive 88): screens.buildScreens has cognitive complexity 88 (threshold 15). Drivers by points: if/else 24 (59 pts), loops 7 (11 pts), ternaries 6 (11 pts), boolean chains 7 (nesting depth added 44). Of this number, 87 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":"src/ui-server/api/screens.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dbaea58b63a0534d954bc7608589b4628800756d887789725b472f72da74a3"}},{"ruleId":"D2","level":"warning","message":{"text":"dead-code.buildDeadCodeReport (cognitive 87): dead-code.buildDeadCodeReport has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (58 pts), loops 8 (12 pts), boolean chains 11, ternaries 4 (6 pts) (nesting depth added 38). Of this number, 78 points are the body\u0027s own statements and 9 belong to 5 function items 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":"src/graph/dead-code.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d10102cbefa6f0d521e2a4e4d8f308d9fb4df1018131adfbd38ed48fbee369"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCTypeKeywordArgs (cognitive 86): c-cpp.blankCTypeKeywordArgs has cognitive complexity 86 (threshold 15). Drivers by points: if/else 16 (51 pts), loops 7 (23 pts), boolean chains 9, ternaries 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68b0cc3c98115b113c64f879268835bfb0c7db4996d1705b8cb5c05e4716bed"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchMemberFunctionRef (cognitive 86): name-matcher.matchMemberFunctionRef has cognitive complexity 86 (threshold 15). Drivers by points: if/else 21 (44 pts), ternaries 10 (22 pts), boolean chains 20 (nesting depth added 35). Of this number, 76 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d749385c8dff7a0fecfb7650df2fe8c28c0654519cd646924617f6373e61e4"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.readFrontend (cognitive 86): tauri-synthesizer.readFrontend has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 22 (36 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 35). Of this number, 70 points are the body\u0027s own statements and 16 belong to 6 function items 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"933f7b37b2dd41012a397c305584711a1e17b8b505e7c7c6bed56682af1d49b1"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.flushValueRefs (cognitive 85): TreeSitterExtractor.flushValueRefs has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 7 (18 pts), boolean chains 11, ternaries 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 47). Of this number, 78 points are the body\u0027s own statements and 7 belong to one function item 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959b7781982108c3dd0fbee4ca324a944d51cc9f2618cc36e66516d794ebf95"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCUnbalancedConditionalBranches (cognitive 84): c-cpp.blankCUnbalancedConditionalBranches has cognitive complexity 84 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 8 (21 pts), boolean chains 16, ternaries 4 (7 pts) (nesting depth added 41). Of this number, 83 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"236a316bbfaf26d488ed7fe4e73a6732a55eea05090ce524365b0e3fba1414f2"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGraph.indexAll (cognitive 84): CodeGraph.indexAll has cognitive complexity 84 (threshold 15). Drivers by points: if/else 36 (49 pts), error handling 10 (18 pts), boolean chains 13, ternaries 2 (4 pts) (nesting depth added 23). None of this is in the body itself: all 84 points belong to one function literal inside it that branches (line 649). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da1eb28c641e0c366049aa082e5e1a86280f6863fe695f76bef2d2bd559c1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-methods.cppCodeScan (cognitive 83): cpp-macro-methods.cppCodeScan has cognitive complexity 83 (threshold 15). Drivers by points: if/else 20 (60 pts), loops 4 (10 pts), boolean chains 9, ternaries 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"8993aef8114ac00df1f922b17ad05b12882f94f36373ee6a977098d5bf66f8bf"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isRustNameInScope (cognitive 83): name-matcher.isRustNameInScope has cognitive complexity 83 (threshold 15). Drivers by points: if/else 30 (55 pts), boolean chains 25, ternaries 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":10807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd8434e1b9cb8aa7a45650bbf18b087a903537f63fd45d52e9819da0539b79a"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goImplementsEdges (cognitive 83): callback-synthesizer.goImplementsEdges has cognitive complexity 83 (threshold 15). Drivers by points: if/else 57 (132 pts), loops 38 (64 pts), boolean chains 14, ternaries 2 (5 pts) (nesting depth added 104). To reduce it, split the body into named stages: move each independent 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: 3 other methods here (callback-synthesizer.goImplementsEdges::methodArities, callback-synthesizer.goImplementsEdges::wantedArities, callback-synthesizer.goImplementsEdges::methodTypes) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b563ee3e58b613c8d2d5181d49a0b11a7b2f3919f8267909261a49f7094e62"}},{"ruleId":"D2","level":"warning","message":{"text":"rust-scopes.readRustScopes (cognitive 82): rust-scopes.readRustScopes has cognitive complexity 82 (threshold 15). Drivers by points: if/else 23 (57 pts), loops 7 (11 pts), boolean chains 8, ternaries 3 (6 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/rust-scopes.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7b6a0a0958d820218be1bf4995612b47dd5043bb56f119ba68c50c9a760839"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.findExportedSymbolWalk (cognitive 81): import-resolver.findExportedSymbolWalk has cognitive complexity 81 (threshold 15). Drivers by points: if/else 26 (52 pts), ternaries 9 (19 pts), boolean chains 8, loops 2 (nesting depth added 36). Of this number, 79 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03d1100ad59158db18f3a48265c630c88dcd781ae99226c45350df8ee5628c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow-model.buildFlowLayout (cognitive 81): flow-model.buildFlowLayout has cognitive complexity 81 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 19 (23 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 34). Of this number, 75 points are the body\u0027s own statements and 6 belong 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":"ui/src/lib/flow-model.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ba8337a02428be35cab5608bcb059725b6dda14175395b890c0ca2a38d8eac"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.readRequestPath (cognitive 80): tier-synthesizer.readRequestPath has cognitive complexity 80 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 7 (29 pts), boolean chains 10, ternaries 2 (nesting depth added 48). 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9126f8b8bc765654be960d36365eeee3f81774d1ca5c8a522f1500fe40978a8"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.attribute (cognitive 80): screens.attribute has cognitive complexity 80 (threshold 15). Drivers by points: if/else 17 (49 pts), loops 9 (21 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/screens.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa27a07b2bd4614eca9f3e81170686a7a6725189d750d71798efae114f95cc50"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 80): Walker::flush_value_refs has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (63 pts), loops 7 (15 pts), boolean chains 2 (nesting depth added 53). 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"79aa2256a1aeff62983b9dbd9885ee7cb23d1fc309b57f2de4acbf96346fa0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 80): Walker::flush_value_refs has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (63 pts), loops 7 (15 pts), boolean chains 2 (nesting depth added 53). 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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"616490072457929a4344fe8af69b17c7e59d47bb11200f1b559d5a576bb5fe2c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.readGoScopes (cognitive 78): name-matcher.readGoScopes has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 12 (23 pts), ternaries 8 (15 pts), boolean chains 11 (nesting depth added 31). Of this number, 72 points are the body\u0027s own statements and 6 belong to 3 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"440f75a37eae878e9af8a425bad090ca293de26ee09ac6c8c5568408a9a91f24"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.erlangBehaviourDispatchEdges (cognitive 78): callback-synthesizer.erlangBehaviourDispatchEdges has cognitive complexity 78 (threshold 15). Drivers by points: if/else 25 (59 pts), loops 8 (12 pts), boolean chains 6, ternaries 1 (nesting depth added 38). Of this number, 69 points are the body\u0027s own statements and 9 belong to 3 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5651f34429cc99663e9b97f7eb70d98e9985f1beca3b341c670477493fb226e"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_variable (cognitive 78): Walker::extract_variable has cognitive complexity 78 (threshold 15). Drivers by points: if/else 25 (60 pts), match/switch 4 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a420b27af9e9724ee0f2dbf643fb28bb89d7d1a2af61584d244018320c23c"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-visibility.walkTranslationUnit::scan (cognitive 77): cpp-macro-visibility.walkTranslationUnit::scan has cognitive complexity 77 (threshold 15). Drivers by points: if/else 19 (40 pts), ternaries 9 (27 pts), boolean chains 9, loops 1 (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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1767251f6cb6955fbff001e50a2b551056fe13b9021645e16d4157b0a1cf2271"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runInstallerWithOptions (cognitive 77): index.runInstallerWithOptions has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (43 pts), ternaries 8 (23 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 34). Of this number, 76 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":"src/installer/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d2163cef3edce118ef58f5224a43016f2232163d4e0fbb9a7b379a4d0ed439"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-template-calls.scanMarkup (cognitive 76): vue-template-calls.scanMarkup has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (44 pts), loops 6 (18 pts), boolean chains 9, ternaries 2 (5 pts) (nesting depth added 42). Of this number, 75 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c5bedf518e39b3230b83f51eb0a0ad95203aafdab738bb76541339998f910"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.laravelEventEdges (cognitive 76): callback-synthesizer.laravelEventEdges has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (45 pts), loops 8 (23 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 45). Of this number, 73 points are the body\u0027s own statements and 3 belong to 4 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f49218e5b8a7c3baed88a8d8a960375123c02ce1efa4b47fdbc09334c94d69"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.parseAngularRoutes::walk (cognitive 75): angular-router.parseAngularRoutes::walk has cognitive complexity 75 (threshold 15). Drivers by points: if/else 15 (36 pts), ternaries 9 (26 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf12113a4ff87034c05a07240c001b9d88c382c103889df5a9b87c9bfdf6f50"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.readRustSide (cognitive 75): tauri-synthesizer.readRustSide has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 13 (22 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 39). Of this number, 74 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64776b5bfc6dde0601777b95907d93be1715a4b0338ccd3011d50b4e61bd40"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchFuzzy (cognitive 74): name-matcher.matchFuzzy has cognitive complexity 74 (threshold 15). Drivers by points: boolean chains 63, ternaries 9 (10 pts), if/else 1 (nesting depth added 1). Of this number, 41 points are the body\u0027s own statements and 33 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":31921}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac025092267f66ebc34eb18de0d40aea7535bf61a1cdba8da7e73509a82db8"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractTypeAlias (cognitive 74): TreeSitterExtractor.extractTypeAlias has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (49 pts), loops 4 (14 pts), boolean chains 8, ternaries 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3784666957786a3294ed7e9f8028a54be4afe8b4975c46043550882864c61a"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.springEventEdges (cognitive 74): callback-synthesizer.springEventEdges has cognitive complexity 74 (threshold 15). Drivers by points: if/else 19 (52 pts), loops 6 (12 pts), boolean chains 10 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"730831bf90e0a23049c863b37dd9bbcfe0064b42d846515947a604f0a9af07e6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppExpressionType (cognitive 72): name-matcher.cppExpressionType has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (36 pts), ternaries 11 (19 pts), boolean chains 15, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":17592}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec59b4d614a3d39181a5aa5ff00ee3449f6c5578162346793e0233b64a8ccf8"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.templateMemberUses (cognitive 72): angular-template-synthesizer.templateMemberUses has cognitive complexity 72 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 16 (31 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 38). Of this number, 70 points are the body\u0027s own statements and 2 belong 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3379fbfe66b138ae7b55296a9eec5b9f99b44f2ed474a2e19ac7c307209643c9"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.statementsShape (cognitive 71): pascal-preparse.statementsShape has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 21, ternaries 2 (4 pts), loops 1 (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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0743e8de3742cd6c77af582a13615b5c20798375e604c5b77552a7caea9578b8"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-packages.collectPathDeps (cognitive 71): workspace-packages.collectPathDeps has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (51 pts), loops 4 (10 pts), boolean chains 4, ternaries 1 (4 pts), error handling 1 (2 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/workspace-packages.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9729afc3940a7a6a51f6e2a22f60e2998230cc3050d0b614579ebd11cb6cfc9e"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.preParsePascal (cognitive 70): pascal-preparse.preParsePascal has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (45 pts), boolean chains 11, ternaries 3 (8 pts), loops 3 (6 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"6408de3bbc9a3970803e91012e0d0b1791fc5810e50089a0a3727b05cfee85dc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runUninstaller (cognitive 70): index.runUninstaller has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (42 pts), loops 5 (14 pts), ternaries 4 (10 pts), boolean chains 4 (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":"src/installer/index.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f28f4867629909640edddc4bd20ff4c1eb2fd9c4cb01b6aae777527daecfa57"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.mediatrDispatchEdges (cognitive 69): callback-synthesizer.mediatrDispatchEdges has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (51 pts), loops 7 (12 pts), boolean chains 6 (nesting depth added 34). Of this number, 64 points are the body\u0027s own statements and 5 belong to 3 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"472a48d1ba9960ec9d97a80641f72f0197fba3bf8d22042829b051e9d367133c"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.triggerInTree (cognitive 69): branch-guards.triggerInTree has cognitive complexity 69 (threshold 15). Drivers by points: if/else 11 (29 pts), ternaries 7 (24 pts), boolean chains 11, loops 2 (5 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"3403ffc6e7397c8eefc4c517521b14b2350f820df628ae40704a4a3cedb195d5"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustTypedMethodCall (cognitive 68): name-matcher.rustTypedMethodCall has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 14, ternaries 7 (13 pts), loops 2 (nesting depth added 19). Of this number, 63 points are the body\u0027s own statements and 5 belong to 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13343}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1936150c07b4a2b157f54f2fcf1241594108defa4c1ff6e79d49abd11300b"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.declaredPythonRoots (cognitive 68): import-resolver.declaredPythonRoots has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 5 (19 pts), boolean chains 1 (nesting depth added 44). Of this number, 66 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"60162bb5c5c013b3a142594307dc1612852451493a131d57383fbb3ad69a5482"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.vueTemplateEdges (cognitive 67): callback-synthesizer.vueTemplateEdges has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 7 (13 pts), boolean chains 8, ternaries 2 (6 pts) (nesting depth added 34). Of this number, 57 points are the body\u0027s own statements and 10 belong to 4 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"e152ae94124f4cc62152a61762ab08d6853bc708cb8843b09296802b2f109bab"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.nixOptionPathEdges (cognitive 67): callback-synthesizer.nixOptionPathEdges has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 7 (12 pts), ternaries 3 (9 pts), boolean chains 8 (nesting depth added 33). Of this number, 62 points are the body\u0027s own statements and 5 belong to 2 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4875}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9506767aff5d62c2dd97681a90461fb9d3ec5df9bb7ef5c0431b2126bde3b18"}},{"ruleId":"D2","level":"warning","message":{"text":"named-symbol-flow.walkBidirectional (cognitive 67): named-symbol-flow.walkBidirectional has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 9 (21 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 38). Of this number, 64 points are the body\u0027s own statements and 3 belong to one function item 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe2d6871156bbc9a4b90a1518eda02e00982bfc3bb8855134f904356e24b4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"function-ref.goLocalBindings (cognitive 66): function-ref.goLocalBindings has cognitive complexity 66 (threshold 15). Drivers by points: loops 11 (34 pts), if/else 8 (27 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 44). Of this number, 56 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. 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":"src/extraction/function-ref.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd705a1a9514e37c2252685a6a21d2625db00f61ba85fd22dacf78d2ab01a247"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripGo (cognitive 66): strip-comments.stripGo has cognitive complexity 66 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 6 (16 pts), boolean chains 12 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/strip-comments.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ebdd9c2fab368fc438cbc480957c16fc3e30f9ccd639c8223e9e20f077524"}},{"ruleId":"D2","level":"warning","message":{"text":"JsxLexer.code (cognitive 66): JsxLexer.code has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 19, loops 3 (6 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":"src/resolution/jsx-code.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9856afdd27c8f31da05af33c965f819f3088ca770ed23e9fc5b2048806fae0b3"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.arkuiEmitterEdges (cognitive 66): callback-synthesizer.arkuiEmitterEdges has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (45 pts), loops 6 (10 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 33). Of this number, 59 points are the body\u0027s own statements and 7 belong to 4 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84d0ea9be7a609cdc088a5c7ce5bb28b5d17870a9d19c729fa277673b5f4041"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractField (cognitive 65): TreeSitterExtractor.extractField has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (30 pts), ternaries 7 (23 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 36). Of this number, 63 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3066b141c51f4fa8ac276ec82e95742f45f6a60d4aa91d5bbe89d67709e182"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.closureCollectionEdges (cognitive 65): callback-synthesizer.closureCollectionEdges has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 7 (16 pts), boolean chains 7 (nesting depth added 35). Of this number, 62 points are the body\u0027s own statements and 3 belong to one function item 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"52817bf379b7ec22c05d976d44cf6ed1acdbee4b19dad8b7510ef50388bd9dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleFileView (cognitive 65): ToolHandler.handleFileView has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (31 pts), ternaries 11 (20 pts), boolean chains 10, error handling 1 (2 pts), loops 2 (nesting depth added 19). Of this number, 53 points are the body\u0027s own statements and 12 belong to 3 function items 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":"src/mcp/tools.ts"},"region":{"startLine":8256}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cb0abcf23cd8f5df15bd70e50942c872cbd4aea5247aba2bdfab7931baa91a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cognitive 65): Walker::visit_for_calls_and_structure has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (51 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"f758978c8e08ebe3d62085af02c21a6f66c66ec94e91a3453a3a033ce5df65be"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::go::go_local_bindings (cognitive 65): codegraph_kernel::go::go_local_bindings has cognitive complexity 65 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 8 (23 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bb97449847e82bc341ebb868b69253509db93278cde6f936d22a030ed3ed1e"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-raw-strings.cppNonCodeLines (cognitive 64): cpp-raw-strings.cppNonCodeLines has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 6 (25 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 34). Of this number, 49 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. 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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68e2c9ad340d1b44a9c0661c4c475ae111d351eb466dd19bd16e769a9df2293"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.isBuiltInOrExternal (cognitive 64): ReferenceResolver.isBuiltInOrExternal has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 20, ternaries 1 (2 pts) (nesting depth added 21). Of this number, 60 points are the body\u0027s own statements and 4 belong to 2 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":"src/resolution/index.ts"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"796386e113705cada5b72169e57430ff51e1a5445d92bf545dfb86f86d96fea2"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildFlowFromNamedSymbols (cognitive 64): ToolHandler.buildFlowFromNamedSymbols has cognitive complexity 64 (threshold 15). Drivers by points: if/else 28 (54 pts), ternaries 13 (28 pts), loops 9 (15 pts), boolean chains 11, error handling 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ToolHandler.buildFlowFromNamedSymbols::collectSynthLinks) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaadce798499e6ec2d9137930ac0b5df7e88fef01bce201db7f6721ae8adfa5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 64): Walker::extract_call has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (59 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1756070c6be19e11da5e617cdd07ecc35cf45a2d9c9da0fb77510f23e0165ed"}},{"ruleId":"D2","level":"warning","message":{"text":"react-router-synthesizer.reactRouterLinkEdges (cognitive 63): react-router-synthesizer.reactRouterLinkEdges has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (42 pts), ternaries 3 (11 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe2b58e940416052f46c945c077042d5a9486ebf157f6f538403d3bd6c0e733"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 63): Walker::visit_node has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (39 pts), loops 3 (9 pts), match/switch 3 (8 pts), boolean chains 7 (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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27d4df77081971fc385d33c510fc57ae7ce6d474b952654085beebff2d44b0"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripRuby (cognitive 62): strip-comments.stripRuby has cognitive complexity 62 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 6 (21 pts), boolean chains 11 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/strip-comments.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff94e71e259a1993116fae58cdbdbc36e97190be81ec106751fba0b928c5ded"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppForBodyEncloses (cognitive 62): name-matcher.cppForBodyEncloses has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (44 pts), boolean chains 13, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":17813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c72d89aa62be11602cfdb9b839d0fc804c1762f331ffb6b8bd91325b90c3056"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goReceiverChainType (cognitive 62): name-matcher.goReceiverChainType has cognitive complexity 62 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 15, ternaries 4 (10 pts), loops 1 (nesting depth added 18). Of this number, 61 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26971}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0bb49dcc37850b9d5342b61d7e2025e2ab9b41c8dc48371a1c8d845ac3e575"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.visitPascalNode (cognitive 62): TreeSitterExtractor.visitPascalNode has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 6 (12 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":8754}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab272675d7a4a117d37015fb9aee8f783e45c911d737bdc314c7b3cc5851ee"}},{"ruleId":"D2","level":"warning","message":{"text":"map-model.buildMapLayout (cognitive 62): map-model.buildMapLayout has cognitive complexity 62 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 16 (20 pts), ternaries 6 (11 pts), boolean chains 10 (nesting depth added 20). Of this number, 42 points are the body\u0027s own statements and 20 belong to 5 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":"ui/src/lib/map-model.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b891f84243582d6f5fe16ca79e71b36237381b33ef869e21bb746d7fca74a8"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonStatementBindsAt (cognitive 61): name-matcher.pythonStatementBindsAt has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 17, loops 9 (11 pts) (nesting depth added 18). Of this number, 60 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":"src/resolution/name-matcher.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"374904528756ecfbca69a801c22ffac69dabb1163706bc39de11fcb948a5752f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferLocalReceiverType (cognitive 61): name-matcher.inferLocalReceiverType has cognitive complexity 61 (threshold 15). Drivers by points: if/else 34 (76 pts), ternaries 12 (20 pts), boolean chains 12, loops 6 (12 pts) (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (name-matcher.inferLocalReceiverType::matchLine, name-matcher.inferLocalReceiverType::scan) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":23313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a886b4d0b6c9be117f67606f4644d8f9d6c40cd7335e13c35619ad4c811f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"next-router-synthesizer.nextLinkEdges (cognitive 61): next-router-synthesizer.nextLinkEdges has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (42 pts), ternaries 2 (9 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"07337640eb60f8a80fce7d24388945554685b53e7b756fb8d8e870e34c20237b"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.fieldChannelEdges (cognitive 61): callback-synthesizer.fieldChannelEdges has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (47 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 33). Of this number, 59 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba290b932e93bea7630462327e19e9f9240710a4e9947be88ff856602b80ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveDeferredThisMemberRefs (cognitive 61): ReferenceResolver.resolveDeferredThisMemberRefs has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 5 (12 pts), boolean chains 8 (nesting depth added 32). Of this number, 47 points are the body\u0027s own statements and 14 belong to 3 function items 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":"src/resolution/index.ts"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2c3f481faa616e02754bf5b9a9a9d707481ea5841e92dc637e22fec770cd3f"}},{"ruleId":"D2","level":"warning","message":{"text":"rust-scopes.blankRustCode (cognitive 60): rust-scopes.blankRustCode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 11, loops 4 (11 pts), ternaries 3 (9 pts) (nesting depth added 28). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3b65e39d96248627b22b69915125f859f56642cf5cb00519605ff05c6c043a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustCrateGraph (cognitive 60): name-matcher.rustCrateGraph has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 10 (21 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 29). Of this number, 50 points are the body\u0027s own statements and 10 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9630}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e058b3289ad8f68b0d518350b3bf13c87ec83949caa2337f5dc1d15e27e6e85"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.cppStackConstructions (cognitive 60): TreeSitterExtractor.cppStackConstructions has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 11, ternaries 2 (9 pts), loops 3 (7 pts) (nesting depth added 29). Of this number, 36 points are the body\u0027s own statements and 24 belong to one function item 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3416687c38a1919cf085bbd246069d5c9ca0c20340be611ba26324fd62e084"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.objectRegistryEdges (cognitive 60): callback-synthesizer.objectRegistryEdges has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 5 (10 pts), ternaries 2 (5 pts), boolean chains 4 (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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"9478e01897b9772364293f0cc31d19c19ee02d386debe2e8adcaf75793bb0b66"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 60): Walker::flush_value_refs has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 7 (15 pts), boolean chains 2, match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ec8a8d46a11994fa92119288a68a016c174bf067187a45fb0b0c1f3875d9d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 60): Walker::extract_call has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 3 (18 pts), boolean chains 1 (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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"989bbd821045cf2c688cccdfdfa00c903165d96521879c77b6f6f95acc683437"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 60): Walker::flush_value_refs has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 7 (15 pts), boolean chains 2, match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d42be4bc6256bd0a3d20780582aa43a90b896b569bedda32b5dd23de8b7567"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonLineBindings (cognitive 59): name-matcher.pythonLineBindings has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 6 (16 pts), boolean chains 6, loops 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18bf3d701aa68aebb933b975b0f14c343430ffc8f5e1ad25e465a25d62c340d"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.readBindings (cognitive 59): tauri-synthesizer.readBindings has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 13, loops 6 (8 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8256443434ac2ff67f3546e477a8cff4aa66cbfd5dba6ae3b5579b3a5b816f18"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.blankDartLiterals (cognitive 58): dart-local-scope.blankDartLiterals has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 15, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 23). Of this number, 53 points are the body\u0027s own statements and 5 belong to one function item 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad5c0746d53b0368f860a4477b95152d9a6074444c7c63a2b5d723092dbdacb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveAwaitedCallType (cognitive 58): name-matcher.resolveAwaitedCallType has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 14, loops 5 (6 pts), ternaries 4 (5 pts) (nesting depth added 11). Of this number, 45 points are the body\u0027s own statements and 13 belong to 6 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aabd6dc66243faaadf8f35f7813041d347f92b7204346798fb771b7a881e70"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonAttrStatementsUncached (cognitive 58): name-matcher.pythonAttrStatementsUncached has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 15, ternaries 4 (10 pts), loops 2 (4 pts) (nesting depth added 23). Of this number, 57 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28098}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a23c230331282a4628b27bf81f7b52ac323c5fd5b37ad61e87a65b2474f7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-constant-paths.matchRubyConstantPathRef (cognitive 58): ruby-constant-paths.matchRubyConstantPathRef has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 13 (39 pts), if/else 9 (16 pts), boolean chains 3 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7962330f47824daa9414be1bea1f51b353b28d0e7c20e6fd0089608fced43b63"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::dispatch_node (cognitive 58): Walker::dispatch_node has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (40 pts), boolean chains 8, loops 3 (8 pts), match/switch 1 (2 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9cb2965b3e2380212cf1ec319e62bbe8f514a23f5c824ebf4927b65e5d71cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 58): Walker::flush_value_refs has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b619da9801b7b2d224db4afe5c32fca5abee2cba3891bb2c95b90efc334e4ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripRust (cognitive 57): strip-comments.stripRust has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 5 (13 pts), boolean chains 12 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/strip-comments.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a56f8c17baddfb89049f8b0bcb8c0c59c996ac5751b4447b64cb450bcde08e2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchFunctionRef (cognitive 57): name-matcher.matchFunctionRef has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 24, if/else 14 (19 pts), ternaries 7 (14 pts) (nesting depth added 12). Of this number, 45 points are the body\u0027s own statements and 12 belong to 7 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed13e6949159ffc5118ad9c3196094cb38b046016d4d90ca2798b0b89b75591"}},{"ruleId":"D2","level":"warning","message":{"text":"java.extractSpringConfig (cognitive 57): java.extractSpringConfig has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 5 (10 pts), boolean chains 8, ternaries 1 (nesting depth added 28). Of this number, 26 points are the body\u0027s own statements and 31 belong to 3 function items 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"406eabae65b75a30bd9f7dde53e67ca617466cf302cfd4d996f8a417c733b8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-router-synthesizer.vueRouterLinkEdges (cognitive 57): vue-router-synthesizer.vueRouterLinkEdges has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (31 pts), ternaries 4 (14 pts), boolean chains 6, loops 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vue-router-synthesizer.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd5b5b213b39c3371ef30d5f79db47fe8946581e023882f287a28b9611eb8ef"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.eventEmitterEdges (cognitive 56): callback-synthesizer.eventEmitterEdges has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 6 (13 pts), boolean chains 7 (nesting depth added 30). Of this number, 54 points are the body\u0027s own statements and 2 belong 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0732a0e634187a9883169ecc2c6257ac9ace6c8c260ef273c08b35be2ed6748"}},{"ruleId":"D2","level":"warning","message":{"text":"type-hierarchy.walkDescendants (cognitive 56): type-hierarchy.walkDescendants has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 6 (12 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/type-hierarchy.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3be1801ef513ace874219f4eada3cb0e83427da91151400217fa1ea25f19af5"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleNode (cognitive 56): ToolHandler.handleNode has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 12, ternaries 6, loops 3 (5 pts) (nesting depth added 16). Of this number, 50 points are the body\u0027s own statements and 6 belong to 3 function items 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":"src/mcp/tools.ts"},"region":{"startLine":8069}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e5f5f663e052bdc802f70088f302b4347d6c0c12f734d0f3bfa5a001ff85c0"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.flattenMidStatementConditionals (cognitive 55): c-cpp.flattenMidStatementConditionals has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (48 pts), boolean chains 5, loops 1, ternaries 1 (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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d53c0a1f9036e6c81b39fe45aa2c1d5395ec2fdc2fa954eaa1f61e921091dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"react.scanRoutes.jsx (cognitive 55): react.scanRoutes.jsx has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (nesting depth added 19). Of this number, 45 points are the body\u0027s own statements and 10 belong to one function item 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9371c990b53f759cb9e524b76f194851c0cd20729edcf48efc9ab0be0e79672d"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-sitter.extractNameRaw (cognitive 55): tree-sitter.extractNameRaw has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 9, loops 4 (9 pts), ternaries 2 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8381d7986d33f3b50396d199c21c34f3b0e734f3107edcc453c8f3bfb8ef78cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.readBindings (cognitive 55): ruby-parameter-flow.readBindings has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 7 (17 pts), ternaries 3 (9 pts), boolean chains 3 (nesting depth added 31). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"300be6d48c4b5c72e90a4afb8e3fa5a25236b833ea8d6a5952aa4eff0461285e"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.blankStringContents (cognitive 54): strip-comments.blankStringContents has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (38 pts), boolean chains 9, loops 3 (7 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":"src/resolution/strip-comments.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2709662e021b77097e1a1837d9cda5f18a36b032d660931ecfe8d0f0cfe0a02"}},{"ruleId":"D2","level":"warning","message":{"text":"named-symbol-flow.resolveNamedTokens (cognitive 54): named-symbol-flow.resolveNamedTokens has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 5 (9 pts), ternaries 4 (8 pts), boolean chains 6 (nesting depth added 29). Of this number, 49 points are the body\u0027s own statements and 5 belong 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e76ce6e93903a5a2429f00c2fe4cacf5ef0936f64440e2cf7c553cf19f266c"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 54): Walker::flush_value_refs has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"546a32c6173469e941ca8dd4e064399389c70b037f88cbad970249dffc6919e0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.readDartChain (cognitive 53): name-matcher.readDartChain has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 28). Of this number, 51 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"576dc3ac0900b978dd5da1bd89e9fcac91a8145482f895123ac86cd55a50d02b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.objcFileMembers (cognitive 53): name-matcher.objcFileMembers has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 8, loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":8486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f619c9d9c48d6d776b1a25622d13f625be6ee483a5dbc32e50251cb79092ff94"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustItemOf (cognitive 53): name-matcher.rustItemOf has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 9 (20 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 19). Of this number, 51 points are the body\u0027s own statements and 2 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12835}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a65fbfed3e95ccd8509439243e92ba169dfe3f44d192da44d93eb99edbddfa9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppLocalBindings (cognitive 53): name-matcher.cppLocalBindings has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 6 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 27). Of this number, 48 points are the body\u0027s own statements and 5 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19798}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c06678a0b76f2b6e6212ff74ca1b071a5b0ff6141ff64c78ce23c75343a5318"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 53): Walker::flush_value_refs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25f7b89ec57178fe8969b2164a5d595809c803b4671baa891ab01e96e861b06"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 53): Walker::flush_value_refs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 6 (10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda283d2a63995203763a6b6923da3d41cc94be38bf032f82de3500012c50fec"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 53): Walker::flush_value_refs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c396d6e385f838d161156d87a0c40df56cc1c71b294c6604947eb0aba9d3c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_class_members (cognitive 53): Walker::extract_class_members has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 2 (6 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"185617bd42a16f1bf2fa7d075773eb1d1e7a3e766c93dcf1eded1a6ba3799a29"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 53): Walker::flush_value_refs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee240d289a34750a7067a50bee631136812d773e7969bda9cb694f1a91abbcec"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.blankDartCode (cognitive 52): name-matcher.blankDartCode has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 14, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 17). Of this number, 47 points are the body\u0027s own statements and 5 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b049365abb8024b6ff118791ffa9db0ee7095685a93c1e58f25a42a55d26bb22"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goGrpcStubImplEdges (cognitive 52): callback-synthesizer.goGrpcStubImplEdges has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (39 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 33). Of this number, 50 points are the body\u0027s own statements and 2 belong to 2 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18d5fa6371ee18db390fe1a930bcb51ad6501706c2b12354cccd33012caf12a"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.execute (cognitive 52): ToolHandler.execute has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 9, error handling 2 (3 pts), ternaries 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":"src/mcp/tools.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67bc0589831aeab4a2ddb2399d37b24d64422e156b97eb997096f1910a5d8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 52): Walker::extract_inheritance has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 7 (22 pts), match/switch 1 (4 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e9dbdf8a5576205e5aff434bcc9fc54397ace6c0e790705cb053b885e3011c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppDataMemberIn (cognitive 51): name-matcher.cppDataMemberIn has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 4 (13 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":17237}}}],"partialFingerprints":{"codehealthFindingId/v1":"153aa4d95997580f0ec4123e9b360ff932eb04a7aad250cdf6c19dcba1019565"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolvePythonModuleMember (cognitive 51): import-resolver.resolvePythonModuleMember has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 6 (13 pts), boolean chains 10, loops 2 (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":"src/resolution/import-resolver.ts"},"region":{"startLine":3698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc31ea255b8c81a6d345b4e63b0a58d28e2fc9520ccea3a4ce26a847ad8122"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractStaticMemberRef (cognitive 51): TreeSitterExtractor.extractStaticMemberRef has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 8, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":6813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffec5c13b72fc34b5e3ba1f33728e78ca53db83a677befab1ca5b1f4184fc2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.passedOn (cognitive 51): module-importers.passedOn has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 5 (13 pts), boolean chains 6, ternaries 1 (4 pts) (nesting depth added 28). Of this number, 48 points are the body\u0027s own statements and 3 belong to 3 function items 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":"src/resolution/module-importers.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf3f9c3c095eeecaa104508c49b98eeb897184a1f2db119ac6759a3608a6eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_type_alias (cognitive 51): Walker::extract_type_alias has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 3 (8 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b1c01b266b54e2d45b091a7940a5efd62a21583d20e417573808551bf310b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 51): Walker::extract_call has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 1 (5 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f3ee40ecc81cd82c970850718fbfe8797bc0b8e7521d74de675ffae087f495"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractDecoratorsFor (cognitive 50): TreeSitterExtractor.extractDecoratorsFor has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (55 pts), loops 6 (12 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TreeSitterExtractor.extractDecoratorsFor::consider) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edf5f533fd917863cf87643becaab3372ebe6a1301a238d0510329153058a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"const-alias-synthesizer.readTopLevel (cognitive 50): const-alias-synthesizer.readTopLevel has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 8, loops 1 (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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4dc4969a8ad77403152872809d548be9c774d3123a9f65ec7554f15e4a033d"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.memberTypesInTree (cognitive 50): branch-guards.memberTypesInTree has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 6 (12 pts), ternaries 3 (10 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (branch-guards.memberTypesInTree::visitParams) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55dbde935f9dfa3f49e722225bbc24616748e5321e7f4f8c6fa391b1477f97d"}},{"ruleId":"D2","level":"warning","message":{"text":"screens-model.entryLayering.\u003Creturned closure\u003E (cognitive 50): screens-model.entryLayering.\u003Creturned closure\u003E has cognitive complexity 50 (threshold 15). Drivers by points: loops 14 (25 pts), if/else 9 (17 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 21). Of this number, 38 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc061feceb501c8864eba6c8d97a42fe199b4cbd232da805fb51e73aa5a4522"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::callee_name (cognitive 50): Walker::callee_name has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (50 pts) (nesting depth added 37). 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3ef2cf86515d23766c4bffdb04b4443bf2d6a8d9840be6d3c596fcd23adfc4"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.templateLiteralTextAt (cognitive 49): strip-comments.templateLiteralTextAt has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 12, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/strip-comments.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f84ec3707a108c6ea5b189126594326a42c978b37e84f9aee0cb7475cdba4d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isJavaTypeVisible (cognitive 49): name-matcher.isJavaTypeVisible has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 21, ternaries 3, loops 1 (nesting depth added 5). Of this number, 42 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c0aa7cf4fb848ab59d0f9abff70d1321aa6050645e35ef08d054bc96958323"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isVisibleAcrossFiles (cognitive 49): name-matcher.isVisibleAcrossFiles has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 21 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":4192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b51d0e6842ecae4a8d8d665c62148c27b521c5141797e4aa9d383149cf0d2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustReadType (cognitive 49): name-matcher.rustReadType has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (31 pts), ternaries 4 (9 pts), boolean chains 8, loops 1 (nesting depth added 18). Of this number, 47 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12263}}}],"partialFingerprints":{"codehealthFindingId/v1":"43558a2115e7b6a796017422ae11a605d04e6999e0065bdbb4b3cd7debea2b60"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaLambdaParameterType (cognitive 49): name-matcher.javaLambdaParameterType has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 7, ternaries 3 (7 pts), loops 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":14710}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebc94e538463020a6aeee1aa1f022b39382c93c34e6efc8445415d926d43f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppDeclaratorsAfterFirst (cognitive 49): name-matcher.cppDeclaratorsAfterFirst has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 11, loops 5 (8 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16780}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a83df1c173aa08fec17055c4d26e5f463cc5ab4d3f4a3a8903d15dad2163756"}},{"ruleId":"D2","level":"warning","message":{"text":"java.annotatedMethodName (cognitive 49): java.annotatedMethodName has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (nesting depth added 22). Of this number, 40 points are the body\u0027s own statements and 9 belong to one function item 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a81235e77faaca799a409683dc998b801d7772eeb1d6c121dd1ba35960011f"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphTraverser.getImpactRecursive (cognitive 49): GraphTraverser.getImpactRecursive has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 2 (5 pts), boolean chains 3 (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":"src/graph/traversal.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"da06cd3bf2d6bb884e8687fc16e416e6032fcdb08442ab45ec4184d8384bc902"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-options-api.objectMembers (cognitive 48): vue-options-api.objectMembers has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (32 pts), ternaries 2 (7 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/vue-options-api.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a2aa5458a79f73342c9180167b1e09ec6a5048c033254524de15e20740a0d2"}},{"ruleId":"D2","level":"warning","message":{"text":"decode.decodeExtractBuffers (cognitive 48): decode.decodeExtractBuffers has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (37 pts), ternaries 4 (8 pts), loops 3 (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":"src/extraction/kernel/decode.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c17f695e864b4d3e39aced6708bf82ca0595461d1fb018b6374dd0667cd3033"}},{"ruleId":"D2","level":"warning","message":{"text":"dead-code.byNameHookCandidates (cognitive 48): dead-code.byNameHookCandidates has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 10 (14 pts), boolean chains 5 (nesting depth added 17). Of this number, 44 points are the body\u0027s own statements and 4 belong to 4 function items 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":"src/graph/dead-code.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"368d8e86c7f79befebe20fc5905d3fd05f2818f2ffd765dfad0cb1c8637d4c23"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::init_body (cognitive 48): codegraph_kernel::cfnptr::init_body has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 3 (6 pts), match/switch 1 (5 pts), boolean chains 1 (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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c51e8b6a5eb410904c14381aada5a543e827cad70f419b8c8e76fd1c5de706"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.holdsBody (cognitive 47): pascal-preparse.holdsBody has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 8, ternaries 1 (3 pts), loops 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca7bfcc4cc56f668da2b40ee6fe3e8e608263ff5ae36a2c20f8672631441ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustTypeLookup (cognitive 47): name-matcher.rustTypeLookup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 13, ternaries 1 (2 pts) (nesting depth added 12). Of this number, 46 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab53e6a2fc1582dea72334f5e307d8e634a22b0de8dbf2bf854f252e2c3745e"}},{"ruleId":"D2","level":"warning","message":{"text":"tanstack-router-synthesizer.tanstackLinkEdges (cognitive 47): tanstack-router-synthesizer.tanstackLinkEdges has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tanstack-router-synthesizer.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a5b713d2cbf1e69f64891b9506b2e088097de2050171ff49c0c3058cf63598"}},{"ruleId":"D2","level":"warning","message":{"text":"explore-diagnostics.renderTable (cognitive 47): explore-diagnostics.renderTable has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 4 (14 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 21). Of this number, 38 points are the body\u0027s own statements and 9 belong to 4 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":"src/mcp/explore-diagnostics.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be6481ee3cf466168da7be76dd220f90de4fc2266a482c0871672e1dfd58e67"}},{"ruleId":"D2","level":"warning","message":{"text":"program-model.orderGraph::flow (cognitive 47): program-model.orderGraph::flow has cognitive complexity 47 (threshold 15). Drivers by points: loops 6 (20 pts), if/else 7 (17 pts), ternaries 2 (7 pts), boolean chains 3 (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":"ui/src/lib/program-model.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad9d9c4298555bb79f71b1586fb29acd0427cd6207dfe1874d63627b780ebd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::hook_binary_operator (cognitive 47): Walker::hook_binary_operator has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), boolean chains 4, match/switch 1 (nesting depth added 25). 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":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e03aad64aeeac6f77868a87ca038480dbc1e5d9f5bd3520723395240b7da3a"}},{"ruleId":"D2","level":"warning","message":{"text":"function-ref.captureFnRefCandidates (cognitive 46): function-ref.captureFnRefCandidates has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 7, ternaries 3 (7 pts), loops 3 (5 pts), match/switch 1 (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":"src/extraction/function-ref.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b445f0f72ef1fcbf8c455c7412711b504205ea35a3959a147aa0ca7d7498ba0f"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-supertypes.lookUpCppClass (cognitive 46): cpp-supertypes.lookUpCppClass has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 8, ternaries 5 (6 pts), loops 2 (4 pts) (nesting depth added 16). Of this number, 41 points are the body\u0027s own statements and 5 belong to 4 function items 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"055c9b98bbf06d672055e12ad580957f06eea6900d5a2a28162180a947d8c74f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonExternalWrites (cognitive 46): name-matcher.pythonExternalWrites has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 5 (13 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 25). None of this is in the body itself: all 46 points belong to one function literal inside it that branches (line 1266). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872311822a2645455d51cf64a4eba7778c7b7b366d98795ccfda8d13b75fe93"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalParenlessName (cognitive 46): TreeSitterExtractor.extractPascalParenlessName has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 12, ternaries 2 (nesting depth added 8). 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9603}}}],"partialFingerprints":{"codehealthFindingId/v1":"7289512964e137fcdacf98ea77607c636e2d1ddab670e0ada5f4300283e636ab"}},{"ruleId":"D2","level":"warning","message":{"text":"index.scanDirectoryWalk::walk (cognitive 46): index.scanDirectoryWalk::walk has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (37 pts), error handling 3 (5 pts), ternaries 2, boolean chains 1, loops 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":"src/extraction/index.ts"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3031730ffa6a553909e6762300706caeb40601ec61e98ad1038a694007514c"}},{"ruleId":"D2","level":"warning","message":{"text":"sveltekit-synthesizer.svelteKitLinkEdges (cognitive 46): sveltekit-synthesizer.svelteKitLinkEdges has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 3 (6 pts), boolean chains 4 (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":"src/resolution/sveltekit-synthesizer.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8cd127ed82658fc160b60e377b64fa851a6861637b5ef57e4fcb5ec5bef1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.ginMiddlewareChainEdges (cognitive 46): callback-synthesizer.ginMiddlewareChainEdges has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 6 (10 pts), boolean chains 8 (nesting depth added 20). Of this number, 44 points are the body\u0027s own statements and 2 belong 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"130cee8072e5461b212bc637a35ef99f6860a1744c4e9fd11033fcd570a59012"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripPhp (cognitive 45): strip-comments.stripPhp has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (13 pts), boolean chains 10 (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":"src/resolution/strip-comments.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fa14a0e9ff2e0c3c9bcd257b8a30e8de77a79ddd50b4534a3bc55330e01cce"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isUnexportedModuleBinding (cognitive 45): name-matcher.isUnexportedModuleBinding has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (17 pts), boolean chains 5, ternaries 1 (5 pts) (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":"src/resolution/name-matcher.ts"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"826d4d91f2585063f2ed163da4e9c11a36e21b34d6244f725b1876dbc46f94d6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goExprType (cognitive 45): name-matcher.goExprType has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 7, ternaries 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27206}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a04b0da11b7deff3063e10c0b3805d69585e267d7cfb01a8cb70bc87ed995a"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.buildPythonModuleIndex (cognitive 45): import-resolver.buildPythonModuleIndex has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 9 (13 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 16). Of this number, 37 points are the body\u0027s own statements and 8 belong to 2 function items 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":"src/resolution/import-resolver.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe96d0e65051ba51c70be4366f8a1bcbd9b8fa65d0cd571a8131cde6630d5f00"}},{"ruleId":"D2","level":"warning","message":{"text":"react.tableRoutes (cognitive 45): react.tableRoutes has cognitive complexity 45 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 8 (15 pts), ternaries 4 (10 pts), boolean chains 3 (nesting depth added 21). Of this number, 41 points are the body\u0027s own statements and 4 belong to 2 function items 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3f5190b9f7e63ee4487bcdb249d96eb27508cfa2372ca3c18f591f0065600a"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.piniaStoreEdges (cognitive 45): callback-synthesizer.piniaStoreEdges has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 5 (8 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 21). Of this number, 44 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeb6ec2889fccb058908b07dab525fc121507592821590e6e71c09b98441b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.afterCalledName (cognitive 45): ruby-parameter-flow.afterCalledName has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 16). Of this number, 36 points are the body\u0027s own statements and 9 belong to one function item 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5951cee502b4994a13626451f842ec879bd495b49518486e5008856b25c61235"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.manifestScope (cognitive 45): ReferenceResolver.manifestScope has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (8 pts), boolean chains 7, ternaries 4 (7 pts), error handling 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":"src/resolution/index.ts"},"region":{"startLine":4688}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b6c7ad4be4a83041ce9fabce0726afb2ca07d12f51b77af1744bee5ebef877"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildPolymorphicBoundaries (cognitive 45): ToolHandler.buildPolymorphicBoundaries has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 18, error handling 6 (9 pts), loops 5 (9 pts), ternaries 5 (8 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. This shape REPEATS in the file: one other method here (ToolHandler.buildPolymorphicBoundaries::memberOfSupertype::visit) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb0ff63a47bc8c791ccd6626089f49b60a433c0cc280ee0f4c335ac3070fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handleRequest (cognitive 45): index.handleRequest has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (32 pts), ternaries 2 (6 pts), error handling 2 (4 pts), boolean chains 2, loops 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":"src/ui-server/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"506884a824f2e7c55178774087bdcee52619de80581b0daea5974f3d0001f00f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cognitive 45): Walker::normalize_fn_ref_value has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb70a3e7cd614780e8b737251009b7e7e6ec214149d26971ea90071e0c91288f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::rtk_endpoint_handler (cognitive 45): Walker::rtk_endpoint_handler has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 2 (3 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"259dafa6230453f4013dbd265c57133b40b67a220abe7af1ec4193ab63be3df0"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCppAnnotationMacroCalls (cognitive 44): c-cpp.blankCppAnnotationMacroCalls has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (11 pts), boolean chains 6, 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02623b78cbc3dcd490c4cd9ce641bcfc0909cb5ace10bbe89d4fd4c7e524913"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripPython (cognitive 44): strip-comments.stripPython has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 4 (10 pts), boolean chains 9 (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":"src/resolution/strip-comments.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"619807626a708931da21a713932d3a25ebc3d6a15e83955c83631eee356807a4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jsBindingSites (cognitive 44): name-matcher.jsBindingSites has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 8, loops 5 (6 pts), ternaries 3 (6 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23848}}}],"partialFingerprints":{"codehealthFindingId/v1":"163b2c1f4d4a965c6b4e64e103294ec1ab717f92fafc8c26bb8271c021ea3ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goChainLinks (cognitive 44): name-matcher.goChainLinks has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 5 (11 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 17). Of this number, 41 points are the body\u0027s own statements and 3 belong to 3 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26490}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0320e36d6dc76d8682f65b38557e8720a697dfe1a4b71948b19c114fabb93"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchGoFieldChainCall (cognitive 44): name-matcher.matchGoFieldChainCall has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 8, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 19). Of this number, 42 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29043}}}],"partialFingerprints":{"codehealthFindingId/v1":"870e78a62255aa492513540b088aaa5bdcbf2ef6d0292f6326361a3e18d05668"}},{"ruleId":"D2","level":"warning","message":{"text":"react.exportedComponent (cognitive 44): react.exportedComponent has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 6 (16 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 18). Of this number, 42 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bd89c0026705ea86e5104e83e9d0b98ee11fdf4857c00ba882540cb7042e87"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.walkComponentWrapper (cognitive 44): TreeSitterExtractor.walkComponentWrapper has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 7, loops 3 (6 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b6b8c368003f9f1248afc6ae0b4f60a156186b6aadf6305a0d2809424dc84e"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalDeclType (cognitive 44): TreeSitterExtractor.extractPascalDeclType has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 3 (10 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":8902}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73a9d2fd4ca278eeb79ad57e005c6a57a77aca3e3f451014c83bd9871e1d759"}},{"ruleId":"D2","level":"warning","message":{"text":"goframe-synthesizer.goframeRouteEdges (cognitive 44): goframe-synthesizer.goframeRouteEdges has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 5 (7 pts), boolean chains 4, 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":"src/resolution/goframe-synthesizer.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"895043f873116430068e8c664481c2df60858f58722145bccd788464d2eb1918"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.readArgumentList (cognitive 44): ruby-parameter-flow.readArgumentList has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 12, loops 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e69b47c6e916f76d26e8de64b8d1cb92fcb1be850edc1282a88d0acbc60598"}},{"ruleId":"D2","level":"warning","message":{"text":"parameter-flow.planFlows (cognitive 44): parameter-flow.planFlows has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 9, ternaries 8 (9 pts), loops 4 (5 pts) (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 23 belong to 7 function items 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"333800538e95e37a1d451e730f511ade3706fed7374cfccfab553b73ee78aae5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 44): Walker::extract_call has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (44 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9329942edde65994fd6d76e646febd25bec1fa2fafbab40f37c937f7585029"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.searchNodes (cognitive 43): QueryBuilder.searchNodes has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 9, ternaries 5 (8 pts), loops 2 (5 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":"src/db/queries.ts"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de12e07daac44916c62addc5d4bf2b8add9ddab4101807bfe7ae29613849c6"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.recoverSingleArgMacroDefinedName (cognitive 43): c-cpp.recoverSingleArgMacroDefinedName has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6b906464a42c582842414a2045eab812083730e0c72402c7ee5a6520569590"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferJavaFieldReceiverType (cognitive 43): name-matcher.inferJavaFieldReceiverType has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 15, loops 3 (4 pts), ternaries 1 (nesting depth added 12). Of this number, 36 points are the body\u0027s own statements and 7 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded00ab0ff331139de86b9d43c8316c5c8d60bd9d4062f321e4a2fd573bd6085"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.getChangedFiles (cognitive 43): ExtractionOrchestrator.getChangedFiles has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), error handling 3 (6 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (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":"src/extraction/index.ts"},"region":{"startLine":4197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1ad8c7d7f33922a7048fad4e29b66231a5aed1696bca2df81ab8f59fbe00db"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.reopenNavigationsFor (cognitive 43): ReferenceResolver.reopenNavigationsFor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 9 (15 pts), boolean chains 3 (nesting depth added 17). Of this number, 42 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":"src/resolution/index.ts"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4550bc0cc2f9e2fd38c3ad2446b01ee84034764defe8016a0e7fcb904bc58c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.gateTargetKind (cognitive 43): ReferenceResolver.gateTargetKind has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 16, 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":"src/resolution/index.ts"},"region":{"startLine":4299}}}],"partialFingerprints":{"codehealthFindingId/v1":"70926dc147b38c6ca6306391b7604fd312f2f112b994498d24779bb5bb7259de"}},{"ruleId":"D2","level":"warning","message":{"text":"named-symbol-flow.resolveNamedSymbolFlow (cognitive 43): named-symbol-flow.resolveNamedSymbolFlow has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 4 (8 pts), ternaries 2 (5 pts), boolean chains 4, error handling 1 (nesting depth added 20). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function items 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"14812c966e7d2a45b42b6191f7b872896a10bc76ce22f9bad88a41f85ebfff23"}},{"ruleId":"D2","level":"warning","message":{"text":"project-lifecycle.activate (cognitive 43): project-lifecycle.activate has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 23). Of this number, 39 points are the body\u0027s own statements and 4 belong 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":"src/mcp/project-lifecycle.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"304643e183c8e35a173ea52971a6ffe42d6d57591befb0e8eb4bfcd63793892d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 43): Walker::visit_node has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 11, 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0999d62d02ee5edf9fe3581cbcbfde90abed46318f87c1e06b17da1bfe1d7968"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaAncestorNames (cognitive 42): name-matcher.javaAncestorNames has cognitive complexity 42 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 6 (19 pts), boolean chains 1 (nesting depth added 29). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3846}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dcc9056cf7643b5088dfe0421b44122c8edb60d2505d22475fcda7a528a626"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonLocalClassUncached (cognitive 42): name-matcher.pythonLocalClassUncached has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 8, ternaries 3 (7 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":28902}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef44d77480b666f4f8e8728f892f3dc757a6e3a1d620616ad27960deae1c81a9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.findBestMatch (cognitive 42): name-matcher.findBestMatch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 9, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a3292d29f15f8ccb40717bf9152749c237cd611117fcde85e177010ca055a3"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalDefProc (cognitive 42): TreeSitterExtractor.extractPascalDefProc has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (8 pts), boolean chains 4, ternaries 3 (nesting depth added 21). Of this number, 40 points are the body\u0027s own statements and 2 belong to one function item 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9040}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea9c9deb92803b46bde8ce4198d971b961eac49d13e4f8c9cdab17e656d0c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.collectTestRequests (cognitive 42): tier-synthesizer.collectTestRequests has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 9 (21 pts), if/else 13 (18 pts), boolean chains 2, loops 1 (nesting depth added 17). Most of this is not in the body itself: 10 of the 42 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 1167, add, a function literal at line 1152, \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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0757eeab2e0f52c7d08bf94da753f570b995b909e7efddb90fe974bb43785454"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goListItems (cognitive 42): callback-synthesizer.goListItems has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 8, loops 2 (4 pts), ternaries 1 (3 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a486fefe76535d74ceeb42e62510b3f9a99d692df12c0e6dff0a58734ee00e"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.hasAnyPossibleMatch (cognitive 42): ReferenceResolver.hasAnyPossibleMatch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 16). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/index.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"523d287745122f4ef2dbebf830169d7f218dc080ce7360e7e26fa6cad1acd8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::find_rtk_endpoints_object (cognitive 42): Walker::find_rtk_endpoints_object has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 2 (3 pts), boolean chains 1, match/switch 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446b9ba383a90315daff5f12c468eeb33879cf60c7581b37bf1d04ef559a6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::strip_c (cognitive 42): codegraph_kernel::cfnptr::strip_c has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (10 pts), boolean chains 9 (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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"facee0b67b7ae5afede98fe9c4c18a7353ac7cc6e927cd26656eb381abe1eb22"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripCStyle (cognitive 41): strip-comments.stripCStyle has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 11, loops 4 (10 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":"src/resolution/strip-comments.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"46863a48579bbf956a0c7ff25f03a876f7561a44d21ecf9993e934394c0b4254"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustFieldChainAt (cognitive 41): name-matcher.rustFieldChainAt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8, ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29550}}}],"partialFingerprints":{"codehealthFindingId/v1":"211aabeb8f1f7e5556954748261c487d0e13b7615a3363026d7a205a0a599c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolvePythonModule (cognitive 41): import-resolver.resolvePythonModule has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 8, loops 4 (5 pts), ternaries 2 (4 pts) (nesting depth added 14). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/import-resolver.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb0ea3aa8399d0781dc99be20d817984c05813fe6d32da7c158236723d26ac"}},{"ruleId":"D2","level":"warning","message":{"text":"express.scanCall (cognitive 41): express.scanCall has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 7, loops 2 (4 pts), 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2299a4bc32db6d879a6a39b69f9f68958a91f1e5ff895b5cefb9c0fbae6a8931"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.reopenReferencesThroughBarrels (cognitive 41): module-importers.reopenReferencesThroughBarrels has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 6 (13 pts), boolean chains 3 (nesting depth added 23). Of this number, 40 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/module-importers.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc882bf343e09807d13e962588126c8343ecd0f18e636dbe244f658356cdf5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"type-parameters.gateTypeParameter (cognitive 41): type-parameters.gateTypeParameter has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, loops 3 (6 pts), ternaries 2 (6 pts) (nesting depth added 16). Of this number, 40 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":"src/resolution/type-parameters.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072a6517f11fdd39b8af05a70e09e81144fa4d98f73b8817678f2bba5aada27"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.erlangArityAt (cognitive 41): callback-synthesizer.erlangArityAt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4773}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe83a5ce271a0b84ae7c70127620cc5557cf3f805937bcc0a073034f40f5c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveCfmlComponentPath (cognitive 41): ReferenceResolver.resolveCfmlComponentPath has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 9, loops 3 (5 pts), ternaries 2 (3 pts) (nesting depth added 14). Of this number, 38 points are the body\u0027s own statements and 3 belong 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":"src/resolution/index.ts"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"70802455b7c1bd19f78a291b25a9f21ffd1c56db15deef58d3452b3204019b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphTraverser.traverseBFS (cognitive 41): GraphTraverser.traverseBFS has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 5 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 21). Of this number, 33 points are the body\u0027s own statements and 8 belong 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":"src/graph/traversal.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd62a74293f15e4c1e4bfbddc36039c7b8325e343d73366ae16be0bd07c0cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps.chainFor (cognitive 41): steps.buildSteps.chainFor has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (10 pts), boolean chains 5 (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":"src/ui-server/api/steps.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e84d09a6e6cbeaba2945904f7f08ad2a120b495f324e4d24ecc05ca2211807"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_ts_tuple_contract_names (cognitive 41): Walker::extract_ts_tuple_contract_names has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (7 pts) (nesting depth added 25). Of this number, 36 points are the body\u0027s own statements and 5 belong to one function item 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779d0cf01e944fe48775969bff2a30df91ac0b9ebac02b1979335519302e90a"}},{"ruleId":"D2","level":"warning","message":{"text":"cobol.walkDataEntries (cognitive 40): cobol.walkDataEntries has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 7 (13 pts), boolean chains 6, loops 4 (nesting depth added 14). Of this number, 26 points are the body\u0027s own statements and 14 belong to 4 function items 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"966a48e688b4198d6cb5c573640e861ee4e174d3c4880de2350fb531adbda705"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.retargetSelfOverload (cognitive 40): name-matcher.retargetSelfOverload has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 8 (16 pts), boolean chains 6 (nesting depth added 12). Of this number, 35 points are the body\u0027s own statements and 5 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32225}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4cd037108adb567a5333ee431c01251c89476e26a9f61170c5f0360c1e8de"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.constantText (cognitive 40): angular-router.constantText has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 5 (9 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 15). Of this number, 31 points are the body\u0027s own statements and 9 belong to one function item 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4c9e0fda797f3f9302b85910244f7dea68e239e83cad89f956558525bba2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.angularRouteTable (cognitive 40): angular-router.angularRouteTable has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 8 (10 pts), boolean chains 4, ternaries 2 (4 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"367cc3ada3a5272a4679a4cdefaa2a183834859b7cce554817136c286f199641"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.abbreviateArgument (cognitive 40): branch-guards.abbreviateArgument has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (18 pts), ternaries 8 (16 pts), boolean chains 4, loops 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":"src/graph/branch-guards.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25066bd4dd01947c30059654027aac426f10eccb32188e83837bc4b6336a42"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_variable (cognitive 40): Walker::extract_variable has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 3 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"32297066e98b12467ad0bc09921b689dd423626994c9f6602435f67340712fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"ambient-modules.scanNamespaceBlocks (cognitive 39): ambient-modules.scanNamespaceBlocks has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 14, ternaries 3 (8 pts) (nesting depth added 10). Most of this is not in the body itself: 1 of the 39 points is its own statement and the rest belongs to one function literal inside it that branches (line 337). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b15061c8191ad45058b7c098e9e9048afbbc55991bd188210dff10350bae5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"rust-scopes.walkPattern (cognitive 39): rust-scopes.walkPattern has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (10 pts), boolean chains 4 (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":"src/resolution/rust-scopes.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb1c87cea0fa6785c5d881dfdb258d66402770b55d2c6d9e9076e41b681fccb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goSignature (cognitive 39): name-matcher.goSignature has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 10, loops 4 (nesting depth added 9). Of this number, 28 points are the body\u0027s own statements and 11 belong to 3 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e628ceedf9f042b6216f9e43ad26307afce52498cb0ef81b43786668e045b4"}},{"ruleId":"D2","level":"warning","message":{"text":"package-deps.declaredDependencies (cognitive 39): package-deps.declaredDependencies has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 6 (11 pts), boolean chains 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":"src/resolution/frameworks/package-deps.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0682c835b2edec73b35c6193ff149290ff9891a60fca498bcd567b7eba613ff"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-sitter.extractFromSource (cognitive 39): tree-sitter.extractFromSource has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 3 (10 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 14). Of this number, 36 points are the body\u0027s own statements and 3 belong 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9977}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fdced4e88c64eb948bc0b25b2dc611e3c7703169c3be658b76f69411477f96"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.importersOf (cognitive 39): module-importers.importersOf has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 5 (11 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 22). Of this number, 31 points are the body\u0027s own statements and 8 belong to one function item 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":"src/resolution/module-importers.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"61968f75811217ea1c78abc9381df3cb16f84e7484cd82a2b065dcd79f5c1292"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.pairEvents (cognitive 39): tauri-synthesizer.pairEvents has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 3 (13 pts), loops 5 (8 pts), boolean chains 2 (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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"446a0b5283755b9a126dc9ccff2f4545edcdbc37dc4461c6a73a42e495f64d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"named-symbol-flow.walkCalls (cognitive 39): named-symbol-flow.walkCalls has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (8 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 10 belong to 2 function items 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21076327fb81e03378ed3a7bbe7bcb6be53ee3865a5b27766e4e6a20d10b6e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleExplore::shrinkCluster (cognitive 39): ToolHandler.handleExplore::shrinkCluster has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 9, loops 2 (4 pts), ternaries 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. This shape REPEATS in the file: 3 other methods here (ToolHandler.handleExplore, ToolHandler.handleExplore::prio, ToolHandler.handleExplore::sectionRangesOf) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":7129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9569d0e0e4821b33bd08d65c305a6180919fc954dd5e46cabd501a5b9fae9f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.extractSymbolsFromQuery (cognitive 39): index.extractSymbolsFromQuery has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 9 (12 pts), boolean chains 4 (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":"src/context/index.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9753360a93aac718453e092b04b01bb4f76b950ac5b75b6d6c4bc93d244a0211"}},{"ruleId":"D2","level":"warning","message":{"text":"trail-store.parseTrail (cognitive 39): trail-store.parseTrail has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (19 pts), boolean chains 10, if/else 6 (8 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/trail-store.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dac584d4ddafc10f4af502d8beb45501dc87203a850cb22cae5f6a1e5c2ede"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 39): Walker::maybe_capture_fn_refs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 3 (5 pts), boolean chains 2, match/switch 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbfdb52ad7b4c92410633a06cef47bf82249278b5585fd1137d472a3bcc4bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_component_wrapper (cognitive 39): Walker::walk_component_wrapper has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"336dd07d09d9a05593aadd84dffc1f5daa308a7a2ec92f9e1b13747303e5b239"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-template-calls.parseOpenTag (cognitive 38): vue-template-calls.parseOpenTag has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7 (13 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/vue-template-calls.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"48348d2ffa17ab00ac79472bab591fa638886fb06dea87b040590440df985b10"}},{"ruleId":"D2","level":"warning","message":{"text":"object-literal.readFields (cognitive 38): object-literal.readFields has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (31 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/object-literal.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea1aa0e0146809abfd4bb04b97d87305e09f694c0c892bedfec415fc99ff5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.addDirective (cognitive 38): dart-libraries.addDirective has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, loops 3 (5 pts), ternaries 2 (4 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7598da87c26fe1696fef3f29d2537f54cf5cf2f73d774cfefc99e976a17b5"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-raw-strings.cppLiteralsBlanked (cognitive 38): cpp-raw-strings.cppLiteralsBlanked has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 6, loops 2 (5 pts), ternaries 1 (nesting depth added 20). Of this number, 37 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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87b1fa4744ecbd65acdcb6f7798acb0129432200a24597e791b95211f3196f1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchEnclosingScopeMember (cognitive 38): name-matcher.matchEnclosingScopeMember has cognitive complexity 38 (threshold 15). Drivers by points: if/else 34 (77 pts), boolean chains 33, loops 11 (18 pts), ternaries 9 (14 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (name-matcher.matchEnclosingScopeMember::inheritedThrough, name-matcher.matchEnclosingScopeMember::inherited) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":14092}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be5f4d02d2556c0438c846a24810b84287f20a986190bd4bb476b5cc73ffbb6"}},{"ruleId":"D2","level":"warning","message":{"text":"react.readObjectPath (cognitive 38): react.readObjectPath has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 2 (7 pts), boolean chains 5, loops 3 (nesting depth added 17). Of this number, 20 points are the body\u0027s own statements and 18 belong to 2 function items 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b9b215f4371fec5fb43b6b7a2db74d99a40521feafbdb57bb78da4314467bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.flushFnRefCandidates (cognitive 38): TreeSitterExtractor.flushFnRefCandidates has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 9, loops 4, 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631b4b22bd9d9677fcb50efb1cc75aa7a85fe1e1ccedc556c41d2e7927659ad"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.reopenNameMatchedImports (cognitive 38): module-importers.reopenNameMatchedImports has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 3 (5 pts), 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":"src/resolution/module-importers.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4faf6f10a6145e675a0fa0aeeda35844eaef569208c7b3c142b4b043e1ca87"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.rnCrossPlatformEdges (cognitive 38): callback-synthesizer.rnCrossPlatformEdges has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (11 pts), boolean chains 2, ternaries 1 (nesting depth added 21). Of this number, 36 points are the body\u0027s own statements and 2 belong to 2 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"884587b32bf54b28afdb10b7be8cb2941845e0682cdcca043152eb9892190a62"}},{"ruleId":"D2","level":"warning","message":{"text":"parameter-flow.namesToReview (cognitive 38): parameter-flow.namesToReview has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 9 (14 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca15ee5cefb5eec4bec5b3e7f4070bd1530ec834f098bf2b053b76717fc98eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleStatus (cognitive 38): ToolHandler.handleStatus has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 8 (14 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":8558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba71bba98de7760403801e551d0c5e2c3a828c4eefc479ef0f79263177e441be"}},{"ruleId":"D2","level":"warning","message":{"text":"effects.responseStatus (cognitive 38): effects.responseStatus has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (28 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 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":"src/ui-server/api/effects.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d56414119c5759294e619d56bd2a059bdaedb5c8f0c7974377dd892aabf39b6"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.scanParameterList (cognitive 37): pascal-preparse.scanParameterList has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (4 pts), boolean chains 3 (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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee3b0e610e1cc00ab5c942265fab8d0cc3db4878379f0add305236598e341d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.csharpAncestorNames (cognitive 37): name-matcher.csharpAncestorNames has cognitive complexity 37 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 5 (15 pts), boolean chains 3 (nesting depth added 22). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"29af7ac67cf0fe59655f978c44c42f1f4fe3dbbf7ab73201391312cdc8ae0c81"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustUsesOf (cognitive 37): name-matcher.rustUsesOf has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 8 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 9 of the 37 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 9787, bind, a function literal at line 9762). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1f9dade9cda6db9ba1ee0ddf380f5e1d3e35e65a2ccc95f55b7fa4a55b7f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchRustUseBoundName (cognitive 37): name-matcher.matchRustUseBoundName has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8, ternaries 3 (5 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10991}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21b5e6ca9a09c9b2408df973d0aa070d73ffdee70d5a3a3a59d81cbd7aaa10a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonExprScan (cognitive 37): name-matcher.pythonExprScan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 2 (7 pts), boolean chains 5, loops 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27770}}}],"partialFingerprints":{"codehealthFindingId/v1":"561bd3c9cfae0619e0db0a13584033995c0892577da4610e7bf0ed8187f5095c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonFactoryTypeUncached (cognitive 37): name-matcher.pythonFactoryTypeUncached has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 8, loops 2, ternaries 1 (2 pts) (nesting depth added 10). Of this number, 35 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28443}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f87508ec227e88108fde1aa108d60504dd0dc998e84f90a01b25ddd8693213"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.isExternalImport (cognitive 37): import-resolver.isExternalImport has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 4, loops 1 (3 pts), ternaries 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bff6aac97a2059a6efc0c05d1e78520212ea6be28d6079d11e9be6b5df7c3af"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolveJavaImportedReference (cognitive 37): import-resolver.resolveJavaImportedReference has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 5 (13 pts), boolean chains 8, loops 1 (nesting depth added 16). Of this number, 35 points are the body\u0027s own statements and 2 belong 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbfb61ca75d7dabe18d10586b404358de87bbf24fbc75e1916878bf29f6df36"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.routeFilesLoadedBy (cognitive 37): angular-router.routeFilesLoadedBy has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (10 pts), boolean chains 5, ternaries 1 (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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7c07492d8641b953cc4e43690418b87ff7b44dc9d149fdde1917088f57df16"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.pairEvents (cognitive 37): tier-synthesizer.pairEvents has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 2 (8 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c71a0f24820bb9e396a1f7b8df908c420e44448b6e7ff8f93f4076c16de688"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.arkuiRouterEdges (cognitive 37): callback-synthesizer.arkuiRouterEdges has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 8 belong to 5 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97673e8fbb80da7b7a82cea4182328d8a0bd9c9dcad371386c5f03818d946f8"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.vuexDispatchEdges (cognitive 37): callback-synthesizer.vuexDispatchEdges has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 17). Of this number, 24 points are the body\u0027s own statements and 13 belong to 3 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490dd0b9f7b824278125f92021987bfabc6ee83f69f140ae07393bc5a11764b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.pythonAttrRetryCandidates (cognitive 37): ReferenceResolver.pythonAttrRetryCandidates has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 6 (12 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). Of this number, 18 points are the body\u0027s own statements and 19 belong to 3 function items 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":"src/resolution/index.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce3de52a2d26e7dea04ad1ff3bff593d5fde48bd6ee81462860c80afdfb8128"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveOneIn (cognitive 37): ReferenceResolver.resolveOneIn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 14, ternaries 4 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2c9f66dce4caaf6791aa2006c0ff962d14740187c129be5633177e5a719d63"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildFlowFromNamedSymbols::collectSynthLinks (cognitive 37): ToolHandler.buildFlowFromNamedSymbols::collectSynthLinks has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 4 (11 pts), loops 4 (5 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. This shape REPEATS in the file: one other method here (ToolHandler.buildFlowFromNamedSymbols) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"829ef7355764e84ac9c3adb126eedbdc99f1946b0ba4153e85f7844e60dbc965"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph.main::printIndexResult (cognitive 37): codegraph.main::printIndexResult has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 3 (6 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (codegraph.main::runInit) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/codegraph.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e690be2f2a4793f7ed1e993a605cf13d35fcf0f0b6bb31f5d2640fcf666d0af"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_variable (cognitive 37): Walker::extract_variable has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 2 (4 pts), boolean chains 2 (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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f640cb2f35b2e167ad8cede477f804c725517f2173dd1ccd1c4078884231dc27"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_import (cognitive 37): Walker::extract_import has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 2 (4 pts), match/switch 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42c89aa4082557e12c7b6b4e5260e936722fd657f4e5740c44a21bc5115b02b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cognitive 37): Walker::normalize_fn_ref_value has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/php.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f972a4766f629404246d9e1de7450f7e5fe2bda8b5463f3a69856eb369efd0c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::try_visit_hook (cognitive 37): Walker::try_visit_hook has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 23). 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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03db87e73f33f737277d359b08febbc695b9011376359ec9d9eff06e616516"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 37): Walker::extract_call has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (37 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbf7febed3c6c4e8f6db835eb4ad03b405b8ddf108530832a95ef31dedec95c"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.scanForInVariable (cognitive 36): pascal-preparse.scanForInVariable has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"32336019a5317124b711f9a81869bbc377376ac177b95f2a2bc34742d8a5c4c4"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-methods.bodyOpenAfter (cognitive 36): cpp-macro-methods.bodyOpenAfter has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 5, loops 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34aa265adb783a72e9d556ca4cbc64f420cdb07c325411843f8ec58e54b23cf"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.supertypesOf (cognitive 36): vbnet-receivers.supertypesOf has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (10 pts), ternaries 2 (8 pts), boolean chains 3 (nesting depth added 22). Of this number, 35 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"47451fb637b5387eba0c87c7f0d9de95a538fd5750ec08b1b7bf47d51fa39d15"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustGoReceiverName (cognitive 36): name-matcher.rustGoReceiverName has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 2 (7 pts), loops 2 (4 pts), boolean chains 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1d6c16142831845a2fc68f949069a4271f71d6c101b40bef5a28236b3b116d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustManifestDependencies (cognitive 36): name-matcher.rustManifestDependencies has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 6 (23 pts), if/else 7 (10 pts), boolean chains 2, loops 1 (nesting depth added 20). Of this number, 32 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1194a4060215823a91a76e9be0a1debb06d3fed8fec92acb54fe588a53c51f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustPathTarget (cognitive 36): name-matcher.rustPathTarget has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 11, ternaries 5 (7 pts), loops 1 (2 pts) (nesting depth added 7). Of this number, 29 points are the body\u0027s own statements and 7 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfd4775e0e1ea45cc1fb4686ab5b29f9abfa2c1214d8d2f93050ee85fa8221d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchJavaStaticFieldCall (cognitive 36): name-matcher.matchJavaStaticFieldCall has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 11, ternaries 6 (8 pts) (nesting depth added 5). Of this number, 30 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13bca6c5710fb663e9b7baa1ddb373cdb223f72074ddab1e04fb3f996f9d99e"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goFieldTypeOf (cognitive 36): name-matcher.goFieldTypeOf has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (9 pts), boolean chains 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":27343}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc78600e3323506006eee52d04e5862da196ccc67a81996acd6c62529a9a647c"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.pythonPackageImporters (cognitive 36): import-resolver.pythonPackageImporters has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (8 pts), boolean chains 4, ternaries 2 (nesting depth added 18). Of this number, 30 points are the body\u0027s own statements and 6 belong to one function item 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da65d9d811b7267e7840e633475cdbf14ba3b471491715066682fcabf8aaca6"}},{"ruleId":"D2","level":"warning","message":{"text":"react.elementTags (cognitive 36): react.elementTags has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (7 pts), ternaries 2 (7 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9411da432bd2080a6bc3259f96bf7e1029d902a327d04feaa7cdb67fe11a7f26"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router.readStringAt (cognitive 36): expo-router.readStringAt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 22). 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e3c1940d00e5ce0bed0cb65bfbf4ec2ec7c0f1f4f53f892318af8a8ab6ec14"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.returnsInTree (cognitive 36): branch-guards.returnsInTree has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, loops 5 (7 pts) (nesting depth added 14). Most of this is not in the body itself: 14 of the 36 points are its own statements and the rest belongs to 2 function items inside it that branch (visit, collect). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e9c02e52a33113624f4761bb7fd289378249d76226c40aac1e1a91fd99a085"}},{"ruleId":"D2","level":"warning","message":{"text":"file-cycles.tarjan (cognitive 36): file-cycles.tarjan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/file-cycles.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdb5b98d5042699fb7e624aec672e7481c29c26f98a87f2059309e5011e7e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"dead-code.overrideCandidates (cognitive 36): dead-code.overrideCandidates has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 9 (15 pts), boolean chains 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":"src/graph/dead-code.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c6edae52c6220a9b836c5a0f03d815681e47a0c90b83be56bc3c99413ab20b"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextBuilder.buildCallPathsSection (cognitive 36): ContextBuilder.buildCallPathsSection has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 6, boolean chains 4, ternaries 3 (4 pts) (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 9 belong to 5 function items 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":"src/context/index.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba478b4e957e670ae1cebbb1b623fc74b209740b42064b93bb3e8e6ce673414a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::recover_single_arg_macro_defined_name (cognitive 36): Walker::recover_single_arg_macro_defined_name has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 10, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a863bb21746c075f7946386b11fe8455027edbac762a9d9bfab669a24e7550"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 36): Walker::visit_node has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 2 (4 pts), match/switch 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94c2da59f42c20e9aea03a9c957b0c24771e5d195d1f9fda063cc854b737cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::hook_call (cognitive 36): Walker::hook_call has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 4 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc9daf706f0fa8c3af8a64f5155bc819c3a067930919452f621d87304c08348"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_file (cognitive 36): codegraph_kernel::cfnptr::scan_file has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 2, 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4002253e7efbfe392f474cbdaf973cd700b1c5f417f7a953ccb87b6cab29062b"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCppInlineAnnotationMacros (cognitive 35): c-cpp.blankCppInlineAnnotationMacros has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e167a36b681fb732eb7f7195ea1d8c6527543932f00d4257ecf75ddae254982"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-methods.cppDefinitionHeads (cognitive 35): cpp-macro-methods.cppDefinitionHeads has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 3 (7 pts), boolean chains 5, 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"672811d813ef60fab83cbec8978a4c09214b68498286ca571c576e74bf64ce22"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.extractDrupalServices (cognitive 35): drupal.extractDrupalServices has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 3, loops 2 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 5 belong to 3 function items 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eb07cb23278d99507cc133edee29b23ee071ca2f98b07d3694f1028c080020"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.bindParameters (cognitive 35): dart-local-scope.bindParameters has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 3 (7 pts), boolean chains 6, loops 3 (6 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"404bdb57d8a7fb913fdfafe9d250b52548ea401dc0e827e68722c88b610f4330"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.matchVbMemberRead (cognitive 35): vbnet-receivers.matchVbMemberRead has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 11 (12 pts), boolean chains 7 (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"2777b2beb124b07ddae1d659888a35f9929e56fbec51dfcb865511d7511755cd"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-visibility.directiveLines (cognitive 35): cpp-macro-visibility.directiveLines has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a468cbf476b6ca2070f068515e1ea74704802985fbbbd435364bcc8f9955631"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.blankGoCode (cognitive 35): name-matcher.blankGoCode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 4 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 19). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c981e9be2692cafb9b7604257e80fbc1541a5facc7f47f863e858b1f65b146"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchByQualifiedName (cognitive 35): name-matcher.matchByQualifiedName has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 13, ternaries 3 (5 pts) (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 7 belong to 4 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15058}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a088044a1be399c9b1b66f6846f5b6e845619f3ed7064aa728be437028372d1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaStaticField (cognitive 35): name-matcher.javaStaticField has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 3 (13 pts), loops 4 (10 pts), if/else 2 (8 pts), boolean chains 4 (nesting depth added 22). Of this number, 32 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e8ae2246146065879b92bf650f80814e5085c30963ccc8fee11b52b916b4c4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.tsFieldDeclaration (cognitive 35): name-matcher.tsFieldDeclaration has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (7 pts), ternaries 3 (7 pts), boolean chains 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":30146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3287e14e9bd79956ab6cc83cfd274010ff83a7e2008e48fe2f3069d0d7f2c29a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.readDestructuredBindings (cognitive 35): name-matcher.readDestructuredBindings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (8 pts), boolean chains 4, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5458f1533b766411dcbf717666f0b8aaf4ea15146a3d1c85f4f4c98315f01e74"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-router.parseVueRoutes::visit (cognitive 35): vue-router.parseVueRoutes::visit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 5 (11 pts), boolean chains 5, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb894bf86437a07f2c3952f0a46528acffbc65f8f38a9e2b19f0318438184a5"}},{"ruleId":"D2","level":"warning","message":{"text":"override-parameters.blankCsharpTrivia (cognitive 35): override-parameters.blankCsharpTrivia has cognitive complexity 35 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 3 (10 pts), boolean chains 9, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/override-parameters.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"142ec49d368f4702388dd9989fb6f60f54fd26c7fefddcbdf4858d3ddc66a992"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goPromotions.\u003Creturned closure\u003E (cognitive 35): callback-synthesizer.goPromotions.\u003Creturned closure\u003E has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (8 pts), ternaries 1 (5 pts), boolean chains 1 (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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddbf9a9ff54d0ec8d4becca27f4807d569884fa68132066a76ed4753ca9adc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_import (cognitive 35): Walker::extract_import has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (3 pts), match/switch 1 (3 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77d143d4bec6f465bedb526a5982eac2d9a06ed3dbe7cb6030932ce35344ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 35): Walker::extract_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f2ba1eb12cb873f6670a0fdddc037e4a2a134d7ed58072818696f4ad6f3ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"sfc-script.foldScriptResult (cognitive 34): sfc-script.foldScriptResult has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, loops 6 (7 pts) (nesting depth added 11). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/sfc-script.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"971bbb25a79ab11ffa26468adee69c989e18dfdf8886a76a7dc335d94ea2b2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.exportsOf (cognitive 34): dart-libraries.exportsOf has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 4 (12 pts) (nesting depth added 23). 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"620313dbddc1fe3fa4b12792be393b2e84ae460ced3d9490b03c27586d14660a"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.extensionFor (cognitive 34): vbnet-receivers.extensionFor has cognitive complexity 34 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 6 (9 pts), boolean chains 7, ternaries 1 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2e6504397ee0a5991d84da0a5d6927ba05339ebe71e5490ba51c84ed83a426"}},{"ruleId":"D2","level":"warning","message":{"text":"ambient-modules.scanAmbientModules::blockToken (cognitive 34): ambient-modules.scanAmbientModules::blockToken has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 9, match/switch 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 shape REPEATS in the file: one other method here (ambient-modules.scanAmbientModules::token) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58aa499d16250cbe4f62c87aee5bc3a2efdf04672a432d474a4edfacc115da9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinLambdaReceiver (cognitive 34): name-matcher.kotlinLambdaReceiver has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, ternaries 3 (5 pts), loops 3 (4 pts) (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 9 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f3c13793b7b53f2556901c867299ab76638967bdd3e8a99accd117a90a6a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaArgumentType (cognitive 34): name-matcher.javaArgumentType has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (18 pts), ternaries 6 (12 pts), boolean chains 4 (nesting depth added 7). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2643eeae1fca31f27ec16c95ab2dd9be8da58016c6670b05e6a75a0d274ddcf"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolveAliasedImport (cognitive 34): import-resolver.resolveAliasedImport has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 4 (6 pts), loops 3 (4 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d09260d4b79ac17c4e1b520daa762e55976f623ce2dd4596a8ee9a0e1ee031"}},{"ruleId":"D2","level":"warning","message":{"text":"react.readObjectValue (cognitive 34): react.readObjectValue has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 3, ternaries 1 (3 pts) (nesting depth added 14). Of this number, 16 points are the body\u0027s own statements and 18 belong to 2 function items 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"04edacdb579bfa9beae9f9e70e5fd0f119e92a77741b879d87f1506bab156980"}},{"ruleId":"D2","level":"warning","message":{"text":"react.valueOf (cognitive 34): react.valueOf has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 3 (7 pts), boolean chains 4, loops 2 (nesting depth added 12). Of this number, 31 points are the body\u0027s own statements and 3 belong 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86efb509a4bba8a127da685c6e41879921f9ff3096cbf2d59cc5c7d36a85833"}},{"ruleId":"D2","level":"warning","message":{"text":"tanstack-router.parseTanstackRoutes (cognitive 34): tanstack-router.parseTanstackRoutes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 4 (9 pts), boolean chains 3, loops 3 (nesting depth added 14). Of this number, 33 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"720b281a8eaa638c2b72c914fa86903b8eac0668f6253a8f1bf2557f855634ff"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractTypeAnnotations (cognitive 34): TreeSitterExtractor.extractTypeAnnotations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 2 (5 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab441610f0526d9187a1340a16522136d7e361071b7c86ea816e9953cf587a92"}},{"ruleId":"D2","level":"warning","message":{"text":"type-parameters.declaredTypeParameters (cognitive 34): type-parameters.declaredTypeParameters has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/type-parameters.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8cb4160c3269c0f6ace6b322671aa82fa580efaaa3648f4c49d16d719bd4d"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.componentsIn (cognitive 34): angular-template-synthesizer.componentsIn has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 18). Of this number, 33 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da12f0a6ebc6391d17a77cc0cda74ebfb9cac074da932ad81cbe09380e63538"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.readMicrosyntax (cognitive 34): angular-template-synthesizer.readMicrosyntax has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 6, loops 2 (nesting depth added 14). Of this number, 28 points are the body\u0027s own statements and 6 belong to 2 function items 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fac13f48189c82d2cc054a9520677f431672558d2ce542cce72f4a85dea947"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.constantEventName (cognitive 34): callback-synthesizer.constantEventName has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 6 (14 pts), boolean chains 4 (nesting depth added 16). Of this number, 25 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"7993a0e1c87a9c0f037ca28cd635e0a999255dac891e9e642ba80748ceac678b"}},{"ruleId":"D2","level":"warning","message":{"text":"synthesized-hop.describeSynthesizedHop (cognitive 34): synthesized-hop.describeSynthesizedHop has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 15 (29 pts), if/else 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/graph/synthesized-hop.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8fe15035468c784ea983db1ed72e3189b5efe19ea3a909e3ca06d163d15e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleCallees (cognitive 34): ToolHandler.handleCallees has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (6 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 15). Of this number, 20 points are the body\u0027s own statements and 14 belong to one function item 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":"src/mcp/tools.ts"},"region":{"startLine":3496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0bae372d3924c5d019979a8a737b8464ebc8fec0ba6fa3ab34b860e744bf4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildBlastRadiusSection (cognitive 34): ToolHandler.buildBlastRadiusSection has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 4 (7 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 17). Of this number, 33 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":"src/mcp/tools.ts"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a2d787be2a5169e90294fd5595424991df0362a795ea27424c3860c20b8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"when.annotateWhen (cognitive 34): when.annotateWhen has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (8 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 15). Of this number, 31 points are the body\u0027s own statements and 3 belong to 2 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":"src/ui-server/api/when.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd09c59cbd194acb94ca7b6ef6a3fc8f2f6aad313ab7e836d2add72a757488ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 34): Walker::extract_call has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"716ad80aee0b4e2ab64feb1ad4facb3b85b08035dc90d7487de93b3641a68994"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::hook (cognitive 34): Walker::hook has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (7 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/scala.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcea131b2be328d5e609b2af32e59d90fb9b272779975d304f9e93da444a177"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 34): Walker::visit_node has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 2 (4 pts), boolean chains 2, match/switch 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50e744a7a42964ca87188baf5c1c637375fdbe8a19c0463026aa6922e924e7"}},{"ruleId":"D2","level":"warning","message":{"text":"function-ref.normalizeValue (cognitive 33): function-ref.normalizeValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 3 (8 pts), boolean chains 2, loops 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":"src/extraction/function-ref.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba079f7fd1f3bfbd10548407cb4c31c3f81e11c07612ba58fcb22608a65975da"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCFileScopePrefixedDeclMacros (cognitive 33): c-cpp.blankCFileScopePrefixedDeclMacros has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6fa7f8374236f8030b338e9aad974e205d8abdfa4c6647c111cd75574c0798"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.blankDuplicateBegins (cognitive 33): pascal-preparse.blankDuplicateBegins has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (13 pts), boolean chains 4 (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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff11887710ddb4d0e4bceaa67b658ccdd0739ca89e60c5090bee9ab4c617af5"}},{"ruleId":"D2","level":"warning","message":{"text":"erlang.moduleExports (cognitive 33): erlang.moduleExports has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 3 (12 pts), loops 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/erlang.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"04136dc2689ccedbedce502e3f75138e6b559caabceffb5e0b3a429ad1ccdf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"arkts.collectDecoratorNames (cognitive 33): arkts.collectDecoratorNames has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 16). Of this number, 23 points are the body\u0027s own statements and 10 belong to one function item 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":"src/extraction/languages/arkts.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"402c008fe9a61b7f0988b955cfdcbf2745222be49c3b136007ef2c21cb5cf431"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorExtractor.matchBrace (cognitive 33): RazorExtractor.matchBrace has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (10 pts), boolean chains 7 (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":"src/extraction/razor-extractor.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"71270b657f6f1c919803a012821602c8ed51fecebd2ce549a98bd0abf63e1b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonConstructorCall (cognitive 33): name-matcher.pythonConstructorCall has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba420bf7b212547e2c58a8ef275359d6482fdccf7571e4a747e14f636c060c9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchDartAnnotation (cognitive 33): name-matcher.matchDartAnnotation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 6 (11 pts), boolean chains 10 (nesting depth added 8). Of this number, 32 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69440f46bcb67657f2430e6393da3531fdb791a567107e3933c06154037f885"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rubyClassMethodOf (cognitive 33): name-matcher.rubyClassMethodOf has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 4 (15 pts), boolean chains 1 (nesting depth added 22). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9034}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a50edc8e689d6ba2b4ea9475d5eefda270217c6895d1285b772a44a1b072e98"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchEnclosingScopeMember::inherited (cognitive 33): name-matcher.matchEnclosingScopeMember::inherited has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (name-matcher.matchEnclosingScopeMember, name-matcher.matchEnclosingScopeMember::inheritedThrough) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":14195}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ccdff19b295e2057b35b0db684fcb305c90a07711eaeb916d5858a7c892a34"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaOverloadsFitting (cognitive 33): name-matcher.javaOverloadsFitting has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 5 (9 pts), boolean chains 5, loops 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":14952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10ce53b533e8241b7297f1d43994596a5534144e50f280c04381e30273b751b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppMethodOf (cognitive 33): name-matcher.cppMethodOf has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (9 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 12). Of this number, 31 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d349383679ba97a295a8ec9c80ad1f34de5caa842fda6ceac7ffdaa8327bcb46"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinChainDeclaredType (cognitive 33): name-matcher.kotlinChainDeclaredType has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2ec1d19776b0e8cbd3de1bf5abcdc505e93199af3f4aa6dd4fe83816471a80"}},{"ruleId":"D2","level":"warning","message":{"text":"python.extractFlaskUrlRules (cognitive 33): python.extractFlaskUrlRules has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 3 (7 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/python.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80d64fae043428c7a3c4df553f16ab705b79182007291c4e9e24e113e769a90"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.resolveScopedModuleRef (cognitive 33): terraform.resolveScopedModuleRef has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 5 (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 3 belong to 2 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":"src/resolution/frameworks/terraform.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd235339c60074579c22b87a0d4d73aa76dea60411201d553ba631007001cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.findRtkEndpointsObject (cognitive 33): TreeSitterExtractor.findRtkEndpointsObject has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 6, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd286bf1776cd15a4da30aa79a1420e7779518e321e1f56c22edb7906df12a0"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractTsTupleContractNames (cognitive 33): TreeSitterExtractor.extractTsTupleContractNames has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 17). Of this number, 28 points are the body\u0027s own statements and 5 belong to one function item 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"240ce716ccbfd02f67e963da6098b932862d449e13a48ab713c086859a689684"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.pascalNameMode (cognitive 33): TreeSitterExtractor.pascalNameMode has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 10 (21 pts), boolean chains 7, if/else 2 (4 pts), match/switch 1 (nesting depth added 13). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":9859}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd1849aa068d6d1a7c32f6a3ee4b011447b1bdc1e594c98c030c3b2b5bcdb55"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-constructor.matchCppConstructor (cognitive 33): cpp-constructor.matchCppConstructor has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 12). Of this number, 29 points are the body\u0027s own statements and 4 belong 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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f745fe12ba60294adb8e066f2c874e10bbb87fc6178bc6d5b99d4cd5cdb4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"c-fnptr-synthesizer.evalConditionals (cognitive 33): c-fnptr-synthesizer.evalConditionals has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 13). Of this number, 30 points are the body\u0027s own statements and 3 belong to 2 function items 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"93947e0cccc3572cb8b0d961d9bed5e2df6a8023aa02596f88542e30f5985f9f"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.collectQueue (cognitive 33): tier-synthesizer.collectQueue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 14). Of this number, 32 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"40191ec70d9612757ad51c2612108c7a2cf56d25d43e46cbad4de08fa2379087"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.nixLeadingPlainSegments (cognitive 33): callback-synthesizer.nixLeadingPlainSegments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (6 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cee3b1dbadf071bc68e6a7a40b89803479c152bad51ed7b5a50284d76de266d"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowPass.flow (cognitive 33): FlowPass.flow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). Of this number, 26 points are the body\u0027s own statements and 7 belong to 2 function items 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa655db61d72dbe2c898c890ac5cdb68a06f241c8c405ce3122724a4ee8f5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runUpgrade (cognitive 33): index.runUpgrade has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 6 (11 pts), error handling 5 (10 pts), if/else 7 (9 pts), boolean chains 2, match/switch 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":"src/upgrade/index.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f6529629f69c7c0571309e1ae9546a39424b16e22e1d11ca5db960772b1684"}},{"ruleId":"D2","level":"warning","message":{"text":"effects.classifyEffect (cognitive 33): effects.classifyEffect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/effects.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a029798b61954f2ca62cdeabe013dc4e0bf18a596b1adad44726fa6ee5bde3"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps.link (cognitive 33): steps.buildSteps.link has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, ternaries 4 (nesting depth added 8). Of this number, 31 points are the body\u0027s own statements and 2 belong to 2 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":"src/ui-server/api/steps.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbcdbded93388a7e1b22429258df64daebd3dd8dbd94996cd5a1a828d42bd2f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow.buildFlow (cognitive 33): flow.buildFlow has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 11 (18 pts), if/else 5 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 3 belong 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":"src/ui-server/api/flow.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3e58b9872026a01caeea38a36ad236fed508ff37d0dcf7e727905e64cc6d85"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 33): Walker::extract_decorators_for has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (9 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e25ff113dc52b98006ba457dfcebbe2db4ed9c2a4630ccdc23b182c89c6438f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 33): Walker::maybe_capture_fn_refs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (3 pts), boolean chains 2, match/switch 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d768694bfade6da6f291513ba55b79a21a286f944c6a2bfd81c6f8f28b7106"}},{"ruleId":"D2","level":"warning","message":{"text":"writer-lock.tryAcquireWriterLock (cognitive 32): writer-lock.tryAcquireWriterLock has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 5 (9 pts), boolean chains 4 (nesting depth added 14). Of this number, 18 points are the body\u0027s own statements and 14 belong to one function item inside it that branches. 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":"src/mcp/writer-lock.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a36a6753aaf34625e5d6cc641786df9a6949cd2a54d84318f7ca5f0bfaa9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"query-parser.parseQuery (cognitive 32): query-parser.parseQuery has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (6 pts), boolean chains 3, match/switch 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":"src/search/query-parser.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa79d47e05513399ca40eebeabeef1e33bf61fa987138cb9520a61462672cf63"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.recordEnd (cognitive 32): pascal-preparse.recordEnd has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9852cbcccb78e99bae509d58a1032b161bd9ec5166aa1eaecb52da1cd16554b4"}},{"ruleId":"D2","level":"warning","message":{"text":"r.extractClassMembers (cognitive 32): r.extractClassMembers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 4, loops 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":"src/extraction/languages/r.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7d90ec6f25377ed92735f9fa6a7a49c72a5fda32c60035e86655d79a3d5dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-packages.loadWorkspacePackages (cognitive 32): workspace-packages.loadWorkspacePackages has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 7 (9 pts), ternaries 4, 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"677ab5734f654191b24ba674270b80caeb427224a9bf3207a1757d92b69fb5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-packages.expandWorkspaceGlob (cognitive 32): workspace-packages.expandWorkspaceGlob has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), ternaries 2 (5 pts), error handling 1 (3 pts), boolean chains 2 (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":"src/resolution/workspace-packages.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcc0dd213880bb6daa61ceda78e958aa551bb20733633615c263d3aa05f0684"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dartLocalType (cognitive 32): name-matcher.dartLocalType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 4 (9 pts), boolean chains 5, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":5980}}}],"partialFingerprints":{"codehealthFindingId/v1":"61073e162784cbe32ce9a35af446f63a103943145b383833935a0e69f02cc535"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinBraceFrames (cognitive 32): name-matcher.kotlinBraceFrames has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 2 (7 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":7140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1b287db13c47efc34d3e8b3240a39afafc78d70e033b2aafeb275000204163"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isScalaMemberInScope (cognitive 32): name-matcher.isScalaMemberInScope has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 8, ternaries 1 (3 pts), loops 1 (nesting depth added 7). Of this number, 31 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d58d87d998bec6f43e57db4aa8d5795c2211ec2995e42cf43ee6600b3bf893f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.objcMemberReceiverType (cognitive 32): name-matcher.objcMemberReceiverType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 4 (8 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 10 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6748a7c2a29730f3671b241b462904796720319bbf06cf8e8f2b6f9b4f38f00"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaArgumentFit (cognitive 32): name-matcher.javaArgumentFit has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 10, boolean chains 7 (nesting depth added 7). Of this number, 29 points are the body\u0027s own statements and 3 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14917}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9687d62f51ccaede20657a89d87e1e5d685759fe0669a4247e2933b52e2fccf"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppLibraryElementOf (cognitive 32): name-matcher.cppLibraryElementOf has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (11 pts), ternaries 2 (5 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":17528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1f7577a3f5ef40ea12d4303d944732c2be5ad827ce4710c6ee3b9d0ba17f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferPhpAssignedPropertyType (cognitive 32): name-matcher.inferPhpAssignedPropertyType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24142}}}],"partialFingerprints":{"codehealthFindingId/v1":"94396f4e7f08fbf85c09a76570862314907f74cf7687b2ba76d567e79ca0bac0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.swiftOverloadForClosure (cognitive 32): name-matcher.swiftOverloadForClosure has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 8, loops 2 (3 pts), ternaries 3 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 14 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db5dae0e85ad0ca9e8416aece7caebce282f5bd3f40191481fa6ef8ebc30ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"react.ownReturns (cognitive 32): react.ownReturns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 5 belong to one function item 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eff903afa0e565d2839b0ad3deeb292e539e2824c28974fbcc7c721623a45bb"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.rtkEndpointHandler (cognitive 32): TreeSitterExtractor.rtkEndpointHandler has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 pts), boolean chains 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df0ca9b3fe440a60e1a99fc5d6207873a57a11d2d3a10bfe6ed764e0ff9a911"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractTsTypeAliasMembers (cognitive 32): TreeSitterExtractor.extractTsTypeAliasMembers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 3 (10 pts), loops 3 (5 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4685}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c85b573cc9cb017c63fb28e9d65f7cd8042c782e1e2c97003d37e5b1056b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.readPascalTextRoutines (cognitive 32): TreeSitterExtractor.readPascalTextRoutines has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), ternaries 3 (7 pts), boolean chains 4 (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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9779}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b4bfd5765ba98d33aa6bfb73723009f1c859cf723b86399a14b0a2c0896736"}},{"ruleId":"D2","level":"warning","message":{"text":"index.collectGitFiles (cognitive 32): index.collectGitFiles has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (5 pts), ternaries 1 (3 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":"src/extraction/index.ts"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c96d91d9c4ab6731cd6ca12a4610cf3218eadac2ea6b72975271d734fe163c"}},{"ruleId":"D2","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges::processUnit (cognitive 32): c-fnptr-synthesizer.cFnPointerDispatchEdges::processUnit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges, c-fnptr-synthesizer.cFnPointerDispatchEdges::parseStructFieldsRaw, c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a64111687b42532096e36de861a831e31603e1dce4630f36f83db313d4e63f"}},{"ruleId":"D2","level":"warning","message":{"text":"const-alias-synthesizer.constAliasEdges (cognitive 32): const-alias-synthesizer.constAliasEdges has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (9 pts), boolean chains 6, 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee800fba50cab61ad64b591229d0dd23bc9f9fa3e6dcc8c208a9e5257306cff"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.sidekiqDispatchEdges (cognitive 32): callback-synthesizer.sidekiqDispatchEdges has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 11 belong to 5 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4665}}}],"partialFingerprints":{"codehealthFindingId/v1":"025aea3cad381d13031e6fe77ddc95fb8a2156533314f6b85484f25e25e45f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol-lookup.matchesSymbol (cognitive 32): symbol-lookup.matchesSymbol has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 10, loops 1 (nesting depth added 5). Of this number, 30 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"src/graph/symbol-lookup.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe9b132e55238f31c7b7b0287dbe85d8d9ac39cfce220da4a130bb22bd690f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleCallers (cognitive 32): ToolHandler.handleCallers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (6 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 12 belong to one function item 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":"src/mcp/tools.ts"},"region":{"startLine":3407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c34f30229c8990f4269c34c4a57b497c02878da7c780bef65f5fd3f6c6c2447"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGraph.getSegmentMatches (cognitive 32): CodeGraph.getSegmentMatches has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 14). Of this number, 29 points are the body\u0027s own statements and 3 belong 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":"src/index.ts"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc69f6fb26c4cf459c839a835694900438750f08f4515498407401bef460d063"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.mentionsOf (cognitive 32): screens.mentionsOf has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 7, loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 14). Of this number, 31 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":"src/ui-server/api/screens.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea829b3b154908db35ba2cdc1b7633ac5aec377d1ced1d8bf06f2899187abc37"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_object_literal (cognitive 32): Walker::extract_object_literal has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (6 pts), match/switch 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75874ea7483301bad4334df8068ef8bba41d56657efeb1d369489c61f337238"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit (cognitive 32): Walker::visit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/lua.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"382e9f356f4a5b0be8a9f4d75475fbb212f675da540eb414d4dbc5e02bd086ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_ts_type_alias_members (cognitive 32): Walker::extract_ts_type_alias_members has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"142bac51f0ef83bdffff0511a859be058b8969b61b8d6714b59d91a7ff1e46f3"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.searchNodesFuzzy (cognitive 31): QueryBuilder.searchNodesFuzzy has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (4 pts), ternaries 3 (4 pts), boolean chains 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":"src/db/queries.ts"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"340a55a59983b5f1d5fc304d202d9d395210daa4bee4ffffa37070410da8f910"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.cStatementLines (cognitive 31): c-cpp.cStatementLines has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 10, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee9f0a8b2681edde8f0907ddd911016c9da0c90f80388c9ae78946738be380a"}},{"ruleId":"D2","level":"warning","message":{"text":"dart.dartCallee (cognitive 31): dart.dartCallee has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4 (nesting depth added 17). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/extraction/languages/dart.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32b35078992a9035ff4c0b4e5d6fc01318288403d714b9f60eaf2ab25ec559b"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-methods.qualifiedCallableAt (cognitive 31): cpp-macro-methods.qualifiedCallableAt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 4 (8 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ca8d5a83c5f6aa299b338455535af849dab78146a18507687cb91b7bb301f"}},{"ruleId":"D2","level":"warning","message":{"text":"laravel.routeFileMounts (cognitive 31): laravel.routeFileMounts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (10 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a6e2ee85c22548ea3edab8cea5e104c41b160f5e2d755bc4e089783c3fdcbd"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.readString (cognitive 31): dart-libraries.readString has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-libraries.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb8038ed63b01eededcd59d1daf2bbc67a67d6048cab038c6822779af0f4587"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonAssignment (cognitive 31): name-matcher.pythonAssignment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"148aa7ddde95ad18433f5cb4ccd5635a0e770a8ff050050aa54abb10903c6901"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinReceiverTypes (cognitive 31): name-matcher.kotlinReceiverTypes has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 5 (12 pts), boolean chains 4 (nesting depth added 14). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7032}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0db037473857ee9e93ebcb595d394d8ed59022f677185b201b69c2856b0ab25"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goClosingBracket (cognitive 31): name-matcher.goClosingBracket has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":26544}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f877ade88dfdeca3d3ded4dc735e790891b9f01b3c3e10d057ef084e71062c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonParamAnnotation (cognitive 31): name-matcher.pythonParamAnnotation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 10, loops 3 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34408a62d6f53b9109726bcb5ae925d83a74f22c63b6258b6e1e1267ade1269"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.pythonStarExports (cognitive 31): import-resolver.pythonStarExports has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 5 (8 pts), loops 2 (5 pts), boolean chains 4 (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":"src/resolution/import-resolver.ts"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a2d7f4d4da0866d32db8b1aaa1305f24f1d14daeb47a60f40b67c7346ca75"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.extractJSImports (cognitive 31): import-resolver.extractJSImports has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (8 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76b1366ec89fe6daa80e502e7d59610835a200481d25d6a4bb3a1fc8ff16489"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-modules.nativeBinding (cognitive 31): expo-modules.nativeBinding has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 7 (11 pts), boolean chains 4 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/expo-modules.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0be5cbb8cda7d6625cbfc9cb3e7675bd89310b2d34670d681ef967906e6516a"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalCall (cognitive 31): TreeSitterExtractor.extractPascalCall has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 5, 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef4b74a466bf7d21445d23f54fb27fdeab8790f06492abab8841528d2ed78e"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.addPythonImporters (cognitive 31): module-importers.addPythonImporters has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 8 (12 pts), boolean chains 2, ternaries 1 (nesting depth added 11). Of this number, 26 points are the body\u0027s own statements and 5 belong to 3 function items 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":"src/resolution/module-importers.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"789681cdb9957b86cdbf45b98bc1573b7989808912868c51c5d2742cd8f84e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"next-proxy.compileMatcher (cognitive 31): next-proxy.compileMatcher has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (10 pts), boolean chains 2, 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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca40be5f244b8d199c484f583e83be9b4844b4210f51d62e999eb713389b961a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsxLexer.tag (cognitive 31): JsxLexer.tag has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, ternaries 1 (3 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":"src/resolution/jsx-code.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e64e585d4d3aecb55d3f3af797f2a4a39c782a1e2ff6a5631f472529b453ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWatcher.flush (cognitive 31): FileWatcher.flush has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, ternaries 2 (4 pts), error handling 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":"src/sync/watcher.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fab308b1f52c79ae9cd41435630baed20afe35208548cd94ca669c1ca9c13a"}},{"ruleId":"D2","level":"warning","message":{"text":"map.buildMap (cognitive 31): map.buildMap has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6, boolean chains 4, ternaries 1 (nesting depth added 9). Of this number, 28 points are the body\u0027s own statements and 3 belong 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":"src/ui-server/api/map.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52c68e71346b79002e70133d3c65ac465b131907eb412f8d7af9406b00fbf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_name_raw (cognitive 31): Walker::extract_name_raw has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 3 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eba34061d38e96cbfccda5b1861511e6fa7cbe0cfe92fa0079331533b9cc87"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 31): Walker::maybe_capture_fn_refs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 5, match/switch 3 (4 pts), loops 2 (3 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9d1e48af0af151b2163ef7f1c2af7c46946db21cfbc1b42f52b369e2c16565"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_fn_or_method (cognitive 31): Walker::extract_fn_or_method has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, match/switch 1 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2166eafc8fb6cf3b42cfd1d49557dd98e810d50d34076dc65087989c1cbaff"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::array_table_body (cognitive 31): codegraph_kernel::cfnptr::array_table_body has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c143cd9e690fb94a8f2251412edeb7d2437616e7299a82ae71265285610a10a"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.openBlocks (cognitive 30): pascal-preparse.openBlocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 2 (11 pts), boolean chains 1, 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4adff4aa96423bf7c7481bdf427b3d9feeee66f0f4424e5f1cc309e8c9f2904"}},{"ruleId":"D2","level":"warning","message":{"text":"razor-script.blankRazor (cognitive 30): razor-script.blankRazor has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, ternaries 1 (3 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":"src/extraction/razor-script.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d150f84828666e3eb59cb276c6beaf9e7569cdbc3f8279048b28b506e0a1ee6b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonScopeText (cognitive 30): name-matcher.pythonScopeText has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 12). None of this is in the body itself: all 30 points belong to 2 function literals inside it that branch (lines 824, 835). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"f114edc272a8604a2beab2c5e9f95dd6ed3cac11cd1cbc5e9ce4db35ffd6891f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonFieldType (cognitive 30): name-matcher.pythonFieldType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da957f82915dc08654e0da533157a38202bb54257336ef05972490782049e6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isSwiftCallTarget (cognitive 30): name-matcher.isSwiftCallTarget has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 13, ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"efecb8c0bf9661f33202b1d2e2abff1477b74d429194dab414a2ef3de8ab2a72"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustSiteType (cognitive 30): name-matcher.rustSiteType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 9, ternaries 4 (6 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12883}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d2f2ade45f723d1200f10ea9e93b021196d929f7a17af156b1ac379433fdf8"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jsBodyEnd (cognitive 30): name-matcher.jsBodyEnd has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 10, loops 4 (8 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5143cd447dac9c9e822a3d9b8f779bb4dfc6bebd4a07fad3eb54e8a4065d5fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchDottedCallChain (cognitive 30): name-matcher.matchDottedCallChain has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 3 (7 pts), boolean chains 5 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":20797}}}],"partialFingerprints":{"codehealthFindingId/v1":"01df68e2d2f861fe744134cfd2fff7cb76f20799e467b6b7a331475309dfb57c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonClassNamed (cognitive 30): name-matcher.pythonClassNamed has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 6 (9 pts), boolean chains 4, loops 1 (nesting depth added 14). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28217}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bac8fbf92d0996c238aea81965c615b3664fb9daa5d153bcf9cdac904b290e"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustFieldDeclaration (cognitive 30): name-matcher.rustFieldDeclaration has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 16). Of this number, 28 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd7cb072535f347cf667640bd92eee8002c5add85b272295ffb35459a6d8e8"}},{"ruleId":"D2","level":"warning","message":{"text":"express.handlerRefs (cognitive 30): express.handlerRefs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 5 (8 pts), boolean chains 6, 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d033f3d2a8d58007f04efb68bcbe8edebb43a09df90c9a05428ce9987d411b8"}},{"ruleId":"D2","level":"warning","message":{"text":"swift.resolveVaporHandler (cognitive 30): swift.resolveVaporHandler has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, ternaries 3 (7 pts) (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 15 belong to 7 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18bc98c0c8f02aa676aa12f8d4158a97d0411f00a78d0727e391e765a7bc8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.visitPascalBlock (cognitive 30): TreeSitterExtractor.visitPascalBlock has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 2, 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9529}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf07176676170fd06c173c5b2009426db8ac5f7e03c0abdf00bac030a293f3"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.reactRenderEdges (cognitive 30): callback-synthesizer.reactRenderEdges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 14). Of this number, 29 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c51a4ad7720f56c8fc50194d2b7205cd6632831b2f2506a20d3acb61d665623"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goImplementsEdges::methodArities (cognitive 30): callback-synthesizer.goImplementsEdges::methodArities has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 5 (11 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 shape REPEATS in the file: 3 other methods here (callback-synthesizer.goImplementsEdges, callback-synthesizer.goImplementsEdges::wantedArities, callback-synthesizer.goImplementsEdges::methodTypes) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d74c7dd52265d98357177efe94c88e0dd55c2907b5c922144234bc8eb8566a9"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.fabricNativeImplEdges (cognitive 30): callback-synthesizer.fabricNativeImplEdges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (8 pts), boolean chains 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb987ec5f790183315186bd417bc266ccb4f841b2a10647f87d41f8f6a0adcda"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.mybatisJavaXmlEdges (cognitive 30): callback-synthesizer.mybatisJavaXmlEdges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, loops 3, 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"97edcce62b13d1dfcc1561337d30a483e79987ea8f749a84be7dfdcfb18656d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.changedDefaultExports (cognitive 30): ReferenceResolver.changedDefaultExports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 13). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/index.ts"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08ad72379892d809e1e2974027271b00fcc2a7619a369f68aacb4bf996fea27"}},{"ruleId":"D2","level":"warning","message":{"text":"query-paths.stripWrapping (cognitive 30): query-paths.stripWrapping has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-paths.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"382b508a727edb551efac5f076abb9277521768bf9e22bcdab6cbfe72f43fdac"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.computeGraphRelevance (cognitive 30): ToolHandler.computeGraphRelevance has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 7 (14 pts), boolean chains 1 (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":"src/mcp/tools.ts"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"34713cdf9dd580ddc7765f5852a577f71acb0a5d3054d63232c821031d2f7b79"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::cpp_stack_constructions (cognitive 30): Walker::cpp_stack_constructions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e89e63ab07f0df8684cc3142caf32adab9beabd12d551cc672d453d9d89f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_class (cognitive 30): Walker::extract_class has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8115efdad9494c84758cc5cbe12151fd2dfd33c6970a4eff531dbb7e5a141bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::find_vue_store_collection_objects (cognitive 30): Walker::find_vue_store_collection_objects has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), match/switch 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279ceccdc2031467609f45bc182d148afddcffb3cff13131e97f66324ff07ba"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_fntype_typedefs (cognitive 30): codegraph_kernel::cfnptr::scan_fntype_typedefs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"496c42a95981a51cb40294a3317de05a59fa4989066243d336c68bfb07841d70"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::alias_line (cognitive 30): codegraph_kernel::cfnptr::alias_line has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 7, loops 3 (4 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"583c0a26ea61154092cb12abb5f1a183023f56e0e0e8afc8c16fc5ac33a4c031"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.findNodesByExactName (cognitive 29): QueryBuilder.findNodesByExactName has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (10 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ff9f0ebc08254b95e2e59d066155df99c9ab2a19f2d96b44b11fd3c845dac0"}},{"ruleId":"D2","level":"warning","message":{"text":"kotlin.isFunInterfaceNode (cognitive 29): kotlin.isFunInterfaceNode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 5, loops 2 (4 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5213176a649ccbafc5fe8499d19c9a4bbd5c4a77810f980e60ca064844bb6d"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.wrapAlternativeStatements (cognitive 29): pascal-preparse.wrapAlternativeStatements has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), boolean chains 5, 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd9f30753df74857927fcd142915371c0c3585d6a02e0bcf4da6ef109fcc7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.yamlPathDependencies (cognitive 29): dart-libraries.yamlPathDependencies has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-libraries.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc85c148dc3f1bc72646c58add61f20ab4db314d3f91c64c55a12f47740c7cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dartFieldType (cognitive 29): name-matcher.dartFieldType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), ternaries 1 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":6128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe6febfb60d21c375da9254d1a3a1f647d5f50dffb1e4536fbbe263b385096d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dartMemberOf (cognitive 29): name-matcher.dartMemberOf has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 2 (7 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":6301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3728c05fdd6a6c0eae883862c8b0352200151b59aa449470914aa5a97afb0bf"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustUseTreeBindings::read (cognitive 29): name-matcher.rustUseTreeBindings::read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, loops 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9853}}}],"partialFingerprints":{"codehealthFindingId/v1":"612396982a1bb4a7cdb5b5c03724c1f7048aaf916d64f7c066431eca33d18bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustReadPathDecls (cognitive 29): name-matcher.rustReadPathDecls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (9 pts), boolean chains 6, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c4fbbe6f9c94d5ab176f70306609aef3a2fa76f73906a8b78995cd0c95544d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferEsmAwaitedCallType (cognitive 29): name-matcher.inferEsmAwaitedCallType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23585}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bed2a54c620044c85f96ef2cab63ec6e738343d5d7e05de6e9c8fafcce9a12"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goFileConstraint (cognitive 29): name-matcher.goFileConstraint has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, ternaries 4 (5 pts), loops 2 (nesting depth added 6). Of this number, 28 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26348}}}],"partialFingerprints":{"codehealthFindingId/v1":"97004f9ff49194204b4f3f2fa6e9a20b026d787951ec7679f37fbebe7bd04473"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goTypeParamsAt (cognitive 29): name-matcher.goTypeParamsAt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 7 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab1dd44eb827963be1e65a25025eb210726917fc3a5f85d412240d89324fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.readBootstrap (cognitive 29): nestjs.readBootstrap has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 3 (8 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"178968556927bbe60f55d180338f555de2702fe4f29f4c4d236050ef9f802c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.matchPascalParenlessRef (cognitive 29): pascal-scope.matchPascalParenlessRef has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 7, ternaries 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f8fd26282cde8496bcf202cfd1293939d81be727bbd807867043a590c09336"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.blankStrings (cognitive 29): angular-template-synthesizer.blankStrings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 3 (11 pts), loops 2 (4 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4499efc9e44703ca33ec07925d4aa51d37eb7e834ba993fcb7102418168d5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.thisRootedCalls (cognitive 29): tier-synthesizer.thisRootedCalls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (12 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d82163c5b64c2167eef3cecb6ef260bc69f09b35b4398f38b9b46a4e0e77bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.withStalenessNotice (cognitive 29): ToolHandler.withStalenessNotice has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), error handling 5 (7 pts), boolean chains 4, 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":"src/mcp/tools.ts"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e26bc83bd37f38e3a677120dfa97751d8bc9795828cb37f93a33842301c3b50"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.indirectTestNote (cognitive 29): ToolHandler.indirectTestNote has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 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":"src/mcp/tools.ts"},"region":{"startLine":4289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3560af03bcc6d5165bd2cd1219919155aa1730fc7a9e325a13c6357429cf91"}},{"ruleId":"D2","level":"warning","message":{"text":"node.buildNode (cognitive 29): node.buildNode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 7, boolean chains 5, ternaries 3 (4 pts) (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 9 belong 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":"src/ui-server/api/node.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9614fcf328f274e7b960326803e39597ac2f2c1f3a68b4f3c901d07efa102300"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver-worker.port.on(\u0022message\u0022) (cognitive 29): resolver-worker.port.on(\u0022message\u0022) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 5 (9 pts), ternaries 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 13). Of this number, 24 points are the body\u0027s own statements and 5 belong 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":"src/resolution/resolver-worker.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf6562f5ec53570523152931094165f092b7b0c6d2519443e683bac6bc95778"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 29): Walker::maybe_capture_fn_refs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts), boolean chains 2, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb4542622ed64ce3ffd39fd698e187d0c62f317866868cdb095cf1fe1619e71"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit (cognitive 29): Walker::visit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts), boolean chains 3, match/switch 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb54b97d177729c74a50dd4be22681fa80b7462d4d1dfbfc6ea7d390fa431c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_value_refs (cognitive 29): Walker::flush_value_refs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3b1d3084be02e39a516c709e855b414e282a3496a8231dc506c0cdeb6d5b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cognitive 29): Walker::normalize_fn_ref_value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 1 (2 pts), match/switch 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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8e5bc6912193f998ae95af13d47f840f394ac1ab8d3ce82e572586efa6d1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 29): Walker::extract_decorators_for has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (9 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"4364a7b8d4d0b8d6e5a47bd649c123a6cd73263f562e5b81621ff606656c048a"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::docstring::preceding_docstring_with (cognitive 29): codegraph_kernel::docstring::preceding_docstring_with has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (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":"codegraph-kernel/src/docstring.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83723418410eb6d62b7eb4f98d29ac335be9aca118b0b4aab7f01ddeee2a38f"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-methods.cppMacroMethods (cognitive 28): cpp-macro-methods.cppMacroMethods has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 13). Of this number, 26 points are the body\u0027s own statements and 2 belong 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da68f36255f4717764a33001c4ed15bd958632d4194b9e5d355af3e4b4a2c14"}},{"ruleId":"D2","level":"warning","message":{"text":"strip-comments.stripErlang (cognitive 28): strip-comments.stripErlang has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), boolean chains 5 (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":"src/resolution/strip-comments.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"af002706e70037b81316007703a212e00674cb961c489a42cc42c0ad08b61ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.importedFilters (cognitive 28): dart-libraries.importedFilters has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 4 (9 pts), ternaries 1 (2 pts) (nesting depth added 17). 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"122b5fd63a6ae9dd90c31feadb92ca7d8844b5fd881541fe01540f6950daa4c7"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-namespaces.cppNamespaceMacros (cognitive 28): cpp-namespaces.cppNamespaceMacros has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-namespaces.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978f4260c95f37cae8656cbe7029a23b76aa6fbc3026f9ef226378469075a89"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.localDeclarationScope (cognitive 28): name-matcher.localDeclarationScope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, loops 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"226c4ee8a3466bbf462b9c7d22954fb54d739cc342c6542898514465c9249663"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinHierarchyAt (cognitive 28): name-matcher.kotlinHierarchyAt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 4 (5 pts), 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7094}}}],"partialFingerprints":{"codehealthFindingId/v1":"5797d5e9f46dc312acf56062c509871b30a6d3018c1405c1add3fe1d694ed881"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustPlacedByName (cognitive 28): name-matcher.rustPlacedByName has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 3 (5 pts), ternaries 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":10188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d157ac4b78848682fdafe7990f96a61a5c9a7bdcbaf055966c5f4f522357d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustTraitImplemented (cognitive 28): name-matcher.rustTraitImplemented has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 5 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13094}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98551def1d08d67724b18cc7af1cbe3ff03294136318c544aa1fed7661e93c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinQualifiedCallResultType (cognitive 28): name-matcher.kotlinQualifiedCallResultType has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, ternaries 2 (4 pts), loops 1 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 4 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21949}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9de949fe449bd9a16d84d4f9338cb60532db261e9f71f67fb8cb75caf7927ca"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferMemberReceiverType (cognitive 28): name-matcher.inferMemberReceiverType has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, loops 3 (4 pts), 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22818}}}],"partialFingerprints":{"codehealthFindingId/v1":"007feb98a7f67570697e737c64bdcba0b4b1a7ee09e2639b1bde91a4b63584bb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.findInheritedClassMethod (cognitive 28): name-matcher.findInheritedClassMethod has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (15 pts), loops 4 (10 pts), boolean chains 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":23063}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ec74d6994fe4356d3d0b5da91823333bb5940c221b5ea0ddb32a168df64deb"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.shlexSplit (cognitive 28): import-resolver.shlexSplit has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 6 (11 pts), boolean chains 5 (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":"src/resolution/import-resolver.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e784d2ac98de7dc9a22ee881b362570bfb8b75715168906677f5d8f4c84c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.stripJsComments (cognitive 28): import-resolver.stripJsComments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, loops 3 (7 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d20c74a270afe557087dc75c93133127007c6f839ad932c43ed7ccbb84463cb"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.destinationOf (cognitive 28): angular-router.destinationOf has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 4 (7 pts), boolean chains 6 (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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f72d033304f58cd965859668eef90487fd3a67a7dfcd8ddd42b621c7611274"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.resolveErlangGenServerTarget (cognitive 28): TreeSitterExtractor.resolveErlangGenServerTarget has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":5303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc24884a297e86cd88e5e1d10a5ea95fda74992b9b7eea4e4d4c1874db3c01d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.storeExtractionResult (cognitive 28): ExtractionOrchestrator.storeExtractionResult has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, ternaries 4 (5 pts), loops 3 (4 pts) (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. 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":"src/extraction/index.ts"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"518d79b96b88801248a1da6f756e7a6d8413dfa3e7764bd5dd029955f7f4949c"}},{"ruleId":"D2","level":"warning","message":{"text":"type-parameters.declaredValueParameters (cognitive 28): type-parameters.declaredValueParameters has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 17). Of this number, 24 points are the body\u0027s own statements and 4 belong to one function item 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":"src/resolution/type-parameters.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e98aa2da532eefba5f82f0c2d980c3d2dba289d3d6215633741deda1258e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts (cognitive 28): c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 4 (7 pts), loops 6, 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. This shape REPEATS in the file: 4 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges, c-fnptr-synthesizer.cFnPointerDispatchEdges::parseStructFieldsRaw, c-fnptr-synthesizer.cFnPointerDispatchEdges::registerStructValue, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fac2b82eb3d647de0b0d3221ec64e59d337b7366febee51dc2b47826022575d"}},{"ruleId":"D2","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges::registerStructValue (cognitive 28): c-fnptr-synthesizer.cFnPointerDispatchEdges::registerStructValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 2, 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 shape REPEATS in the file: 4 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges, c-fnptr-synthesizer.cFnPointerDispatchEdges::parseStructFieldsRaw, c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd1656d35a16bb370587a8201fbb3c01b38c1da0a08aa1eed7be9bb6413a64d"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.operandEnd (cognitive 28): tier-synthesizer.operandEnd has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 9, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abec61a3e0e4b1fb5428fe333395efd74590eb5bcb3f17c4e7cc1098d977a26"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.crossTierEdges (cognitive 28): tier-synthesizer.crossTierEdges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36f72f9d659ac5cf29325ea5ad6bb37247e7e242412b10b4822bdaad2e85da6"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.cppOverrideEdges (cognitive 28): callback-synthesizer.cppOverrideEdges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 16). Of this number, 27 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"8324a00987a34792f76c09ee790507011ae0d8285f5193997ee90d34cd28f1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.formatFilesTree (cognitive 28): ToolHandler.formatFilesTree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (6 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 10). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 2 function items inside it that branch (renderNode, a function literal at line 8927). 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":"src/mcp/tools.ts"},"region":{"startLine":8874}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35f7d309c4113fcdae39105bee459ac1a0396027f64d959b2207eea4edbc097"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.allocateExploreBudget (cognitive 28): tools.allocateExploreBudget has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (7 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 8). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function items 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":"src/mcp/tools.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"605245e38843722b99d6daaf609008df3525d194d6114af4c591c63bfe6ad43d"}},{"ruleId":"D2","level":"warning","message":{"text":"route-roots.routeRoots (cognitive 28): route-roots.routeRoots has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 12 belong to 6 function items 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":"src/ui-server/api/route-roots.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a696e3beda42642a1044650f2adae65571986be66ccfed1a70fc0d77ae54a5"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps.stepFor (cognitive 28): steps.buildSteps.stepFor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6 (9 pts), boolean chains 5 (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":"src/ui-server/api/steps.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"648b1dd6665dbde9ffc56f44bd93cdf7ab51165182e08b10d54038c113a4e3df"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::misparsed_generic_call (cognitive 28): Walker::misparsed_generic_call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 9, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c758b1e0ce6e704700ba97963d6387f13b8f7bcd69530b8aea2cb313bd0f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 28): Walker::extract_decorators_for has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bd5d6c829a27361ac6ae01c35f03f0a30d27c37d256ddb8b6f2da2758d9c59"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 28): Walker::extract_decorators_for has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1378ee1232b9f8b3a33ee05aa099c0c3004e4ebfd0c121df989863c459f7f58b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 28): Walker::extract_decorators_for has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d0d74e615a46c6f29da1093fd059806f66a994568a3e8c344affd8cb0cdb11"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_object_literal_functions (cognitive 28): Walker::extract_object_literal_functions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbac9ac7d62d3bbbcc15bdb787f6abdab570b56bc62af6fea83003a1ac7c172"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_pinia_setup_body (cognitive 28): Walker::extract_pinia_setup_body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e0f707781a2bd93538ec57c997203224f350d6642dbf372d6fcce40ba35f32"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 28): Walker::extract_decorators_for has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ed52069278c3b61c584b0bc86b7a9e2726acddbf05059711166a3f77f6189"}},{"ruleId":"D2","level":"warning","message":{"text":"query-utils.getStemVariants (cognitive 27): query-utils.getStemVariants has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 13 (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/search/query-utils.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"89606b87ab643e07eb0d7853fbefc805509cf05305315982c4a4e69d7c9f7ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-detection.hasGeneratedHeader (cognitive 27): generated-detection.hasGeneratedHeader has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/generated-detection.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e442ddae37c7b14682fc11ca1bebe4c2918f20e066ca9d332a7cba6eca834c77"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-sitter-helpers.getPrecedingDocstring (cognitive 27): tree-sitter-helpers.getPrecedingDocstring has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (7 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 9). Of this number, 26 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":"src/extraction/tree-sitter-helpers.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06bc153b6fc949be60d1403396cc9d4d6caf2096cb6a524c73a67714769ed21"}},{"ruleId":"D2","level":"warning","message":{"text":"java.synthesizeRecordComponents (cognitive 27): java.synthesizeRecordComponents has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/java.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7394c08995718af17f19053de7f4fde6a4caf56124ef0eeb352606392769dc39"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.emitModuleProvidersRefs (cognitive 27): terraform.emitModuleProvidersRefs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e041c9906a712bea8043f77abbeca1d6dd55045abe54af3885d51ecbc615acc"}},{"ruleId":"D2","level":"warning","message":{"text":"path-aliases.stripJsonc (cognitive 27): path-aliases.stripJsonc has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), boolean chains 6 (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":"src/resolution/path-aliases.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"402245e52da37a6f071daa28924c2fe5dbe12185bd79cf0af9a73e5f90f8cd4a"}},{"ruleId":"D2","level":"warning","message":{"text":"path-aliases.loadProjectAliases (cognitive 27): path-aliases.loadProjectAliases has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 4 belong 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":"src/resolution/path-aliases.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8a5467f36602c351dceda668fa9cfcbc67286be40f14b54c00229eaf266f47"}},{"ruleId":"D2","level":"warning","message":{"text":"swift-type-visibility.resolveSwiftTypePathCall (cognitive 27): swift-type-visibility.resolveSwiftTypePathCall has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 9, ternaries 3, loops 1 (nesting depth added 5). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to 3 function items inside it that branch (onPath, a function literal at line 401, a function literal at line 392). 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d542d7ea6079da23396aaffffe728095fe580c70d49ea2d9dc189687b8199636"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.matchBrackets (cognitive 27): dart-local-scope.matchBrackets has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 3 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ec0f739f93f73436b3508b367985a71a6d9c0a289f327926b20cdc95fff9d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isLexicallyReachable (cognitive 27): name-matcher.isLexicallyReachable has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 13, if/else 9 (13 pts), ternaries 1 (nesting depth added 4). Of this number, 25 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f7109378e7242d63e16a236e73a9fd5c8d5354f3dedc39d409b640aeb5b0e1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppScopeMethod (cognitive 27): name-matcher.cppScopeMethod has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 9, loops 2 (3 pts), ternaries 3 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 7 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18955}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c94254ad054ca6dd7a5ea7a466bc8804ece59a4c71195e4051fba62a002c51"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dynamicImportScan (cognitive 27): name-matcher.dynamicImportScan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (9 pts), ternaries 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":25526}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d5fd3e85b8a1b76da0f8e295ab547f3b4739c65ac80cb9dceea2a88fc030b0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchTsThisFieldCall (cognitive 27): name-matcher.matchTsThisFieldCall has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, ternaries 4 (6 pts), loops 2 (nesting depth added 6). Most of this is not in the body itself: 9 of the 27 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 30705, a function literal at line 30680, held, \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":"src/resolution/name-matcher.ts"},"region":{"startLine":30655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fabcbd594ebf899d1592e9e4e726efdd1faaa00e11cd2ec72076a5ad7323b53"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.getFileExportIndex (cognitive 27): import-resolver.getFileExportIndex has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 13). Of this number, 26 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":"src/resolution/import-resolver.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65afbf94d7e9cb363e7f13fd68e279538517fc8b822ed2fe70074eb8965dc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"react.statementEnd (cognitive 27): react.statementEnd has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 6, loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ab6db7cba1dcc2ca057b8ab083dfd2d34c08ab6c164467bd43b18861911595"}},{"ruleId":"D2","level":"warning","message":{"text":"react.exportedTable (cognitive 27): react.exportedTable has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 3 (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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ed7080cc9fda2118f0492011d79d0530c0879d122ac2ae79412fad238c3a23"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.staticString (cognitive 27): angular-router.staticString has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (7 pts), boolean chains 3, 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca05c923fef00385235f102f2903d8e1cf2bf86a7bfeb89c8c2d03d5ee8b670"}},{"ruleId":"D2","level":"warning","message":{"text":"index.collectGitStatus (cognitive 27): index.collectGitStatus has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 5 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 7 belong to one function item 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":"src/extraction/index.ts"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"b165fc156aab67b8dda8ceadca29dba1c70908c3b6256daea1a0f797e6c20832"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-constructor.constructorShape (cognitive 27): cpp-constructor.constructorShape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 2 belong 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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1421e587b9d986691e2c9c73d3ffc948a95af553b453493b23b73089295323"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.pairQueue (cognitive 27): tier-synthesizer.pairQueue has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 4 belong to 2 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcffb125fb0765a7229a3d4e19f6fc89809b472cba2ca6f6effa1f5aa341374"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.expoCrossPlatformEdges (cognitive 27): callback-synthesizer.expoCrossPlatformEdges has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"141e7549c90a4a622b0ef04ebe57a7a6872d16b1bfdab680676e933358a2b6d3"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.reduxThunkEdges (cognitive 27): callback-synthesizer.reduxThunkEdges has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 7, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). Of this number, 26 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7636db723c4ef1e80fb1e80c7771f1d83c35bb09f47552237847111ae08bf53"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamic-boundary-report.findDynamicBoundaries (cognitive 27): dynamic-boundary-report.findDynamicBoundaries has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, error handling 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9078c9ba4989653f5579bff88991de5915b96ccb92ec9a061a51c6597cc9943d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::create_node (cognitive 27): Walker::create_node has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b75933d0ba39fbf8761346545d209d8e2b636a39ebdead754b82829d9daed5"}},{"ruleId":"D2","level":"warning","message":{"text":"query-utils.extractSearchTerms (cognitive 26): query-utils.extractSearchTerms has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-utils.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfc171beb50f34bd014b5212939bb3a2cd8d4ad41e14a858e4b0f69592110b4"}},{"ruleId":"D2","level":"warning","message":{"text":"dart.dartMisparsedGenericCall (cognitive 26): dart.dartMisparsedGenericCall has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 9, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/dart.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1205e7e9828bf53928749fac45b5a040c90ae2dddc6bdc3e67031e117ffa94fd"}},{"ruleId":"D2","level":"warning","message":{"text":"erlang.handleAppResourceTuple (cognitive 26): erlang.handleAppResourceTuple has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 10). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/languages/erlang.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38ffe62212ae6523507cba53fb2b39459b2a33fac78160c86e1a005a287418f"}},{"ruleId":"D2","level":"warning","message":{"text":"CfmlExtractor.delegateScriptTag (cognitive 26): CfmlExtractor.delegateScriptTag has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, loops 3 (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 3 belong to 2 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d3185109c1e7443e11e6d3ce018698fe4ea0a4fd75fda57b178284d836d0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.pathDependencies (cognitive 26): dart-libraries.pathDependencies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 4 (10 pts), boolean chains 3, loops 2 (3 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdef15c00ec03f23cf25555d0e78ac013ed82697267901c6e5b7339750e7af27"}},{"ruleId":"D2","level":"warning","message":{"text":"c-feature-variants.evaluate (cognitive 26): c-feature-variants.evaluate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, loops 3, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 5 function items inside it that branch (shape::term, term, shape, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-feature-variants.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"734c9befa70f9eb2bddc9831c6614e79c91de0af52eb8a1fa5074dc6b5505412"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.luaLocalDecl (cognitive 26): name-matcher.luaLocalDecl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 9). Of this number, 24 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfba1a940468db400b8aa02ad2eef1ef8f59a9f14d7b76a68bb091463f9680c3"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.typeDartLink (cognitive 26): name-matcher.typeDartLink has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 5 (11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5797}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce58dc9ae343a094488c7a374c86b5526e3eeef35266d9b4d9165500f354c2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.scalaSupertypesOf (cognitive 26): name-matcher.scalaSupertypesOf has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 3 (5 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7814}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c9fe3f30b64da2ef3af2faca5dd13bd88b199aec2942524cbd8033f02c7413"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.csharpProjectUsings (cognitive 26): name-matcher.csharpProjectUsings has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (7 pts), ternaries 2 (5 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":8066}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d4b20d8b49edf78c930629bc6624b16379075a50cd654fe04bfad6e95f1980"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustUseScopes (cognitive 26): name-matcher.rustUseScopes has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 3 (10 pts), if/else 5 (9 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 6 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9975}}}],"partialFingerprints":{"codehealthFindingId/v1":"7261c329c333aabecd91f1293db2b775acfd9a31bfd061c57131a27007a652fe"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.bindsAtSites (cognitive 26): name-matcher.bindsAtSites has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":13979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e544583ad335776d92c0e0f4f681357c3f0bf505baba5ea8ccf3d7c81736f5"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchKotlinCallResultCall (cognitive 26): name-matcher.matchKotlinCallResultCall has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (10 pts), ternaries 3 (6 pts) (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 6 belong to 4 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21056}}}],"partialFingerprints":{"codehealthFindingId/v1":"98036aab7ccb1c07f25d38ada6cbf70b087e4e10f48d3e306bb5c93f1d78b33c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferLocalReceiverType::scan (cognitive 26): name-matcher.inferLocalReceiverType::scan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (name-matcher.inferLocalReceiverType, name-matcher.inferLocalReceiverType::matchLine) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":23497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2adad441b3b08033ae29d653e4c1fa47f9e2e087a1ab73acfd05f9d2a78b903"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustWrittenCallReceiver (cognitive 26): name-matcher.rustWrittenCallReceiver has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b549030b560a87bc166972b106965b6f3011ba0f599edca14884885da2cc08b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.tsFieldElementType (cognitive 26): name-matcher.tsFieldElementType has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, ternaries 3 (6 pts), loops 1 (nesting depth added 6). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30024}}}],"partialFingerprints":{"codehealthFindingId/v1":"60858bd30b30e795c9cc21c6006829c0e19cd75815973705779737a94bcbaa73"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.tsFieldCall (cognitive 26): name-matcher.tsFieldCall has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (3 pts) (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 8 belong to 4 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30827}}}],"partialFingerprints":{"codehealthFindingId/v1":"a996829c206b41eca221acc69bf137a59fd9883328ce112f50668888f019f538"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchReference (cognitive 26): name-matcher.matchReference has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 12, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d746e2684ee9a9c46ec71fc924df82c050a123a672a6901402e2a12ce3444da5"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.readCompileDbIncludeDirs (cognitive 26): import-resolver.readCompileDbIncludeDirs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"84876874502ed3fd6b92cc4666da13e6658648063d347d19b0908325ab140ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"react.blockValue (cognitive 26): react.blockValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, ternaries 1 (3 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7363fdbd843edfb8adb613a8728ce3f973d4bacb0fbd083c6f775ed4e136c5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.vbReceiverPath (cognitive 26): TreeSitterExtractor.vbReceiverPath has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5 (9 pts), boolean chains 4, match/switch 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"2880102c6fe16b675a2ce6770ffc058e0db733fa4d43b9235067f8f8fe230b66"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractDecoratorsFor::consider (cognitive 26): TreeSitterExtractor.extractDecoratorsFor::consider has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 2, ternaries 1 (2 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 shape REPEATS in the file: one other method here (TreeSitterExtractor.extractDecoratorsFor) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5322179d93d4938593157bae98d213c04198fc0ed22407d0f308d7fda2285b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseWorkerPool.onMessage (cognitive 26): ParseWorkerPool.onMessage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (10 pts), boolean chains 3 (nesting depth added 12). 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":"src/extraction/parse-pool.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0179459ad233088020efb1712255ada674e6a260fa8eae559de5e9a3c06a1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.nestedRoutineInScope (cognitive 26): pascal-scope.nestedRoutineInScope has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, loops 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdabccadc31fd25b4d3a76a7c1a34cf2fcccbd20f8b28dec5e952f23de5a141"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.typesNamed (cognitive 26): pascal-scope.typesNamed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (10 pts), boolean chains 3 (nesting depth added 13). Of this number, 18 points are the body\u0027s own statements and 8 belong to 2 function items 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bbe65761031cbfe974fe2660a176341eb4062359bf74656b11529d41db8f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.clientPath (cognitive 26): tier-synthesizer.clientPath has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3 (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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9166d98f405419311ed9bb2412f894bd540243942917f01b980fcfcd51c3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"JsxLexer.read (cognitive 26): JsxLexer.read has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 4 (10 pts), loops 2 (3 pts), boolean chains 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":"src/resolution/jsx-code.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ded34a3a6a72acd08ce63e008928fc0e3abc64bdd2011903525115f8ae741b5"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.arkuiStateBuildEdges (cognitive 26): callback-synthesizer.arkuiStateBuildEdges has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27abdcfb8a2abe839b045673013f821f845d43efaf367bed469bd01552ee9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowPass.run (cognitive 26): FlowPass.run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/parameter-flow.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"613c7fbc09890a775cbebe9d9e5de3edd674c0e8ff541309d5a872ff38e59293"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon.start (cognitive 26): Daemon.start has cognitive complexity 26 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 7 (9 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 6 belong to 2 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":"src/mcp/daemon.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac68218c6fa02095872179c627a81b70efe7689ae89068fcb094d7483cb65be"}},{"ruleId":"D2","level":"warning","message":{"text":"search.buildSearch (cognitive 26): search.buildSearch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 6 (8 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. 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":"src/ui-server/api/search.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b1f8e344a4b1418a2dde9661f83c05c663d48763964781ccd063289cc08127"}},{"ruleId":"D2","level":"warning","message":{"text":"node.summarizeTestCallers (cognitive 26): node.summarizeTestCallers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/node.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3491f21ba085d2ef63f2aa0cc8e6a0bd151085088082ace79458193c86dc99"}},{"ruleId":"D2","level":"warning","message":{"text":"toml.layoutOf (cognitive 26): toml.layoutOf has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 8). None of this is in the body itself: all 26 points belong to 2 function items inside it that branch (a function literal at line 321, blockOf). 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":"src/installer/targets/toml.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cce3d7f2f9b78eb399500b93d2fb55adaaa75ba02ba4e7c3504b5d5027fc05"}},{"ruleId":"D2","level":"warning","message":{"text":"program-model.buildOrderModel (cognitive 26): program-model.buildOrderModel has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6, boolean chains 3, ternaries 2 (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 function items 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":"ui/src/lib/program-model.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c9d5306a2f3711ef0a47b8e9d092ebfbd8cc10f9446500d986bd641296013d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 26): Walker::maybe_capture_fn_refs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), match/switch 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee162379d6e3d651cdfc6d6896dc9ac4c71feec0330f76d448b64726aca8bb8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 26): Walker::extract_call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d55edbf514b544c1bace35fb877dbe09a763153afb370bbe1103000e28648d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_modifiers (cognitive 26): Walker::extract_modifiers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1cb34bee5185cc5c74fcb75a68a80ec86c03c4ba757bd1930a6341b1894948"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cognitive 26): Walker::visit_for_calls_and_structure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bcbd734d58301e9e488e4f6256779179a44dc33134dec4361e6c2fee5e6b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::rustlang::receiver_chain (cognitive 26): codegraph_kernel::rustlang::receiver_chain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"79479d3f3983b3c8d93a7bda54186f296751566f4e97ab31a55dc7f0906763d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::tsjs::classify_ts_class_member (cognitive 26): codegraph_kernel::tsjs::classify_ts_class_member has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (5 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"064f63abdd61fbe1f40f02bd853b3244b2f3d1e84f7b4e59fbfcd72525a66bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::tsjs::fnref::capture (cognitive 26): codegraph_kernel::tsjs::fnref::capture has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 pts), boolean chains 2, match/switch 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":"codegraph-kernel/src/tsjs/fnref.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cc6f74a358365a0deedf7d537105c070edd688d809bca61db539778c506d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.getRetryableFailedImports (cognitive 25): QueryBuilder.getRetryableFailedImports has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 3 (8 pts), ternaries 1 (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"src/db/queries.ts"},"region":{"startLine":4978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ed7a5968b3cdfd0af012ced7689f73ba088d5529dcc524eaa5a80f501cb04f"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.anonymousRecordDeclStart (cognitive 25): pascal-preparse.anonymousRecordDeclStart has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69d02317566a571b8cb191522aee76ee522350476902b3050ea388d20b9d367"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.providerSelectionFromExpr (cognitive 25): terraform.providerSelectionFromExpr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/terraform.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"85654cf09a54d82dd33790043f735a1f32acc04a566469a2ae55648bf5d02cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"laravel.routeGroups (cognitive 25): laravel.routeGroups has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (3 pts), boolean chains 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f99b44fa9947aff52bce6c94235ff24831eb96a8ea307b8875608d1087ebd8e"}},{"ruleId":"D2","level":"warning","message":{"text":"swift-type-visibility.declarationFor (cognitive 25): swift-type-visibility.declarationFor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1260bf95922581bf3168fa4e6c0df2cb068859dd53cd7b33cdb921ec736c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.gateLanguageMatch (cognitive 25): name-matcher.gateLanguageMatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 12). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd8d037cf61a212ac22ce9cc7ade05f000fd78a481267cf53a99b8d78dd2a49"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonBaseList (cognitive 25): name-matcher.pythonBaseList has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d987f4b304c111974725fe141e09625ac1022b58a0c6c755f74fea6ea0d0cdbb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonFixtureReturnType (cognitive 25): name-matcher.pythonFixtureReturnType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 9). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"145eebe9fcf90068ae33a290de13e9cca6c71d116fb87967834011fd1578c660"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustWalkModules (cognitive 25): name-matcher.rustWalkModules has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (10 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10435}}}],"partialFingerprints":{"codehealthFindingId/v1":"96baaa735013896eb1d085724069e79f6d615ed782e10c0233e74d8e900bd8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchEnclosingScopeMember::inheritedThrough (cognitive 25): name-matcher.matchEnclosingScopeMember::inheritedThrough has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (name-matcher.matchEnclosingScopeMember, name-matcher.matchEnclosingScopeMember::inherited) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":14164}}}],"partialFingerprints":{"codehealthFindingId/v1":"798a8effc9052e31e4c3e3a0390c1571c18e1f68c8b1a24d35ac04b8007f9aad"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinDeclaredTypeIn (cognitive 25): name-matcher.kotlinDeclaredTypeIn has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), ternaries 3 (5 pts) (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":"src/resolution/name-matcher.ts"},"region":{"startLine":21882}}}],"partialFingerprints":{"codehealthFindingId/v1":"911eedbe452e04ad3dedf34a7e611146493f2b70855ada29cc145836061ef88b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonDefStatements (cognitive 25): name-matcher.pythonDefStatements has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":27962}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b19a0a6a84f7c5fdd1fbf8a45006aa050c24177c5749bbddb3f3b65243b8c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.tsCallEndsStatement (cognitive 25): name-matcher.tsCallEndsStatement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 5 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":30254}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dde2b0ea284ea7eb9832108d70270846636a7647b231fc62f496926a295765"}},{"ruleId":"D2","level":"warning","message":{"text":"express.topLevelArgs (cognitive 25): express.topLevelArgs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/express.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7026f3266b2cea566f280032cd9118929ad3688085773e53911194ade46fa43"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.commandsHref (cognitive 25): angular-router.commandsHref has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, loops 1 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 3 belong to one function item 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"24294aa5b7812b6c3b59f9843c7f04d92b2f1f6a7e40bc6e9e111a793511ebdb"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractEnum (cognitive 25): TreeSitterExtractor.extractEnum has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), ternaries 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54ca52c8aa51f4a6705aa931d43fa3845872b125a539cd258f14345c81cd72e"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.findVueStoreCollectionObjects (cognitive 25): TreeSitterExtractor.findVueStoreCollectionObjects has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":3863}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c17b0d34b2310a151e95d3e3c4c20d4d53aec62b333210edd1555d3071158d4"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.outrankedImports (cognitive 25): module-importers.outrankedImports has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/module-importers.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8f0950f1ccc74d2e2f031398711c4f84d74d3e98b2326d3a069fd6c993cf4c"}},{"ruleId":"D2","level":"warning","message":{"text":"next-router-synthesizer.nextProxyEdges (cognitive 25): next-router-synthesizer.nextProxyEdges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (8 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 11). Of this number, 24 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"70807f1f14ef96f00dee83de18bf8d96aadec9d37199fd9af513d347ab1728ce"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.tauriEdges (cognitive 25): tauri-synthesizer.tauriEdges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 10). Of this number, 24 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d83905906dfe0892b338296600ddf2c8766f91dc3ca59e5d683b442007a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.callAt (cognitive 25): branch-guards.callAt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2cc525f8bae0e7af687670b3befd6fabdf4dfd474fe6f8757d17c29815b949"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamic-boundaries.scanDynamicDispatch (cognitive 25): dynamic-boundaries.scanDynamicDispatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08c164f25213d5e9ab761b43de597f4f6222c05eef208b1fb3b5fea7f7f9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dead-code.ancestorsOf (cognitive 25): dead-code.ancestorsOf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (8 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":"src/graph/dead-code.ts"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bf62a697da058068e3268dd482a590dc3d1d1f69eb5084bfb701af796f0957"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps.effectLink (cognitive 25): steps.buildSteps.effectLink has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10, ternaries 7 (9 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/steps.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b56eb293f1629433b04239529e6acd8454a7b1cf88d04d132ed4637f54ac0b"}},{"ruleId":"D2","level":"warning","message":{"text":"toml.scanTomlStatements (cognitive 25): toml.scanTomlStatements has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 3 (8 pts), boolean chains 2, 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":"src/installer/targets/toml.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aac29285aaea27e4f9a06a25a5e299c5d3cce4fd9f2cc9dec80ac86030b49c"}},{"ruleId":"D2","level":"warning","message":{"text":"toml.scanTomlLine (cognitive 25): toml.scanTomlLine has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (5 pts), boolean chains 3, 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":"src/installer/targets/toml.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"41afe0f59cc374b2574c92de19efe6fbddabb950336cd3b70ebdd5cce7746244"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cognitive 25): Walker::visit_for_calls_and_structure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5, 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a3b91ae63cab5e46d54559413529dc85c311f1fef83e7a8348e2cd2aa3fe22"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::parse_struct_fields_raw (cognitive 25): codegraph_kernel::cfnptr::parse_struct_fields_raw has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e69c27947fdcce4da4c433e645449ad0db99d4b5ff68474451cf112f9523ed"}},{"ruleId":"D2","level":"warning","message":{"text":"typescript.classifyTsClassMember (cognitive 24): typescript.classifyTsClassMember has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 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":"src/extraction/languages/typescript.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1280031de66a1d52b4092f0a86e35d7ae08101009204962f0e563cdeeea17345"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankLoneMacroLines (cognitive 24): c-cpp.blankLoneMacroLines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6034becf563434f0c7fb8d7c23d366182f1b73ce972117239632d45ebd6ac"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.commentOrStringEnd (cognitive 24): pascal-preparse.commentOrStringEnd has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b406967bde594976340d047353568b687230730028eb43e04e73224485176547"}},{"ruleId":"D2","level":"warning","message":{"text":"LiquidExtractor.findTagOccurrences (cognitive 24): LiquidExtractor.findTagOccurrences has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/liquid-extractor.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c69252fbdfeb3253bf223753409456cc1ea3b474c954bbd4af06abd0b7bf015"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.splitParameters (cognitive 24): dart-local-scope.splitParameters has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae23752be5c53db804679de510385cdd9b4ab08ee977fe1c3d92fde3ee055520"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.bindingOn (cognitive 24): vbnet-receivers.bindingOn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 5 (9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a87c14916c9b0022a442c8fffe1b6521ec3d3e9b1908b79a3d51044eefbe8e"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.memberOn (cognitive 24): vbnet-receivers.memberOn has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 3 (6 pts), if/else 1 (4 pts), boolean chains 2 (nesting depth added 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to 2 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c279ca84ca33361bf737d6decd953c690e0b3ad8344f698920ec91dd29417277"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-type-aliases.baseClassesOf (cognitive 24): cpp-type-aliases.baseClassesOf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ca15dee19b6bcca2810e89a7a3a91396f9d514640623ea53916bc2b04bcc3f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.luaMemberIn (cognitive 24): name-matcher.luaMemberIn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 5 belong to 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ed909c26d5ad5ac6afdb32eb1c35df81deb3665c5111e49f395aed88dbba7"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.typeDartHead (cognitive 24): name-matcher.typeDartHead has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (8 pts), boolean chains 7 (nesting depth added 6). Of this number, 23 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6530f41f97d4ba7fc37dcc6c717e539370b25b4c7803b7a42bddeebc0f74a0da"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustCrateRootModule (cognitive 24): name-matcher.rustCrateRootModule has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (12 pts), boolean chains 6, if/else 6 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10307}}}],"partialFingerprints":{"codehealthFindingId/v1":"475d833edee1cea6b1b925cfc9c6811700b9559dda5648961724da551579c729"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustFunctionReturn (cognitive 24): name-matcher.rustFunctionReturn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12512}}}],"partialFingerprints":{"codehealthFindingId/v1":"796250d46f99ecc51360fb65c359d9b9a8f14362510046569d6486bd27d78f21"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchDottedSupertype (cognitive 24): name-matcher.matchDottedSupertype has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10, loops 1 (2 pts), ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 15019, a function literal at line 15013, closeness). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8ce83711ab32b8b9a13b4d2abd9d76d8f8dc22a2a63ad761e955ceaccbe727"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.memberTypeThroughHierarchy (cognitive 24): name-matcher.memberTypeThroughHierarchy has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":22875}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcad7c6f5a6cc6c98fbcbd4855babe9254a98f9d1f92e9d8975ee23cc9351ab"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jsScopeFile (cognitive 24): name-matcher.jsScopeFile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (9 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23785}}}],"partialFingerprints":{"codehealthFindingId/v1":"63659ea589841aec330fbdbf250f43b94729d2b3368f12f04e7f0c436af06eab"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonValueEvidence (cognitive 24): name-matcher.pythonValueEvidence has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 4 (10 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":27839}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e005f7f20a1d2a9205963f67f42ea52ab1b330c16c8218d0fcb866ec06d8974"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchPythonAttrCall (cognitive 24): name-matcher.matchPythonAttrCall has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 1 (2 pts), 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b895f0d83a6e1f0b5b56aa774838ae125b9d00c9fca817fb37906d75337171b3"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchRustSelfCall (cognitive 24): name-matcher.matchRustSelfCall has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2a90f150bfe606620a98f422831d76c64495e15286db34b0a3d112495e80f4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppParametersGivingDefaults (cognitive 24): name-matcher.cppParametersGivingDefaults has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts), boolean chains 4, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32997}}}],"partialFingerprints":{"codehealthFindingId/v1":"5312b55a4ce2aeb8e42076bc2cb4aa9e5bb3da1062e3284a1e4d1c5ec5f88d55"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.pythonReopenScope (cognitive 24): import-resolver.pythonReopenScope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (7 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 11 of the 24 points are its own statements and the rest belongs to 2 function items inside it that branch (moduleNames, a function literal at line 1041). 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea17b9cf3a505af74216931edfdecc04620f03e1b4bcdc9dd54b01bd53ebbcb"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolveModuleImportToFile (cognitive 24): import-resolver.resolveModuleImportToFile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (3 pts), boolean chains 2, 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3916}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9ec9e6b9d15a7dae0f94c2a376a2640464bf128b37ac1d533c21e1c0d27909"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.jvmImportedMember (cognitive 24): import-resolver.jvmImportedMember has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 3 belong to 3 function items 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9465c18d34efa5d4b8fd500b78487e6db2fb651355a5cbc709353020ed14a4"}},{"ruleId":"D2","level":"warning","message":{"text":"express.regexLiteralEndAt (cognitive 24): express.regexLiteralEndAt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, loops 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/express.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"554c86d6879440c26ac00593404943c8e09ae166c77d372438ee2c6d2e6b117d"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.decoratorChainStart (cognitive 24): nestjs.decoratorChainStart has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"409f09a2cc10dacc5459e47cf4db65adfabc3bb69d3bfca007b6f574db3df84f"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.splitTopLevelObjects (cognitive 24): nestjs.splitTopLevelObjects has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"716637591b0596a6431d278e60236687875197d2551ea742e6ccc20409da348a"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router.indexAtDepth0 (cognitive 24): expo-router.indexAtDepth0 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, loops 2 (4 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc4db21b03f4b39994e2dc6b8f2d45e6d706d07006eda136bc8b4bf6eb0b7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-router.vueRouteTable (cognitive 24): vue-router.vueRouteTable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6be6466857f837f46a61b4557a48f8c6b7484a58001612ed202426e27a8c6eb"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.angularMounts (cognitive 24): angular-router.angularMounts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function item 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b013150f9a95d67078ea3211d7cbd86e431df54f13e59283dfbfb24d361e44ff"}},{"ruleId":"D2","level":"warning","message":{"text":"fabric.extractFabricNodes (cognitive 24): fabric.extractFabricNodes has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (19 pts), loops 2 (3 pts), if/else 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"051d09cc8bf1a92160ac9b7e6d9ff5f39c8cc7f5e56a8faa1dfdd59358875081"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extract (cognitive 24): TreeSitterExtractor.extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, ternaries 1 (2 pts), error handling 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da715e25dba488a7965447c2cbbab21eaef21da4b35520bad18f94e0e2bb49b"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractObjectLiteralFunctions (cognitive 24): TreeSitterExtractor.extractObjectLiteralFunctions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (4 pts), boolean chains 3, 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5697b884a4f92de4c5aac19c1fb671e93ef4032a7e2ba50c1263fc1a47ff922a"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.functionReturnedObject (cognitive 24): TreeSitterExtractor.functionReturnedObject has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 11). Of this number, 15 points are the body\u0027s own statements and 9 belong to one function item 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cf90cc4ae647a95149465145b6468ee8cfb68e1b3e4af9af198cdeac940470"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractPascalParenlessCall (cognitive 24): TreeSitterExtractor.extractPascalParenlessCall has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (8 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":9408}}}],"partialFingerprints":{"codehealthFindingId/v1":"409edd260457c2391b9d6d37de302d315cf439aac4d968c0b1728363fdf97012"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router-synthesizer.expoRouterReturnEdges (cognitive 24): expo-router-synthesizer.expoRouterReturnEdges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (6 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":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669b51881391325e702972be73e9818206d27364c4fb2b6694def4e952b76d3"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.collectEvents (cognitive 24): tier-synthesizer.collectEvents has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d58809249e6a5d94637db3a23e763a44551737f1b21b6af39cde0d05a95f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.kotlinExpectActualEdges (cognitive 24): callback-synthesizer.kotlinExpectActualEdges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0996eedb4d7fff03ab41ba5ff4c53d2df8485a88fcc2a895511accbead87cc4e"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.guardsInTree (cognitive 24): branch-guards.guardsInTree has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf8dd575e89c916a189139f68e3fa4ec1e9e466f95a5774ea09bbd26c5b6cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"answer-freshness.validateAnswerFiles (cognitive 24): answer-freshness.validateAnswerFiles has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/answer-freshness.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf95d244135e00f27b43f14e5029f4eef0216e68a8d3c55215f439449589cd"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphQueryManager.getContext (cognitive 24): GraphQueryManager.getContext has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (7 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":"src/graph/queries.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f00554cd66ef69f9632241ef770880bac5015c729b661726486ebb0e9084c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.formatContextAsMarkdown (cognitive 24): formatter.formatContextAsMarkdown has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (9 pts), loops 4 (8 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 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":"src/context/formatter.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bfb14bd7b0f321006bed0cec8d28cc4cdcde0aebf3f9cdd3791398205f8280"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextBuilder.extractCodeBlocks (cognitive 24): ContextBuilder.extractCodeBlocks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4, ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4d581b86183f020755c206c45daeac523e0267c1906db0eef989a365e3e502"}},{"ruleId":"D2","level":"warning","message":{"text":"wire.groupRelations (cognitive 24): wire.groupRelations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 10). Of this number, 23 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":"src/ui-server/api/wire.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2fbd95aa7b975ecc64263a517f4757e2c2c47251dd0eec9e17ddc62e760c9c"}},{"ruleId":"D2","level":"warning","message":{"text":"parse-worker.\u2026.on(\u0022message\u0022) (cognitive 24): parse-worker.\u2026.on(\u0022message\u0022) has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (5 pts), boolean chains 4, 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":"src/extraction/parse-worker.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e12e1bfb2e5feec83af3a7e28810a71e277b29ebde3be4a251950bdd634ade"}},{"ruleId":"D2","level":"warning","message":{"text":"export-svg.capRows (cognitive 24): export-svg.capRows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (9 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 23 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"560e35af802832c16295ac111424cd56e71f87b68a8779478c5f585dafb62a06"}},{"ruleId":"D2","level":"warning","message":{"text":"screens-model.buildScreensModel (cognitive 24): screens-model.buildScreensModel has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (10 pts), if/else 4 (8 pts), ternaries 2 (4 pts), boolean chains 2 (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":"ui/src/lib/screens-model.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5412eec8e0841ea9857a7fb7d617b6f7be0d85511267a6fb21e614b0ab52f909"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_type_alias (cognitive 24): Walker::extract_type_alias has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (8 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc51e44cb3a55843b2dfafa1e5407e71a58f345008464d1eebf7cd5900b58af5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 24): Walker::maybe_capture_fn_refs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 pts), match/switch 2, 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df014e9e9eae56989a7581b4222118ef9ce4a54df819d9c703072535ee4ef8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cognitive 24): Walker::visit_for_calls_and_structure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts), match/switch 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2194239ffc421ece6080799e44528ec10a0fe3ed1fe5c2346a3968ebb27d87f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 24): Walker::maybe_capture_fn_refs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), match/switch 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e61b2ede652423db8dcecaf96bb2707d55ac3481240269523b926a2f1602da8"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::tsjs::resolve_field_body (cognitive 24): codegraph_kernel::tsjs::resolve_field_body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (5 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf222e183e64b6ad429c0c71dac09a9dfeb27cdae1bc44091b09e5d18d2b14"}},{"ruleId":"D2","level":"warning","message":{"text":"kotlin.extractKotlinReturnType (cognitive 23): kotlin.extractKotlinReturnType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, ternaries 1 (3 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c22cfbcc65d7e0dcc23004bc860e9a81ccdbc4a6acc2052a721b29144f376b"}},{"ruleId":"D2","level":"warning","message":{"text":"swift-type-visibility.inheritedTypeNames (cognitive 23): swift-type-visibility.inheritedTypeNames has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (10 pts), boolean chains 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabd772eb148992eab4cf973d411363b417a367f08b75b717e3845a918ae6947"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.typeArgumentsEnd (cognitive 23): dart-local-scope.typeArgumentsEnd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (4 pts), boolean chains 3, 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3c4a994db179666dcb1231fed90a80e5306a3759b9cf2d7d9c63c3b4e13d82"}},{"ruleId":"D2","level":"warning","message":{"text":"ambient-modules.scanGlobalScope (cognitive 23): ambient-modules.scanGlobalScope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8 (nesting depth added 3). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 270). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"506b77eaf61fe293fe4942b4ba8c2179b27dacc891530f41079507620f82907c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.luaAliasExpr (cognitive 23): name-matcher.luaAliasExpr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (8 pts), boolean chains 7 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 6 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c686f9aa2f0d2fb6624ba2e3ec3346064b4f5f75c4f4a3fd3dbe239ad56f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.typeDartChain (cognitive 23): name-matcher.typeDartChain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5b7bb72aea4973367dffbf8a4bb8808081b2b3f818ad12b2d0957a810e5b56"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.csharpProjectStaticUsings (cognitive 23): name-matcher.csharpProjectStaticUsings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), error handling 2 (3 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7992}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3349e94b13cf59fba25f124ad6fd204b220d8c612677923eb6b7fce65eff9e"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustCodeBraces (cognitive 23): name-matcher.rustCodeBraces has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":9901}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c4cf9bfba9a2a3b9120777866a7b2ee57065629aac8ff0d522b14cbfe86363"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustFirstArgIs (cognitive 23): name-matcher.rustFirstArgIs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da2b53d6430d246a5eefb2aa5337cbe3b24b77d4422bb7ebd768af22d55dd87"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.readRustDeclaredFields (cognitive 23): name-matcher.readRustDeclaredFields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 4 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":12953}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27e7018dee97abb1c6bd5146ae88a0fcf758509b440c7d5119f23867882d7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinSupertypeNames (cognitive 23): name-matcher.kotlinSupertypeNames has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":21731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31bb22a04bb4758f99570a0b2fd57587e89d6a53672e7a3305eb1c42988537f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.destructuredParameterBody (cognitive 23): name-matcher.destructuredParameterBody has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, loops 2, ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23938}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fd989bd49ff8c9a2b772e31d2af68c42a07d7f1ac41f79c3050ad87218b8fd"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveGoMethodInPackage (cognitive 23): name-matcher.resolveGoMethodInPackage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":25731}}}],"partialFingerprints":{"codehealthFindingId/v1":"013159eee72486854a842f1b087ac67d2ea176258944cb4e764801b8996b6553"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchGoPackageValueCall (cognitive 23): name-matcher.matchGoPackageValueCall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aa7299914c35f00b66d6b5b6fb0a8a2bf9a8c91ddc3a9ef6fa7e14311adafd"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonAssignTargets (cognitive 23): name-matcher.pythonAssignTargets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":27930}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ae0613576e5f684009b52f9657b11d833b4736f8e69104451cd13a10a07bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonAttrClassWalk (cognitive 23): name-matcher.pythonAttrClassWalk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 5 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1f71519ca58cd365fb70c796cfa38d56399d6286969833457a0ba495e7313d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.splitCppTopLevel (cognitive 23): name-matcher.splitCppTopLevel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, loops 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32853}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcef0ef3b9cd10fba8c54add0b2ed00c8fa4e303f1b423ac658c269fc2bcd1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.statedDefaultExport (cognitive 23): import-resolver.statedDefaultExport has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/import-resolver.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89ec6b1fe6356b39c33cb1f01b5462eb719c27ce9f51ee0c2bd2bbe977f311d"}},{"ruleId":"D2","level":"warning","message":{"text":"react.functionBody (cognitive 23): react.functionBody has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61fa635805a5c8a8d86f53efbe0195690330efa6ee04eb2e045db031b7f6136"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractFunction (cognitive 23): TreeSitterExtractor.extractFunction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac571f2cbcfc75382a55fbddb5dc3c2dedf4959173e270bf1c1245e7d24ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractMethod (cognitive 23): TreeSitterExtractor.extractMethod has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, ternaries 2 (nesting depth added 5). Of this number, 21 points are the body\u0027s own statements and 2 belong 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5870c85c57bc3cf0c3d59d1e1a62e847bd7b355ce244e10b86ab5cae0305a2ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.indexAll::storeResult (cognitive 23): ExtractionOrchestrator.indexAll::storeResult has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (ExtractionOrchestrator.indexAll) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"624cb3b7744eeafec508157f049e183c1fbc3d26d14572ee9d8b5172f5c1b4fc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.findNestedGitRepos (cognitive 23): index.findNestedGitRepos has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f776a177f244e734e692bf68f78af162c7755c2cc71411f29383526ac5cad5"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router-synthesizer.screensInBody (cognitive 23): expo-router-synthesizer.screensInBody has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 3 (4 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":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ed43b7dd130a9fb0ff49b047c38e0934757854a272c8cd25af1c772ae1839"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.argumentsAt (cognitive 23): tier-synthesizer.argumentsAt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 8). Of this number, 22 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"48054a5372c3025341c1df19d9d485fb9b6ec693d4dcc9fb24d5ebfa66793fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.isRequestHelper (cognitive 23): tier-synthesizer.isRequestHelper has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 3 (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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"6185deb6858f1ab29f5f4ca50f46d57ed2664a053beb4bed44906193391d47f8"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.flutterBuildEdges (cognitive 23): callback-synthesizer.flutterBuildEdges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). Of this number, 22 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad906f26151b264f73fe546fa4684070ad04938b78b8161fc0de12d03de6a8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.jsxChild (cognitive 23): callback-synthesizer.jsxChild has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"281635ecc7e3c8677e24bb4b0627931e18477218ad8bf7c208b212fb96c14c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.createEdges (cognitive 23): ReferenceResolver.createEdges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, ternaries 2 (nesting depth added 5). None of this is in the body itself: all 23 points belong to 2 function literals inside it that branch (lines 2102, 2166). 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":"src/resolution/index.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a78990da2e514aaaac3921acc345462b6e620fc6f65749a6e67b6a0023c98b1"}},{"ruleId":"D2","level":"warning","message":{"text":"claude.removeHookCommandsMatching (cognitive 23): claude.removeHookCommandsMatching has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (4 pts), boolean chains 3 (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":"src/installer/targets/claude.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"96197bd06b5e10b65a71d505397cdf15a056145c5742725e01f310308531a210"}},{"ruleId":"D2","level":"warning","message":{"text":"effects.modelOf (cognitive 23): effects.modelOf has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, ternaries 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/effects.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c824f8e6fbd0d4eceeb8dfe82a1ac26c9998e8d0b6cbecced3c8c7ff586ab9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"export-svg.mapSvg (cognitive 23): export-svg.mapSvg has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (7 pts), loops 4, boolean chains 3 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 5 belong 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a9096bce0c276857b09f3b0092c4af2fcf1be4f6043033177620642476c51d"}},{"ruleId":"D2","level":"warning","message":{"text":"router.svelte.parseHash (cognitive 23): router.svelte.parseHash has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 10, ternaries 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/router.svelte.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419bb8b4cabdd1eb15f5db8bf7b4e8a8f095086d574b5248398532a60fc15d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 23): Walker::visit_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10651933f7fd980dec6a0631a4266025efaba232d79400003db9f36abbd6eff"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 23): Walker::extract_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (3 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"7add4199c1a850c434691ea237c72f2abfdeef6449114bed178f79b82e8b429f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 23): Walker::maybe_capture_fn_refs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), match/switch 2, 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8e1fd7a9f485f107ef74943bd1ab0ed7abe2ce7c43a33958c9c55213cf8edb"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::function_returned_object (cognitive 23): Walker::function_returned_object has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 belong to one function item 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f553e72d9f0150ee9909bac416522bc8e6817460682a4f0682690b2fa9986f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 23): Walker::extract_inheritance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (7 pts), match/switch 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db49e4f697a92ca8f416bc3136df9c30753e12b8d2009ea1999b4f4880215a2"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_inline_structs (cognitive 23): codegraph_kernel::cfnptr::scan_inline_structs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), match/switch 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"786350444fb2827c73560a6b95adba21dfb240fcc89ead2fc371dddb8458ee93"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.getRetryableFailedReferences (cognitive 22): QueryBuilder.getRetryableFailedReferences has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (5 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. 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":"src/db/queries.ts"},"region":{"startLine":4873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9ec243339c6802f20067736a707276642147118b80993fb3e52e8a9d29f913"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.routineNameEnd (cognitive 22): pascal-preparse.routineNameEnd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d973296f4b37e47df9e5e66762d659cdd1bcbed443d881559e6fc3d210f68a"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.emitReferencesInBody (cognitive 22): terraform.emitReferencesInBody has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 4 belong 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"75951f4836dc4b71d64f6691d0b79a7bcc8f0c0786d40dff82b8f12c9085560a"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorExtractor.processScriptBlocks (cognitive 22): RazorExtractor.processScriptBlocks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 pts), boolean chains 3, 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"29332dd45cc5b3878ddbf6d05d34d20f9481baba7626f5b1d59aa39cbd6fabbd"}},{"ruleId":"D2","level":"warning","message":{"text":"CfmlExtractor.tagAttrValueNode (cognitive 22): CfmlExtractor.tagAttrValueNode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). Of this number, 21 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0185f7e14202c9d657fe2b81cd1ff5a5e0ea97aac6b8e15bad0087decf6aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.skipTrivia (cognitive 22): dart-libraries.skipTrivia has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-libraries.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba6927255ad8af981c9f3fe5c62e106ef5e83dfc4b045f8cedcb732f1851664"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.resolveDartUri (cognitive 22): dart-libraries.resolveDartUri has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 3 belong 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29d0eeb0fdcc32aeebe79473e38d63e335de4f8e8e814100d930866b973fd88"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo-workspace.getArrayValue (cognitive 22): cargo-workspace.getArrayValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/cargo-workspace.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e167bf62f39845f8ea0bb2e20c1c671d12a9aedcf31a2f24d66e59447917333b"}},{"ruleId":"D2","level":"warning","message":{"text":"rust-scopes.rustBoundsOf (cognitive 22): rust-scopes.rustBoundsOf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c983cde9e647dab9e560e00eda8ca1e80a47d15edc27cba3b428d672ff2869a1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.hasBridgeEvidence (cognitive 22): name-matcher.hasBridgeEvidence has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"684437174fad183413fb4e0d088ebba75fd1a643c71810a0a4c1618d8c1697f1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonStatementStarts (cognitive 22): name-matcher.pythonStatementStarts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad5c4a80f05a1d7b2fdb6f0d0c8725883857c827cc834a3184da96f14f0a17b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dartInitializerType (cognitive 22): name-matcher.dartInitializerType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6081}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe756b1e833f6498877225adb251ac593c5e35d5012cbbb1caeea9f4a4dd7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustSubmodule (cognitive 22): name-matcher.rustSubmodule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a975e52dc43ccfa6c4cbab2cd28f9e308e76388a621a1d69cab3ca7ccf6f3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustShadowingLocal (cognitive 22): name-matcher.rustShadowingLocal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, ternaries 2 (3 pts), loops 2 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":11084}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c839ec4a000caae256fa28d39f0479e2ef284d7364f55fa00f0f64d1e7e0fc"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.objectLiteralProperty (cognitive 22): name-matcher.objectLiteralProperty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15352}}}],"partialFingerprints":{"codehealthFindingId/v1":"47229d5dc84ad10fdb4d1cb37cd57f28736dcc34787a39abc75954df4bafd193"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveObjectLiteralBinding (cognitive 22): name-matcher.resolveObjectLiteralBinding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 3 (4 pts), loops 2 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f716f77532980ef77270b3696dcf0034b65bfa5ff5c5ba86c7b12a51da76b33d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinInheritedPropertyType (cognitive 22): name-matcher.kotlinInheritedPropertyType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 3 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21802}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e1dd1edb26b121a47e0d9ddd9670ac57ee5e8cd9980a386865212a8fb003d4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goPackageValueType (cognitive 22): name-matcher.goPackageValueType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":26156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b795e5c73fd2243694676a0827ee0cc1ba1c5355dc398410d9b81bf165b5b64"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.matchingClose (cognitive 22): nestjs.matchingClose has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e7399a653a68e022737802e7bba170c3de5144d7b25d61d8b3ce347aedfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router.skipTemplate (cognitive 22): expo-router.skipTemplate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f0200fc4c812b0f118f95f4117d13ee37218b0dbe54006e754b7ec1f4977bd"}},{"ruleId":"D2","level":"warning","message":{"text":"python.extractDecoratorRoutes (cognitive 22): python.extractDecoratorRoutes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/python.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7ef038b1b58a74140eb5b3a9dda7d81d7bba8d12481147f7f9196b9898ad65"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp.endpointGroupRoutes (cognitive 22): csharp.endpointGroupRoutes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5a13b4f4af75336836e0322cd6db6a072a66629a71bc51e453c357595b1e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-sitter.rustReceiverChain (cognitive 22): tree-sitter.rustReceiverChain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (4 pts), boolean chains 3, 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff49ee05cb62e07290e0d1400248cfa082a3e89f337b0bbef96fdb2df9260ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.resurrectPythonPackageImporters (cognitive 22): ExtractionOrchestrator.resurrectPythonPackageImporters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/index.ts"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8812f414e6a49cd497a7c3df4ab96ae22803581ad2cde61fe45510d08a507f58"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.memberAtPath (cognitive 22): pascal-scope.memberAtPath has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, ternaries 1 (3 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/pascal-scope.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7f81f1e53ab0108efba0272ad630f5e375b26c237261b2d39fc6e39e5f2e81"}},{"ruleId":"D2","level":"warning","message":{"text":"type-parameters.scalaMemberInScope (cognitive 22): type-parameters.scalaMemberInScope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. 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":"src/resolution/type-parameters.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5583de14cac9b7b69af7981db3b28ad231f8d04e55e84d7f4f18da371dc4f8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.templateEnd (cognitive 22): tier-synthesizer.templateEnd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"503f006f96819bda5c8c0ed82ceab746fecc86ae2801b922526e66eecfb6caae"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goImplementsEdges::methodTypes (cognitive 22): callback-synthesizer.goImplementsEdges::methodTypes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (11 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 shape REPEATS in the file: 3 other methods here (callback-synthesizer.goImplementsEdges, callback-synthesizer.goImplementsEdges::methodArities, callback-synthesizer.goImplementsEdges::wantedArities) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5550222b3bae07b62093a8994530b25fd13a5df750c9fc4626d0b2c0533f3895"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.celeryDispatchEdges (cognitive 22): callback-synthesizer.celeryDispatchEdges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 6, loops 3 (6 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 shape REPEATS in the file: one other method here (callback-synthesizer.celeryDispatchEdges::isCeleryTask) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3fad4adb831987b8d7d875519731ab549d339b5783f825ef309df58b949422"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphTraverser.findPath (cognitive 22): GraphTraverser.findPath has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), ternaries 2 (4 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":"src/graph/traversal.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"240f6c449a3a28ce8e3c3e00de06814a623f409f39e672bab765d62fd8208d57"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildCopybookSection (cognitive 22): ToolHandler.buildCopybookSection has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 2 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e957306b28c56704fb8f1ef57efa7a0c2dee634b00e8e6cfa6389b4dfbf3c5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon.readClientHello (cognitive 22): daemon.readClientHello has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 6 (9 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 22 points belong to 3 function literals inside it that branch (lines 1014, 985, 1040). 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":"src/mcp/daemon.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5045545900a69e3dc60417ee479b34b493fc2b36c918cd9fa477639c13dacf5"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPServer.startDaemonProcess (cognitive 22): MCPServer.startDaemonProcess has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 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":"src/mcp/index.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f108b672ce37522c33fb894c8c98bf69fc3ecbacf1db1a82a4c3f084a32788"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.formatNodeTree (cognitive 22): formatter.formatNodeTree has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), ternaries 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":"src/context/formatter.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"323df242f298764cfa163ae5a69ad2971e7dd8d929dd3a2e875238e9a0f14503"}},{"ruleId":"D2","level":"warning","message":{"text":"entrypoints.swiftPreviewSpans (cognitive 22): entrypoints.swiftPreviewSpans has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/entrypoints.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6347c968cf7f882ba4274985b93aaeccf13e0e77ee7740251c1ae4b883ec50"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-manager.runDaemonPicker (cognitive 22): daemon-manager.runDaemonPicker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 10). Of this number, 21 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":"src/mcp/daemon-manager.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e354bae9b16ffc81aa8c8fe20288c0c4aac3c8d4d6f8bd1a78af7d858816ae"}},{"ruleId":"D2","level":"warning","message":{"text":"store-worker.port.on(\u0022message\u0022) (cognitive 22): store-worker.port.on(\u0022message\u0022) has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 1, match/switch 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":"src/extraction/store-worker.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9084cb0dcb331b1f334a0325f274295b39f062e06e4aa38d35e6b6df84aeea6"}},{"ruleId":"D2","level":"warning","message":{"text":"export-svg.flowCapSvg (cognitive 22): export-svg.flowCapSvg has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 1 (2 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4db30e8e0f7f25e75671fe239599aeadf0cb6bde323fe6e987faec538843907"}},{"ruleId":"D2","level":"warning","message":{"text":"steps-model.kindWords (cognitive 22): steps-model.kindWords has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/steps-model.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e608c2b392a88b807d052a8c96d1e66d930d68fda8e51ca913fef8841a08897"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 22): Walker::maybe_capture_fn_refs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), match/switch 2, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741837a4a356860886013d1b05942dd3cc55f6a64362f1a7ea89706e45254c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_name (cognitive 22): Walker::extract_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6008ff6ab2ab6078554a905c46d7ff0c5cf85db9fe096a495d2919b950f2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 22): Walker::maybe_capture_fn_refs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), match/switch 2, 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6295490958783627085342e9b223bf338194d6822ea7353714da03d28462c0f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::return_type_of (cognitive 22): Walker::return_type_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe65722137a1af624d3fa380697d5e26349f4f98f075db5819bf9fa8302888d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::maybe_capture_fn_refs (cognitive 22): Walker::maybe_capture_fn_refs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), match/switch 2, 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"796f4329b59305eeefe7504aecc5b014cf3d76e9009305282f29e2ede7f2b082"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_php_type_refs (cognitive 22): Walker::extract_php_type_refs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"810a563dc64ee1b2d24af0f9d76c73bd9b602cfdcc01aa7f07f7f08f7f50169a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::return_type_of (cognitive 22): Walker::return_type_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, match/switch 1 (2 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b159f3a0f4d41e65ec605d4df419e4d5d50c23c1a546bba0bafeb098318c885"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_function (cognitive 22): Walker::extract_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aca582f5688e3f506e73b402193e998d1ad38de283c360bcec21338e6a1fa6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_rtk_endpoints (cognitive 22): Walker::extract_rtk_endpoints has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"669ebbe4f2d22260c137e2660d6796379ca1919f5a2c18b21cefd61fe84e1adb"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::python::body_docstring (cognitive 22): codegraph_kernel::python::body_docstring has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (4 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba5cade749c439e266be6f7a18d8892fd59d53f27fc618636456c47c70bd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-substring-index.searchNameSubstring (cognitive 21): name-substring-index.searchNameSubstring has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 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":"src/db/name-substring-index.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ebe26ebca1393692f091b0927ec49e158dbf22d7a894dd5721938c9026b48e"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.followsDeclaredName (cognitive 21): c-cpp.followsDeclaredName has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 6, loops 4 (5 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87598eef2a45c483a4afa57edfd7d45a00b5b27297d83dd44e52abaa5280b58"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCDesignatedMacroArgs (cognitive 21): c-cpp.blankCDesignatedMacroArgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9117e552d3d0876d32276007605194a23325f08b2eb1cf0c56957f1bbcdf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"cobol.collectRefs (cognitive 21): cobol.collectRefs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cobol.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ab13a9c93bdd5a2641ed5b510aee2553f09e6feb8272bf384b0110f8d36b42"}},{"ruleId":"D2","level":"warning","message":{"text":"erlang.handleFunDecl (cognitive 21): erlang.handleFunDecl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 3, ternaries 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":"src/extraction/languages/erlang.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed67b7e62522b06db11f88820c552040c249d07bf7a37b7004b9dcdf0ce2d380"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-options-api.matchClose (cognitive 21): vue-options-api.matchClose has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d7aaa681d95b2fbb215d32af82dd52a00cc712ba9b997eb6d7b788fede99dc"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.extractDrupalRoutes (cognitive 21): drupal.extractDrupalRoutes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c4636001d7bd4a99e1b6d70aeae23be85470705806b2f04a9749851ec2ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.pluginDefinitions (cognitive 21): drupal.pluginDefinitions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (6 pts) (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"65181ca8cc20de6a203da2d73d23f3e69e8c8860f7e22e600db98f9e18af8276"}},{"ruleId":"D2","level":"warning","message":{"text":"laravel.splitArgs (cognitive 21): laravel.splitArgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 2 (4 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb74b67544dd18c19f280843602229a4e100a8c67ee79c922831c2c552f6932f"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.ancestry (cognitive 21): vbnet-receivers.ancestry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). Of this number, 17 points are the body\u0027s own statements and 4 belong 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6846cc2106d2dbbcc1ebcb517b04c4fe47926587bd2dd045681888b18e6ea80"}},{"ruleId":"D2","level":"warning","message":{"text":"ambient-modules.scanAmbientModules::token (cognitive 21): ambient-modules.scanAmbientModules::token has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6 (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. This shape REPEATS in the file: one other method here (ambient-modules.scanAmbientModules::blockToken) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"187ce4ac5da2121616c6ca90baee592db68a642cdedb3214459b9021412f6854"}},{"ruleId":"D2","level":"warning","message":{"text":"ambient-modules.scanned (cognitive 21): ambient-modules.scanned has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a86f879e81bf08efb6ab3f56ebc88d7d43761d62f80f827826351908f6d8b8"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.scalaBlockOf (cognitive 21): name-matcher.scalaBlockOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f9606b688c587c73cf15407e5c234cc2af2c6037c18cbabc670bafdeb5cf74"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.scalaAnonymousBases (cognitive 21): name-matcher.scalaAnonymousBases has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (8 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7720}}}],"partialFingerprints":{"codehealthFindingId/v1":"0830b7de147962265758a464483da1a6f9c77129c901d918986e0d5f162dc407"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.scalaReceiverName (cognitive 21): name-matcher.scalaReceiverName has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":7744}}}],"partialFingerprints":{"codehealthFindingId/v1":"477340647e56c5d0c945c8c5dd45edbf56b5ab262f1cd6110471fb0b9f40df52"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jvmSupertypeChains (cognitive 21): name-matcher.jvmSupertypeChains has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":16118}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dc0aae8c15bc8e89530f34d2d605617d8bab26a98da3dc85fbc2858d616dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isCppLocalCallableCall (cognitive 21): name-matcher.isCppLocalCallableCall has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), loops 1 (nesting depth added 2). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":19879}}}],"partialFingerprints":{"codehealthFindingId/v1":"440adf771d6cab91c04e882afa77080221790d582855bc7d2846efe1e427bce9"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.inferLocalReceiverType::matchLine (cognitive 21): name-matcher.inferLocalReceiverType::matchLine has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), boolean chains 4, 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 shape REPEATS in the file: 2 other methods here (name-matcher.inferLocalReceiverType, name-matcher.inferLocalReceiverType::scan) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":23455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf2865f4261c6a389abec3d9aa2075aa2e4f0dc055256cb98d3149d46326f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goCalledType (cognitive 21): name-matcher.goCalledType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 3 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27073}}}],"partialFingerprints":{"codehealthFindingId/v1":"209be3887bbae4a534e45fcf88f08d876f5409cd17068af7bfbaf1ccef9ff488"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goDeclaredValueType (cognitive 21): name-matcher.goDeclaredValueType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (7 pts), boolean chains 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":27269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3b3098e4345991f1e7850bc5dde39ab994725c30d555f588f6de946746be23"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goElementOf (cognitive 21): name-matcher.goElementOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (6 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3ac54021d30b56c93b5df422c4960ce3fac7c2eb84d233d7345bd12376a753"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goStructMembers (cognitive 21): name-matcher.goStructMembers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), boolean chains 2, ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a1597481d59577d38e9951204ba33b46c30206f326ebb2957d34c192190e58"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonConditionalArms (cognitive 21): name-matcher.pythonConditionalArms has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":27808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c5293824858c482daf196addffa7a25a8f6678b68689eef4f1401797f9e416"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveStoreAction (cognitive 21): name-matcher.resolveStoreAction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":31091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f406d631c38d65af50516c517e0fbac271ae814f46dee8c964a784305c3992ac"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchCppMacroNamespaced (cognitive 21): name-matcher.matchCppMacroNamespaced has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (7 pts), boolean chains 3, loops 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 1 belongs to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dba2f7ddee9b7769b4dedfca0de0304e065eb92da76d0b9fe166a919aa0cbce"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppTemplateArgumentsEnd (cognitive 21): name-matcher.cppTemplateArgumentsEnd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, loops 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32888}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ed70922e5cd26762a59a9db5207138cc31e126353572e30cd91d5e605e3f25"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolveCobolCopybook (cognitive 21): import-resolver.resolveCobolCopybook has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), ternaries 1 (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":"src/resolution/import-resolver.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f53165462d7428dd2cc961403d09c97bcd4c9178084cc89b9d49b5654050a58"}},{"ruleId":"D2","level":"warning","message":{"text":"react.mapsRouteFields (cognitive 21): react.mapsRouteFields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 6). Of this number, 12 points are the body\u0027s own statements and 9 belong to 2 function items 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02e373e641e9c13d9d3bad7e62d8f3c898122086b763fadd4bba8c872e5e3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"react.routeRender (cognitive 21): react.routeRender has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (8 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6c2ea0589a06dd26ec1a87a263b68a9035fd89a3fab2d7e2507ceed31f46e7"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router.parseHrefExpression (cognitive 21): expo-router.parseHrefExpression has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 5 (8 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc69c009066e136f770eaf2a76cd6b9722555406f71a1ec0e6e341dd6de57ae"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.pathSegments (cognitive 21): angular-router.pathSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 2 belong 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f47e7e7e15a7a527e30fd43f9b0bed28d5789227ce5dfe1fcea8177359c711"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractInstantiation (cognitive 21): TreeSitterExtractor.extractInstantiation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d2acada5686f2f79a7f2a5b99ee4d4d21241c140474bc3dfff62e75b3c4498"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeIgnore.ignores (cognitive 21): ScopeIgnore.ignores has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, 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":"src/extraction/index.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21dc6b667463ca576a5bb670840cada6f1350a83b7f2416bcafe1e4dba5aa40"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverPool.constructor (cognitive 21): ResolverPool.constructor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 245, 284, 288). 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":"src/resolution/resolver-pool.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d459e6b158693f61645594819d49d22367029ee5bac05729ca854d6eaa9e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"override-parameters.overrideFilter.\u003Creturned closure\u003E (cognitive 21): override-parameters.overrideFilter.\u003Creturned closure\u003E has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 3 (4 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":"src/resolution/override-parameters.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"569165203d04ec6578654495100d30de0ebf07f24e66b3874b047bef773d756c"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.spanTags (cognitive 21): callback-synthesizer.spanTags has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0604985b879add4ed0f48e3c2b916d0e066b31c529d66fd8ad036373828b78ab"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.svelteKitLoadEdges (cognitive 21): callback-synthesizer.svelteKitLoadEdges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750e55fdcc684f7dd1b17efa5860bba134be968b8b709054a7f9d13095a977d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveParameterFlows (cognitive 21): ReferenceResolver.resolveParameterFlows has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 3 (6 pts), error handling 1, loops 1 (nesting depth added 11). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 3215, 3216, 3223, \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":"src/resolution/index.ts"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fbc086dfbb79124d10194cd39d2ca367471d0e3569e5b029d700b227b0fdd2"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWatcher.refreshWatchTree (cognitive 21): FileWatcher.refreshWatchTree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/watcher.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf19ea973d2fb64534dce268747a45e3ca6e19a226b907ea627daea65a1bed3"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.decoratorsOn (cognitive 21): branch-guards.decoratorsOn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function item 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":"src/graph/branch-guards.ts"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6c758c9ca58251a034280a2639b2b20a3dfebc960319f4b0e56d619fbed20a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGraph.getFrameworkChangesSinceIndex (cognitive 21): CodeGraph.getFrameworkChangesSinceIndex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), error handling 2, ternaries 2, boolean chains 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/index.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a697923944ff02e6a6ad8942334269a7f5615499f945c921b79725868a90307"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.siteText (cognitive 21): steps.siteText has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 8 (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":"src/ui-server/api/steps.ts"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019de2ea9258d9a0603c38d474e93a0adae2cb6ee1d241579c070d11ffb626b"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.hopLabel (cognitive 21): steps.hopLabel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, ternaries 4 (9 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":"src/ui-server/api/steps.ts"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dd40931218c7bc6a0923905930c39263ddf95e1dbb5b3777d955ecbbc2aa7a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow.toWireFlow (cognitive 21): flow.toWireFlow has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/flow.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3547fdb15a4d1a500e9541c584deb513d571ceacc81d70ed9df0d51e62c0790b"}},{"ruleId":"D2","level":"warning","message":{"text":"toml.decodeBasicString (cognitive 21): toml.decodeBasicString has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (8 pts), boolean chains 3, 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":"src/installer/targets/toml.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"521f6a4fc85eaab6bbc0d46ca8d8d29fa5ca80ca6d65c9efff1f1b8966cf0e41"}},{"ruleId":"D2","level":"warning","message":{"text":"render-check.main (cognitive 21): render-check.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. 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":"telemetry-dashboard/scripts/render-check.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"553f73d3e7f9e797f8dfbdf043d936fa7d79cb8d711912a2441c833d877bb462"}},{"ruleId":"D2","level":"warning","message":{"text":"api.breakdown (cognitive 21): api.breakdown has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 5 (6 pts), boolean chains 5 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38848b90ae3d3c92b6b556f44f951042fb1ac07ac98a418464202e4b34297b7"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol-model.assignRefs (cognitive 21): symbol-model.assignRefs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 5 belong 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":"ui/src/lib/symbol-model.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b322f6d754c9245ac1f2b6830b664e2167c1307d9e85e5bf915c7985df0271a4"}},{"ruleId":"D2","level":"warning","message":{"text":"map-model.moduleCycles (cognitive 21): map-model.moduleCycles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (strongconnect, a function literal at line 701). 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":"ui/src/lib/map-model.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"56470350533e39dd53785c4bb86733634a288fd3191ad2566ba52773c6a3ff90"}},{"ruleId":"D2","level":"warning","message":{"text":"export-svg.flowSvg (cognitive 21): export-svg.flowSvg has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), loops 7 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb28189160447ca11afde236361bbd8c77b871d2e45f1d19b91f419cae9bc511"}},{"ruleId":"D2","level":"warning","message":{"text":"screens-model.trackedCurves (cognitive 21): screens-model.trackedCurves has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (7 pts), boolean chains 2, loops 2 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"168f30c8849f76f05d8021e64f4caefce5cdb0e4056edb1dfd9ba0448dd5aa56"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_method (cognitive 21): Walker::extract_method has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 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, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdcaf74eaf53491c0be360b6ec2e130182a85295b9be1f4fadd930692fbf8be"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_field (cognitive 21): Walker::extract_field has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cd909dd6b1ff20dff8cb716da8abeb87636edc58471e7c25d3616f56c27624"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::dedicated_property_branch (cognitive 21): Walker::dedicated_property_branch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38afd7ae4119440a1281c68089b423f797988be302812a4948217e6d8f329dd"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::php::extract (cognitive 21): codegraph_kernel::php::extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (nesting depth added 12). 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78cf667f30c5677bb0104a908c0457b9754517ffa531dc2eacd96319e2365d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::tsjs::is_ambient_export (cognitive 21): codegraph_kernel::tsjs::is_ambient_export has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4850b2b7823e921bdf2f8388dab672b90bf080f33fe0e7bc17faab27eda0402e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.validatePathWithinRoot (cognitive 20): utils.validatePathWithinRoot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (4 pts), ternaries 2 (3 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":"src/utils.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7effde5ce84f4607efcda3679e80404031d60098d38a7d332c163e0a46af4230"}},{"ruleId":"D2","level":"warning","message":{"text":"directory.planFrontload (cognitive 20): directory.planFrontload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/directory.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22ecdbf3b0cda7449e27da20961067fca5ba7f83349ce0e89fbb0e70106906d"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.runBatched (cognitive 20): QueryBuilder.runBatched has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (8 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":"src/db/queries.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f36cb8525e4d56e60e99d2bc5a0818fd41cb51130101e8ffc8dab4f3c691a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.conditionalGroups (cognitive 20): pascal-preparse.conditionalGroups has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaff09f705d803f58109ea61c21635b8359c3ef86b34003666801719c5eedf2"}},{"ruleId":"D2","level":"warning","message":{"text":"cobol.walkProcedureChildren (cognitive 20): cobol.walkProcedureChildren has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 2 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a83ad8ea6f65b0fc5a578345d65fd235fef726b4616785e5ffcd6eb7d344074"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.emitModuleWiring (cognitive 20): terraform.emitModuleWiring has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (6 pts), boolean chains 2, 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b45846bb088b52c8bb549203a5bbf1bf4902e6a36890769eca5933dbf7df6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-methods.cppMacroInvocations (cognitive 20): cpp-macro-methods.cppMacroInvocations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e0e78b2ae0e25f0bb4f0cb55177beb0cb5642ffe51944641ecce805b9d2c11"}},{"ruleId":"D2","level":"warning","message":{"text":"razor-script.pastBracket (cognitive 20): razor-script.pastBracket has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (4 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":"src/extraction/razor-script.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab021f9e4bd0c016f19348bf84e1ca2c0f309306fc7aed92cccb6553cbc461e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CfmlExtractor.visitTag (cognitive 20): CfmlExtractor.visitTag has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, ternaries 1 (3 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/cfml-extractor.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4a2130da650d7d2526120f6c6e542bcbb58a13c1fe23bbe9090a3ef246695d"}},{"ruleId":"D2","level":"warning","message":{"text":"path-aliases.applyAliases (cognitive 20): path-aliases.applyAliases has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), ternaries 1 (3 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":"src/resolution/path-aliases.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e087c417a30cdd47a8b95a85271eabc6a3df860e6f3604a020bd2bcee46299"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-supertypes.usingsIn (cognitive 20): cpp-supertypes.usingsIn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 pts), boolean chains 3 (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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ff83ed30cfc680081116070138e46fd5ff714c9b8e3c823e2fe927e2140ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonDynamicGlobalWrite (cognitive 20): name-matcher.pythonDynamicGlobalWrite has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 4, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e365c0595702a5950037bf5ece27ea2f51b6b5c60da7569c887f05d569af272"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustSelfParamBounds (cognitive 20): name-matcher.rustSelfParamBounds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12720}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fe0bce451d84d2ff4379d693cf6344414cf35323158302d07c69f64ca5afd2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppDeclaratorType (cognitive 20): name-matcher.cppDeclaratorType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":16596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c9efd664429dc201f5f99b288d14bf93912063b056d4c825434a65b1db30d6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppRangeElementOf (cognitive 20): name-matcher.cppRangeElementOf has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 4 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":17455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003782b6231d4ffe02eca4db83a8214aaebc4d5d8c3449a0f8c5bdcbcde2981"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isCppLocalName (cognitive 20): name-matcher.isCppLocalName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":19656}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa242bda56b5c62a26ec10e5b8eb2e2ef638cea70633717edc7ed794922c8f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchCppConstruction (cognitive 20): name-matcher.matchCppConstruction has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 5, boolean chains 4 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f43961f8e2cfd275fab5da82a3660d4eb24ffd8c1e7d07e335c9609dc8ff4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppTypeWrittenAt (cognitive 20): name-matcher.cppTypeWrittenAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), ternaries 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":20654}}}],"partialFingerprints":{"codehealthFindingId/v1":"56378cd59fc842612f71784d2c7ee2fe4e4c66a9b83efb2a84d625aea2f87e90"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaFileAncestors (cognitive 20): name-matcher.javaFileAncestors has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21388}}}],"partialFingerprints":{"codehealthFindingId/v1":"188edbc519b391aec6b81d308e7d259b132edf8b018fb1de89453330db6d6fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaTypeRef (cognitive 20): name-matcher.javaTypeRef has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (6 pts), boolean chains 3, loops 1 (nesting depth added 4). Of this number, 19 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c757a003074f6c99acb518eac095562343c53f02c09bf73cc9c603925031bfb5"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goResultText (cognitive 20): name-matcher.goResultText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f52119ae34ebc71664fa20e79ae3de54debe159954270687af558ec44b3f0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonScopeBindings (cognitive 20): name-matcher.pythonScopeBindings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (names). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":28765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0514f326c5e576889a63db195b59f65b4681d82d59c9a3aaf5bc3c3572008d2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchRustAsMutChainCall (cognitive 20): name-matcher.matchRustAsMutChainCall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (8 pts), boolean chains 4 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":29395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca06ea6f6d5938a9fd6379463632a1f00a46140880b07cf0aac23a73d88343"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchDestructuredStoreCall (cognitive 20): name-matcher.matchDestructuredStoreCall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66b0cf10bf928f19ff8712f0a247a71bdb5b3dff675746952f99e3a7438d313"}},{"ruleId":"D2","level":"warning","message":{"text":"alias-binding.extractLocalExportAliases (cognitive 20): alias-binding.extractLocalExportAliases has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (7 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":"src/resolution/alias-binding.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bb5520d2d4d65267fce1f8088e35a844d64f36c1505587719d18967e7f2921"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolvePhpQualifiedClassRef (cognitive 20): import-resolver.resolvePhpQualifiedClassRef has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9993ff67f2748cf5f260959337903f2c6e81f9b5dbb170fbb5c07b43d2102d"}},{"ruleId":"D2","level":"warning","message":{"text":"react.functionParts (cognitive 20): react.functionParts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (5 pts), boolean chains 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"99adbf5c27af10d3a973b28e42e1bacde237acc10ed0dfaa5e84a4d1472297ca"}},{"ruleId":"D2","level":"warning","message":{"text":"react.initializerAt (cognitive 20): react.initializerAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a8d12421b511c8e7eb52d41f1b29325eae7608da467a32171f0456cb0f0e22"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-router.matchParen (cognitive 20): expo-router.matchParen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f4665fdf27a5361d8abb18632f30acfea291b5ed6ef0e5dcb20a5045d2264b"}},{"ruleId":"D2","level":"warning","message":{"text":"nextjs.nextRouteForFile (cognitive 20): nextjs.nextRouteForFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 7). Of this number, 19 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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef4fa10880eee7dc8615bd3c88bd55af51b1720a8a0d85b5276d80cdd41bc94"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractPiniaSetupBody (cognitive 20): TreeSitterExtractor.extractPiniaSetupBody has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":3933}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee15fd6e4d082644c8d72d397aedc5c13554d6e47de85b3e335ff0482deec5f7"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.reopenReferencesThroughDeclaredPackages (cognitive 20): module-importers.reopenReferencesThroughDeclaredPackages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), error handling 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":"src/resolution/module-importers.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc05d18a81ca3129cd49922c2cec9e49b083683c8433ae5f4f870ef06a4168bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionOrchestrator.buildDetectionContext (cognitive 20): ExtractionOrchestrator.buildDetectionContext has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 2 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 4 function items inside it that branch (probe, a function literal at line 2274, a function literal at line 2256, \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":"src/extraction/index.ts"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ed10c524a9e2c0fa9d93745d224ce424b75f188f8d65ec3c932c4cfb64f247"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.headerClassAt (cognitive 20): pascal-scope.headerClassAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), ternaries 1 (3 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2193144a21da6a5719e023377c353384f660a6c96f2ea19a81f8e54aafc48177"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.includesOf (cognitive 20): pascal-scope.includesOf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d88b4b10ba7ae0f54fda49b1a87c80187c5269cc0e2ae19ae385def17abde93"}},{"ruleId":"D2","level":"warning","message":{"text":"c-fnptr-synthesizer.cFnPointerDispatchEdges::parseStructFieldsRaw (cognitive 20): c-fnptr-synthesizer.cFnPointerDispatchEdges::parseStructFieldsRaw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 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. This shape REPEATS in the file: 4 other methods here (c-fnptr-synthesizer.cFnPointerDispatchEdges, c-fnptr-synthesizer.cFnPointerDispatchEdges::mergeNativeFacts, c-fnptr-synthesizer.cFnPointerDispatchEdges::registerStructValue, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7255f89f9cf119770b69f5ea349685057543aabb3a74a1213d5646426814d2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.closeParen (cognitive 20): tier-synthesizer.closeParen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f484984dc1bbefac18799e5373c555ecfe89a7ec950521ebe8c1e91a2c43e5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.findForwarders::forwardersIn (cognitive 20): tauri-synthesizer.findForwarders::forwardersIn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (4 pts), ternaries 1 (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 shape REPEATS in the file: one other method here (tauri-synthesizer.findForwarders) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb8755b458817934cd9092d27419c349614fb68dd42fce33375a4ce325ec9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.synthesizeCallbackEdges::collectInputs (cognitive 20): callback-synthesizer.synthesizeCallbackEdges::collectInputs has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (8 pts), boolean chains 3 (nesting depth added 11). 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 shape REPEATS in the file: one other method here (callback-synthesizer.synthesizeCallbackEdges) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b193ca9f88913d4a6ca1d29913ec2ba754a97d9d5a16634d526080b90ea7e657"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.synthesizeCallbackEdges (cognitive 20): callback-synthesizer.synthesizeCallbackEdges has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 10 (18 pts), boolean chains 11, ternaries 3 (6 pts), error handling 1 (2 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 shape REPEATS in the file: one other method here (callback-synthesizer.synthesizeCallbackEdges::collectInputs) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec477c7d4a6054df91f9f30244d315035c911496ea486dee3dc29e6357e160fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.closingParenthesis (cognitive 20): ruby-parameter-flow.closingParenthesis has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040f904e2fb25fc957d1a843107e1d2f62daf9e58419154db92cb3415f75f69"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.sortArguments (cognitive 20): ruby-parameter-flow.sortArguments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1ca1039f5e047d4880c20341d1e0017e5fc38bcad8e3c7af4c2fb3dddb7a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.readSignature (cognitive 20): ruby-parameter-flow.readSignature has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae249d9f27a7b7b37845d2393d9251fc2daf635eaf3e986ed5fc8b7b2572e229"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.classExpressions (cognitive 20): ReferenceResolver.classExpressions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/index.ts"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"888aeb4e6067cdcd4400db6dfa43c2ef7beffcd5080c39926784868970456750"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBasedJsonRpcTransport.handleLine (cognitive 20): LineBasedJsonRpcTransport.handleLine has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (4 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":"src/mcp/transport.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e1c9c1aeb8e390f942c9cb8c65bca7d05eb9b77aadc9129cb66b81c8c40df1"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamic-boundary-report.continuationsFrom (cognitive 20): dynamic-boundary-report.continuationsFrom has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), error handling 2 (3 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":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d568e7ab9d573acfe2f827c81eeadc4993359fc69332e284e2d99b78dbab0953"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeTarget.uninstall (cognitive 20): ClaudeCodeTarget.uninstall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (20 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":"src/installer/targets/claude.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d133e32e3c7f192509100dba53c976cb0afaba40d528b284f90ecb4b13a8a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleImpact::impactOf (cognitive 20): ToolHandler.handleImpact::impactOf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (5 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":"src/mcp/tools.ts"},"region":{"startLine":3597}}}],"partialFingerprints":{"codehealthFindingId/v1":"264b4d1f3770b158e25d1592b4fdeb4beed8a3d851f1252fca8650627a530031"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildDynamicBoundaries (cognitive 20): ToolHandler.buildDynamicBoundaries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3972}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fda9baf8f17835ee4e1053f062c9298229578a4bbf8af5351553580ae9826b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleExplore::prio (cognitive 20): ToolHandler.handleExplore::prio has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (19 pts), boolean chains 1 (nesting depth added 13). 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 shape REPEATS in the file: 3 other methods here (ToolHandler.handleExplore, ToolHandler.handleExplore::sectionRangesOf, ToolHandler.handleExplore::shrinkCluster) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":6433}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d06c5db4b8a242d18787dae57b8474f97377a34834dd143c603872f9abcbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps.springMvcReplies (cognitive 20): steps.buildSteps.springMvcReplies has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (5 pts), boolean chains 4, 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":"src/ui-server/api/steps.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6941e2982c16eac4ec73ed220c493d7a47fe5e6c41d494b48d96f091580bd1b"}},{"ruleId":"D2","level":"warning","message":{"text":"remove-binary.planBinaryRemoval (cognitive 20): remove-binary.planBinaryRemoval has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (nesting depth added 6). Of this number, 19 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":"src/upgrade/remove-binary.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"de86ec14c5efef5cd750de2585fd1cf5da0ee315b93f62ea29ea7a59958453bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_field (cognitive 20): Walker::extract_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9280bbad4c167e381d68092325ce1431402433b4bdf85c886998d3aa8bda99"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 20): Walker::visit_node has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"162b22d138eeb7ac19b33fe5ea25ca17dbb310deaaecf262eb274a33cfa8b648"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::consider_decorator (cognitive 20): Walker::consider_decorator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e35408b5d94f17a2749da421e225d24e682e4cc78fc09ef9c21ef7d1cfbfe3"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 20): Walker::visit_node has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3509c3dcff6c78b39ffa17b0f52813d0ef44d44ebf95ded49f83b9020e82f7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 20): Walker::extract_inheritance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (6 pts), loops 2 (4 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f9ffa41ae5fdb04efb6baed1674c80624cd94209eed8e38b5e7c694c3ba9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::consider_decorator (cognitive 20): Walker::consider_decorator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aa576e0f57afb9478d32821559df46e7275b81688d9d3dea5e7dfceee0c74a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::create_node (cognitive 20): Walker::create_node has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc346c36cbfc0e757e46f8d6fb4a083dbc45b1c890fdea6100ba30cabaf25c64"}},{"ruleId":"D2","level":"warning","message":{"text":"WalCheckpointValve.backfillFully (cognitive 19): WalCheckpointValve.backfillFully has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"src/db/wal-valve.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea709f763bdd77fb0f4c55053b4866ea0b5ae3d445b667fe7e86d881c6be33e"}},{"ruleId":"D2","level":"warning","message":{"text":"function-ref.goScopedFnRefScopes (cognitive 19): function-ref.goScopedFnRefScopes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 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":"src/extraction/function-ref.ts"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"f107d7521719034c3ae3b6d53f5695befaa248e32dbf9c5cb750be1b40934b85"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.blankCCplusplusGuardBodies (cognitive 19): c-cpp.blankCCplusplusGuardBodies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), ternaries 2, boolean chains 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d12a18f291fdb6860b6378261057b751506ca3c167dce5fcfd5609c2198bf"}},{"ruleId":"D2","level":"warning","message":{"text":"swift.extractSwiftReturnType (cognitive 19): swift.extractSwiftReturnType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"src/extraction/languages/swift.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7457208d4bdf15a916438c302d157e8b1e00d8bfb14ce99577fbd56bdf272005"}},{"ruleId":"D2","level":"warning","message":{"text":"nix.isReturnedAttrsetMember (cognitive 19): nix.isReturnedAttrsetMember has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/nix.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7171e8a3f646fe39f4ff49bc1926b931439fde41c78d3621591c43655d6541"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-brace-scopes.namespaceHead (cognitive 19): cpp-brace-scopes.namespaceHead has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, ternaries 2 (3 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3a4ecbcb26282af3f70566b613bf159997d4f2a21dc8d07f7f46ae7ed15973"}},{"ruleId":"D2","level":"warning","message":{"text":"razor-script.blankControl (cognitive 19): razor-script.blankControl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/razor-script.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b811db383f23f5ed9e91db2f4a10c77ac5089632e24bd02d7ae8f7ee0923e"}},{"ruleId":"D2","level":"warning","message":{"text":"DfmExtractor.parseComponents (cognitive 19): DfmExtractor.parseComponents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 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":"src/extraction/dfm-extractor.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4047f81c2888c2e1b0c80e17c561432858638812687d55939ffd47769eb6e4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"VueExtractor.addOptionsMembers (cognitive 19): VueExtractor.addOptionsMembers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, boolean chains 3, ternaries 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 6 belong to 2 function items 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":"src/extraction/vue-extractor.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"da66b0269669f92e167645cc5da9e2bc9df49ab51b1b573caa148aba81031dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.attributedDeclarations (cognitive 19): drupal.attributedDeclarations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (8 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d704e06f364957c7c842843e5f899d23af2e9cad37cb655151ed1c856ef4470"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-libraries.readDirectiveTokens (cognitive 19): dart-libraries.readDirectiveTokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"46da57ca9f001211dbbfe7b3d8dd91590824ee78014bd92e39f331dafe101445"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.endOfConstructor (cognitive 19): dart-local-scope.endOfConstructor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce02f7476e648e3df1941ec478ad6efcaf084cd41e02598e88f2071921d7535"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.vbCode (cognitive 19): vbnet-receivers.vbCode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d016ee93206ffe27ff67049dea7059d35b4ec3b971f9a129daca4afd72f392"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-includers.cppIncluders (cognitive 19): cpp-includers.cppIncluders has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-includers.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e480334268e402144a084186909b695a383901266aaa77c5dbd99d82d65aee3f"}},{"ruleId":"D2","level":"warning","message":{"text":"c-macro-renames.cMacroRename (cognitive 19): c-macro-renames.cMacroRename has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), boolean chains 3, 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":"src/resolution/c-macro-renames.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"45363a6498db9b6c9e9e330d940be07992676a326468c322f47790447efa3fad"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonGlobalReceiverTarget (cognitive 19): name-matcher.pythonGlobalReceiverTarget has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 5, ternaries 2. Of this number, 14 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9162acfebe2c000d1d5aee0402305662a2f639990fc63ecb4861c0d3f9314ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goScopesOf (cognitive 19): name-matcher.goScopesOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f490bd5772fdf28a2e4cd42d55d7ac275f637138707533515e990a60a1a7d20d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonBoundBelow (cognitive 19): name-matcher.pythonBoundBelow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 2, ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0370ace690f3de8ee746386a498f1fa3894d8789bf91f33d2c7a76728a7e247"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchDartChainLink (cognitive 19): name-matcher.matchDartChainLink has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6, ternaries 5 (6 pts), boolean chains 5, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5381}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bfa1fd006496b8cb3f231871889a88a30b28cf566f5cc7117d6f213212c1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isKotlinMemberReachable (cognitive 19): name-matcher.isKotlinMemberReachable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":7262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f41dc9e84c2a5936bca7a698e150256b2b9f5360000a63a1beb0c2d4fc9088a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.scalaImportsOf (cognitive 19): name-matcher.scalaImportsOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":7886}}}],"partialFingerprints":{"codehealthFindingId/v1":"0804664efb96f71666cb6cef3daa5d0d64c22821b0e2de3bf86339b1c6ba1ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rubyMixinsOf (cognitive 19): name-matcher.rubyMixinsOf has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (7 pts), boolean chains 6, if/else 4 (5 pts), loops 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8905}}}],"partialFingerprints":{"codehealthFindingId/v1":"80531bccb2f0d91754f77944cbdf57d2e1504b893c75f7607049edca3a46ee21"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustAttributesBefore (cognitive 19): name-matcher.rustAttributesBefore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad91cf04494c22e12fed645425c92f4f122fb6420b98a1f9de8420d77ffc1928"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.parseRustImplHeader (cognitive 19): name-matcher.parseRustImplHeader has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adc544c6dbf1aff0ed4522e7a73e1d37f8c201dcf13a7b1b34758f7dc74e202"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchRustSelfPath (cognitive 19): name-matcher.matchRustSelfPath has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (pick, a function literal at line 11686, a function literal at line 11684). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11673}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e01b04e89dfa339da76aad94adc7d0ad24545b46652209d6b05db84a28b61b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.expandRustUse (cognitive 19): name-matcher.expandRustUse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":12088}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17a5259e8c979608af7bd495c51c997b9e297ac80737c683645b84914e568c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustAssociatedReturn (cognitive 19): name-matcher.rustAssociatedReturn has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 7, boolean chains 4 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":12481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67c6d83697162010c24719ae7b2457f029143b77d2f7583e19b0c07f97feefc"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveObjectLiteralMember (cognitive 19): name-matcher.resolveObjectLiteralMember has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 7, ternaries 3. Of this number, 10 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15272}}}],"partialFingerprints":{"codehealthFindingId/v1":"323acac7764d3fdffdd8ef0ea551728094ccb5d41b5b2bcce0e67f4066155e40"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppClassParenDepths (cognitive 19): name-matcher.cppClassParenDepths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (5 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":17304}}}],"partialFingerprints":{"codehealthFindingId/v1":"72abe3b158b2262cae79dc99014964d932c1db2c0ace40a04de1342b78830e98"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppInheritedDataMember (cognitive 19): name-matcher.cppInheritedDataMember has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 3 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":17395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016750b8c27c8ba58aefc2e81f4ad83362bb3480a0690236d34d51118b7b85b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppProjectScopeNames (cognitive 19): name-matcher.cppProjectScopeNames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18447}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcffcb5614c1a0bf97e4e7f7168d885822c573dc188d198005da0eb51e1d666"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppArgumentType (cognitive 19): name-matcher.cppArgumentType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (6 pts), boolean chains 5 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":19339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0bff1028b927689bb9ffcf1b73c9ca3a632f4e710fceead8f7cdef19dd40ae"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.classMemberLines (cognitive 19): name-matcher.classMemberLines has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2dbcb6826c362358ca314662dd559a69c7944f2e36d09dbc090f25ca14626c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.preferGoBuildTwin (cognitive 19): name-matcher.preferGoBuildTwin has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":26402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4833095f9f045f3bf38f6d85abf5c6f64fc7c2fb018597d95335d0d00af805"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonBoundInDef (cognitive 19): name-matcher.pythonBoundInDef has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":28048}}}],"partialFingerprints":{"codehealthFindingId/v1":"63afb05255ca3196e006f3ae9c13d197806d8a5e8844563b36a67a87d255b4fc"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchRustSelfFieldCall (cognitive 19): name-matcher.matchRustSelfFieldCall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29834}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38063238e39b4a945e478486a83dac32c97c8747f0453a5280de90855d29f24"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.soliditySupertypesOf (cognitive 19): name-matcher.soliditySupertypesOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 2 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":32736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f54a4cf168da766b2cba6418458e1d691bcfd78100c67bc916692045fd77dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppOverloadFit (cognitive 19): name-matcher.cppOverloadFit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, loops 1 (nesting depth added 3). Of this number, 18 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":"src/resolution/name-matcher.ts"},"region":{"startLine":33048}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d517c9a8895a1f7ae028318ab74a6a81bd83149dc78d15b51aaf783aa66448"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.extractGoImports (cognitive 19): import-resolver.extractGoImports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 5 (6 pts), boolean chains 5, ternaries 2 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 6 belong 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e937dffb681870960a10d07d3f501c01b16a26672e9fea1d6a38f626ff95ac"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.pythonImportsInScope (cognitive 19): import-resolver.pythonImportsInScope has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 3). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 3671, binds, keyOf, \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":"src/resolution/import-resolver.ts"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ed1c706687cf6a7d66093e406798e2d8050c83e163ac9ef865496150e69fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.importBindingTail (cognitive 19): import-resolver.importBindingTail has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":4651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee083025d191037808db9fc8cb3261faf3ad1e06e005f40a53d8320271b870c8"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.readArgs (cognitive 19): nestjs.readArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c705c54432932b443cd69d921e085d4bf58e128b2082bb589ae4b975e35f06aa"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.splitTopLevel (cognitive 19): nestjs.splitTopLevel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c77dee67e43af228916fec2e45c1f54bbfdd60e8e55c645d32005fb017ff7f"}},{"ruleId":"D2","level":"warning","message":{"text":"react.configHrefExpression (cognitive 19): react.configHrefExpression has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 2 belong 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7618cbd7f36304bdcd3012c585d2effbb01aa041336ad59bcbe66db8db988af7"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp.fastEndpointConstantRoutes (cognitive 19): csharp.fastEndpointConstantRoutes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"72031fa763586fcca8dd2861d56e63a1ef37765c69a29fbdd20dba5cebf9cb91"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.curriedWrapperBoundName (cognitive 19): TreeSitterExtractor.curriedWrapperBoundName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":7554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fd5c2736901f9efac0d5b7e70da6a8dc32125c67ed0d64e53ad7d7fcc225d8"}},{"ruleId":"D2","level":"warning","message":{"text":"module-importers.bindingsOf (cognitive 19): module-importers.bindingsOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 6 belong 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":"src/resolution/module-importers.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"80090d4aa024061fa922a289c5fc52ff00c92b4e18426d1a91b6a934a7ef2731"}},{"ruleId":"D2","level":"warning","message":{"text":"index.discoverEmbeddedRepoRoots::visit (cognitive 19): index.discoverEmbeddedRepoRoots::visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3, boolean chains 2, error handling 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":"src/extraction/index.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"92de1ca76224e40672662bbc4e16b7950eabe557e3a6dba1d0e2ca8d570f883d"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.collectHttpSites (cognitive 19): tier-synthesizer.collectHttpSites has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (add). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7155a468516ed0a0627f07cc77a23e37f524aa1c60b35bb5b7fe8585ed2519ce"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.findForwarders (cognitive 19): tauri-synthesizer.findForwarders has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 8 (14 pts), ternaries 1 (3 pts), boolean chains 2 (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 shape REPEATS in the file: one other method here (tauri-synthesizer.findForwarders::forwardersIn) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a6870a3cc9585ed0a72591fa731ce534bbb25f8a5b24a2558788f8ef8f10a9"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goPromotions (cognitive 19): callback-synthesizer.goPromotions has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 4 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 8). None of this is in the body itself: all 19 points belong to 5 function items inside it that branch (ifaceMethods, kindOf, embeds, \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fa7d7e01a3343ef1b51fa42d9032ed006f7d7af14d1351df44e4be6a00d4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.hasSynthesisPattern (cognitive 19): callback-synthesizer.hasSynthesisPattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, loops 1 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"65768bcfc8767a6a0d4f345064f40653f20e9e8f0554c34b21da75fa8311cc39"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-parameter-flow.splitTopLevel (cognitive 19): ruby-parameter-flow.splitTopLevel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad34e7ca97e0bfe241cd48551bf435e2f8405d257dda2dff06090ee46cf69260"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.runPostExtract (cognitive 19): ReferenceResolver.runPostExtract has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 3 (5 pts), error handling 2 (4 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d634fc001f6277dc36bcc6a6a7f7753627fc816f7ccb5fd03f6c9714408dd44e"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.loopsInTree (cognitive 19): branch-guards.loopsInTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"832360241057a6843ad2b0d7664962c40d8195a78b152eb108e69a7b38f57934"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.exploreCompletenessNotes (cognitive 19): tools.exploreCompletenessNotes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (4 pts), loops 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":"src/mcp/tools.ts"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8d7b4603a2d8f7ab130e169b016b96f4f0ade01accaf0faed3469fcbe4d0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"map.pickDefaultDepth (cognitive 19): map.pickDefaultDepth has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/map.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a95848dd23115820c27fe63da0b8caa1575de7007c10189f68fece8470f8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"program.itemFor (cognitive 19): program.itemFor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (8 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":"src/ui-server/api/program.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c2a44798e48f32e983984e67ac43bc0b6fa70d8a1359a2b0a8c7de3fe54df8"}},{"ruleId":"D2","level":"warning","message":{"text":"trails.parseSaveRequest (cognitive 19): trails.parseSaveRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 3 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/trails.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f454da099e911cb7282e332540c341532e0ec4bbcd797a2c743464822ceda05"}},{"ruleId":"D2","level":"warning","message":{"text":"filecode-model.buildFileRefs (cognitive 19): filecode-model.buildFileRefs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item 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":"ui/src/lib/filecode-model.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cbd3b5ba585c944f04f8c89fd60ca9e1c9c01c14517ccfb2152e45e17b3217"}},{"ruleId":"D2","level":"warning","message":{"text":"export-svg.flowCardSvg (cognitive 19): export-svg.flowCardSvg has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 7, boolean chains 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"570d24faca60db89e9a13a24b6de1f134599df98455928279e72ba3a7f1107de"}},{"ruleId":"D2","level":"warning","message":{"text":"conditions.splitTop (cognitive 19): conditions.splitTop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"ui/src/lib/conditions.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f4485c2ebb43f474a47641f2fe3ffe2b7f06149e2856a0d18feca8be3293af"}},{"ruleId":"D2","level":"warning","message":{"text":"screens-model.placeLabels (cognitive 19): screens-model.placeLabels has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), ternaries 4, loops 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 8 belong to 4 function items 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e06cb005c636af119e0d2ea435a35e90aa05eb4f7e58493b03c25592b6957f"}},{"ruleId":"D2","level":"warning","message":{"text":"steps-model.buildStepsModel (cognitive 19): steps-model.buildStepsModel has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (8 pts), loops 5, if/else 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/steps-model.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78f2c491d8bfb4625891135020ae4eb01e67466b1888693035fd36cda226cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::collect_member_type_names (cognitive 19): Walker::collect_member_type_names has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"66260d3585e39d4bd88ae3bbb58437efba9aab5468b5ca4519405c257fdfab10"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_decorators_for (cognitive 19): Walker::extract_decorators_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f57411cd5aba95c60e4615bfb082399e30e11fd0a992c86ab3dfc7674c1fc3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::emit_import_binding_refs (cognitive 19): Walker::emit_import_binding_refs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9fca679d29b31012e173e9859e052b7c8f729db0313ae818106a1157462292"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::rustlang::strip_turbofish (cognitive 19): codegraph_kernel::rustlang::strip_turbofish 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"60529a801b50c74c9caf5b58a8c99d9ec605b67512e3addab3ed41bb876673f2"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.insertNodes (cognitive 18): QueryBuilder.insertNodes has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 815). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0e9de20a49aa8a63d0efa2835b01a793035517dd51bac9745d30c5c2392ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"queries.foldModuleRows (cognitive 18): queries.foldModuleRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). 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":"src/db/queries.ts"},"region":{"startLine":5915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1faaa2adbcbfa3412b1aafa079e65560de2ea782c7a2d3378409a8d13f3d455"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.collectMemberTypeNames (cognitive 18): c-cpp.collectMemberTypeNames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6cb178d46fcb4853312241611c497297aed5bd07df2b18fc019560eca72077"}},{"ruleId":"D2","level":"warning","message":{"text":"SvelteExtractor.extractTemplateCalls (cognitive 18): SvelteExtractor.extractTemplateCalls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/svelte-extractor.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"132a064768d7a262cb03d24593cad6e84067947dab6ce1ab8c916b5eecff734b"}},{"ruleId":"D2","level":"warning","message":{"text":"AstroExtractor.extractTemplateCalls (cognitive 18): AstroExtractor.extractTemplateCalls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/astro-extractor.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c95af2991a0f6977157856f71aa7a332cc083c0ed9c0c6241185b42c16c293"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-options-api.vueOptionsMembers (cognitive 18): vue-options-api.vueOptionsMembers 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/vue-options-api.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1aec808172046e694fc6aa3aacc5fefbc96a0b6835d143c5d444cfd51cc3045"}},{"ruleId":"D2","level":"warning","message":{"text":"path-aliases.loadEffectiveOptions (cognitive 18): path-aliases.loadEffectiveOptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, ternaries 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":"src/resolution/path-aliases.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cabeec5cd613742086ae86cb3d3662ac6e54b04223f73c028755d5945eb6f6"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-packages.readPackageEntries (cognitive 18): workspace-packages.readPackageEntries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 2 (3 pts), loops 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f229f4e628ec85474d627b134597d4243940ee778bf1191f7117092b1cdf3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codeigniter.methodOf (cognitive 18): codeigniter.methodOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). 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":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d0369c62a6b2085c94d8296130af64e997fd06774865c453e7e7cb080e9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.gateDartLocal (cognitive 18): dart-local-scope.gateDartLocal has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c889c8bfdb340090db872cd2b66066cc499259f3dbef1a9c9ce9c172b76a4625"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.bindLocals (cognitive 18): dart-local-scope.bindLocals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function item 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"916b801eda9bbfc75bd2cf1a8f03a21c3149a265e6c15cb3e5bd478898eb7d72"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.blankTypeArguments (cognitive 18): dart-local-scope.blankTypeArguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a445045430e925b7400741fb1f1da6e9699854945ce6297e314e424be5c830"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-type-aliases.templateParametersAround (cognitive 18): cpp-type-aliases.templateParametersAround has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f182436cafa91d2a92138635496282143b964cd948fecc219a6ab7f94a64792"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-namespaces.cppMacroNamespaceFrames (cognitive 18): cpp-namespaces.cppMacroNamespaceFrames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 115). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-namespaces.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044a3c5f662638a8c3e207691625bd105dceb1cb3dca6372df7f10f30e46fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonImportBinds (cognitive 18): name-matcher.pythonImportBinds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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":"src/resolution/name-matcher.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"0708bd2866ad5f7e7baf6517ad8876cd3fbf7846a1d65b553c713ba28568e0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goParamNames (cognitive 18): name-matcher.goParamNames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 3 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffde3e925bd1665615a1c51d9ab6ad987225b4b3854399ab750bd3b5f5325294"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dartReturnType (cognitive 18): name-matcher.dartReturnType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 6). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5849}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bae19b6ac593d40a87d88d677685212318ecc38e5244eabb3c839a3cd6b3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.csharpSupertypesOf (cognitive 18): name-matcher.csharpSupertypesOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 4 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae3fd88de28d3767bf49c3c88ed8151be10d07bc5a6df27a5c1492f3d6ad93"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustDeclaredItems (cognitive 18): name-matcher.rustDeclaredItems has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":10466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dea3c05fa77e5d4607388d4c7265e19dd4b4f7ed928aa2c78facc9f88e6b286"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustNameRead (cognitive 18): name-matcher.rustNameRead has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 5 (8 pts), if/else 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":10935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d40a531a29eee942c133ef032aecb83a21f19145bacbdce01d9831e90c3b5f1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.bindingScopes (cognitive 18): name-matcher.bindingScopes has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 7). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15818}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5545e12abf74ede380b8cb60bb34c0ffcf2db1228935c80bcb45466fbdcd0df"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goSlicedType (cognitive 18): name-matcher.goSlicedType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (5 pts), boolean chains 3, loops 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6ae49ec14b338adadb92c4b5fae2af6c0c20f26b4601bddf291ac5aafeb14c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goTypeSpec (cognitive 18): name-matcher.goTypeSpec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27471}}}],"partialFingerprints":{"codehealthFindingId/v1":"80db0a135e365e0c81f0cb9f863ad1dd074f75338a9180826c31a78321de95e4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goTypeTextEnd (cognitive 18): name-matcher.goTypeTextEnd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (6 pts), boolean chains 3, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27615}}}],"partialFingerprints":{"codehealthFindingId/v1":"560a14158f5cf37d997914f8b39f3c33acd5c5d2c409df79baeb31cfb75d8a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.readDefaultExport (cognitive 18): import-resolver.readDefaultExport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (7 pts), loops 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":"src/resolution/import-resolver.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62d810d12e1fa30bb41c12e8f32e1a13b4ee49a2203f0f9a323c963fce04ada"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.typeQualifier (cognitive 18): import-resolver.typeQualifier has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), boolean chains 5, if/else 3 (5 pts), ternaries 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8551d5236079c65bb6481a2acab1088d117f4ab60a31078f2844d14e0c7f087"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.importedTypeMember (cognitive 18): import-resolver.importedTypeMember has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6d209a0d3dbf09440f527b96ad670eec4716461c37cb9da96503b0116e0296"}},{"ruleId":"D2","level":"warning","message":{"text":"express.matchDelim (cognitive 18): express.matchDelim has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/express.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1a34aefcd50c2f9c99f397ee2943acfeb1805958fc4ff72fa01863b1a8aec4"}},{"ruleId":"D2","level":"warning","message":{"text":"react.dropGluedTemplateHoles (cognitive 18): react.dropGluedTemplateHoles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (4 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a21d7e3673369e007669ed7c154facc91b70560627d1d21ff26837a4008d6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"react.loaderOf (cognitive 18): react.loaderOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 pts), boolean chains 1, 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fac9c1ea274d4a5d76995073bc7cf2c5ea2038a6e513a7e2693c2323c39df7d"}},{"ruleId":"D2","level":"warning","message":{"text":"tanstack-router.chainAfter (cognitive 18): tanstack-router.chainAfter has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 8). 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48f564e39567c626b77e983e48e268e6b8e3b140e4a689b6f7d78aa07228de0"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-router.propertyInitializer (cognitive 18): angular-router.propertyInitializer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9f6f3f6fd0c201bd84cd571a3c5fbad705f22218f5f9292b97f4f45f68e239"}},{"ruleId":"D2","level":"warning","message":{"text":"python.balancedArgs (cognitive 18): python.balancedArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/python.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b2690ef1653d7684e78b0bcfa46a569495f1368edd6fd9cacc0e9ca0f55695"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.visitPatternDefaults (cognitive 18): TreeSitterExtractor.visitPatternDefaults has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5dc288f44e86ffece04e9654bb92aa43c79a8e7609f2277c73d72e2fa8f0d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.walkPascalRoutine (cognitive 18): TreeSitterExtractor.walkPascalRoutine has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 4 (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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3b91b875b58e6001e643e56df2c18f920d27db8e6c3839587995d6c0962f02"}},{"ruleId":"D2","level":"warning","message":{"text":"type-parameters.collect (cognitive 18): type-parameters.collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/type-parameters.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e905bf4d735d5eafe0f759dd3e3a75b530060ffe752c21763de014b761731ac"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goCrossFileMethodContainsEdges (cognitive 18): callback-synthesizer.goCrossFileMethodContainsEdges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function items 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"991e54f0fac8948b43567a981a98f92dd109d305f0eb3fc743fab9aa839abeca"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveCfmlIncludePath (cognitive 18): ReferenceResolver.resolveCfmlIncludePath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5440b3e357ad42c542eefeeaac9102e65c27c89742c81f5270df6b6f9bce3e"}},{"ruleId":"D2","level":"warning","message":{"text":"claude.writePromptHookEntry (cognitive 18): claude.writePromptHookEntry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 5). 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":"src/installer/targets/claude.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"897597a2a5e4a244a25dac5700f7e5c5ccdcd08c51e4f5c7375c92a590d0f05f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.detectInstallMethod (cognitive 18): index.detectInstallMethod has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/upgrade/index.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa9ddfbd72e22b6db500a8b03951d4b90b8a3dca5db1c95e9c95f6c8a7b9a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.buildPolymorphicBoundaries::memberOfSupertype::visit (cognitive 18): ToolHandler.buildPolymorphicBoundaries::memberOfSupertype::visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (3 pts), boolean chains 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. This shape REPEATS in the file: one other method here (ToolHandler.buildPolymorphicBoundaries) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c27f257dbbeee08301e323297fa5e8f10892b41d1e8de1a14ef9567a5a6a56"}},{"ruleId":"D2","level":"warning","message":{"text":"index.toWireLines (cognitive 18): index.toWireLines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/highlight/index.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62e3f616019d7943b5b98478315c7d6011a4316457603743fd65c39b094e0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.buildSteps.firedByEffect (cognitive 18): steps.buildSteps.firedByEffect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, 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":"src/ui-server/api/steps.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2813c03efe52b34a55e5f71e7938003d125feb55e6be51eb5eb1cc57dfd948"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 18): Walker::extract_inheritance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f335b4e15c085c8a50df1f4a8050a93c3f3998a4ec446f49e841efc8706bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::create_node (cognitive 18): Walker::create_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55848bbd30a171951535bb46c2843a21805bec897d1ebfca3975dcd58eb9fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_import (cognitive 18): Walker::extract_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fa639d085295c74c2fbbb5aca606b6d801dea6d7d0df079e7a6582ab838a82"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::consider_decorator (cognitive 18): Walker::consider_decorator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4567533ef8574f749ee5f78213b824379b7029166f68e2f783482e44cc6c5a04"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 18): Walker::extract_inheritance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09c09f144e50c010e21073e00e7e58387e9badade273a16c6012b576fa07c62"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::lombok_annotation_names (cognitive 18): Walker::lombok_annotation_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (nesting depth added 11). 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a546973987988e6df124d806b93a37068f56547f9d77bf49735a5a442f8bd4e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_import (cognitive 18): Walker::extract_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 2). 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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fedf64f46464d00b4bc0ef4322f87fd601687ab34f0fa6b8efa1e4e867f5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 18): Walker::visit_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9154bfd30026f721e791a80c3302ed655448a20302701e4fd1aeeb34c9d0f38e"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_rust_route_macro (cognitive 18): Walker::extract_rust_route_macro has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeb092dfaef98936161fafa53c7cf09b53fff2a3fcb51c6fcf2d9f932e8bc1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 18): Walker::extract_static_member_ref has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e1e4ae09ce5d869d12d8e1b2d0b040ae43315b67c2a1848599467b84b659e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::consider_decorator (cognitive 18): Walker::consider_decorator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe058bb4d28a516479e45b87a2fd61a474e0b45a9c052644516e42d86ecba1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cognitive 18): Walker::normalize_fn_ref_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7772fe6aedfc618bbcd00e0747519c7646a0d427fc82bfb1b6d8aecc80a24ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_pattern_defaults (cognitive 18): Walker::visit_pattern_defaults has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"743a340e606276b01a2a4b28ff6f8f0ba8c62633686e4760c50a045d75e98a06"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_dispatch (cognitive 18): codegraph_kernel::cfnptr::scan_dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), match/switch 2 (5 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7d045325ba7ac89f594b8aee76ae4428d15480f6f8c7e8156095b00722c154"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_array_dispatch (cognitive 18): codegraph_kernel::cfnptr::scan_array_dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1, 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e909d4592ac99b0c87be9a17557526e089500dc3baf6fc99db71ec7153ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::go::go_scoped_fn_ref_scopes (cognitive 18): codegraph_kernel::go::go_scoped_fn_ref_scopes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa615a24c64c7253f140ac27634d6396dad132690edf8ab44b836f6cc0e5487"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-registry.removeDaemonArtifacts (cognitive 17): daemon-registry.removeDaemonArtifacts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 3 (6 pts), 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"93abd148d3d86c558c3b578403ed59c18aa11db7daf6c33d01bb5064b27d884e"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-registry.daemonStopFailureMessage (cognitive 17): daemon-registry.daemonStopFailureMessage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64d9b053f99c1d4df8144ac0da26e8f170221bfb58e8e817e5d933ffe2c4c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-registry.stopVerifiedDaemon (cognitive 17): daemon-registry.stopVerifiedDaemon has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (5 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d40c045685a884b2072530005cd682705abb41ee1af4d1825a7dde8b3f8fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Telemetry.setEnabled (cognitive 17): Telemetry.setEnabled has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (6 pts), if/else 2 (4 pts), ternaries 2 (3 pts), boolean chains 2, loops 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":"src/telemetry/index.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5014c467748ab40ca38e9d2375ffdf4227c54463cc56aae7e24be43d0600d8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-detection.isMinifiedContent (cognitive 17): generated-detection.isMinifiedContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/generated-detection.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"332b1529e50214d0e52c7b18991433193e7a8f5e3126d23103b1153ead7d895e"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryBuilder.findNodesByNameSubstring (cognitive 17): QueryBuilder.findNodesByNameSubstring has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5 (6 pts), boolean chains 4 (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":"src/db/queries.ts"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f256b633035391ef79d02608849371e35fcefa32fea4ca1dc4db3071414443"}},{"ruleId":"D2","level":"warning","message":{"text":"grammars.detectLanguage (cognitive 17): grammars.detectLanguage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"80114a66191c835374af6d8e9f3f03dbe5f453b951649e56cb9fdf106673619d"}},{"ruleId":"D2","level":"warning","message":{"text":"swift.joinSwiftCompositionContinuations (cognitive 17): swift.joinSwiftCompositionContinuations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (5 pts), loops 2 (3 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":"src/extraction/languages/swift.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0184aaaddc9d850dc3b5a5f8422737bad2abd23cf77c8505fef2ecb22b90d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"cfscript.cfmlCreatedComponent (cognitive 17): cfscript.cfmlCreatedComponent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cfscript.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"521b3050e36b780909a4636842ab5c50668febb4aaf62acaa95add3c146a2d94"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.qualifyReference (cognitive 17): terraform.qualifyReference has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/terraform.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7b955f630bdfa532c4872b5c707f4b00c563efeb8cc22d7425db91a4407680"}},{"ruleId":"D2","level":"warning","message":{"text":"vue-template-calls.rootTemplate (cognitive 17): vue-template-calls.rootTemplate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1, ternaries 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f599e3b88014a2f444233e6cf897ad6c7db48ab24411a1c4de251423fc55e373"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.extractDrupalHooks (cognitive 17): drupal.extractDrupalHooks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"580ef76c5e5e68f5a514593ccd77ee76c3e5c4ac575716bf9293920024f8c4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"swift-type-visibility.gateSwiftTypeTarget (cognitive 17): swift-type-visibility.gateSwiftTypeTarget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, ternaries 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4be17b63b1c8888c9431c477f1fc5880a77b3b09959e1f26e9a07b2a56ecb3f"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.endOfStatement (cognitive 17): dart-local-scope.endOfStatement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2 (3 pts), 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d5a2d7814a5bfbb94eadda334209247492204520cce7460f5d4a439e97dc48"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.typesNamedAt (cognitive 17): vbnet-receivers.typesNamedAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, ternaries 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5710596debc90665f6f87744809991dcf9448423245b74b184507a8e4b787724"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.readExtension (cognitive 17): vbnet-receivers.readExtension has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4, boolean chains 2, loops 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb77552fb60af8097bcd81c56ea0e833a71d29019cb4ebbf27281a6535227cae"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.receiverAt (cognitive 17): vbnet-receivers.receiverAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1221ff5230f4d47971739248ced1e947e00fa1872dd43dfecc80d2541b95bcb0"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-macro-visibility.resolveInclude (cognitive 17): cpp-macro-visibility.resolveInclude has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 7). Of this number, 16 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b78353ee1b18e45e3867a0b6f8acfa5f53afc697a59911790f68e275dfdc30"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonCaseCaptures (cognitive 17): name-matcher.pythonCaseCaptures has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a594e0c04de4b75d17357200fd07b53f416c6549d827cc31eaea8bd38db6db"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pythonOwnGlobalWrites (cognitive 17): name-matcher.pythonOwnGlobalWrites has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 7). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 1145). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e2f6bd4d0f17df17a676cdc3db876961b69624e224ee95ae7e12b4b03fbd5d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.withinCppTranslationUnit (cognitive 17): name-matcher.withinCppTranslationUnit has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8030ba3e1fb2c5035409ba82f45d2d80ca2f1705b8d0b39989404345e340b85"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isSfcPrivate (cognitive 17): name-matcher.isSfcPrivate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b758430f30771b649e20b037f5f3356d5bb1bb758e701201210d56ab276784a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.usesNameOnlyAsReceiver (cognitive 17): name-matcher.usesNameOnlyAsReceiver has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":4386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc45bbfbb86dd75ae82597b64398fe2ed3cd7892012fcb7e6c6bc91b1c24bf42"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.dartAnnotationAt (cognitive 17): name-matcher.dartAnnotationAt has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (5 pts), boolean chains 3, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb2d81ce191a8c86e0fddb91cbf82f09e8837b8eb453da44635a61c2bba9d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.isRustAssocBinding (cognitive 17): name-matcher.isRustAssocBinding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9ab84d6d62f2598e3ead4d46222d65885cf58d027a9fd06b5c9ed954308e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.readRustMethodReturn (cognitive 17): name-matcher.readRustMethodReturn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 6, ternaries 2. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12574}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa35d4286c913ec049db13b5074f54422e3f20b5474b3b701354f26ed83d79b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustOutsideTypeCall (cognitive 17): name-matcher.rustOutsideTypeCall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 4 belong to 4 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e609320a6da067749eb944547975f5181a0a799f3fe73510820d4ea7d500aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.destructuresMember (cognitive 17): name-matcher.destructuresMember has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":15735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acabb3533e76b1bffc34fe5fec1893a25f5f1e40cdd25288854887ce5257fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.esInheritedMethod (cognitive 17): name-matcher.esInheritedMethod has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (inherited, a function literal at line 16068, a function literal at line 16076). 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16065}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6441a37bcf845b040a88fca9bae8eedd61ff8293435fe57834f3392e4e654"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppReturnTypeWritten (cognitive 17): name-matcher.cppReturnTypeWritten has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (2 pts), ternaries 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17069}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0261d4c167eb725e76157a4bf64cee0e980c173e186ca34a5d2b32717ba9fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppArgumentListFollows (cognitive 17): name-matcher.cppArgumentListFollows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), boolean chains 4 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":18814}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf5fbbe6300e4406b06918f0604a62330314f8334e807e420f6ead2f4366734"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppUnqualifiedTypeFit (cognitive 17): name-matcher.cppUnqualifiedTypeFit has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 5. Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":19517}}}],"partialFingerprints":{"codehealthFindingId/v1":"37946018565fad510f05f98ea0d3a6be94d81c5d557b475551a87626c75c783a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinLocalCallResultType (cognitive 17): name-matcher.kotlinLocalCallResultType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 3, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21102}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7550d797ebc598cfb7f9d6a9c8b431a809f6fb9c718ae1145fb674d7fbe2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.kotlinReceiverDeclaredType (cognitive 17): name-matcher.kotlinReceiverDeclaredType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, loops 1 (2 pts), 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22002}}}],"partialFingerprints":{"codehealthFindingId/v1":"7667e30787d75b56b15882b89fcda427c8f4cb424a4ae661706a7383d837cea1"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goEmbeddedTypes (cognitive 17): name-matcher.goEmbeddedTypes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25835}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6017125acd142f14f6bfc343ed3db279781df8d25209e1e980881b9411608eb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goParseBuildExpr (cognitive 17): name-matcher.goParseBuildExpr has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (4 pts), if/else 2, loops 2 (nesting depth added 1). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (not, or, and). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":26291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71b79a0799ef32982578a5c123e25b40ccfc7e906ca22e1b3e691b260dbeed"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goNamedTypeDecls (cognitive 17): name-matcher.goNamedTypeDecls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26945}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd581a9c7a83a5e4c3b1a9a7ad72051d8a086d89f9cc7a42c2b79975c88040"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchRustWrittenReceiverCall (cognitive 17): name-matcher.matchRustWrittenReceiverCall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":29444}}}],"partialFingerprints":{"codehealthFindingId/v1":"633cc2bfd4dd106e4e803074c319f236300f7d7c7ae4f2fe25c391d1a750574b"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.tsClassTypeParameter (cognitive 17): name-matcher.tsClassTypeParameter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":30618}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e2bf499eda3b58375d3077c141a57fc8e899b0472065d31e5c67d68250d35"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.exportedByName (cognitive 17): import-resolver.exportedByName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"03243162db2e62fb0396250a21ee4efee8ba7ff545bf0a956e42af2430343c95"}},{"ruleId":"D2","level":"warning","message":{"text":"react.conditionalBranches (cognitive 17): react.conditionalBranches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b0d4c1144c164b5fcc9717161c53349daf5310d8eb4d65b572bed81b0adbd6"}},{"ruleId":"D2","level":"warning","message":{"text":"java.skipGroup (cognitive 17): java.skipGroup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 3, 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c5045614bf6bd6f69d066516ace1326ad495c71a3927c6d4966e0fb8392789"}},{"ruleId":"D2","level":"warning","message":{"text":"java.readAnnotation (cognitive 17): java.readAnnotation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfac66f69f0dbd6b7cf5f530dfbda0e71ebe299f5660b9fa68b4956b5e1597cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractRtkEndpoints (cognitive 17): TreeSitterExtractor.extractRtkEndpoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":3726}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf5e1314628faed9f504aea9915aff1ff4fa023755fee990c09598e2474f82b"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.classNamed (cognitive 17): pascal-scope.classNamed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 5). Of this number, 9 points are the body\u0027s own statements and 8 belong to one function item 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"800b3c018ee6ffd2c620039b6daf760299bf76fb6705c498d15028b28cf85ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"type-parameters.matchingBracket (cognitive 17): type-parameters.matchingBracket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (7 pts), boolean chains 1, 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":"src/resolution/type-parameters.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8867fd4cd44a541a12d25ebf2604a4eb1828d7d3ec669a4638241ac57c346"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-constant-paths.ivarClassFromInitialize (cognitive 17): ruby-constant-paths.ivarClassFromInitialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), 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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1401aacb0f51e2ef2a4aa66e5b1351d1547a1e4c48c458adec2f3b827fecc959"}},{"ruleId":"D2","level":"warning","message":{"text":"next-proxy.readProxyMatcher (cognitive 17): next-proxy.readProxyMatcher has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (7 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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a455af8859e51ceb7ff9492b648d9109e2e774371ebf535695d254053099805"}},{"ruleId":"D2","level":"warning","message":{"text":"react-router-synthesizer.linkWrappers (cognitive 17): react-router-synthesizer.linkWrappers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3218a7e76d9ecdb3913cbcbb428dee23f9f4cbe3b7d56c9cdc174a5264f5d01"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.fieldValue (cognitive 17): angular-template-synthesizer.fieldValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdb54bc2012d08adc932e0bea31cbd2ef826ec2f54b52740d3a6ea8c52434aa"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.expressionEnd (cognitive 17): angular-template-synthesizer.expressionEnd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb78a1a43527a4709ca2a180fe4341093385812df2aad69ffdec5d793cdaabb"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.statementEnd (cognitive 17): angular-template-synthesizer.statementEnd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4035f4ec93c0a07542e84b2c2b4086ab79f3d006a12ec3370e3a9bc895ff81f"}},{"ruleId":"D2","level":"warning","message":{"text":"angular-template-synthesizer.memberShape (cognitive 17): angular-template-synthesizer.memberShape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de48b26bd024f1c6edfdb8f96b068e66a40b5814c35fde520c09323195c74cc"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.matchHttp (cognitive 17): tier-synthesizer.matchHttp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376b1bf9dbd9f86fbb09e62772927080e31724180c7f8fc7f8f646b69ca35ea"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.bindingElementAt (cognitive 17): callback-synthesizer.bindingElementAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"5570ae6d8576575af94c3add4d1e948820a89ff261eb1fdce9889a866b46b75b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.reconcileCrossFileNodes (cognitive 17): ReferenceResolver.reconcileCrossFileNodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4, 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":"src/resolution/index.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f08af735b44ab3c658396465faefbcc38f4dd1743289484c2b28f120e926d5"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWatcher.start (cognitive 17): FileWatcher.start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1, 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":"src/sync/watcher.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bc9d58340813722749625b7e21ef0e28ac2117006d68de0c1b32ce623a1878"}},{"ruleId":"D2","level":"warning","message":{"text":"git-hooks.installGitSyncHook (cognitive 17): git-hooks.installGitSyncHook has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 pts), error handling 1, 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":"src/sync/git-hooks.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b23cfb64c8abfc4cc6f2d94b1033799c0149b031168d9809b90fa768856797f"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.argumentsOf (cognitive 17): branch-guards.argumentsOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"6034878ec303248a6b60f6ebfa93423b5b02ee2e909c77ca23a86dacee466d39"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamic-boundaries.isRuntimeImportArgument (cognitive 17): dynamic-boundaries.isRuntimeImportArgument has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b0ed3348d4e7a1ce002690599a3cff067e69f001098d4ae30868f255a37be2"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamic-boundaries.scanPythonGetattr (cognitive 17): dynamic-boundaries.scanPythonGetattr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, ternaries 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02ab34a3eb99dec47cf7667aea421269ef638b045c186b3a0dfc62fb1cb8813"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.getCodeGraph (cognitive 17): ToolHandler.getCodeGraph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 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":"src/mcp/tools.ts"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f2a661d55e043a894f1895d527a11fe052958ef1ee0eb6d546f533ab60c89f"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPSession.handleMessage (cognitive 17): MCPSession.handleMessage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/session.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b279a37487f2d632acf4788b84ddfb1eb33d2288bfa5532eff4bd648d5bde0"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPEngine.retryInitializeSync (cognitive 17): MCPEngine.retryInitializeSync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"src/mcp/engine.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3707df268bc4ee6cdb7495f1378e069deeb06d78bb1c82d49ac86cb84b4705"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextBuilder.resolveImportsToDefinitions (cognitive 17): ContextBuilder.resolveImportsToDefinitions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 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":"src/context/index.ts"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b74c4e80a3b7d61f727fcf61d1bfe16dd87bbd7ed5e695befb8ff5c4dfcdd"}},{"ruleId":"D2","level":"warning","message":{"text":"filecode.buildCalls (cognitive 17): filecode.buildCalls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 6). Of this number, 16 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":"src/ui-server/api/filecode.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82dfdd3340a23529fe5e17bc2a29ee6b0610db9593d6a8fae4a01c01b379b58"}},{"ruleId":"D2","level":"warning","message":{"text":"entrypoints.withoutPreviews (cognitive 17): entrypoints.withoutPreviews has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 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":"src/ui-server/api/entrypoints.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc038944ac58f31bd7e818e4b0b03c5bb194695560d1e817bc57e83aa586e0df"}},{"ruleId":"D2","level":"warning","message":{"text":"index.listenWithFallback (cognitive 17): index.listenWithFallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 3, ternaries 2 (3 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":"src/ui-server/index.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d72653e8b156dd0da609d6684c687dd46da9bc584fd58eed4142d1920951d83"}},{"ruleId":"D2","level":"warning","message":{"text":"index.writeToD1 (cognitive 17): index.writeToD1 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 2, 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":"telemetry-worker/src/index.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a451fb356cb149c9060779c0e470b57efefdefcaf99dfd187aa08beca1b1af1c"}},{"ruleId":"D2","level":"warning","message":{"text":"steps-model.packStubs (cognitive 17): steps-model.packStubs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function items 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fe4a9cbd6aaf2ee1f17fb241b583e869b5404c37f111910bc26e4ec6b779e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_for_calls_and_structure (cognitive 17): Walker::visit_for_calls_and_structure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8873617a1ab16dfeb7e2c58608863e54b3bc5f2e0dc4eb3a19e7528f51b73475"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::normalize_fn_ref_value (cognitive 17): Walker::normalize_fn_ref_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"42481202523106e9b77e89f8f544809165ccbd483fe83304795c8b387dab87b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_variable (cognitive 17): Walker::extract_variable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa798b9fb8121d767c113a357f0df71bb83d2754f08a4291ac26e1372103a07"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_name (cognitive 17): Walker::extract_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"730d44be8e92117ffc3a97f7ebb59985aebd44777925b447d26b1234b1232da8"}},{"ruleId":"D2","level":"warning","message":{"text":"Telemetry.flushNow (cognitive 16): Telemetry.flushNow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (5 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":"src/telemetry/index.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa08c3513129c53ba08e4cc66a347df83edef9e4dce965fabb52ceab3d140fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"reference-tail.referenceNameTail (cognitive 16): reference-tail.referenceNameTail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 2 (3 pts) (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":"src/db/reference-tail.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acfa304c5b52c6f18bc3f1334333a2a734798fb9c7de188ba0d8964fb377fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"query-parser.boundedEditDistance (cognitive 16): query-parser.boundedEditDistance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), ternaries 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":"src/search/query-parser.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9608b13e6839b813648f69e00114f91ca6396176fca5da2401e53d51ce1de526"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.skipCppAngleArgs (cognitive 16): c-cpp.skipCppAngleArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8660f0a065754fa858937c5e0698bc86a0121c9535f3beade8294c9c2df3b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"c-cpp.firstCodeCharAfter (cognitive 16): c-cpp.firstCodeCharAfter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528bd635ec277ce476ef5904ba812fdfac753825ee94a214ddfed3f22565463"}},{"ruleId":"D2","level":"warning","message":{"text":"kotlin.kotlinPropertyKind (cognitive 16): kotlin.kotlinPropertyKind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/kotlin.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197fe0d2d227a8f9107617c199a5861513fa9f1973cc56c8a4627a388d2773f"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.tokenEndBefore (cognitive 16): pascal-preparse.tokenEndBefore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"983bc86f07333fb6b679379e39fcbac4bedc4a1bac62e9a30a5ba9521c949f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-preparse.attributeEnd (cognitive 16): pascal-preparse.attributeEnd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ad22def6dc5668d81abd80b59ad63739f25e4000616535a5e7e920c89bf720"}},{"ruleId":"D2","level":"warning","message":{"text":"razor-script.pastExpression (cognitive 16): razor-script.pastExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/razor-script.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3de1c9fcee1f23589d6a1a911acdd3d2ab0c014aea1c7d52958b6029bb2118"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorExtractor.extractDirectives (cognitive 16): RazorExtractor.extractDirectives has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/razor-extractor.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e09fa4e8a4006de7363fd40de17995c5421ac84d3dae84ac29dc9323f509ac"}},{"ruleId":"D2","level":"warning","message":{"text":"VueExtractor.extractTemplateCalls (cognitive 16): VueExtractor.extractTemplateCalls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/vue-extractor.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa02ca207154a19dd632544b425f724086a1c83d5df2f134f1a1e539e038c99e"}},{"ruleId":"D2","level":"warning","message":{"text":"path-aliases.resolveExtendsTarget (cognitive 16): path-aliases.resolveExtendsTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 1, error handling 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/path-aliases.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9c01aa934d719b619d78d574fd8a2075a631bc05e921b8bc21eeb93c34cf25"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-packages.readNpmPathDeps (cognitive 16): workspace-packages.readNpmPathDeps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts), 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42114eeb12005c329f6fc053abab37448e49647795e4992bb952c08e29d6ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.skipTrivia (cognitive 16): drupal.skipTrivia has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f2617ccef9571f70698b06c108db9d326b7b2bd351725aa90514f2ec3d91b"}},{"ruleId":"D2","level":"warning","message":{"text":"drupal.oopHookReferences (cognitive 16): drupal.oopHookReferences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 15 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45dd97e87af076c5bc6021b0d1b8c5bf13c796fd517e26cb96bd308b6169f47"}},{"ruleId":"D2","level":"warning","message":{"text":"laravel.matchParen (cognitive 16): laravel.matchParen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8af75a9971643cc34f0ff8cdafccf0171c55c5b2dd67a61741478c5d1bc897"}},{"ruleId":"D2","level":"warning","message":{"text":"laravel.resolveControllerMethod (cognitive 16): laravel.resolveControllerMethod has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4417308a5adae19164c7c9997de8b89dc3122940c9183e42bbe292cd22052d"}},{"ruleId":"D2","level":"warning","message":{"text":"dart-local-scope.parameterNames (cognitive 16): dart-local-scope.parameterNames has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb6f247c2458ffa6ac9a356eca2d43b99f7d7ef136a889be40a55247bef951f"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.valueBinding (cognitive 16): vbnet-receivers.valueBinding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (7 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9e1d81301f133c7b9fa427e1add962d925cd8525681d92e51f2c8ff16b57b4"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet-receivers.baseTypeNamesAround (cognitive 16): vbnet-receivers.baseTypeNamesAround has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"70260d58292ad812ec8fb9d50a14678433497203de82684df0a2c2a5690889b9"}},{"ruleId":"D2","level":"warning","message":{"text":"cpp-type-aliases.readCppTypeName (cognitive 16): cpp-type-aliases.readCppTypeName has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"164523b52d3dab27bb29695d0692087d4365b1944af227bc8e2821d3660f95b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rust-scopes.walkTop (cognitive 16): rust-scopes.walkTop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d2e4addb7e9f9d018cfbbf97ad614b49439edfe74351cdabe0315d1d1f50b8"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goTypePositionTarget (cognitive 16): name-matcher.goTypePositionTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 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, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"73664c76a2408479c6027c6851d54a9efc3660f95f9c13126a8fcc47ecd002cb"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.pluggedFixtureModules (cognitive 16): name-matcher.pluggedFixtureModules has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (6 pts), ternaries 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":4713}}}],"partialFingerprints":{"codehealthFindingId/v1":"310133b8efdf3f278908972b9a0c136a7c3369bae62667aebb9fad8f6a58087c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustGoCallShape (cognitive 16): name-matcher.rustGoCallShape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc15ceada4e7f2a602d2284e5b46fca2665cc6d2efb02538131727fd9b2021fc"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustModBlocks (cognitive 16): name-matcher.rustModBlocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":9933}}}],"partialFingerprints":{"codehealthFindingId/v1":"00677b82e4312f58466ddb2128bbce1b513547e16562f7a7bd85c93d5ad3061c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustTypeMember (cognitive 16): name-matcher.rustTypeMember has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5, boolean chains 4 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function items 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11204}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f88d19f83650e27144b0efd96ef71f0099760d4cc8031c085a153c1a45f10a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustFieldValue (cognitive 16): name-matcher.rustFieldValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, ternaries 2 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12685}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c5039a718a72feb213fc8597c662d51d0816fb2fbdb6d0b40c7809f62110d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.rustTraitMethods (cognitive 16): name-matcher.rustTraitMethods has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5539bcf4b90001e1ae099f3d31c48a87b7745708b7aef6026fbffb2edfa95aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jsNameSites (cognitive 16): name-matcher.jsNameSites has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13602}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bb5bcfdb98d1815e1001097620aa4cdc6336f062731fc0a18f6a9910708ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jsBindingEnclosesReference (cognitive 16): name-matcher.jsBindingEnclosesReference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5a15c4441dfa3438fd5e76da38ceeeff124e063d799670c09b48a348fe573d"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.enclosingOpenParen (cognitive 16): name-matcher.enclosingOpenParen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, ternaries 1 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":13959}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c29d9606bad78f41c57145461c93947cc59f2b00549b34fc7db27e3a08910e"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.holderScopeAt (cognitive 16): name-matcher.holderScopeAt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, ternaries 3 (4 pts) (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":"src/resolution/name-matcher.ts"},"region":{"startLine":15863}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecc3070d5204c4cae56884c3162eecb90695a2de9cef793fb41abca61600d33"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.resolveObjectPathMember (cognitive 16): name-matcher.resolveObjectPathMember has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15940}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c6084b14cd898a55059a76edf91978976f299e934bdd64e1389fd6c4115391"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppRangeExpression (cognitive 16): name-matcher.cppRangeExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":16894}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc02701dc13d52c8fd9e08aa520844a743b6d148a5e6d13f97dd93f2793d729c"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchCppDeclaredTypeCall (cognitive 16): name-matcher.matchCppDeclaredTypeCall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 2. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2140e3cacad49ce5f793ff111883fb727aa7a8d461ca06989acf6b9958f22653"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppClassScopesAround (cognitive 16): name-matcher.cppClassScopesAround has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 2 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18910}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662c07dc56e451d591e8f61a07dc0698625f61ef60cf4c7dc209343a287a526"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppMacroTypeNames (cognitive 16): name-matcher.cppMacroTypeNames has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (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":"src/resolution/name-matcher.ts"},"region":{"startLine":20060}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb58ad8765861e4407d5c02ac838c6ef155592bff04507c0f059679b7027df7a"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.cppStructuredBindingType (cognitive 16): name-matcher.cppStructuredBindingType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20441}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee74e1c1fd5e6c951aa52ee36f76a80fead833933294ae6e690696d37035004"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.javaReceiverDeclaredType (cognitive 16): name-matcher.javaReceiverDeclaredType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 3 belong 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21628}}}],"partialFingerprints":{"codehealthFindingId/v1":"7888fa82188349fec5d671f3629f448a33731d341d1849570c691360ec3941c6"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.jsDeclarationReading (cognitive 16): name-matcher.jsDeclarationReading has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, ternaries 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":24025}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0d2a5b2ad3da36c010ee9c071c5ba56cd583a423de5a31c6abdc1ecee9da78"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.goWrittenType (cognitive 16): name-matcher.goWrittenType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25918}}}],"partialFingerprints":{"codehealthFindingId/v1":"af931e6dd769205390a5e3ce0fd0edefecc84c2411ce90994d971ddea984c8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchPythonFactoryChain (cognitive 16): name-matcher.matchPythonFactoryChain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":28969}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a58eb27b37de8df479846985a9280d5b1325aa2f7e8dacb7df85f09dc58e43e"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.tsMethodUpChain (cognitive 16): name-matcher.tsMethodUpChain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (nesting depth added 4). Of this number, 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c96fe968584fea3e8836f80389cfc0c0d0ced45bee8e0601e2c2b95f276e1e2"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchSelectedStoreCall (cognitive 16): name-matcher.matchSelectedStoreCall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, boolean chains 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31491}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d6bff8fe67292a5b0a7f04bb9c72a239a17a7185c7eb7414dccb2a2dcb17e2"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.pythonScriptModuleScope (cognitive 16): import-resolver.pythonScriptModuleScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 15 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"8343d8cd9fd95d7377b10a8059e78884aed9dd9b3ca9eaf66182cf2b930cc78c"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.pickJvmDeclaration (cognitive 16): import-resolver.pickJvmDeclaration has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 4 (nesting depth added 3). Of this number, 15 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2fcfa222d6ecf626a339a88d986f9465e12a0a7217e5bf7daaad9c292571a6"}},{"ruleId":"D2","level":"warning","message":{"text":"import-resolver.resolveImportedInstanceMember (cognitive 16): import-resolver.resolveImportedInstanceMember has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":4466}}}],"partialFingerprints":{"codehealthFindingId/v1":"72447af4b16f9e8fd194a3348d05b846f032a22e2ec713ef30d053e024f4ae37"}},{"ruleId":"D2","level":"warning","message":{"text":"nestjs.methodNameAfter (cognitive 16): nestjs.methodNameAfter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"646a4288638c95ff741b21aff8e184be083c3813dad0981d110c98c630eb0946"}},{"ruleId":"D2","level":"warning","message":{"text":"react.declare (cognitive 16): react.declare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189d840f596424e3bcfb2b877e3de28d3172b28a94f0d79649bcb05a90fb38a"}},{"ruleId":"D2","level":"warning","message":{"text":"react-router.reactRouterTable (cognitive 16): react-router.reactRouterTable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0c567661dc2b1829e90c3d456310bb808d22e5afe38fda7a94f188960fbee1"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractGoInterfaceMethods (cognitive 16): TreeSitterExtractor.extractGoInterfaceMethods has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":4650}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d4ed06f87e6b7afef103fe8ca9a64f648263102a20bb41b9fa6dd93e8bc9ef"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.emitRustUseBindingRefs::collect (cognitive 16): TreeSitterExtractor.emitRustUseBindingRefs::collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 3 (6 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":5115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1199ac541dbf72485621fb6e668cc2917b30070e6e620650859866607e606fe"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor.extractRustRouteMacro (cognitive 16): TreeSitterExtractor.extractRustRouteMacro has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c73f278041db9cd292fe798494abdfa3b4bd21935b8cd0a4d3c262cc4a143e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseWorkerPool.drain (cognitive 16): ParseWorkerPool.drain has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (6 pts), boolean chains 5, if/else 2 (3 pts), ternaries 1 (2 pts) (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":"src/extraction/parse-pool.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c37ae2205c2157e1d7c321c8632e518c1f233f86cee9c1f2c8add5fd4d1da"}},{"ruleId":"D2","level":"warning","message":{"text":"StoreWriter.constructor (cognitive 16): StoreWriter.constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 91, 111, 107). 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":"src/extraction/store-writer.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f442bde528f7e706e7978c0c4916a19776cd440c8ddc694f4cf8995bc5aba48"}},{"ruleId":"D2","level":"warning","message":{"text":"index.collectIncludedFiles::consider (cognitive 16): index.collectIncludedFiles::consider has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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":"src/extraction/index.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"05afd9ae352bbf1a28ee55b308e4a54ad8fa96d0f3d7a3029e4ebda69deabda1"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.declarationInScope (cognitive 16): pascal-scope.declarationInScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (3 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f91c3b7b3077b579b77411863a8aab80c09664889f4d1b137d34389502ef34"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal-scope.unitFileNamed (cognitive 16): pascal-scope.unitFileNamed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bfc15f0d033504936e448f880568e67540ebcc5d3720adc5336ea4a23e2b50"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby-constant-paths.skipParens (cognitive 16): ruby-constant-paths.skipParens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd58c9f18e84767460ccbed1c3bb180de0c03714dc4d21b7d796ef064f8e94f"}},{"ruleId":"D2","level":"warning","message":{"text":"tier-synthesizer.methodNameAfter (cognitive 16): tier-synthesizer.methodNameAfter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a24c6828c5c38f4200d655d3e5ac9e2b3282dec11d454f8414fb8477efef486"}},{"ruleId":"D2","level":"warning","message":{"text":"tauri-synthesizer.receiverType (cognitive 16): tauri-synthesizer.receiverType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7c41d30ebb1a5335196c91f3224655da6529b8bb2f95289322830c33379bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"override-parameters.topLevelIndex (cognitive 16): override-parameters.topLevelIndex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/override-parameters.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14fa42603625565d36f7c9d1fc690848280c0594494f1d3fe8af0611da44a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsxLexer.children (cognitive 16): JsxLexer.children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, 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":"src/resolution/jsx-code.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bc87c83d4817715b46f3f5604c74b66c3518a471889bc44d19d96f26d9aec3"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.goImplementsEdges::wantedArities (cognitive 16): callback-synthesizer.goImplementsEdges::wantedArities has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (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. This shape REPEATS in the file: 3 other methods here (callback-synthesizer.goImplementsEdges, callback-synthesizer.goImplementsEdges::methodArities, callback-synthesizer.goImplementsEdges::methodTypes) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebda2c7021eb87a84b8b1813519a9e121e4dc758f3a3083d30812c132d495aa"}},{"ruleId":"D2","level":"warning","message":{"text":"callback-synthesizer.celeryDispatchEdges::isCeleryTask (cognitive 16): callback-synthesizer.celeryDispatchEdges::isCeleryTask has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (callback-synthesizer.celeryDispatchEdges) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18c612f11edb6945e1b35d26711359d683fbf36f67bfdfda789deb7a370c050"}},{"ruleId":"D2","level":"warning","message":{"text":"query-paths.resolveSpan (cognitive 16): query-paths.resolveSpan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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":"src/search/query-paths.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf1eb39df46abfdab7b77f8b851988b295243446398553a91415e19117835b1"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.hasTopLevelOr (cognitive 16): branch-guards.hasTopLevelOr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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":"src/graph/branch-guards.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6854a50cd4962a58f777d3e293202972f5c430ded478e5710279f60af0c0f8ab"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.guardsForFileSync (cognitive 16): branch-guards.guardsForFileSync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (3 pts), boolean chains 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":"src/graph/branch-guards.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c8c07a1ec97674f3c6085428e8a94b0e2ab391c0205ee3e6f490a9225b051"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.objectKeys (cognitive 16): branch-guards.objectKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1, ternaries 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":"src/graph/branch-guards.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa8b5c76e2eedbf3649907569e1bb1eb8225c3b8bfe5df226c154f806947a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"branch-guards.memberTypesInTree::visitParams (cognitive 16): branch-guards.memberTypesInTree::visitParams has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (branch-guards.memberTypesInTree) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"684a3b885946c770ea420d0836f03274d33b13f16053bb299c63451c9c713722"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphTraverser.dfsRecursive (cognitive 16): GraphTraverser.dfsRecursive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 5). Of this number, 15 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":"src/graph/traversal.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4317131fcbc7ea39ded3bda3e524bc7e262f68c7a7895a295f8637171992cb41"}},{"ruleId":"D2","level":"warning","message":{"text":"index.compareVersions (cognitive 16): index.compareVersions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 2 (5 pts), boolean chains 4 (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":"src/upgrade/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"273b63eca1157038762d54033204007b200fe66838ee57de9552410a619544b4"}},{"ruleId":"D2","level":"warning","message":{"text":"explore-diagnostics.attributeSourceBytes (cognitive 16): explore-diagnostics.attributeSourceBytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item 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":"src/mcp/explore-diagnostics.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c5e5b4c975041179539f8c2760fabb5c104a342899dda298d107ecea11f019"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handleExplore::sectionRangesOf (cognitive 16): ToolHandler.handleExplore::sectionRangesOf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (ToolHandler.handleExplore, ToolHandler.handleExplore::prio, ToolHandler.handleExplore::shrinkCluster) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6b5e56df5ebb7d8a32f7082978295041382a4d206ca3a9e117242956a7e0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.fitExploreEpilogue (cognitive 16): tools.fitExploreEpilogue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 4 (5 pts), boolean chains 4, loops 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (fitPointers). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d44db3850b060aeb217f7687786546c100fedf8373c3d8d0c768bec4716fd2c"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphQueryManager.getFilteredSubgraph (cognitive 16): GraphQueryManager.getFilteredSubgraph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 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":"src/graph/queries.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7481cc220ef4d5fc2fd985cf3416b12416725e9aa4fc0dc8572e58d3dbaed1d"}},{"ruleId":"D2","level":"warning","message":{"text":"program.seal (cognitive 16): program.seal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 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":"src/ui-server/api/program.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"994ee88ecc3e6cfb02dfc907cdca614df7fdc0ec2d660c0867b808de5c621eac"}},{"ruleId":"D2","level":"warning","message":{"text":"trail-store.listStoredTrails (cognitive 16): trail-store.listStoredTrails has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 3 belong 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":"src/ui-server/api/trail-store.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c2008688e56cf124a6adcf86d21a6f8a57460b8e5be07aebd7a8f5a40ae1d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow.edgeBetween (cognitive 16): flow.edgeBetween has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, ternaries 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":"src/ui-server/api/flow.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd95141eda80e6c4dca5ead573f2134c751f539dfa1af37b1daca1ce0e6a3c28"}},{"ruleId":"D2","level":"warning","message":{"text":"hermes.childrenOf (cognitive 16): hermes.childrenOf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 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":"src/installer/targets/hermes.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbe293d84a74373b54fb08d0e8217f4b525baf8599a9574ed2bd16adebea66d"}},{"ruleId":"D2","level":"warning","message":{"text":"hermes.upsertCodeGraphServer (cognitive 16): hermes.upsertCodeGraphServer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 1 (2 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/hermes.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2616dac14a8df129c8d87c49e9a288510be2aff920c56459843212a20fe400b2"}},{"ruleId":"D2","level":"warning","message":{"text":"remove-binary.executeBinaryRemoval (cognitive 16): remove-binary.executeBinaryRemoval has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 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":"src/upgrade/remove-binary.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8bf3633d947b15750e007786d44e03d4e76c9e6a988495ea4b93c5a86f2d30"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph.main::runInit (cognitive 16): codegraph.main::runInit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (codegraph.main::printIndexResult) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/codegraph.ts"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be503ca8f1a7e18de1c612c38d31c694a00a1010e9967fe43ada74fd8aace3b"}},{"ruleId":"D2","level":"warning","message":{"text":"rollup.runNightly (cognitive 16): rollup.runNightly has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 3 (4 pts), loops 2, ternaries 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":"telemetry-worker/src/rollup.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba7ee2ecf7fdf18ce719d2868cb103243b2116eae40da0e4ef5bfce43b15c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"steps-model.stepSub (cognitive 16): steps-model.stepSub has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 1 (2 pts), boolean chains 1, match/switch 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee16144834cf68c386ed08db8dfca1e67587339d406859ca2955485ae12e08b"}},{"ruleId":"D2","level":"warning","message":{"text":"program-model.withoutBackEdges (cognitive 16): program-model.withoutBackEdges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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":"ui/src/lib/program-model.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3bf5ec83681d604bea9988e73549543f7910af5a4457014a5ad667aa0752da"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::create_node (cognitive 16): Walker::create_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf6348462bd2adfb3c4934654d8808020ea214212944c019b188340d09e864e"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea4d18a590625b7212df5840efb8e86b9e784ecbdbd6c45a7966d383b4c0a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 16): Walker::extract_inheritance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 pts), match/switch 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16146ce0d7d207724155faa2d0835dbc7a32fa955c4c40ba91a15a28d1025b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flush_fn_ref_candidates (cognitive 16): Walker::flush_fn_ref_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc3b277ec5ed32de62b8cfa91fcfa6a4bc15fe508a9a4bcb33ece61bc3fd756"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_call (cognitive 16): Walker::extract_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa68191ac0c4dc5c352e3f27cba0f05141195e6c59b151e4b290be32d615d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c194aceab87dfad4f7eb4f8242eba0f243d80253278c5e29f0a7429580093768"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_csharp_type_refs (cognitive 16): Walker::extract_csharp_type_refs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"776777aa292bad28331a3428be1bf389494c44ea37b6e9693cd57124dddfac56"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_import (cognitive 16): Walker::extract_import has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58076514b014ecac1e4260d213b0a70c0bf4ca4650c518c285e06c89b54e85c"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"7839c3d3962226175477f22358ef64de67356ac1b4455a988fa22cc1b2939e24"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"135afd93e78712e24afab82fc1e602f63b46a34ffe1d5fcbdd1354c452b48a57"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::require_module (cognitive 16): Walker::require_module has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fa3afd89ab15faab76a10685d6263d7ec5e758ca17f90e9dbfe1879e6839c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_variable (cognitive 16): Walker::extract_variable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2, 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d4c1655d8101fad63d4cd86ac922b745a0dbe67a887528d8b68c2e554d0b73"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b98c44db4a7dd58f12adb7a17ac29b0349b8edecabe040856ade6bcc89f7bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_inheritance (cognitive 16): Walker::extract_inheritance 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/php.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5bdd3b7d16fe9c64d0a1f4b24cdf6c70460ad20b7fa4445459df05d8210420"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit_node (cognitive 16): Walker::visit_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts) (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":"codegraph-kernel/src/python.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba18f2e54199c527834d9f7b294d85728af8f7226d5009ca4bf38ae61446cfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::emit_use_binding_refs::collect (cognitive 16): Walker::emit_use_binding_refs::collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4310dfd00c73fed1298053351c3c34e77846ce1ff1e91c5ef3f36b9647f4a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"df265417a2f8e3842b0354a27e16e699fbea63cfeec157b9571e07da6eaf7556"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::create_node (cognitive 16): Walker::create_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/swift.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a277b0f961fe5d4a106e3547f5e3fe4d55b354359574c115761146b53ff13a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::extract_static_member_ref (cognitive 16): Walker::extract_static_member_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1c023775c10a702a18d636b7ff58da9bac70cda833dd9c1bfbacef995ce73f"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::ccpp::brace_scopes::namespace_head (cognitive 16): codegraph_kernel::ccpp::brace_scopes::namespace_head has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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":"codegraph-kernel/src/ccpp/brace_scopes.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c976011f1e88fb724dbb0c4ec24ea8176775ad01c1c5d1e5a3d722bb892d0b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_fnptr_typedefs (cognitive 16): codegraph_kernel::cfnptr::scan_fnptr_typedefs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), match/switch 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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e18f93d01538bd1e9217389fd8c29a8425767aeeb862ad5ead5fa76736c3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::cfnptr::scan_includes (cognitive 16): codegraph_kernel::cfnptr::scan_includes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dc9acb33e42c44c97a585f79fffea853e7c9eba59c6080e2b4863af00b1213"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::java::extract (cognitive 16): codegraph_kernel::java::extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a1575d98fff4c2335968c2da770e56e77f2353da82e81b4614ae0a7bc3cbee"}},{"ruleId":"D2","level":"warning","message":{"text":"codegraph_kernel::kotlin::extract (cognitive 16): codegraph_kernel::kotlin::extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3a18541ac8afa48f8bbbaa96ba8d5249d067a9f9748d77f3504046fe5475c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/name-matcher.ts: FileTooLong \u2014 18577 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18077 over it, 37.15\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":"src/resolution/name-matcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"330ec926b882f0b7694770ddded4dcbc5594e5a8945dd92e0578f1c45dec44ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/tree-sitter.ts: FileTooLong \u2014 5187 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4687 over it, 10.37\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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8258358f4d32aaa73e7dd3d7c02f4d74030dfb4b5fe5c305996401a86d322d11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/tools.ts: FileTooLong \u2014 4287 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3787 over it, 8.57\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":"src/mcp/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5b5748aba6fcd4984c001ced6016acea5684a7b5d5bd72088ebc20f394eb7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/callback-synthesizer.ts: FileTooLong \u2014 3253 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2753 over it, 6.51\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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1271598b6833cc19beeb1b055de64d9647dafa6271b544cbc6710bc319ea764d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/queries.ts: FileTooLong \u2014 3207 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2707 over it, 6.41\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":"src/db/queries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7db2efe57cb81b79e13162fe2730fc20681029bff8bcbca988486ad9e56ae0e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QueryBuilder: TooManyMethods \u2014 192 methods. The bar is 30 methods; this is 162 over it, 6.40\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":"src/db/queries.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5247a4a1347d6e7c829d23520ee616f6c3e36f01d9393f1d130d4ca6dc6067a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeSitterExtractor: TooManyMethods \u2014 155 methods. The bar is 30 methods; this is 125 over it, 5.17\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":"src/extraction/tree-sitter.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"df126591fddf3f3edf68860c20323d0740f0f86ae29552c0174511e70a93a7fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/index.ts: FileTooLong \u2014 2474 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1974 over it, 4.95\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":"src/resolution/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04faa7187a14de28d9ebb82c30acecfe37f49022c5ec0f33cec88dfbe87daa2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/import-resolver.ts: FileTooLong \u2014 2403 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1903 over it, 4.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":"src/resolution/import-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e9264d279057a1a464653b24693f4685369e09a10d87f6e9dbb1e5fb40b234"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodeGraph: TooManyMethods \u2014 134 methods. The bar is 30 methods; this is 104 over it, 4.47\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":"src/index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b947a72e6bf9b71bdcb60277af4eab5b0108c9100690b2f0ef24b1d6807e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/index.ts: FileTooLong \u2014 2044 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1544 over it, 4.09\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":"src/extraction/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22142c2ddced0ac60a2383cceedc7316f30671ee1bd78371442f1cb7f6ab8aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeGraph.sync: MethodTooLong \u2014 sync runs 354 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 254 over it, 3.54\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":"src/index.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0223ba2c8fdb6378bbd60b3908a482faa88bef943ada735eafeb179db04235a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ccpp/mod.rs: FileTooLong \u2014 1731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 1231 over it, 3.46\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6360878a0481c4c10da59066cbbed27d0e1d9b7fead9798f96f0df16f0e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReferenceResolver: TooManyMethods \u2014 100 methods. The bar is 30 methods; this is 70 over it, 3.33\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":"src/resolution/index.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a272c017c3cf5811b2f6827e63979cd70ff6cb4fac160ad08c3b303f728bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/branch-guards.ts: FileTooLong \u2014 1595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1095 over it, 3.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"683e5c256bba33a631d166a973d1d76a0dcc3f4d4611bc30a6950d74b7deb940"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodeGraph: ClassTooLong \u2014 1234 significant lines (blank, comment-only and punctuation-only lines excluded), 134 methods. The bar is 400 significant lines; this is 834 over it, 3.09\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":"src/index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc48205f183834b63c7a080b0f656303e878a26eadfef50474cbf536ea4e0fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 92 methods, declared across 2 files: tsjs/extractors.rs (64), tsjs/mod.rs (28). The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a85de7ae50abf4f3daf99882f75750ee75d760261508072d266e465286745c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: languages/c-cpp.ts: FileTooLong \u2014 1496 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 996 over it, 2.99\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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f85e70e5e75fcdf93e025e9ca5aafa9d0004d933144eb052113ceedb3a21b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 1191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 2 blocks, lines 209-2177. The bar is 400 significant lines; this is 791 over it, 2.98\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4f772d4f11149d1ceb43ece6e08243d8897d79db64fd8ad41049660e29e26e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frameworks/react.ts: FileTooLong \u2014 1472 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 972 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ffa545c68aa5d2bff823aee837bf9a5f8649aa10f00de47748e5f075b96b23"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtractionOrchestrator: ClassTooLong \u2014 1135 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 735 over it, 2.84\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":"src/extraction/index.ts"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1262200fb58b8449119b7808436d1c0577d8ab711f19ac2e9fb8913906a94008"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolHandler: TooManyMethods \u2014 82 methods. The bar is 30 methods; this is 52 over it, 2.73\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":"src/mcp/tools.ts"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"572fd4ac10efd9d41a96d59707fedbaa37a9b71893f88012ef8d5e02a709e7dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dart.rs: FileTooLong \u2014 1359 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Walker (2 blocks, 209-2177). The bar is 500 significant lines; this is 859 over it, 2.72\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"862caee70eaaeebd17db8bcfcdb372401dfa74b213554828fe5b6bfb6e823f94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tsjs/extractors.rs: FileTooLong \u2014 1350 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: Walker (15-2106). The bar is 500 significant lines; this is 850 over it, 2.70\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2d16e5cdf9838dbb500b4a7ad596736487117baf3ca1181ecba266a9bc3582"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 1350 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: CodeGraph (189-3321). The bar is 500 significant lines; this is 850 over it, 2.70\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":"src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfea9dc27502bf40fada028bc5e3cc2975f49a0bdc60778a739546d79041c3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: steps-model.packRegions: FunctionTooLong \u2014 packRegions runs 261 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\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":"ui/src/lib/steps-model.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daf4b3e3d6f844f04c7ec824dac68c0f7aa661daaf70bf8680a8f5c4d98572a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 126-1722. The bar is 400 significant lines; this is 626 over it, 2.57\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278f190f4549dc701a4fdcf4886c84bf83daeae4c9e88d996f910e188d24dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kotlin.rs: FileTooLong \u2014 1251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 751 over it, 2.50\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d0c372110bfac901a92410528b57ee66a0c95b4db9b9cac349cec4a36b973a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/java.rs: FileTooLong \u2014 1227 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: Walker (2 blocks, 126-1722). The bar is 500 significant lines; this is 727 over it, 2.45\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a1581e24d5fcb52a7b9fa0c3365724240ead807e15819f67d90c92b537a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proxy.runLocalHandshakeProxy: FunctionTooLong \u2014 runLocalHandshakeProxy runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\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":"src/mcp/proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2e9a179bbc6878513ae773b73d4c8f51a5515c9fa4780928971932c3b37237"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 2 blocks, lines 128-1700. The bar is 400 significant lines; this is 520 over it, 2.30\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c596159ec00e051049062789e6293eebbed444e9dee193896ac6d05d994353"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 2 blocks, lines 118-1626. The bar is 400 significant lines; this is 509 over it, 2.27\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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd6f8804815765dd6152bbbd70cee897a149cc4a2af85c272aee99b3089a722"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/swift.rs: FileTooLong \u2014 1130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: Walker (2 blocks, 219-1683). The bar is 500 significant lines; this is 630 over it, 2.26\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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaccf61b56ad3bec60757cf583536b82e55fe14fd1e6a6561af4a3657215c173"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/vbnet-receivers.ts: FileTooLong \u2014 1127 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 627 over it, 2.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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fba9c5006f15474eab251622131a0c80737bf77fe55f57d5398c7353bab490"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 2 blocks, lines 219-1683. The bar is 400 significant lines; this is 499 over it, 2.25\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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0597c0bc65aef98b2ad347ca8cd3502ce0e6e069f54b52edf15b49991cbb5198"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rustlang.rs: FileTooLong \u2014 1122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: Walker (2 blocks, 118-1626). The bar is 500 significant lines; this is 622 over it, 2.24\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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c7e9787d085eb384319181ac09b52d2902a7137bda6d1647886ff831ac2274"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/csharp.rs: FileTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Walker (2 blocks, 128-1700). The bar is 500 significant lines; this is 620 over it, 2.24\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51539953b1e3a8a02deccd043c56d97702f92424b228f00eb7c29c6058510f1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"75116bf21612ae0d89a0c237af186d1061830b05ed0538fe4ea45ca535b74350"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/go.rs: FileTooLong \u2014 1100 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: Walker (2 blocks, 89-1443). The bar is 500 significant lines; this is 600 over it, 2.20\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33258122854ceffc2e35e1948c08f630b14b52eb77bb43ccb17308a31b4c53a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 2 blocks, lines 89-1443. The bar is 400 significant lines; this is 449 over it, 2.12\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5f0dc3bef15af98bbe2742114ec636571e0b3ee6772b45ab94bfe7896a825"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render-check.main: FunctionTooLong \u2014 main runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\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":"telemetry-dashboard/scripts/render-check.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e037790d4fe6cc8f5a789867b65be3883927c333308050840340e6b8f76d48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/php.rs: FileTooLong \u2014 1007 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 507 over it, 2.01\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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1129dcc9c269523564f55cae5ae93606eddf66d06548a8ec04fe4c87498641e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/steps.ts: FileTooLong \u2014 1003 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 503 over it, 2.01\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":"src/ui-server/api/steps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6555523de70984b5fc6322f229686603fec29d44911e47c021c3175a90b0572f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scala.rs: FileTooLong \u2014 964 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 464 over it, 1.93\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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b31351a8a908af72766580d54578051e9cc9d8d408d212650e1b451facc3d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow-model.buildFlowLayout: FunctionTooLong \u2014 buildFlowLayout runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"ui/src/lib/flow-model.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc845bdcdb190af7ab3b5d9f5e955f7c2b14c70ba0e5cf760106ab4956bc2dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdea38825fd9f0a3ebf881b03ba6ccbbbd0cae0226b1398681c2942c2c1c660b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtractionOrchestrator.sync: MethodTooLong \u2014 sync runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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":"src/extraction/index.ts"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5ef455160990c65cdf6895a23241a28eca1435fb566ef1e8918e9fc3215336"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: map-model.buildMapLayout: FunctionTooLong \u2014 buildMapLayout runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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":"ui/src/lib/map-model.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e64a93894fb2501e6c2c66dcbc870dd2eaf159fe61caebe4a7310e0ecc72f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContextBuilder: ClassTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 322 over it, 1.81\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":"src/context/index.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa5a696d88285a5abf47a170ea1ebe6b0816c97d14bbac2e0eeafdfcdf75bb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/tier-synthesizer.ts: FileTooLong \u2014 888 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 388 over it, 1.78\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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc6dcd9facb70889d16e01c8112878562b8f9a25be3955151b3a8d592c644eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/index.ts: FileTooLong \u2014 843 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ContextBuilder (233-1617). The bar is 500 significant lines; this is 343 over it, 1.69\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":"src/context/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dc737bd74f0ddfabf7cc98565af1a6a4a18f866d66b5f2edf19ff7260221dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/c-fnptr-synthesizer.ts: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3d7e2cefc1b99bf4e51369a1b324758ada9aea4badfc4bf5dd627a29728b2a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e29635cf4a5385d93286f1a95555fad2c0c3f2338ab24f38950f2e984c1ef2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.rs: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: Walker (2 blocks, 140-1140). The bar is 500 significant lines; this is 316 over it, 1.63\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"389b60d233dcc41a08235b60c4081bd22edde1cd5f2965e868a4e85b17cb7a79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeGraph.indexAll: MethodTooLong \u2014 indexAll runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"src/index.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f0ee746213d66016bcb0bcedefff725f6293bb8d23949090b6aed23313590"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/tauri-synthesizer.ts: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 303 over it, 1.61\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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb72b5b45512a19436f506a7c3d68f97774b73859b97203d30ec84b31590486"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: angular-template-synthesizer.angularTemplateEdges: FunctionTooLong \u2014 angularTemplateEdges runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dd762dafe6b86f346fa77c0937bc73408a34c4fb29b81c3fbc3912a4404cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rust-scopes.readRustBindings: FunctionTooLong \u2014 readRustBindings runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"src/resolution/rust-scopes.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65293fbe0136000f450a4e986404f0682940a32ce6be806453000a435eba377"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 140-1140. The bar is 400 significant lines; this is 216 over it, 1.54\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e8bfd2a1340106388e11de4fabd974870425b2b5410b881042260c38d4ad5a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6340b01f3c7d099cc3836747e0f696037aa1304ba55fce7bf20a6f83b6ec246f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ruby.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: Walker (2 blocks, 119-1154). The bar is 500 significant lines; this is 261 over it, 1.52\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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3123b6d49bf43aa8f879e69976c2ebccd2748d05a84a06aa5e491697ea17eea9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 119-1154. The bar is 400 significant lines; this is 202 over it, 1.51\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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5ef6438964d5ad79fb187964ec16b90f8cd906827b440a142c37dce70c820f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vue-template-calls.scanExpression: FunctionTooLong \u2014 scanExpression runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22f2e60cc1d0a93f35213280f2b8b79bce1782ac1868c5f9107130452fb21c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3037851b72040823d000050bcdbf3123665282b9be1d9a89c471819da6fc27"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseConnection: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"src/db/index.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e885875ff3a3644438f4119d02f1e7d025b4755b0727cfa174f88053ea848683"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tsjs/mod.rs: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: Walker (2 blocks, 190-1095). The bar is 500 significant lines; this is 222 over it, 1.44\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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff2f091c002bcadbb0e9a035a1c655000b465af048a24f2249dafd89a072176"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"88be959143a0b1f12f0da8175368fc1819fa542dbf1f7a3b442a918f968a36cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: map.buildMap: FunctionTooLong \u2014 buildMap runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\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":"src/ui-server/api/map.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cd6ac777fccc2b8c28d95f1c894925c0a67bce8d58507e882cd55e5979b2ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/pascal-scope.ts: FileTooLong \u2014 706 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 206 over it, 1.41\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":"src/resolution/pascal-scope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fceb1cc3b286613778d7c495af266ce1ab32e69ad51de1adcd943c77c0e5062"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frameworks/angular-router.ts: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40\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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a0230d59f927a2e4a5e5eabe431362c0719db835fc5091678be842386b620b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: screens.buildScreens: FunctionTooLong \u2014 buildScreens runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"src/ui-server/api/screens.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c011b3d7d01015d8e7b47c5d2bc0d7d27c3ca9625b4ee9a543db441f83551d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/steps-model.ts: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 186 over it, 1.37\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":"ui/src/lib/steps-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"252c3d95c6c217717c230555bc924643968fce0d5c5a60a39054aa3f9b4b2045"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"76af7fc15366f382799a68fd17e825b286279b41a2dec5dc9fe2247dd5cdc532"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: languages/pascal-preparse.ts: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d7aed57e1e3b792abd1b6c55acfa9afca694e7ef646a3e2cc3133a3a40602"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"codegraph-kernel/src/php.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d4f35e47bccaeab7fd36fc23674610237672ecaff0522a80318c8b8587dde9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 72-968. The bar is 400 significant lines; this is 128 over it, 1.32\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b831083256e602c8fcd468183b46f2485514a5ef0b9d9cd591d4438ac995ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.synthesize_lombok_members: MethodTooLong \u2014 synthesize_lombok_members runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a62e7e75b8f01aa3074664675db33afd25e61b9ffd08427a27ee03dd1f8aa6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"609bfcd9449b92ec424d9bcef91561e6654a982b7530a3ae9ad8930a313319d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.runInstallerWithOptions: FunctionTooLong \u2014 runInstallerWithOptions runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"src/installer/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"40baa4f41d8ab857019d6f92ac7b6dfe740c55afc447fac4984f0360831bf23e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/export-svg.ts: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 125 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ffa5cf301e1dc014a3a21bb7c6a51868bee478a252481a69677126d19163e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lua.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: Walker (2 blocks, 72-968). The bar is 500 significant lines; this is 124 over it, 1.25\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2aaac759555e90b05ae5701a74f4b7763f8418944228ade046f2af130bd0dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: export-svg.flowCardSvg: FunctionTooLong \u2014 flowCardSvg runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"ui/src/lib/export-svg.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c4129b5cca20558576fdfe8d843c2acd1036eb662d7ef0d3cc4b06e0b58bc8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef28c1f5df9e94dbada253fceb14464cea78010d5677b7a2a5693882f04ff0b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: function-ref.normalizeSpecial: FunctionTooLong \u2014 normalizeSpecial runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"src/extraction/function-ref.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a89e0f76275e5eea521c3a6407261097896183ca848047a5c47133575664f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/wire.ts: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 99 over it, 1.20\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":"ui/src/lib/wire.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80db35687764fa76142bbe13fcdb99e474d24ebd9ea318aceaccb47eaa45c89e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 92 methods, 2 blocks, lines 190-1095. The bar is 400 significant lines; this is 76 over it, 1.19\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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"81df3568c116681a16badc37a867a195db62946adbd1121c1f96e1bd5a519bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/ambient-modules.ts: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ambient-modules.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ef8b67c07b2cc61d5839e1e7466879dbd3bb49f95a0c453f7515ce8af22467"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsxLexer.code: MethodTooLong \u2014 code runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"src/resolution/jsx-code.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0588f3d04925534e3f16e649e32d7f1075e84e86ee753a0d5a3ea721329523f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ambient-modules.scanAmbientModules: FunctionTooLong \u2014 scanAmbientModules runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\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":"src/resolution/ambient-modules.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e0254585e9ee0b0eb043828c4b6d129b681afd26d317aea940eefa4539e304"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frameworks/nestjs.ts: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3112e52669abea4dcd6e18ac1709da9d5f05d9fdb1422ab6705c29a0205853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/function-ref.ts: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/function-ref.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0d9ec71fe4fb3d2c283ff3b155a47457f681f0908a5b304b851fa1311d39e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileWatcher: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 41 over it, 1.10\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":"src/sync/watcher.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61ec104eab793e33e1b40d8bcd20dacc6cf7b8b9076ff027bae2ddce64a167"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/angular-template-synthesizer.ts: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 over it, 1.09\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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fa6a8ac44d232b9ed942e5789ac76edfc1eefcd798a8d77d79c5fee4d87eae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: adapter.createHttpAdapter: FunctionTooLong \u2014 createHttpAdapter runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"ui/src/lib/adapter.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6183e6248a214bac4582361751a6de8b3d78eba4b11c57c2f19f63d770e6d686"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/dead-code.ts: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 over it, 1.07\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":"src/graph/dead-code.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8efda32c21366f810f525825f68096ffbad208061057404221de2bd66fcbe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/ruby-parameter-flow.ts: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 35 over it, 1.07\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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0328f2146c91248d849a14fa64cbbf67b4eee3114000e735d111234c8ab21d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/rust-scopes.ts: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06\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":"src/resolution/rust-scopes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35183c4e6fd5662dc094c218389f96dc93abc0b62df97841d07279293be112"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/dart-libraries.ts: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06\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":"src/resolution/dart-libraries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f0d524365fb612b476fbdced37969e2f75298fe4373ffe7a2c81526a532796"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CfmlExtractor: ClassTooLong \u2014 417 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 17 over it, 1.04\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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f752e4abc05eb6e12ecd2618241559e67803674603c701658e2f60775007bdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow.buildFlow: FunctionTooLong \u2014 buildFlow runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"src/ui-server/api/flow.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa74b1f974335ac7025870093dcb1a6409377f50451da823012c0e282f2be67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: steps-model.buildStepsModel: FunctionTooLong \u2014 buildStepsModel runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"ui/src/lib/steps-model.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0c302cb80c48cd757bd90a55defab97c4bb2be44f1c5dc9b3c5745afceb3a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sync/watcher.ts: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: FileWatcher (283-1226). The bar is 500 significant lines; this is 19 over it, 1.04\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":"src/sync/watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d269f4cb9852496debf20331e2274d9da26a4aa9cd0fd20ef06d53876f7a79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/flow.ts: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 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":"src/ui-server/api/flow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d55cfbd97e65b8134f355178e4d3cb0523329a8a5bf00e61d66ba03fc15205"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: upgrade/index.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 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":"src/upgrade/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdab021d938c00f84acc2de81713f711fd7e0d0cbf8ba34053df8deb427e3c4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frameworks/expo-router.ts: 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9c72c919b5a495fb2a4d72dbda223e1ef0c31b24d3a2ba891c2dce7c47effa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/api.ts: 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d5c0c46ced16fc1b47fa0261facef676fc09414d87e5394d30ab42dfaeeae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphTraverser: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 7 over it, 1.02\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":"src/graph/traversal.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e82bfd29c1413b91e66031aee5efa23b451097ecc39393ce91e14e2bfb7d9f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.extract_variable: MethodTooLong \u2014 extract_variable runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6adffb9613707902a35a7eed96a1f09e72424a9cb5a0352bb623daef53504c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (14 members, 37 shared lines): codegraph-kernel/src/ccpp/mod.rs:401-499 | codegraph-kernel/src/csharp.rs:147-245 | codegraph-kernel/src/dart.rs:226-300 | codegraph-kernel/src/go.rs:107-182 | codegraph-kernel/src/java.rs:146-253 | codegraph-kernel/src/kotlin.rs:229-334 | codegraph-kernel/src/lua.rs:87-159 | codegraph-kernel/src/php.rs:157-265 | codegraph-kernel/src/rlang.rs:77-143 | codegraph-kernel/src/ruby.rs:136-209 | codegraph-kernel/src/rustlang.rs:136-211 | codegraph-kernel/src/scala.rs:170-247 | codegraph-kernel/src/swift.rs:236-310 | codegraph-kernel/src/tsjs/mod.rs:224-319 \u2014 These 14 members are variants of one another: a block of 37 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa26671f5977ed810fb4280275bd374b2006e76622dbfb7c2a0185755ab86fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (14 members, 27 shared lines): codegraph-kernel/src/csharp.rs:147-245 | codegraph-kernel/src/dart.rs:226-300 | codegraph-kernel/src/go.rs:107-182 | codegraph-kernel/src/java.rs:146-253 | codegraph-kernel/src/kotlin.rs:229-334 | codegraph-kernel/src/lua.rs:87-159 | codegraph-kernel/src/php.rs:157-265 | codegraph-kernel/src/python.rs:157-232 | codegraph-kernel/src/rlang.rs:77-143 | codegraph-kernel/src/ruby.rs:136-209 | codegraph-kernel/src/rustlang.rs:136-211 | codegraph-kernel/src/scala.rs:170-247 | codegraph-kernel/src/swift.rs:236-310 | codegraph-kernel/src/tsjs/mod.rs:224-319 \u2014 These 14 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"827ea242e918ed9a9e7020b5a7f2b81fb9ecd2716e4be6b3718dbeca8a94c344"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (13 members, 37 shared lines): codegraph-kernel/src/ccpp/mod.rs:2504-2598 | codegraph-kernel/src/csharp.rs:1606-1699 | codegraph-kernel/src/dart.rs:2074-2176 | codegraph-kernel/src/go.rs:1333-1442 | codegraph-kernel/src/java.rs:1358-1448 | codegraph-kernel/src/kotlin.rs:1785-1912 | codegraph-kernel/src/php.rs:1417-1477 | codegraph-kernel/src/python.rs:1035-1139 | codegraph-kernel/src/ruby.rs:1044-1153 | codegraph-kernel/src/rustlang.rs:1513-1625 | codegraph-kernel/src/scala.rs:1387-1486 | codegraph-kernel/src/swift.rs:1550-1682 | codegraph-kernel/src/tsjs/mod.rs:509-603 \u2014 These 13 members are variants of one another: a block of 37 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 13 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 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"523150557d16106a12233d3638f1231d617a3719e1722a9729137da599d8ab63"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (13 members, 24 shared lines): codegraph-kernel/src/csharp.rs:316-391 | codegraph-kernel/src/dart.rs:350-451 | codegraph-kernel/src/go.rs:227-317 | codegraph-kernel/src/java.rs:304-381 | codegraph-kernel/src/kotlin.rs:405-521 | codegraph-kernel/src/lua.rs:203-277 | codegraph-kernel/src/php.rs:316-408 | codegraph-kernel/src/python.rs:277-371 | codegraph-kernel/src/rlang.rs:180-246 | codegraph-kernel/src/ruby.rs:275-365 | codegraph-kernel/src/rustlang.rs:260-355 | codegraph-kernel/src/scala.rs:297-391 | codegraph-kernel/src/swift.rs:401-498 \u2014 These 13 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 13 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 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e54d247a5461f47917d49010761b5390835fc3d520cc5933f9c1f454a0a483f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (9 members, 23 shared lines): codegraph-kernel/src/ccpp/mod.rs:544-646 | codegraph-kernel/src/dart.rs:350-451 | codegraph-kernel/src/go.rs:227-317 | codegraph-kernel/src/kotlin.rs:405-521 | codegraph-kernel/src/php.rs:316-408 | codegraph-kernel/src/ruby.rs:275-365 | codegraph-kernel/src/rustlang.rs:260-355 | codegraph-kernel/src/scala.rs:297-391 | codegraph-kernel/src/swift.rs:401-498 \u2014 These 9 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb0934c89fd7cd71c167a07732b5c48e5276e8b746c2054808953d495fe59dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 31 shared lines): codegraph-kernel/src/ccpp/mod.rs:544-646 | codegraph-kernel/src/go.rs:227-317 | codegraph-kernel/src/kotlin.rs:405-521 | codegraph-kernel/src/php.rs:316-408 | codegraph-kernel/src/python.rs:277-371 | codegraph-kernel/src/ruby.rs:275-365 | codegraph-kernel/src/rustlang.rs:260-355 | codegraph-kernel/src/swift.rs:401-498 \u2014 These 8 members are variants of one another: a block of 31 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c4645176f0628f223a08a0ed0127e920122d3e84218e36da25a9622e86268c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 19 shared lines): codegraph-kernel/src/ccpp/mod.rs:544-646 | codegraph-kernel/src/csharp.rs:316-391 | codegraph-kernel/src/go.rs:227-317 | codegraph-kernel/src/java.rs:304-381 | codegraph-kernel/src/kotlin.rs:405-521 | codegraph-kernel/src/php.rs:316-408 | codegraph-kernel/src/rustlang.rs:260-355 | codegraph-kernel/src/swift.rs:401-498 \u2014 These 8 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c14221ea1c075ba89e99a49ab4f60827f92a23413cd96e0013163b2caadcc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 26 shared lines): codegraph-kernel/src/java.rs:1102-1141 | codegraph-kernel/src/kotlin.rs:1516-1553 | codegraph-kernel/src/python.rs:811-842 | codegraph-kernel/src/swift.rs:1279-1318 | codegraph-kernel/src/tsjs/extractors.rs:1900-1941 \u2014 These 5 members are variants of one another: a block of 26 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2b18512f8572552e7a84cc61be1a407a17b9ed179c80563f501b1f8cd1c71e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 31 shared lines): codegraph-kernel/src/java.rs:1102-1141 | codegraph-kernel/src/kotlin.rs:1516-1553 | codegraph-kernel/src/swift.rs:1279-1318 | codegraph-kernel/src/tsjs/extractors.rs:1900-1941 \u2014 These 4 members are variants of one another: a block of 31 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd239646cf5b10867e3cbff6b9dd55555bb5584fd03a482c026d1ef603b750d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 27 shared lines): codegraph-kernel/src/ccpp/mod.rs:544-646 | codegraph-kernel/src/go.rs:227-317 | codegraph-kernel/src/rustlang.rs:260-355 | codegraph-kernel/src/tsjs/mod.rs:382-481 \u2014 These 4 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd388017a537691cdac170b681ff0ed4620a928917a40df9d2d047ae30efca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 27 shared lines): codegraph-kernel/src/java.rs:304-381 | codegraph-kernel/src/php.rs:316-408 | codegraph-kernel/src/swift.rs:401-498 | codegraph-kernel/src/tsjs/mod.rs:382-481 \u2014 These 4 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"13401205be8150df4ad789c11b713c4275ccf3b5875d356c8dce2e138f5f4f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 15 shared lines): codegraph-kernel/src/ccpp/mod.rs:1811-1843 | codegraph-kernel/src/python.rs:844-889 | codegraph-kernel/src/tsjs/extractors.rs:1860-1896 | codegraph-kernel/src/tsjs/extractors.rs:1943-1988 \u2014 These 4 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd56bbce2e04284a8d352209e36bbd2f48baea3bc5ccee1ab768948d598bafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): codegraph-kernel/src/csharp.rs:1213-1246 | codegraph-kernel/src/php.rs:1093-1122 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f351f23025a6bb913050ba98b8c77435458712053cbf5d0bc2d3753bbd01f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (14 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:2461-2500 | codegraph-kernel/src/csharp.rs:1570-1602 | codegraph-kernel/src/dart.rs:2041-2070 | codegraph-kernel/src/go.rs:1292-1329 | codegraph-kernel/src/java.rs:1303-1334 | codegraph-kernel/src/kotlin.rs:1752-1781 | codegraph-kernel/src/lua.rs:936-967 | codegraph-kernel/src/php.rs:1378-1413 | codegraph-kernel/src/python.rs:1001-1031 | codegraph-kernel/src/ruby.rs:1007-1040 | codegraph-kernel/src/rustlang.rs:1480-1509 | codegraph-kernel/src/scala.rs:1354-1383 | codegraph-kernel/src/swift.rs:1517-1546 | codegraph-kernel/src/tsjs/mod.rs:642-677 \u2014 These 14 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 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7700462585bc8a74b51637ce0f1e15d674d7832b7ec6da2c327788cd8860068"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:658-716 | codegraph-kernel/src/csharp.rs:499-511 | codegraph-kernel/src/go.rs:319-331 | codegraph-kernel/src/java.rs:485-497 | codegraph-kernel/src/kotlin.rs:528-542 | codegraph-kernel/src/php.rs:410-422 | codegraph-kernel/src/python.rs:373-385 | codegraph-kernel/src/ruby.rs:367-379 | codegraph-kernel/src/rustlang.rs:358-370 | codegraph-kernel/src/swift.rs:504-529 | codegraph-kernel/src/tsjs/mod.rs:998-1020 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ced2739318180efb3bb84a34038d54aeee97c46e7cabd00bd1fa31d280cea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): codegraph-kernel/src/csharp.rs:696-725 | codegraph-kernel/src/csharp.rs:757-774 | codegraph-kernel/src/java.rs:598-624 | codegraph-kernel/src/java.rs:681-698 | codegraph-kernel/src/php.rs:725-745 | codegraph-kernel/src/php.rs:747-764 | codegraph-kernel/src/python.rs:533-574 | codegraph-kernel/src/ruby.rs:670-705 | codegraph-kernel/src/rustlang.rs:629-647 | codegraph-kernel/src/swift.rs:905-926 | codegraph-kernel/src/swift.rs:985-1002 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b865c3be12e9662c5f312802d6f85194a3b3bc35f707bdc9df152ff74343b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:2436-2456 | codegraph-kernel/src/csharp.rs:1541-1568 | codegraph-kernel/src/go.rs:1266-1290 | codegraph-kernel/src/kotlin.rs:1723-1750 | codegraph-kernel/src/php.rs:1353-1376 | codegraph-kernel/src/python.rs:973-999 | codegraph-kernel/src/ruby.rs:983-1005 | codegraph-kernel/src/rustlang.rs:1454-1478 | codegraph-kernel/src/swift.rs:1493-1515 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"836e094ac18b3cf531c2bc19200198332762453f3b4a92d212ee3a05ac7f8481"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:209-223 | codegraph-kernel/src/go.rs:1453-1467 | codegraph-kernel/src/kotlin.rs:50-64 | codegraph-kernel/src/python.rs:1181-1195 | codegraph-kernel/src/rustlang.rs:1741-1755 | codegraph-kernel/src/scala.rs:54-68 | codegraph-kernel/src/swift.rs:68-82 | codegraph-kernel/src/tsjs/mod.rs:103-117 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e42c1c82e068a8064770a590588f42e72536a05c49dbdec5e299c42f526139"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:1667-1807 | codegraph-kernel/src/go.rs:827-915 | codegraph-kernel/src/kotlin.rs:1239-1330 | codegraph-kernel/src/python.rs:703-789 | codegraph-kernel/src/rustlang.rs:887-1021 | codegraph-kernel/src/scala.rs:876-952 | codegraph-kernel/src/swift.rs:1068-1173 | codegraph-kernel/src/tsjs/extractors.rs:1633-1758 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"060db391dca8e20d65f17eb3e00a6194a69c879612979b0833fd433ac2c6cac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): codegraph-kernel/src/csharp.rs:36-49 | codegraph-kernel/src/dart.rs:70-83 | codegraph-kernel/src/go.rs:1470-1483 | codegraph-kernel/src/java.rs:43-56 | codegraph-kernel/src/rustlang.rs:1759-1772 | codegraph-kernel/src/scala.rs:71-84 | codegraph-kernel/src/swift.rs:41-54 | codegraph-kernel/src/tsjs/mod.rs:120-133 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b6c2801727c833eb4d68529730120c5abe01b5d9ead0a50c53008cd8e08af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:1997-2039 | codegraph-kernel/src/csharp.rs:1250-1287 | codegraph-kernel/src/java.rs:1010-1047 | codegraph-kernel/src/kotlin.rs:1335-1371 | codegraph-kernel/src/php.rs:1127-1170 | codegraph-kernel/src/scala.rs:974-1019 | codegraph-kernel/src/swift.rs:1177-1217 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcf41386193af719646e2f687b19553631464cc3fc3182bcf1cb276be533df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): codegraph-kernel/src/go.rs:1104-1117 | codegraph-kernel/src/java.rs:1174-1187 | codegraph-kernel/src/rustlang.rs:1199-1212 | codegraph-kernel/src/swift.rs:708-782 | codegraph-kernel/src/swift.rs:1245-1259 | codegraph-kernel/src/tsjs/extractors.rs:2061-2077 | codegraph-kernel/src/tsjs/extractors.rs:2079-2089 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2712b029d4f16e83405a763cce33de8d7f733899dc1c1318efdefb7e9365763"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): codegraph-kernel/src/csharp.rs:757-774 | codegraph-kernel/src/java.rs:681-698 | codegraph-kernel/src/kotlin.rs:1100-1117 | codegraph-kernel/src/php.rs:747-764 | codegraph-kernel/src/rustlang.rs:629-647 | codegraph-kernel/src/swift.rs:985-1002 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e27de3909042f84825480b81cf696acbc06e6dafe498b3688bee7a915580ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): codegraph-kernel/src/csharp.rs:1104-1129 | codegraph-kernel/src/java.rs:855-873 | codegraph-kernel/src/kotlin.rs:1191-1212 | codegraph-kernel/src/php.rs:871-996 | codegraph-kernel/src/python.rs:619-700 | codegraph-kernel/src/swift.rs:1046-1064 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a8d6963c35e8f1bbe2e686cc251ed4b07e9b51050cf9bf5fc7eb174bd8e276"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): codegraph-kernel/src/csharp.rs:1527-1539 | codegraph-kernel/src/kotlin.rs:1709-1721 | codegraph-kernel/src/php.rs:1338-1351 | codegraph-kernel/src/ruby.rs:969-981 | codegraph-kernel/src/swift.rs:1479-1491 \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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7747cb31213fd6bc0faf5e598b777518d78e1d03d087125b377c80bcc6147746"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codegraph-kernel/src/ccpp/mod.rs:1438-1459 | codegraph-kernel/src/csharp.rs:776-799 | codegraph-kernel/src/php.rs:766-789 | codegraph-kernel/src/swift.rs:950-973 \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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c77c41a8b40f7ff257d4cc93a5817a953d289335bf252d32dad34fa94fc72"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codegraph-kernel/src/dart.rs:1746-1761 | codegraph-kernel/src/dart.rs:1784-1798 | codegraph-kernel/src/scala.rs:501-516 | codegraph-kernel/src/scala.rs:1162-1177 \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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e0c439be688baa5d72c7cddc05065fa03489414acf52d5d5977b7e31b72bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codegraph-kernel/src/dart.rs:1985-2014 | codegraph-kernel/src/go.rs:1206-1264 | codegraph-kernel/src/lua.rs:880-909 | codegraph-kernel/src/scala.rs:1301-1328 \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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182de0fc23c3f94cdfea1f91cdfa1e931cd7aa9a269f2580af1972bb221f457"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codegraph-kernel/src/go.rs:1119-1133 | codegraph-kernel/src/java.rs:1189-1203 | codegraph-kernel/src/rustlang.rs:1214-1228 | codegraph-kernel/src/swift.rs:1261-1275 \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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c12c22109da9fe1213234da441d4b10ba9e4a4ca9678a7d4595aeb421a06be"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codegraph-kernel/src/java.rs:876-942 | codegraph-kernel/src/kotlin.rs:1239-1330 | codegraph-kernel/src/php.rs:1000-1066 | codegraph-kernel/src/swift.rs:1068-1173 \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":"codegraph-kernel/src/java.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"851b1e03e5f73fe455bdd210d926b9f815b13af29a2156b10eefda8a6aba3f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): codegraph-kernel/src/csharp.rs:875-972 | codegraph-kernel/src/java.rs:749-830 \u2014 These two members are one piece of code written twice and then edited apart: 82 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"963c3617a29b670a7f49d6750eedf00c9aed797a2e5cf01267f575a76a235c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): codegraph-kernel/src/dart.rs:1594-1639 | codegraph-kernel/src/scala.rs:1066-1111 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"58029b0b69f3c4668b045820673a5efd7d1d7e0cd50dc09ccb265756df9b0b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): codegraph-kernel/src/ccpp/mod.rs:2322-2385 | codegraph-kernel/src/rustlang.rs:1356-1452 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"735e632c4140f8e6b6771d8c617d3855dc5153283a4189bdf87d56e9ee4db0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): codegraph-kernel/src/dart.rs:1911-1981 | codegraph-kernel/src/lua.rs:814-876 \u2014 These two members are one piece of code written twice and then edited apart: 63 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6a3fa41c7ba72ac5a9437f456ff120869d7827985862b6afe779f514a44114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 67\u002B corresponding lines): codegraph-kernel/src/csharp.rs:1406-1486 | codegraph-kernel/src/scala.rs:1231-1297 | codegraph-kernel/src/swift.rs:1352-1426 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 67 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b43fcca3890d52be4bb8b332d4485b43ab7b9e61748ec4d861263cd18084f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): codegraph-kernel/src/csharp.rs:814-869 | codegraph-kernel/src/tsjs/extractors.rs:545-605 \u2014 These two members are one piece of code written twice and then edited apart: 56 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c183bcf7bf423fd3df9e2b229b8798ac6d7116481263fd0fe33789eefc2039"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): codegraph-kernel/src/kotlin.rs:840-915 | codegraph-kernel/src/swift.rs:635-704 \u2014 These two members are one piece of code written twice and then edited apart: 70 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"08103eb3b5c86ebc736c1bbe3c4ce5c6d3c4c6f451863d00c28b55f52d35c3a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): codegraph-kernel/src/go.rs:517-567 | codegraph-kernel/src/kotlin.rs:1021-1071 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b808d4c8c4558aa9a892e1a9273fd903aab9016cdf0b9d21f48548a8815cd472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): codegraph-kernel/src/dart.rs:1548-1592 | codegraph-kernel/src/scala.rs:1023-1064 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2534fc3eb8f131e6c26bd53c8570ef5a8a4ad936b6bf860532869799405546f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): codegraph-kernel/src/java.rs:501-549 | codegraph-kernel/src/php.rs:535-611 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21ad3a8085e84938ac6b7604df710d95bd9c695378cb64d4e547fa382f97314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): codegraph-kernel/src/python.rs:579-617 | codegraph-kernel/src/rustlang.rs:732-781 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0079f8d6f54502674ce37c7ec9ea31ff618a484670f1d95dd3587a9605b281d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): codegraph-kernel/src/ccpp/mod.rs:1385-1409 | codegraph-kernel/src/ccpp/mod.rs:1412-1436 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d504ab746abdc8a94e7d32e76735aabda6808111d01dae2ef7512cc3b8b6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): codegraph-kernel/src/kotlin.rs:924-983 | codegraph-kernel/src/swift.rs:801-851 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b60b6bbd540c54c0caea30b01462fe6e4e53dbc1a90a04d19c97f8b9528435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): codegraph-kernel/src/dart.rs:879-929 | codegraph-kernel/src/dart.rs:931-977 | codegraph-kernel/src/scala.rs:716-757 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e8684b54b6661e7b1b4ea4aa78e110421e482b4707733c8453d7b0ab72f098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): codegraph-kernel/src/go.rs:417-455 | codegraph-kernel/src/rustlang.rs:474-532 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"607d16f57b8e30cb8a15ec438d269e652849928f52ab38257b2bc24fe5723770"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): codegraph-kernel/src/tsjs/mod.rs:899-930 | codegraph-kernel/src/tsjs/mod.rs:950-995 \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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2e25b7c5b28a1a7d6b2bacf74ce1a46c00291c2388e3c4b877fbfbf39ae1f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): codegraph-kernel/src/java.rs:1143-1171 | codegraph-kernel/src/kotlin.rs:1555-1583 | codegraph-kernel/src/swift.rs:1320-1348 \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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2552ae7105ca6380b766c3144b1e311ff6e5b21c4339cc1ea7f6f244495786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): codegraph-kernel/src/csharp.rs:1370-1402 | codegraph-kernel/src/php.rs:1220-1245 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a29cf765436eedf6e97e5b3aafdca3831337c9eca425b3a366e929cfcd0b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): codegraph-kernel/src/python.rs:415-452 | codegraph-kernel/src/ruby.rs:480-542 \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":"codegraph-kernel/src/python.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0145b93dbcb739ce3eca40c6352cd9bec543bfc1159e1e39640d3ef18be665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): codegraph-kernel/src/java.rs:700-722 | codegraph-kernel/src/kotlin.rs:1119-1141 | codegraph-kernel/src/rustlang.rs:679-704 | codegraph-kernel/src/tsjs/extractors.rs:496-519 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a07e8d2120d6154b8c611caa72f458710c11a63ca180ad8ed9c63f4ac94795c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): codegraph-kernel/src/kotlin.rs:1073-1098 | codegraph-kernel/src/tsjs/extractors.rs:398-427 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53a11f9a7e1466801e6e583da667c6855284b96a6c20a6a1cd822c103601892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 28\u002B corresponding lines): codegraph-kernel/src/dart.rs:981-1008 | codegraph-kernel/src/dart.rs:1012-1043 | codegraph-kernel/src/scala.rs:761-788 | codegraph-kernel/src/scala.rs:792-820 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 28 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdbcf7f3000968cb39d883d2643e26a18ee1c0fa519ea8c77ece9da31befad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): codegraph-kernel/src/csharp.rs:644-692 | codegraph-kernel/src/java.rs:558-594 | codegraph-kernel/src/php.rs:620-675 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ba7e067a82b13724066b317376692e9e926b828598e16726cce55f9d42f32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): codegraph-kernel/src/csharp.rs:393-412 | codegraph-kernel/src/java.rs:383-402 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67dc5274a2b12ad3f1e7d6c3c79bf54a8b18918a0a4f62ccd10426fda4ebd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): codegraph-kernel/src/csharp.rs:727-755 | codegraph-kernel/src/rustlang.rs:653-675 \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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53135acc85b02a85508a922be45a8ec8216073c931008e5be3f93174f275f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): codegraph-kernel/src/go.rs:490-515 | codegraph-kernel/src/ruby.rs:628-651 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f3f610c71ce7fd6652a5efaef37c4ebd75d90f5b7d2432c83719d56cb68932"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): codegraph-kernel/src/csharp.rs:1074-1098 | codegraph-kernel/src/java.rs:833-853 \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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd27e0010a8a83e3ff71f98c95415808b746c6b74d2d49e35581dc95955747b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): codegraph-kernel/src/csharp.rs:1744-1763 | codegraph-kernel/src/java.rs:1739-1758 | codegraph-kernel/src/kotlin.rs:1916-1935 | codegraph-kernel/src/php.rs:1513-1532 | codegraph-kernel/src/swift.rs:1688-1707 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 20 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"59559cc6e750e075d63e1e82b1355411d97e4d189447ff3d77f3e9d05d0b9733"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 21\u002B corresponding lines): codegraph-kernel/src/csharp.rs:1013-1044 | codegraph-kernel/src/csharp.rs:1048-1072 | codegraph-kernel/src/kotlin.rs:987-1019 | codegraph-kernel/src/python.rs:490-513 | codegraph-kernel/src/swift.rs:883-903 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 21 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94497485d60979a98ea3c06799ef2b525adf4093af2e14782a038e43c883cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): codegraph-kernel/src/ccpp/mod.rs:524-542 | codegraph-kernel/src/go.rs:207-225 | codegraph-kernel/src/python.rs:257-275 | codegraph-kernel/src/rustlang.rs:237-258 | codegraph-kernel/src/tsjs/mod.rs:352-372 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 19 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e2c1de80ced8cff9044178cae3869e64a7f45dbf0fafaeaf4ec719ff9d0a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): codegraph-kernel/src/dart.rs:325-346 | codegraph-kernel/src/lua.rs:178-199 | codegraph-kernel/src/scala.rs:273-293 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"01efe068efe698380cf23ee6b8cdcbfae212d1f548642709a5b2a4ef2ea70190"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): codegraph-kernel/src/java.rs:626-651 | codegraph-kernel/src/php.rs:705-723 | codegraph-kernel/src/python.rs:515-531 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b35a11955bf68acd24dde8083a139751e57f5908cc6381314045b4f2e00f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): codegraph-kernel/src/tsjs/mod.rs:1105-1127 | codegraph-kernel/src/tsjs/mod.rs:1131-1153 \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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"282fd703f0675e58af51799aa03c4157b30bd3705789da5d383ac790d23c1266"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 19\u002B corresponding lines): codegraph-kernel/src/csharp.rs:290-308 | codegraph-kernel/src/java.rs:278-296 | codegraph-kernel/src/kotlin.rs:359-377 | codegraph-kernel/src/php.rs:290-308 | codegraph-kernel/src/ruby.rs:249-267 | codegraph-kernel/src/swift.rs:375-393 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 19 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec79b521cc9c34abd61a6fc3d604a7f546216e87c3ef979f52b506e6bd6db659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): codegraph-kernel/src/java.rs:734-744 | codegraph-kernel/src/kotlin.rs:1163-1173 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c9dace70b60a73b97d7d6d0db0821ed4ff00c6e7d563c22986c4be6bb44faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): codegraph-kernel/src/csharp.rs:1188-1207 | codegraph-kernel/src/java.rs:944-959 | codegraph-kernel/src/php.rs:1068-1088 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c3a0fc2b6328458043f0ca70c0730e93d55c666154b2e89c94f1ef9f4d7a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): codegraph-kernel/src/python.rs:793-805 | codegraph-kernel/src/tsjs/extractors.rs:1847-1858 \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":"codegraph-kernel/src/python.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf88f3bc570d37fe6eca7f48c03ebf6c654178eee236043034a904dfa285d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): codegraph-kernel/src/buffers.rs:299-312 | codegraph-kernel/src/buffers.rs:318-330 \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":"codegraph-kernel/src/buffers.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"926633dfa661eee231912f05a9c5f0e168a46a849635450ee6aa3eb36871cc9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): codegraph-kernel/src/dart.rs:2016-2039 | codegraph-kernel/src/lua.rs:911-934 | codegraph-kernel/src/scala.rs:1330-1352 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a526a14a8fc57c8e0563586dbe52dec0830e070c8ebe292d7ce78598efae5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): codegraph-kernel/src/go.rs:462-486 | codegraph-kernel/src/python.rs:459-486 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5524c656ef9d80fc7cee974bd0be0c5333a237d876597da0f246fe78d2ed397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): codegraph-kernel/src/java.rs:1282-1301 | codegraph-kernel/src/tsjs/mod.rs:620-640 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c592775d26c4d94136a8785919150bf9be38bc13d879904beeb8867891ee57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): codegraph-kernel/src/ccpp/mod.rs:993-1011 | codegraph-kernel/src/java.rs:412-429 | codegraph-kernel/src/kotlin.rs:547-567 | codegraph-kernel/src/swift.rs:534-552 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc68fdd80d15f2c4b0ebd8b079c8f70ed6b0dec2ac9e88e0143df1452021e646"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): codegraph-kernel/src/tsjs/extractors.rs:382-394 | codegraph-kernel/src/tsjs/mod.rs:607-616 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3f6c0f68cbd87020556bc75ba2f5b712aac4d24d562bb00f35eb7caa9d067f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): codegraph-kernel/src/lua.rs:783-810 | codegraph-kernel/src/rlang.rs:303-316 \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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"4739e34361e45321bce04fc764314616294f43f23d5219678ad78d408b352d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): codegraph-kernel/src/cfnptr.rs:530-543 | codegraph-kernel/src/cfnptr.rs:896-909 \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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06b2a657b13e1b896b990611dc9bd3126210546ee994326295ab5098b3204e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): codegraph-kernel/src/rlang.rs:281-296 | codegraph-kernel/src/scala.rs:396-408 \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":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad9716fb4114f336370d69e2101927922c666b5e043f54c23779ff6e87c48b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): codegraph-kernel/src/go.rs:334-342 | codegraph-kernel/src/python.rs:388-396 | codegraph-kernel/src/rustlang.rs:373-381 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7267a83463b3aa73832883c18f33b7c011064f3da23bb0cf5c63444941a2d4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): codegraph-kernel/src/java.rs:431-444 | codegraph-kernel/src/java.rs:447-460 \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":"codegraph-kernel/src/java.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c4dd72ab819d20bc900a491b744980f339d3016dc20a24648e78357c7e2270"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): codegraph-kernel/src/lua.rs:737-752 | codegraph-kernel/src/scala.rs:825-836 \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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf929aabc84c066fdaf03517b33003f6d2a0345c9ee91d5bf2de70eadab3f2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): codegraph-kernel/src/cfnptr.rs:1159-1167 | codegraph-kernel/src/textutil.rs:134-142 \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":"codegraph-kernel/src/cfnptr.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"02044f1e792136603f887a3230af33667c00d042b75f666d7633254de5aff62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): codegraph-kernel/src/ccpp/mod.rs:2739-2748 | codegraph-kernel/src/tsjs/mod.rs:1058-1067 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"331015c94469626b7f86ab9eb7a3ad1e00a5dfcc4491e15bf113f2e15abd45b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): codegraph-kernel/src/dart.rs:625-636 | codegraph-kernel/src/tsjs/mod.rs:1069-1078 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"383d6c8ca2d14ca76ae00e60c684ce2c009164fcb32117b370ddcbdc49163242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): codegraph-kernel/src/csharp.rs:454-458 | codegraph-kernel/src/kotlin.rs:571-575 | codegraph-kernel/src/php.rs:443-447 | codegraph-kernel/src/swift.rs:569-573 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a70b797ddf96cb0a1e23d1f3d280d3aaa8cf757203a8fcfebe0fb781d3b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): codegraph-kernel/src/ccpp/mod.rs:135-138 | codegraph-kernel/src/csharp.rs:68-71 | codegraph-kernel/src/dart.rs:100-103 | codegraph-kernel/src/go.rs:41-44 | codegraph-kernel/src/java.rs:67-70 | codegraph-kernel/src/rustlang.rs:63-66 | codegraph-kernel/src/swift.rs:90-93 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 4 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e214a7a678aee47e2c9b073c98062e2e39801ad626170dbbba30450a5e8a65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): codegraph-kernel/src/ccpp/mod.rs:143-146 | codegraph-kernel/src/scala.rs:116-119 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbab780460b8c0155d1c38005358bb894572cf1800b07f1c71dafaefc47eabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): codegraph-kernel/src/ccpp/mod.rs:147-150 | codegraph-kernel/src/php.rs:95-98 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb7a2fc8ca3cd5a286e9b7ae7d5ac81b3e443de88731223b92830f599ac4eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): codegraph-kernel/src/csharp.rs:73-76 | codegraph-kernel/src/kotlin.rs:67-70 | codegraph-kernel/src/php.rs:90-93 | codegraph-kernel/src/rustlang.rs:68-71 | codegraph-kernel/src/swift.rs:85-88 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e225825fd3c27cd4152158e5509e3b0e63599fdcf02e5af37e55b51c99b09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): codegraph-kernel/src/dart.rs:86-89 | codegraph-kernel/src/go.rs:33-36 | codegraph-kernel/src/java.rs:71-74 | codegraph-kernel/src/scala.rs:96-99 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3581d4b6ff03b7f2585823ce34776217a52a8b91f9b87a86ad14de2997d9468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): codegraph-kernel/src/go.rs:45-48 | codegraph-kernel/src/scala.rs:101-104 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6106d79236a85534306f970a32d9e9c6148b506c17e13a3052b6ee0151de50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): codegraph-kernel/src/dart.rs:95-98 | codegraph-kernel/src/scala.rs:111-114 | codegraph-kernel/src/textutil.rs:10-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"18325768ddd75f88bca3e9647910ac579ee2322763a4b0660b18e7115e9bef9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): codegraph-kernel/src/dart.rs:402-439 | codegraph-kernel/src/scala.rs:342-379 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:402\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/scala.rs:340\u0060 calls \u0060end_position\u0060 and \u0060codegraph-kernel/src/dart.rs:400\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7649f50e9eea6636a4da573f38689caa1e4f92425e76f79198054c8fc409d071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): codegraph-kernel/src/csharp.rs:903-938 | codegraph-kernel/src/java.rs:762-797 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:903\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"657c94da7790a957f130e19ef5f20155ac729bc83f80d8df47ae271c3d90cfa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): codegraph-kernel/src/python.rs:1061-1087 | codegraph-kernel/src/ruby.rs:1073-1099 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:1061\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9d69ba9a378f5616c4d168e01312438cf582d915dca600549d39679ed73356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 5): codegraph-kernel/src/java.rs:1116-1141 | codegraph-kernel/src/kotlin.rs:1528-1553 | codegraph-kernel/src/python.rs:817-842 | codegraph-kernel/src/swift.rs:1293-1318 | codegraph-kernel/src/tsjs/extractors.rs:1916-1941 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:1116\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_decorators_for(\u0026mut\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe793f4b3da73f8c4319002fac22c8c0762582a071b8cbf88a2857808164699b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): codegraph-kernel/src/dart.rs:1595-1620 | codegraph-kernel/src/scala.rs:1067-1092 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aa3b4aa0392086781f1f2c85a7f5c705ad3a7c4ea546e2aad77ab2e0cc9615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1248-1269 | codegraph-kernel/src/swift.rs:1084-1109 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1248\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f89bead56736157d19e56ef3d0a4198fa28c741db1735d40d67508d850cf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): codegraph-kernel/src/go.rs:1145-1169 | codegraph-kernel/src/python.rs:905-929 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 38 separate duplicated blocks between them, totalling at least 468 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1145\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32717b8d99f9a15ad572c51c48fb0e25bb934db2428ae6a5b065bff34c956e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): codegraph-kernel/src/go.rs:1267-1288 | codegraph-kernel/src/kotlin.rs:1724-1748 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 478 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1267\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd954ede960a303c6eb0c978653573edb5f7dcf817cae7ef686b604a28861c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 13): codegraph-kernel/src/ccpp/mod.rs:2575-2598 | codegraph-kernel/src/csharp.rs:1676-1699 | codegraph-kernel/src/dart.rs:2153-2176 | codegraph-kernel/src/go.rs:1419-1442 | codegraph-kernel/src/java.rs:1425-1448 | codegraph-kernel/src/kotlin.rs:1889-1912 | codegraph-kernel/src/php.rs:1454-1477 | codegraph-kernel/src/python.rs:1116-1139 | codegraph-kernel/src/ruby.rs:1130-1153 | codegraph-kernel/src/rustlang.rs:1602-1625 | codegraph-kernel/src/scala.rs:1463-1486 | codegraph-kernel/src/swift.rs:1659-1682 | codegraph-kernel/src/tsjs/mod.rs:580-603 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2575\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/java.rs:1423\u0060 calls \u0060is_foreign_field\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:2573\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9784023a77835c0abfb6d1c597c7fb79b969d591d5505ded1e43210543d44c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): codegraph-kernel/src/go.rs:1367-1390 | codegraph-kernel/src/rustlang.rs:1550-1573 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 668 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1367\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae381dcff4b40ec97e396902d1a6e451e5e72e73623e2f45bdd94987e742ea68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:2437-2456 | codegraph-kernel/src/php.rs:1354-1376 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 364 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98cbdf9a8e95edcf6ff942aa4b4c3e8d96d1480c8c1deae8d025edf852a9337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201326 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1446-1471 | codegraph-kernel/src/kotlin.rs:1626-1632 | codegraph-kernel/src/swift.rs:1391-1414 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1446\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/swift.rs:1414\u0060 calls \u0060unwrap_or\u0060, \u0060Some\u0060, \u0060child_by_field_name\u0060 and \u0060codegraph-kernel/src/kotlin.rs:1632\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dc85d7c664b9acdc609957ac1d97aa69c74f533c55847913dbac8cd9b541ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201322 lines \u00D7 11): codegraph-kernel/src/ccpp/mod.rs:2553-2567 | codegraph-kernel/src/csharp.rs:1654-1668 | codegraph-kernel/src/go.rs:1398-1411 | codegraph-kernel/src/java.rs:1402-1416 | codegraph-kernel/src/kotlin.rs:1865-1881 | codegraph-kernel/src/php.rs:1425-1446 | codegraph-kernel/src/python.rs:1095-1108 | codegraph-kernel/src/ruby.rs:1107-1122 | codegraph-kernel/src/rustlang.rs:1581-1594 | codegraph-kernel/src/swift.rs:1638-1651 | codegraph-kernel/src/tsjs/mod.rs:557-572 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2553\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e316c1867f2ac76d5fdd4b8dfe447f581db8c175046d5ea3d2537096ac0f933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 7): codegraph-kernel/src/ccpp/mod.rs:614-634 | codegraph-kernel/src/go.rs:287-305 | codegraph-kernel/src/kotlin.rs:489-509 | codegraph-kernel/src/php.rs:375-396 | codegraph-kernel/src/ruby.rs:334-353 | codegraph-kernel/src/rustlang.rs:324-343 | codegraph-kernel/src/swift.rs:466-486 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:614\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ed7e61cbca9f3be685e14f8255d17fca8c74fdff5740b2be98bab1bdf64264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 5): codegraph-kernel/src/java.rs:1144-1165 | codegraph-kernel/src/kotlin.rs:1556-1577 | codegraph-kernel/src/python.rs:845-866 | codegraph-kernel/src/swift.rs:1321-1342 | codegraph-kernel/src/tsjs/extractors.rs:1944-1965 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b216033e0f86741335843a04a882fc70628e1c7288cb87a0db76a1e6a93c51bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 3): codegraph-kernel/src/csharp.rs:615-635 | codegraph-kernel/src/java.rs:533-549 | codegraph-kernel/src/php.rs:590-611 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:615\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5babe9cbeda382f900805d8f792186d97fdc810b01871b3e87dab741546c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): codegraph-kernel/src/dart.rs:2124-2145 | codegraph-kernel/src/scala.rs:1434-1455 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:2124\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd5845390b00b856271b55e9e879d4a9812eef8512e25b52484c0ed02a83aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201322 lines \u00D7 2): codegraph-kernel/src/lua.rs:90-101 | codegraph-kernel/src/tsjs/mod.rs:231-252 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/tsjs/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:90\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8ebfaaa6f5a24be984a90bf939a6cf2702fae4e974b007eb8bd51b6130af38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 10): codegraph-kernel/src/ccpp/mod.rs:2512-2527 | codegraph-kernel/src/csharp.rs:1611-1627 | codegraph-kernel/src/dart.rs:2079-2095 | codegraph-kernel/src/java.rs:1363-1376 | codegraph-kernel/src/kotlin.rs:1790-1807 | codegraph-kernel/src/python.rs:1040-1054 | codegraph-kernel/src/ruby.rs:1049-1066 | codegraph-kernel/src/scala.rs:1392-1408 | codegraph-kernel/src/swift.rs:1555-1575 | codegraph-kernel/src/tsjs/mod.rs:514-531 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2512\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b6448853690a1bf567633eb29fcb2b4b5208bbabb7c8c0b1f0d9747c4cac49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 4): codegraph-kernel/src/dart.rs:1607-1626 | codegraph-kernel/src/python.rs:853-873 | codegraph-kernel/src/scala.rs:1079-1098 | codegraph-kernel/src/tsjs/extractors.rs:1952-1972 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 371 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1607\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"61715cf0476e51a5ade777eaa7cc0ede16b520f9603778c489799ce1f7fe54c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): codegraph-kernel/src/go.rs:846-863 | codegraph-kernel/src/rustlang.rs:912-932 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 668 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:846\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d04cbe95ae04dd0b400416435dadfac498556096d4d31a731ebd753af5c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): codegraph-kernel/src/python.rs:318-338 | codegraph-kernel/src/ruby.rs:314-334 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:318\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3fa4eb92f2af70aff0493c8646d7228aba48fbef221d736b5c1c284ded70fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 14): codegraph-kernel/src/ccpp/mod.rs:460-480 | codegraph-kernel/src/csharp.rs:184-204 | codegraph-kernel/src/dart.rs:262-282 | codegraph-kernel/src/go.rs:143-163 | codegraph-kernel/src/java.rs:183-203 | codegraph-kernel/src/kotlin.rs:267-287 | codegraph-kernel/src/lua.rs:121-141 | codegraph-kernel/src/php.rs:192-212 | codegraph-kernel/src/rlang.rs:106-126 | codegraph-kernel/src/ruby.rs:171-191 | codegraph-kernel/src/rustlang.rs:172-192 | codegraph-kernel/src/scala.rs:208-228 | codegraph-kernel/src/swift.rs:271-291 | codegraph-kernel/src/tsjs/mod.rs:279-299 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/go.rs:164\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:205\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3148d48a03630989a65fabd751d73745acadb48b414b32d5f9d9611e53ceb49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1273-1290 | codegraph-kernel/src/swift.rs:1114-1133 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1273\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2e865f30236efd233ff088e6d24f1b616da921d0db4478afbb380669ce51fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): codegraph-kernel/src/csharp.rs:360-378 | codegraph-kernel/src/php.rs:357-375 | codegraph-kernel/src/swift.rs:448-466 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:360\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab6ee0c569ce6c696b377c1076d45dd04e0b76860d8c7c2544b49c1b72946ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:2340-2373 | codegraph-kernel/src/rustlang.rs:1381-1414 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2340\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e921660634b55aeb9a154c4940b4504e872d822e539b56bfc981a7bd5b75ad54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): codegraph-kernel/src/csharp.rs:954-972 | codegraph-kernel/src/java.rs:813-830 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:954\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0c1fd5f1f33765d52705ba9333619212dda082266b3a0926a8988c15872c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:861-878 | codegraph-kernel/src/kotlin.rs:953-971 \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 \u0060codegraph-kernel/src/kotlin.rs:953\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a973d707b67f32bf1744428f4e6c35ef87d5a62118e74ecb4cee06a605b0a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1309-1327 | codegraph-kernel/src/swift.rs:1154-1170 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1309\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d013ca25a80cd4df5800d1f334b24a6e165eae49e4de29ddf6f356489603696f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): codegraph-kernel/src/swift.rs:652-669 | codegraph-kernel/src/swift.rs:820-838 \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 \u0060codegraph-kernel/src/swift.rs:820\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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"d717561ccdac94a4b2c922fe5b4a4f5f85b7380e7a8fbff7a4c28c6186bf7ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 8): codegraph-kernel/src/csharp.rs:1746-1761 | codegraph-kernel/src/java.rs:1741-1756 | codegraph-kernel/src/kotlin.rs:1918-1933 | codegraph-kernel/src/php.rs:1515-1530 | codegraph-kernel/src/python.rs:868-883 | codegraph-kernel/src/swift.rs:1690-1705 | codegraph-kernel/src/tsjs/extractors.rs:1873-1890 | codegraph-kernel/src/tsjs/extractors.rs:1967-1982 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cc30476d6420bcf6e7651a9447df96d8e465e2a1d206e6382fec0293b497c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): codegraph-kernel/src/csharp.rs:1079-1098 | codegraph-kernel/src/java.rs:834-853 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"312b11d412c662958e65cf98dff5c56a4a982bbbb9246cea51cc6fd7e175f1bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): codegraph-kernel/src/go.rs:232-249 | codegraph-kernel/src/rustlang.rs:265-282 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 668 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a82e518d99e014916235fb4c6e29a9312e7e30bb471f1920e1ef0b6da2a2c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:847-863 | codegraph-kernel/src/swift.rs:637-654 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:847\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad1fd38ce9cb758bb8d01a27c606c26050796c0903b4d63c24d505928c96c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1814-1831 | codegraph-kernel/src/swift.rs:1582-1599 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1814\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"245d369334d14a8a565d0d5c44ee76fcb7d4cf503575da66de24c4c405e2c744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): codegraph-kernel/src/tsjs/mod.rs:901-915 | codegraph-kernel/src/tsjs/mod.rs:954-971 \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 \u0060codegraph-kernel/src/tsjs/mod.rs:901\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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce031b7083c50b72e23bdd8fd96e7de74f5d62884858029eb3e71e47ab5c32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 12): codegraph-kernel/src/csharp.rs:154-168 | codegraph-kernel/src/dart.rs:233-247 | codegraph-kernel/src/go.rs:114-128 | codegraph-kernel/src/java.rs:153-167 | codegraph-kernel/src/kotlin.rs:236-252 | codegraph-kernel/src/php.rs:164-178 | codegraph-kernel/src/python.rs:164-178 | codegraph-kernel/src/rlang.rs:84-98 | codegraph-kernel/src/ruby.rs:143-157 | codegraph-kernel/src/rustlang.rs:143-157 | codegraph-kernel/src/scala.rs:177-193 | codegraph-kernel/src/swift.rs:243-257 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:154\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"67760ee5f02c4ad4ca9563ceaef1791a5b3475f10a9b693023488bd1f68a2792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 7): codegraph-kernel/src/ccpp/mod.rs:2010-2026 | codegraph-kernel/src/csharp.rs:1261-1277 | codegraph-kernel/src/java.rs:1021-1037 | codegraph-kernel/src/kotlin.rs:1345-1361 | codegraph-kernel/src/php.rs:1144-1160 | codegraph-kernel/src/scala.rs:992-1008 | codegraph-kernel/src/swift.rs:1188-1204 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2010\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/csharp.rs:1257\u0060 calls \u0060top_row\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:2006\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"af64a942cd9309ea0b394ae10229dcecf0289661e3f87f818da319ba38067039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 7): codegraph-kernel/src/ccpp/mod.rs:2531-2545 | codegraph-kernel/src/csharp.rs:1631-1646 | codegraph-kernel/src/java.rs:1380-1394 | codegraph-kernel/src/kotlin.rs:1841-1857 | codegraph-kernel/src/scala.rs:1412-1426 | codegraph-kernel/src/swift.rs:1616-1630 | codegraph-kernel/src/tsjs/mod.rs:535-549 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2531\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efc6576751228cdb0589433d7d13e1eb0f59aaf7e1f9acf8398b348a1e8dc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): codegraph-kernel/src/dart.rs:1986-2002 | codegraph-kernel/src/go.rs:1207-1223 | codegraph-kernel/src/lua.rs:881-897 | codegraph-kernel/src/scala.rs:1302-1318 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 341 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1986\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdfa9d1c72367982a118ae8ff7e93d22e4e993e6f1d40c0704afb97e33398af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): codegraph-kernel/src/ccpp/mod.rs:1353-1369 | codegraph-kernel/src/go.rs:543-559 | codegraph-kernel/src/kotlin.rs:1047-1063 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1353\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"654681fdba1f7f5d74bdc15c18d394f50bbf157d6bad793301be3861e1c4ad4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): codegraph-kernel/src/ccpp/mod.rs:2439-2452 | codegraph-kernel/src/php.rs:1356-1372 | codegraph-kernel/src/python.rs:980-995 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 364 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2439\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, \u0060codegraph-kernel/src/python.rs:979\u0060 calls \u0060contains\u0060, \u0060id\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:2438\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a368a517f6d3da655f5016cac0289943a819734e2b1b28832eea6e13a4738a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): codegraph-kernel/src/go.rs:1273-1286 | codegraph-kernel/src/kotlin.rs:1730-1746 | codegraph-kernel/src/swift.rs:1496-1511 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 478 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1273\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, \u0060codegraph-kernel/src/go.rs:1272\u0060 calls \u0060contains\u0060, \u0060id\u0060 and \u0060codegraph-kernel/src/swift.rs:1495\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d72dd36ad4b774829eec75a283fa819ce7c7153f275cb65b65b0405c4012d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codegraph-kernel/src/csharp.rs:676-692 | codegraph-kernel/src/php.rs:659-675 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:676\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"559fcfc1bb1aa4802583997f0b0433997bd7db59d1f12fcd49e4ef75990154ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 13): codegraph-kernel/src/ccpp/mod.rs:2561-2573 | codegraph-kernel/src/csharp.rs:1662-1674 | codegraph-kernel/src/dart.rs:2139-2151 | codegraph-kernel/src/go.rs:1405-1417 | codegraph-kernel/src/java.rs:1410-1422 | codegraph-kernel/src/kotlin.rs:1872-1887 | codegraph-kernel/src/php.rs:1437-1452 | codegraph-kernel/src/python.rs:1102-1114 | codegraph-kernel/src/ruby.rs:1114-1128 | codegraph-kernel/src/rustlang.rs:1588-1600 | codegraph-kernel/src/scala.rs:1449-1461 | codegraph-kernel/src/swift.rs:1645-1657 | codegraph-kernel/src/tsjs/mod.rs:566-578 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2561\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 after the matched lines, \u0060codegraph-kernel/src/java.rs:1423\u0060 calls \u0060is_foreign_field\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:2574\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aaad25ccab0dd2db2bf0acac5ed77f9ae458075f6e75f5f8f5483f7cfaa6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:564-578 | codegraph-kernel/src/go.rs:239-254 | codegraph-kernel/src/rustlang.rs:272-287 | codegraph-kernel/src/tsjs/mod.rs:414-429 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:564\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/ccpp/mod.rs:579\u0060 calls \u0060Some\u0060, \u0060set\u0060 and \u0060codegraph-kernel/src/go.rs:255\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7d7414acd2869eb4db116df5d1b5a87a0805bce50e42b16f1045e11298855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:1816-1828 | codegraph-kernel/src/dart.rs:1189-1200 | codegraph-kernel/src/rustlang.rs:1031-1043 | codegraph-kernel/src/tsjs/extractors.rs:1864-1879 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_instantiation(\u0026mut\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/ccpp/mod.rs:1815\u0060 calls \u0060top_row\u0060 and \u0060codegraph-kernel/src/rustlang.rs:1030\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b896408e4efdfd3d7817137d80fadfc7b0dbff0634bbe53eacff9444b5f16cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1192-1207 | codegraph-kernel/src/java.rs:948-959 | codegraph-kernel/src/php.rs:1077-1088 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1192\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bf49444016c431cad7e5c651d2603a1766483bd4ff7429410aff06f8f56e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): codegraph-kernel/src/dart.rs:327-342 | codegraph-kernel/src/lua.rs:180-195 | codegraph-kernel/src/scala.rs:275-289 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:327\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"161dbcdfa1fb4935136902bcb14948a84105780547b9df71afd72fd0caa37b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): codegraph-kernel/src/dart.rs:893-907 | codegraph-kernel/src/dart.rs:940-955 \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 \u0060codegraph-kernel/src/dart.rs:893\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, \u0060codegraph-kernel/src/dart.rs:938\u0060 calls \u0060extract_name\u0060 and \u0060codegraph-kernel/src/dart.rs:890\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89d5bd62190335f9748802b2842d43d2c93fcf1f3cac1e04d270795ce5f9c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): codegraph-kernel/src/dart.rs:1928-1942 | codegraph-kernel/src/scala.rs:1246-1261 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1928\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf077f98f42432584ec67e5e7766dd89aa02a8e6b4e57e101cba306a05cfd89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): codegraph-kernel/src/java.rs:224-242 | codegraph-kernel/src/kotlin.rs:305-323 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:224\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af367a7f8a84ad9985483c3833f1ed184949175415efde77012cad4bff16ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): codegraph-kernel/src/java.rs:926-939 | codegraph-kernel/src/php.rs:1048-1063 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 608 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:926\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1d80c6068af5f2089f0ced559c7e8afd1fb89e1ae8a4767993e0011f3f6bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:426-441 | codegraph-kernel/src/lua.rs:214-229 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 186 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f74e337f2be8289341dc2c104fad700d31b87507b6bb50934d6cae1493856b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1083-1098 | codegraph-kernel/src/tsjs/extractors.rs:414-427 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1083\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_class(\u0026mut\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88e3bbc1818a0957e697f9be67784468b476f0aa381c4e88d32f7a579737dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1595-1610 | codegraph-kernel/src/ruby.rs:878-893 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 522 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1595\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"61555e412dfc84154c8b30b13fbed29efce276b3c8f356cbda2a183afd4c0a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codegraph-kernel/src/lua.rs:822-837 | codegraph-kernel/src/scala.rs:1236-1251 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 329 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:822\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/lua.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"145e7cd730bc82318ca11a69567e0e2b97ddb3cad9fc8a61eaa8bed5b1eae6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codegraph-kernel/src/rlang.rs:225-240 | codegraph-kernel/src/tsjs/mod.rs:455-470 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/rlang.rs\u0060 and \u0060codegraph-kernel/src/tsjs/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/rlang.rs:225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d42f084eefd10f997eaadd60766b5510f8680ebdec5a42e46f3714f4c4f3de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 13): codegraph-kernel/src/ccpp/mod.rs:2486-2500 | codegraph-kernel/src/csharp.rs:1588-1602 | codegraph-kernel/src/dart.rs:2056-2070 | codegraph-kernel/src/go.rs:1315-1329 | codegraph-kernel/src/java.rs:1320-1334 | codegraph-kernel/src/kotlin.rs:1767-1781 | codegraph-kernel/src/lua.rs:953-967 | codegraph-kernel/src/php.rs:1399-1413 | codegraph-kernel/src/python.rs:1017-1031 | codegraph-kernel/src/ruby.rs:1026-1040 | codegraph-kernel/src/rustlang.rs:1495-1509 | codegraph-kernel/src/scala.rs:1369-1383 | codegraph-kernel/src/swift.rs:1532-1546 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2486\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac10e2fd2f8a620595671194d132abfb7ff131047494e22e55c87eb82a5211a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 12): codegraph-kernel/src/ccpp/mod.rs:2511-2520 | codegraph-kernel/src/csharp.rs:1610-1620 | codegraph-kernel/src/dart.rs:2078-2088 | codegraph-kernel/src/go.rs:1337-1346 | codegraph-kernel/src/java.rs:1362-1369 | codegraph-kernel/src/kotlin.rs:1789-1800 | codegraph-kernel/src/python.rs:1039-1047 | codegraph-kernel/src/ruby.rs:1048-1059 | codegraph-kernel/src/rustlang.rs:1517-1527 | codegraph-kernel/src/scala.rs:1391-1401 | codegraph-kernel/src/swift.rs:1554-1568 | codegraph-kernel/src/tsjs/mod.rs:513-524 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dac86eb28d4f356a376e082c9ca132b632bd40d701454acf6c8e4b4d84f538c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 12): codegraph-kernel/src/ccpp/mod.rs:2538-2559 | codegraph-kernel/src/csharp.rs:1639-1661 | codegraph-kernel/src/dart.rs:2109-2130 | codegraph-kernel/src/go.rs:1383-1404 | codegraph-kernel/src/java.rs:1387-1409 | codegraph-kernel/src/kotlin.rs:1850-1871 | codegraph-kernel/src/python.rs:1080-1101 | codegraph-kernel/src/ruby.rs:1092-1113 | codegraph-kernel/src/rustlang.rs:1566-1587 | codegraph-kernel/src/scala.rs:1419-1440 | codegraph-kernel/src/swift.rs:1623-1644 | codegraph-kernel/src/tsjs/mod.rs:542-565 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2538\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fd3ae75081f8c69d3fd7aaeb7636357ed1bd5173bf150bb649564646f10738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 9): codegraph-kernel/src/csharp.rs:1573-1586 | codegraph-kernel/src/dart.rs:2044-2054 | codegraph-kernel/src/java.rs:1306-1316 | codegraph-kernel/src/kotlin.rs:1755-1765 | codegraph-kernel/src/lua.rs:939-951 | codegraph-kernel/src/ruby.rs:1010-1024 | codegraph-kernel/src/rustlang.rs:1483-1493 | codegraph-kernel/src/scala.rs:1357-1367 | codegraph-kernel/src/swift.rs:1520-1530 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1573\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"068e1464ae88422ee956972ffeed4af9f68df156dfb059929e046642543b9181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 5): codegraph-kernel/src/ccpp/mod.rs:525-537 | codegraph-kernel/src/go.rs:208-220 | codegraph-kernel/src/python.rs:258-270 | codegraph-kernel/src/rustlang.rs:238-250 | codegraph-kernel/src/tsjs/mod.rs:353-367 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:525\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa4914ad0e66193e15023744c4cea8101f1dcd0682325d6a2f6c83cd10ad172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 5): codegraph-kernel/src/csharp.rs:1438-1448 | codegraph-kernel/src/dart.rs:1935-1949 | codegraph-kernel/src/kotlin.rs:1618-1628 | codegraph-kernel/src/scala.rs:1254-1268 | codegraph-kernel/src/swift.rs:1383-1393 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2c799a60e5c4abdb4f19d346874910eb0bc06d550cb59e23e5f8a731f7bcec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1222-1236 | codegraph-kernel/src/java.rs:984-997 | codegraph-kernel/src/php.rs:1102-1113 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee69394759a15ca87fde86f478ff28a223dd049740b5b1355973bfc1655ea0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): codegraph-kernel/src/go.rs:902-915 | codegraph-kernel/src/python.rs:777-789 | codegraph-kernel/src/rustlang.rs:1007-1021 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 38 separate duplicated blocks between them, totalling at least 468 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:902\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, \u0060codegraph-kernel/src/rustlang.rs:1003\u0060 calls \u0060kind\u0060, \u0060strip_turbofish\u0060, \u0060text\u0060 and \u0060codegraph-kernel/src/go.rs:901\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b9139ac38f49ba0fadc850497a5d7863f91d0f9207efe412c1e89ba3c1c281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): codegraph-kernel/src/rlang.rs:193-207 | codegraph-kernel/src/ruby.rs:287-301 | codegraph-kernel/src/scala.rs:310-324 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/rlang.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 135 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/rlang.rs:193\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/scala.rs:327\u0060 calls \u0060opt_str\u0060, \u0060as_deref\u0060 and \u0060codegraph-kernel/src/ruby.rs:305\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":"codegraph-kernel/src/rlang.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f933a94076b51395eacfa030ed90bc4b0889ac30827af668814a79fcafa20abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codegraph-kernel/src/dart.rs:909-923 | codegraph-kernel/src/dart.rs:957-971 \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 \u0060codegraph-kernel/src/dart.rs:909\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a947ceaa8f3340397e9a7a67b984066ada75d7e8b23a2bf1987373a0db8b4ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): codegraph-kernel/src/dart.rs:1020-1033 | codegraph-kernel/src/scala.rs:800-814 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29cbb91ebde96a70152819a48d792036a95be6a96661dbc76ce3fd33540d55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codegraph-kernel/src/dart.rs:1747-1761 | codegraph-kernel/src/scala.rs:1163-1177 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637c0b8449e08cff5bd3b84a15c3a5e2a7729fa39bf53515aedfa600e6911e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 9): codegraph-kernel/src/ccpp/mod.rs:611-624 | codegraph-kernel/src/csharp.rs:375-388 | codegraph-kernel/src/go.rs:284-297 | codegraph-kernel/src/java.rs:365-378 | codegraph-kernel/src/kotlin.rs:486-499 | codegraph-kernel/src/php.rs:372-385 | codegraph-kernel/src/ruby.rs:331-344 | codegraph-kernel/src/rustlang.rs:321-334 | codegraph-kernel/src/swift.rs:463-476 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:611\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/kotlin.rs:482\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:371\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"13465535d5e7e49aa7eadcd88487292171fbb887a48cb450b443fa9d86dbfa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 9): codegraph-kernel/src/csharp.rs:325-338 | codegraph-kernel/src/dart.rs:358-371 | codegraph-kernel/src/java.rs:313-326 | codegraph-kernel/src/php.rs:325-338 | codegraph-kernel/src/python.rs:286-299 | codegraph-kernel/src/rlang.rs:190-203 | codegraph-kernel/src/ruby.rs:284-297 | codegraph-kernel/src/scala.rs:307-320 | codegraph-kernel/src/swift.rs:410-423 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/csharp.rs:323\u0060 calls \u0060end_position\u0060 and \u0060codegraph-kernel/src/dart.rs:356\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4842c2eea9aedb0a52fb78884a9baa3fc1880a907567f8c70989bf7ee5014b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 8): codegraph-kernel/src/ccpp/mod.rs:210-223 | codegraph-kernel/src/go.rs:1454-1467 | codegraph-kernel/src/kotlin.rs:51-64 | codegraph-kernel/src/python.rs:1182-1195 | codegraph-kernel/src/rustlang.rs:1742-1755 | codegraph-kernel/src/scala.rs:55-68 | codegraph-kernel/src/swift.rs:69-82 | codegraph-kernel/src/tsjs/mod.rs:104-117 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2822472a0edb10e86019062f0a15ede4ab1d3734df7df3200033c32c0fbc7cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 6): codegraph-kernel/src/csharp.rs:1189-1197 | codegraph-kernel/src/go.rs:920-928 | codegraph-kernel/src/java.rs:945-953 | codegraph-kernel/src/php.rs:1069-1082 | codegraph-kernel/src/rustlang.rs:1028-1036 | codegraph-kernel/src/tsjs/extractors.rs:1861-1869 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 423 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_instantiation(\u0026mut\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"54474d39534d28c47486dbb49decfe3feef61c6ba3df9051917d0e7a6e923966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): codegraph-kernel/src/dart.rs:414-427 | codegraph-kernel/src/lua.rs:259-272 | codegraph-kernel/src/scala.rs:354-367 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:414\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62f0a378d0bfcee83d9d8a4c9198198d8a268c823999d51971c5f7e761e66df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:596-609 | codegraph-kernel/src/go.rs:269-282 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:596\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff779475932eac473ae4bf05548481d270f49f00c9cc824ba0789e96fe66c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:998-1011 | codegraph-kernel/src/java.rs:416-429 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 372 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:998\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"90716c6e358fc9bd71b12626ef2b0973532511af6ac12ea85538c1bee4d878cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/dart.rs:1568-1581 | codegraph-kernel/src/scala.rs:1043-1056 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1568\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ca14ee911f30a5750252925cf22d43a9645a1a5d786c5870c2a93abfa50c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/lua.rs:264-277 | codegraph-kernel/src/rlang.rs:233-246 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/rlang.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:264\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6097420dc7e3c7ceaebd05283b319f0e9e6f0d9c5163a1b81035dabaca90d47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 13): codegraph-kernel/src/csharp.rs:326-337 | codegraph-kernel/src/dart.rs:359-370 | codegraph-kernel/src/go.rs:237-248 | codegraph-kernel/src/java.rs:314-325 | codegraph-kernel/src/kotlin.rs:428-440 | codegraph-kernel/src/lua.rs:216-228 | codegraph-kernel/src/php.rs:326-337 | codegraph-kernel/src/python.rs:287-298 | codegraph-kernel/src/rlang.rs:191-202 | codegraph-kernel/src/ruby.rs:285-296 | codegraph-kernel/src/rustlang.rs:270-281 | codegraph-kernel/src/scala.rs:308-319 | codegraph-kernel/src/swift.rs:411-422 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/csharp.rs:323\u0060 calls \u0060end_position\u0060 and \u0060codegraph-kernel/src/dart.rs:356\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab629252eba4707def00aed96555d80c78ae081bed5928ff2993b443558c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 11): codegraph-kernel/src/csharp.rs:396-408 | codegraph-kernel/src/dart.rs:433-445 | codegraph-kernel/src/go.rs:300-312 | codegraph-kernel/src/java.rs:386-398 | codegraph-kernel/src/kotlin.rs:504-516 | codegraph-kernel/src/php.rs:391-403 | codegraph-kernel/src/python.rs:354-366 | codegraph-kernel/src/ruby.rs:348-360 | codegraph-kernel/src/scala.rs:373-385 | codegraph-kernel/src/swift.rs:481-493 | codegraph-kernel/src/tsjs/mod.rs:489-501 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a1d6dcdc2655130127a63e794276a7acc7c5959418ae1793329e31fe1b9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 9): codegraph-kernel/src/ccpp/mod.rs:607-618 | codegraph-kernel/src/csharp.rs:370-382 | codegraph-kernel/src/go.rs:280-291 | codegraph-kernel/src/java.rs:361-372 | codegraph-kernel/src/php.rs:367-379 | codegraph-kernel/src/python.rs:330-342 | codegraph-kernel/src/ruby.rs:326-338 | codegraph-kernel/src/rustlang.rs:317-328 | codegraph-kernel/src/swift.rs:458-470 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:607\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, \u0060codegraph-kernel/src/ccpp/mod.rs:606\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:370\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8ac8803981895c1bb3acfb26e405afd89c9a1ff41a1a0be46c6b18ec944d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 8): codegraph-kernel/src/csharp.rs:163-174 | codegraph-kernel/src/dart.rs:242-253 | codegraph-kernel/src/php.rs:173-184 | codegraph-kernel/src/python.rs:173-184 | codegraph-kernel/src/ruby.rs:152-163 | codegraph-kernel/src/scala.rs:188-199 | codegraph-kernel/src/swift.rs:252-263 | codegraph-kernel/src/tsjs/mod.rs:254-266 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3118911a670107f3430d213d493c9edbbaf228b634a4a0394845c54b34efa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 7): codegraph-kernel/src/csharp.rs:1115-1127 | codegraph-kernel/src/java.rs:861-871 | codegraph-kernel/src/kotlin.rs:1200-1210 | codegraph-kernel/src/php.rs:904-914 | codegraph-kernel/src/php.rs:981-991 | codegraph-kernel/src/python.rs:627-637 | codegraph-kernel/src/swift.rs:1052-1062 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cfac27f39d921c4ebcc346a14da16cd1c1b17932f3e09f9d837a09bc5b1c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): codegraph-kernel/src/csharp.rs:291-303 | codegraph-kernel/src/java.rs:279-291 | codegraph-kernel/src/kotlin.rs:360-372 | codegraph-kernel/src/php.rs:291-303 | codegraph-kernel/src/ruby.rs:250-262 | codegraph-kernel/src/swift.rs:376-388 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:291\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c875df0e14bebb80fcefb524d74b1455f16732c767380f4e454c1a8ad2f0494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): codegraph-kernel/src/csharp.rs:358-370 | codegraph-kernel/src/dart.rs:400-412 | codegraph-kernel/src/go.rs:266-278 | codegraph-kernel/src/php.rs:355-367 | codegraph-kernel/src/swift.rs:446-458 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:358\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/go.rs:279\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:371\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6599dd333667031ebd8c40732b11514cc0410202b1c177d0ef4a14088a50d2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:2362-2372 | codegraph-kernel/src/go.rs:1177-1189 | codegraph-kernel/src/ruby.rs:895-905 | codegraph-kernel/src/rustlang.rs:1403-1413 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b9966cba340a7822331d83796358d154b4dca990b0cf2d1c2078b7493fc6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): codegraph-kernel/src/go.rs:1120-1133 | codegraph-kernel/src/java.rs:1190-1203 | codegraph-kernel/src/rustlang.rs:1215-1228 | codegraph-kernel/src/swift.rs:1262-1275 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 428 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/go.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"145820cca2d10e741ec4f8caf95bfc0294408a17a722e4c84c2c93e01d4709be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1419-1431 | codegraph-kernel/src/rustlang.rs:1370-1382 | codegraph-kernel/src/swift.rs:1364-1376 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 537 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1419\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"912fe5d1fce28a68ebd3a07d7d77390a013aea303b13f169b9bd010b2e6a8a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): codegraph-kernel/src/java.rs:347-359 | codegraph-kernel/src/kotlin.rs:468-480 | codegraph-kernel/src/rustlang.rs:303-315 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:347\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f032b30a8e7a5d2dc006a83f8b88c0f5f12e12db04cb5e23e2520dfd258e7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): codegraph-kernel/src/lua.rs:246-258 | codegraph-kernel/src/python.rs:319-331 | codegraph-kernel/src/ruby.rs:315-327 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 160 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:246\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/lua.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29fafe9cbbcdce88e00a9e25a0224425978207df6a81051b8c77afb9b6d169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): codegraph-kernel/src/python.rs:318-330 | codegraph-kernel/src/ruby.rs:314-326 | codegraph-kernel/src/tsjs/mod.rs:447-459 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:318\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/python.rs:331\u0060 calls \u0060push\u0060 and \u0060codegraph-kernel/src/tsjs/mod.rs:462\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc92184c966e4de7c0ed2ab4dae9cc949a0068d6a7f0cfefb2a74e24b64e6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/dart.rs:386-399 | codegraph-kernel/src/scala.rs:326-339 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:386\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1c00c8b63bf21d5f4cbe2053b7fc171a728aa34d9eb656ef4601724b87a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/go.rs:1347-1360 | codegraph-kernel/src/rustlang.rs:1528-1541 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 668 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1347\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cf5b1d74a3e60d3162449066e98ab8bc0786d6b5eca9528328fbce5976f8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:944-956 | codegraph-kernel/src/swift.rs:813-823 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:944\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, \u0060codegraph-kernel/src/kotlin.rs:940\u0060 calls \u0060extract_object_literal\u0060 and \u0060codegraph-kernel/src/swift.rs:811\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba0462c5ddc33ef7bc04c0dc50712a3ab9fd03784c404202e6471d2e44a15e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codegraph-kernel/src/python.rs:729-741 | codegraph-kernel/src/tsjs/extractors.rs:1667-1679 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:729\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_call(\u0026mut\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd10d3a7475e5d7e164d290cf4517b83743efb6a2b91350dfa69452ca34f8580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codegraph-kernel/src/python.rs:959-971 | codegraph-kernel/src/rustlang.rs:1439-1451 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 42 separate duplicated blocks between them, totalling at least 491 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:959\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8ae9408783a64cf9a434f8dae2975e8959d1c151c98ce82cb68f6ef7e0d04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 15): codegraph-kernel/src/ccpp/mod.rs:488-499 | codegraph-kernel/src/csharp.rs:234-245 | codegraph-kernel/src/dart.rs:289-300 | codegraph-kernel/src/go.rs:171-182 | codegraph-kernel/src/java.rs:242-253 | codegraph-kernel/src/kotlin.rs:323-334 | codegraph-kernel/src/lua.rs:148-159 | codegraph-kernel/src/php.rs:254-265 | codegraph-kernel/src/python.rs:221-232 | codegraph-kernel/src/rlang.rs:132-143 | codegraph-kernel/src/ruby.rs:198-209 | codegraph-kernel/src/rustlang.rs:200-211 | codegraph-kernel/src/scala.rs:236-247 | codegraph-kernel/src/swift.rs:299-310 | codegraph-kernel/src/tsjs/mod.rs:308-319 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:488\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/dart.rs:288\u0060 calls \u0060flush_value_refs\u0060, \u0060root_node\u0060 and \u0060codegraph-kernel/src/lua.rs:147\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbcce3700378a41e2add3ac66e8a6f6db62f1731c6acf66b22830f6338d33f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 15): codegraph-kernel/src/ccpp/mod.rs:609-620 | codegraph-kernel/src/csharp.rs:373-384 | codegraph-kernel/src/dart.rs:418-429 | codegraph-kernel/src/go.rs:282-293 | codegraph-kernel/src/java.rs:363-374 | codegraph-kernel/src/kotlin.rs:484-495 | codegraph-kernel/src/lua.rs:263-274 | codegraph-kernel/src/php.rs:370-381 | codegraph-kernel/src/python.rs:333-344 | codegraph-kernel/src/rlang.rs:232-243 | codegraph-kernel/src/ruby.rs:329-340 | codegraph-kernel/src/rustlang.rs:319-330 | codegraph-kernel/src/scala.rs:358-369 | codegraph-kernel/src/swift.rs:461-472 | codegraph-kernel/src/tsjs/mod.rs:462-473 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/ccpp/mod.rs:606\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:370\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7ab8a49fb811603412a144617ef8606c1317e69b601e8b265a15b6f1e68c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 8): codegraph-kernel/src/ccpp/mod.rs:1821-1828 | codegraph-kernel/src/dart.rs:1194-1200 | codegraph-kernel/src/dart.rs:1620-1626 | codegraph-kernel/src/python.rs:866-874 | codegraph-kernel/src/rustlang.rs:1036-1043 | codegraph-kernel/src/scala.rs:1092-1098 | codegraph-kernel/src/tsjs/extractors.rs:1869-1880 | codegraph-kernel/src/tsjs/extractors.rs:1965-1973 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_instantiation(\u0026mut\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b17a09ed26f20ff831c35a54fdffd42259f9a0ba6bf053d4b2a7f39cc09c619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): codegraph-kernel/src/csharp.rs:359-370 | codegraph-kernel/src/dart.rs:401-412 | codegraph-kernel/src/go.rs:267-278 | codegraph-kernel/src/php.rs:356-367 | codegraph-kernel/src/scala.rs:341-352 | codegraph-kernel/src/swift.rs:447-458 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:359\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/go.rs:279\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:371\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"847b5fac39ca4db3d993ac22c925ace4dbba102e5115939ef6db1f9743f3c2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): codegraph-kernel/src/csharp.rs:1557-1568 | codegraph-kernel/src/go.rs:1279-1290 | codegraph-kernel/src/kotlin.rs:1739-1750 | codegraph-kernel/src/python.rs:988-999 | codegraph-kernel/src/rustlang.rs:1467-1478 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 423 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1557\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28b3631d95265e9c526de88610a1673c91a0c861fd4f4556c0c6038c3bebbb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:2339-2349 | codegraph-kernel/src/csharp.rs:1429-1439 | codegraph-kernel/src/rustlang.rs:1380-1390 | codegraph-kernel/src/tsjs/fnref.rs:57-68 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2339\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"86037d5a0dbfa2c20567d410a0f606ff6b63882dae12a419db892965799e67ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): codegraph-kernel/src/ccpp/mod.rs:1340-1351 | codegraph-kernel/src/go.rs:532-541 | codegraph-kernel/src/kotlin.rs:1034-1045 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1340\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e28d981e10cf8eb65108c2cb9bcef140345e7f18b34597ba02e94a29b4f3d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): codegraph-kernel/src/csharp.rs:204-214 | codegraph-kernel/src/java.rs:208-216 | codegraph-kernel/src/php.rs:212-223 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:204\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca4720428040d53e7d525783013239a87929a3e2aa82e79a40c7be0d998ee17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): codegraph-kernel/src/dart.rs:2028-2039 | codegraph-kernel/src/lua.rs:923-934 | codegraph-kernel/src/scala.rs:1341-1352 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:2028\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"efff7ee0436156166554a5545e6aa7292a5bab690f6fc45ef2706716e3e145bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1347-1358 | codegraph-kernel/src/rustlang.rs:595-606 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1347\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8725d73edca98a7fcd512db71449a3ed63e71050e235173e0894a05b82944198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/csharp.rs:854-865 | codegraph-kernel/src/tsjs/extractors.rs:590-601 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:854\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_property(\u0026mut\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecdf6409b5fc0b3949aa3c275b36f2ac143f21548c96b5b39cf48f14f4279e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): codegraph-kernel/src/dart.rs:1471-1482 | codegraph-kernel/src/dart.rs:1826-1834 \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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1558fa6de289537d63119cbfa0066d4bab01fa634206dc974a00a078c013ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/dart.rs:1551-1562 | codegraph-kernel/src/scala.rs:1029-1040 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/dart.rs:1567\u0060 calls \u0060declaration_wrapper\u0060, \u0060unwrap_or\u0060 and \u0060codegraph-kernel/src/scala.rs:1043\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e43b70d72978db5721196b49fbcf12213f4fdf45969eb13e9e03d752b40dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1292-1303 | codegraph-kernel/src/swift.rs:1135-1146 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1292\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a7d277b533c7d36f59115e9b1f2d953c91e8a941a886e6af5a39d7e0d5340c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/lua.rs:768-779 | codegraph-kernel/src/rlang.rs:592-603 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/rlang.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:768\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e2dda127e6b0559307097e8808d0d4f3041f7a82b83dcaf2da343f5834fa0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/python.rs:606-617 | codegraph-kernel/src/rustlang.rs:770-781 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 42 separate duplicated blocks between them, totalling at least 491 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:606\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba8af1a59f6bd1accaa4cd92095d9911ffacb0211b2d8289978e7db6bfeb576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): codegraph-kernel/src/swift.rs:425-435 | codegraph-kernel/src/tsjs/mod.rs:426-437 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/swift.rs\u0060 and \u0060codegraph-kernel/src/tsjs/mod.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 398 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/swift.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e82d8d269c46966036b98e6578b8765f608faad0a6f05aafc979c7a56ce61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 15): codegraph-kernel/src/ccpp/mod.rs:454-457 | codegraph-kernel/src/csharp.rs:170-180 | codegraph-kernel/src/dart.rs:249-258 | codegraph-kernel/src/go.rs:131-139 | codegraph-kernel/src/java.rs:170-179 | codegraph-kernel/src/kotlin.rs:255-263 | codegraph-kernel/src/lua.rs:114-118 | codegraph-kernel/src/php.rs:180-188 | codegraph-kernel/src/python.rs:180-188 | codegraph-kernel/src/rlang.rs:99-103 | codegraph-kernel/src/ruby.rs:159-167 | codegraph-kernel/src/rustlang.rs:160-168 | codegraph-kernel/src/scala.rs:195-204 | codegraph-kernel/src/swift.rs:259-267 | codegraph-kernel/src/tsjs/mod.rs:271-276 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:454\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/csharp.rs:180\u0060 calls \u0060bytes\u0060, \u0060filter\u0060, \u0060count\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:457\u0060 does not \u2014 after which the two agree again for 5 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4987d3088426766ee06ebc154ea1160cb063523c0df6a0cf824b037870407348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 11): codegraph-kernel/src/csharp.rs:1571-1580 | codegraph-kernel/src/dart.rs:2042-2048 | codegraph-kernel/src/java.rs:1304-1310 | codegraph-kernel/src/kotlin.rs:1753-1759 | codegraph-kernel/src/lua.rs:937-945 | codegraph-kernel/src/php.rs:1379-1384 | codegraph-kernel/src/python.rs:1002-1008 | codegraph-kernel/src/ruby.rs:1008-1018 | codegraph-kernel/src/rustlang.rs:1481-1487 | codegraph-kernel/src/scala.rs:1355-1361 | codegraph-kernel/src/swift.rs:1518-1524 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/python.rs:1010\u0060 calls \u0060contains\u0060 and \u0060codegraph-kernel/src/csharp.rs:1582\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38f9ec42820346125db4339a7f9c53a92ec0da90e9dccb3bfcdc2475ddb8ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): codegraph-kernel/src/csharp.rs:1050-1060 | codegraph-kernel/src/php.rs:681-691 | codegraph-kernel/src/ruby.rs:630-640 | codegraph-kernel/src/swift.rs:857-867 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1050\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 after the matched lines, \u0060codegraph-kernel/src/csharp.rs:1061\u0060 calls \u0060Some\u0060, \u0060is_async\u0060 and \u0060codegraph-kernel/src/php.rs:692\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad630710ac25c63d2ea46260c2eea2b411c7dc2ab8b250840ff463695dcb8de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): codegraph-kernel/src/csharp.rs:1529-1539 | codegraph-kernel/src/kotlin.rs:1711-1721 | codegraph-kernel/src/ruby.rs:971-981 | codegraph-kernel/src/swift.rs:1481-1491 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1529\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"df357ecbd4bf9753240258f617d546c3d5fe8d141a51b73eeda136c81da44f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1282-1292 | codegraph-kernel/src/ccpp/mod.rs:1319-1329 \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 \u0060codegraph-kernel/src/ccpp/mod.rs:1282\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, \u0060codegraph-kernel/src/ccpp/mod.rs:1318\u0060 calls \u0060extract_name\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:1280\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd9449dee6b7b4255dd4788b68dcbe5d0327c3aac317b09f28a400c83b919b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1399-1409 | codegraph-kernel/src/ccpp/mod.rs:1426-1436 \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 \u0060codegraph-kernel/src/ccpp/mod.rs:1399\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a06887286f877ea44fd39a2d2b1fd101629d528d1c80c9e42e6970026686c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/dart.rs:865-875 | codegraph-kernel/src/scala.rs:590-600 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:865\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6686f2ba19ed25b91d78051179b570777b3e36c8faec4985a0ad470d05289b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/dart.rs:1299-1309 | codegraph-kernel/src/dart.rs:1467-1477 \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 \u0060codegraph-kernel/src/dart.rs:1299\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c3b5b5662434bf007f066d05125a3e8c0864bd7111e79a83f695948718d247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/java.rs:641-651 | codegraph-kernel/src/swift.rs:893-903 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 60 separate duplicated blocks between them, totalling at least 714 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:641\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b457ae4b71ab16107abd0c8285239d273cbdeb9036b024137f890540318cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/java.rs:669-679 | codegraph-kernel/src/swift.rs:871-881 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 60 separate duplicated blocks between them, totalling at least 714 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:669\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3147251eb3c3095130afbf60b18c5680e33112ef09f3fde91fbf7f806f2a2f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/lua.rs:501-511 | codegraph-kernel/src/scala.rs:722-732 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 329 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"781370232f64d3d604a197d5fd1c85ac29d80377f227ce978c584c099578f63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/rustlang.rs:1418-1428 | codegraph-kernel/src/scala.rs:1277-1287 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/rustlang.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 382 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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b94c951ed36411d036e67091febf26e9fd55b5bebbb92879d4037a844437bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codegraph-kernel/src/tsjs/extractors.rs:1296-1306 | codegraph-kernel/src/tsjs/extractors.rs:1316-1326 \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 \u0060codegraph-kernel/src/tsjs/extractors.rs:1296\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e846302d797e57b75b4e3e288becad118934e1a1582dcffdd40a119f2b4072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 14): codegraph-kernel/src/csharp.rs:154-163 | codegraph-kernel/src/dart.rs:233-242 | codegraph-kernel/src/go.rs:114-123 | codegraph-kernel/src/java.rs:153-162 | codegraph-kernel/src/kotlin.rs:236-247 | codegraph-kernel/src/lua.rs:94-103 | codegraph-kernel/src/php.rs:164-173 | codegraph-kernel/src/python.rs:164-173 | codegraph-kernel/src/rlang.rs:84-93 | codegraph-kernel/src/ruby.rs:143-152 | codegraph-kernel/src/rustlang.rs:143-152 | codegraph-kernel/src/scala.rs:177-188 | codegraph-kernel/src/swift.rs:243-252 | codegraph-kernel/src/tsjs/mod.rs:235-254 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:154\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdf851db41ea1912c7aedc7d3585943d53bc53c0c56345a2cb5f2dcb9a087ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 11): codegraph-kernel/src/ccpp/mod.rs:531-538 | codegraph-kernel/src/csharp.rs:297-304 | codegraph-kernel/src/go.rs:214-221 | codegraph-kernel/src/java.rs:285-292 | codegraph-kernel/src/kotlin.rs:366-373 | codegraph-kernel/src/php.rs:297-304 | codegraph-kernel/src/python.rs:264-271 | codegraph-kernel/src/ruby.rs:256-263 | codegraph-kernel/src/rustlang.rs:244-251 | codegraph-kernel/src/swift.rs:382-389 | codegraph-kernel/src/tsjs/mod.rs:359-368 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:531\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"520eafd571f1b987d763697a1a0a028a779d160d654424d04cc7b4aa6ba45a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): codegraph-kernel/src/ccpp/mod.rs:623-634 | codegraph-kernel/src/go.rs:296-305 | codegraph-kernel/src/kotlin.rs:498-509 | codegraph-kernel/src/php.rs:384-396 | codegraph-kernel/src/python.rs:349-359 | codegraph-kernel/src/ruby.rs:343-353 | codegraph-kernel/src/rustlang.rs:333-343 | codegraph-kernel/src/swift.rs:475-486 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:623\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d2237018a83fc6d618eb17be3618df8622013bdf4716712aca8758c1ed4dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): codegraph-kernel/src/ccpp/mod.rs:1727-1736 | codegraph-kernel/src/go.rs:842-851 | codegraph-kernel/src/kotlin.rs:1265-1274 | codegraph-kernel/src/python.rs:721-730 | codegraph-kernel/src/rustlang.rs:908-917 | codegraph-kernel/src/scala.rs:894-903 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1727\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350bda4e887749d0ec1c4915425c005b9f2f420b94f74c64eb59e2fcf6efad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): codegraph-kernel/src/ccpp/mod.rs:1722-1731 | codegraph-kernel/src/python.rs:716-725 | codegraph-kernel/src/rustlang.rs:903-912 | codegraph-kernel/src/scala.rs:889-898 | codegraph-kernel/src/tsjs/extractors.rs:1650-1659 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 372 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1722\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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_call(\u0026mut\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33959f5a396e14415c71601baff07880d09e1c9e3a6820270c9a554ec2cfdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 5): codegraph-kernel/src/csharp.rs:779-788 | codegraph-kernel/src/kotlin.rs:1122-1129 | codegraph-kernel/src/php.rs:769-778 | codegraph-kernel/src/rustlang.rs:682-689 | codegraph-kernel/src/swift.rs:953-962 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff9384599e02ae459da38e119b61555f8af5e15cb45924df7906de144b60b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): codegraph-kernel/src/csharp.rs:1049-1058 | codegraph-kernel/src/java.rs:655-664 | codegraph-kernel/src/php.rs:680-689 | codegraph-kernel/src/ruby.rs:629-638 | codegraph-kernel/src/swift.rs:856-865 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1049\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 after the matched lines, \u0060codegraph-kernel/src/csharp.rs:1061\u0060 calls \u0060Some\u0060, \u0060is_async\u0060 and \u0060codegraph-kernel/src/php.rs:692\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"388824ed7ed09d277668f384c608a5208e73d68d8160b649619e80209666b891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): codegraph-kernel/src/csharp.rs:1278-1287 | codegraph-kernel/src/java.rs:1038-1047 | codegraph-kernel/src/kotlin.rs:1362-1371 | codegraph-kernel/src/php.rs:1161-1170 | codegraph-kernel/src/swift.rs:1208-1217 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1278\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/java.rs:1052\u0060 calls \u0060edge_kind_index\u0060, \u0060unwrap\u0060 and \u0060codegraph-kernel/src/csharp.rs:1294\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1bb96de823bea42dd4ef5136028fd6ffbd0167608d2815e9b001f3c2bdcd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): codegraph-kernel/src/csharp.rs:1528-1537 | codegraph-kernel/src/kotlin.rs:1710-1719 | codegraph-kernel/src/php.rs:1339-1348 | codegraph-kernel/src/ruby.rs:970-979 | codegraph-kernel/src/swift.rs:1480-1489 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1528\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29a06f505fcc7cccbd18d1f387dc540409ef9cd4fd152ae2aac6b24f177c797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): codegraph-kernel/src/csharp.rs:1426-1434 | codegraph-kernel/src/rustlang.rs:1377-1385 | codegraph-kernel/src/swift.rs:1371-1379 | codegraph-kernel/src/tsjs/fnref.rs:53-62 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 537 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1426\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7422c97fe0c73298b99b701732eae7ce9c1db8405dce12cb2eab91334485de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): codegraph-kernel/src/dart.rs:326-335 | codegraph-kernel/src/lua.rs:179-188 | codegraph-kernel/src/rlang.rs:163-172 | codegraph-kernel/src/scala.rs:274-283 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"06008f06742e7d9973b845d892971c61bd57c88a9060abe348c589a7b438e2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): codegraph-kernel/src/kotlin.rs:1271-1280 | codegraph-kernel/src/python.rs:727-736 | codegraph-kernel/src/swift.rs:1112-1121 | codegraph-kernel/src/tsjs/extractors.rs:1665-1674 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 488 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1271\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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_call(\u0026mut\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce11f4195b8ad922338d1e9627e57527fbc238151451ee3fee268e8abe482746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codegraph-kernel/src/ccpp/mod.rs:1812-1821 | codegraph-kernel/src/dart.rs:1185-1194 | codegraph-kernel/src/scala.rs:957-966 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab307a2808b96b1398d2af22adf9b869c7c49155509d21c43a194d2c0d9f15a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): codegraph-kernel/src/python.rs:302-310 | codegraph-kernel/src/swift.rs:429-437 | codegraph-kernel/src/tsjs/mod.rs:430-439 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 594 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/swift.rs:440\u0060 calls \u0060opt_str\u0060, \u0060as_deref\u0060 and \u0060codegraph-kernel/src/tsjs/mod.rs:442\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d81c5cc73326bd3ff81bf1a4d8b02cd371536412892512f29715d1dfa654450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1520-1529 | codegraph-kernel/src/go.rs:603-612 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1520\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bd4b1ed54aab4315abb459e4c431106626a77d68a86e6472cc3c0ed5813075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegraph-kernel/src/csharp.rs:1339-1348 | codegraph-kernel/src/csharp.rs:1358-1367 \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 \u0060codegraph-kernel/src/csharp.rs:1339\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6e01353a9eb87afa243f60837aff09549c9be891f5172a31292d4abd89b229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegraph-kernel/src/go.rs:261-270 | codegraph-kernel/src/python.rs:313-322 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 38 separate duplicated blocks between them, totalling at least 468 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:261\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, \u0060codegraph-kernel/src/go.rs:258\u0060 calls \u0060opt_str\u0060, \u0060as_deref\u0060 and \u0060codegraph-kernel/src/python.rs:310\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a34e7f672179aaa13859fb4f9796d2867150577bbd7c8f27a49f6aac064657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegraph-kernel/src/java.rs:1090-1099 | codegraph-kernel/src/tsjs/extractors.rs:2048-2057 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/java.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c3ffa27d698864a0c8eec3ba21a4c104b9d31df95411a44018cb4fc962a4ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:548-557 | codegraph-kernel/src/swift.rs:535-544 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 70 separate duplicated blocks between them, totalling at least 914 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:548\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b4c615ffc6732fadef4a9bc3f09cbb314449be34ec1037f93dc092e3c814b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): codegraph-kernel/src/ccpp/mod.rs:708-716 | codegraph-kernel/src/csharp.rs:503-511 | codegraph-kernel/src/go.rs:323-331 | codegraph-kernel/src/java.rs:489-497 | codegraph-kernel/src/kotlin.rs:534-542 | codegraph-kernel/src/php.rs:414-422 | codegraph-kernel/src/python.rs:377-385 | codegraph-kernel/src/ruby.rs:371-379 | codegraph-kernel/src/rustlang.rs:362-370 | codegraph-kernel/src/swift.rs:521-529 | codegraph-kernel/src/tsjs/mod.rs:1012-1020 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:708\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08f6b023798b86f0c121b8325e0b87be7ca7f801a43ecbf0cd1ab51332b3e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): codegraph-kernel/src/csharp.rs:164-172 | codegraph-kernel/src/dart.rs:243-251 | codegraph-kernel/src/lua.rs:105-113 | codegraph-kernel/src/php.rs:174-182 | codegraph-kernel/src/python.rs:174-182 | codegraph-kernel/src/ruby.rs:153-161 | codegraph-kernel/src/scala.rs:189-197 | codegraph-kernel/src/swift.rs:253-261 | codegraph-kernel/src/tsjs/mod.rs:256-264 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42c5447553c891c43f9044c573a22368ceaf322a7944ca8f11ca55dcd8482b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 8): codegraph-kernel/src/ccpp/mod.rs:1726-1731 | codegraph-kernel/src/go.rs:841-846 | codegraph-kernel/src/kotlin.rs:1264-1269 | codegraph-kernel/src/python.rs:720-725 | codegraph-kernel/src/rustlang.rs:907-912 | codegraph-kernel/src/scala.rs:893-898 | codegraph-kernel/src/swift.rs:1102-1110 | codegraph-kernel/src/tsjs/extractors.rs:1654-1660 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1726\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_call(\u0026mut\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"939fc420843a1e8099c5bf48fdf80457719eaaada9e32c12f38fbb505601ea2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): codegraph-kernel/src/csharp.rs:353-361 | codegraph-kernel/src/java.rs:342-350 | codegraph-kernel/src/kotlin.rs:463-471 | codegraph-kernel/src/php.rs:350-358 | codegraph-kernel/src/ruby.rs:309-317 | codegraph-kernel/src/rustlang.rs:298-306 | codegraph-kernel/src/swift.rs:441-449 | codegraph-kernel/src/tsjs/mod.rs:442-450 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:353\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, \u0060codegraph-kernel/src/csharp.rs:350\u0060 calls \u0060opt_str\u0060, \u0060as_deref\u0060 and \u0060codegraph-kernel/src/tsjs/mod.rs:439\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d343ac641d912411f2a2eaf0a28e1ea33558c08d7e40000525151c13bebd1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): codegraph-kernel/src/ccpp/mod.rs:2337-2345 | codegraph-kernel/src/csharp.rs:1427-1435 | codegraph-kernel/src/rustlang.rs:1378-1386 | codegraph-kernel/src/swift.rs:1372-1380 | codegraph-kernel/src/tsjs/fnref.rs:55-63 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2337\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08164ce143bf96dca62a3640d4f34781c4db5125e3ae1d643a77e8cea343960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): codegraph-kernel/src/csharp.rs:758-766 | codegraph-kernel/src/java.rs:682-690 | codegraph-kernel/src/kotlin.rs:1101-1109 | codegraph-kernel/src/php.rs:748-756 | codegraph-kernel/src/swift.rs:986-994 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71967751a6218d8b385a60f9353180088aeef5c2205742c6bf6fb52ba5eeacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 5): codegraph-kernel/src/csharp.rs:777-784 | codegraph-kernel/src/php.rs:767-774 | codegraph-kernel/src/rustlang.rs:680-687 | codegraph-kernel/src/swift.rs:929-937 | codegraph-kernel/src/swift.rs:951-958 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"191bc049993a3cda9be74c00b248d5f70313fdc29254dbb5da0ca14457ad6ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:433-441 | codegraph-kernel/src/go.rs:123-130 | codegraph-kernel/src/java.rs:162-169 | codegraph-kernel/src/rustlang.rs:152-159 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8babdff8e7addd5adc66658d711ca6c1f972918c69101047fb9d997e23f96540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 6): codegraph-kernel/src/go.rs:168-170 | codegraph-kernel/src/python.rs:211-218 | codegraph-kernel/src/ruby.rs:188-195 | codegraph-kernel/src/rustlang.rs:197-199 | codegraph-kernel/src/swift.rs:288-296 | codegraph-kernel/src/tsjs/mod.rs:296-303 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 38 separate duplicated blocks between them, totalling at least 468 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:211\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/python.rs:218\u0060 calls \u0060visit_node\u0060, \u0060root_node\u0060, \u0060flush_fn_ref_candidates\u0060 and \u0060codegraph-kernel/src/go.rs:170\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8330d83e207df5f2f93ada9e2a6fc7020a9db981d8de7c7978c0e2780dda12a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): codegraph-kernel/src/ccpp/mod.rs:2346-2354 | codegraph-kernel/src/java.rs:1228-1235 | codegraph-kernel/src/rustlang.rs:1387-1395 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 372 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2346\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c50f66b9a70bbe18f934a9289e8b08628ccd14cbdd0218ae542131d05318b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): codegraph-kernel/src/dart.rs:1198-1211 | codegraph-kernel/src/dart.rs:1624-1637 | codegraph-kernel/src/scala.rs:1096-1109 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1198\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d09c4ca3fb608f88efbe3c3ff20158c206ed450a9d9291225eb3684bc19d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): codegraph-kernel/src/dart.rs:1315-1323 | codegraph-kernel/src/dart.rs:1485-1491 \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 \u0060codegraph-kernel/src/dart.rs:1315\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"738be27d7f9d5e7e1f499e50bc36a832ebed2f03021bfb44704bf018e583e0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codegraph-kernel/src/dart.rs:2006-2014 | codegraph-kernel/src/lua.rs:901-909 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:2006\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ad612a0def2809d332919b65367bcf1e071c7195c083bd097692651c9828e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codegraph-kernel/src/go.rs:828-836 | codegraph-kernel/src/python.rs:704-712 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 38 separate duplicated blocks between them, totalling at least 468 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:828\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e9d14d0c72f6e54cb6d658c0f98c9846b31075d9a71eff532957fc0c70cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): codegraph-kernel/src/lua.rs:379-387 | codegraph-kernel/src/scala.rs:523-530 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 329 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:379\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, \u0060codegraph-kernel/src/scala.rs:521\u0060 calls \u0060extract_name\u0060, \u0060Some\u0060, \u0060child_by_field_name\u0060 and \u0060codegraph-kernel/src/lua.rs:378\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00c7c11697afc34aa1f8030c9e6b0243b7c0709da8c3c052eea97a5007deec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): codegraph-kernel/src/lua.rs:854-860 | codegraph-kernel/src/scala.rs:1269-1277 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 329 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:854\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b364a156c8401dfa51bed4311e1ad5203dc77e0178ed2d8aea2052d27ef8356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codegraph-kernel/src/python.rs:538-546 | codegraph-kernel/src/ruby.rs:677-685 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:538\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7d4268c12271116bc48c6bb5110dfae01652a2c3dc329eede9854734b9b265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): codegraph-kernel/src/python.rs:676-683 | codegraph-kernel/src/python.rs:689-697 \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 \u0060codegraph-kernel/src/python.rs:689\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdc385de832673b97db9067d2b7be575cc304c4b7b6dd8cc273215aeac821e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): codegraph-kernel/src/ccpp/mod.rs:627-634 | codegraph-kernel/src/csharp.rs:394-401 | codegraph-kernel/src/go.rs:298-305 | codegraph-kernel/src/java.rs:384-391 | codegraph-kernel/src/kotlin.rs:502-509 | codegraph-kernel/src/php.rs:389-396 | codegraph-kernel/src/python.rs:352-359 | codegraph-kernel/src/ruby.rs:346-353 | codegraph-kernel/src/rustlang.rs:336-343 | codegraph-kernel/src/swift.rs:479-486 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:627\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba17d0aaf0627901eddfb0865859003061419f9c21efa746b942009fccee446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): codegraph-kernel/src/csharp.rs:717-725 | codegraph-kernel/src/csharp.rs:767-774 | codegraph-kernel/src/java.rs:691-698 | codegraph-kernel/src/php.rs:738-745 | codegraph-kernel/src/php.rs:757-764 | codegraph-kernel/src/python.rs:567-574 | codegraph-kernel/src/ruby.rs:698-705 | codegraph-kernel/src/rustlang.rs:640-647 | codegraph-kernel/src/swift.rs:919-926 | codegraph-kernel/src/swift.rs:995-1002 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:717\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/csharp.rs:707\u0060 calls \u0060extract_primary_ctor_param_refs\u0060 and \u0060codegraph-kernel/src/csharp.rs:765\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"476a9119cdfdca9a31d08cfdb223be18e018d432cd3adc7dc02daff05af35d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): codegraph-kernel/src/dart.rs:277-284 | codegraph-kernel/src/lua.rs:136-143 | codegraph-kernel/src/python.rs:209-216 | codegraph-kernel/src/ruby.rs:186-193 | codegraph-kernel/src/scala.rs:223-230 | codegraph-kernel/src/swift.rs:286-293 | codegraph-kernel/src/tsjs/mod.rs:294-301 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:277\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/dart.rs:288\u0060 calls \u0060flush_value_refs\u0060, \u0060root_node\u0060 and \u0060codegraph-kernel/src/lua.rs:148\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd03c84448cd427eaa65d4e30da5fa289b758e1a859128be5b26cd2b1f3f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 8): codegraph-kernel/src/ccpp/mod.rs:587-594 | codegraph-kernel/src/csharp.rs:352-359 | codegraph-kernel/src/go.rs:259-260 | codegraph-kernel/src/java.rs:336-337 | codegraph-kernel/src/kotlin.rs:462-469 | codegraph-kernel/src/php.rs:349-356 | codegraph-kernel/src/rustlang.rs:297-304 | codegraph-kernel/src/swift.rs:440-447 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:587\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/ccpp/mod.rs:585\u0060 calls \u0060opt_str\u0060, \u0060as_deref\u0060 and \u0060codegraph-kernel/src/go.rs:257\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"34241b0f99ffdc1fba603d3fc0abd9ebc8d1d9e028e7d8927b681958f494e625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): codegraph-kernel/src/ccpp/mod.rs:2348-2355 | codegraph-kernel/src/go.rs:1163-1170 | codegraph-kernel/src/java.rs:1229-1236 | codegraph-kernel/src/python.rs:923-930 | codegraph-kernel/src/rustlang.rs:1389-1396 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e86160e6600f2030e5f0ff35fdfc22011634ddab8f202ca52da6f0194e1f282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/ccpp/mod.rs:408-415 | codegraph-kernel/src/lua.rs:89-96 | codegraph-kernel/src/tsjs/mod.rs:230-237 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"64953a5190a9f8e1a479e387dd686433bde95f722599744de2d56bee04a3a850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/csharp.rs:699-706 | codegraph-kernel/src/kotlin.rs:1076-1083 | codegraph-kernel/src/swift.rs:907-914 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/kotlin.rs:1075\u0060 calls \u0060resolve_body\u0060 and \u0060codegraph-kernel/src/csharp.rs:697\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59bee7fdbc960bfec367129cfe0b8ef39ff32df0d84fcefa3f79ab0e7810007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1133-1140 | codegraph-kernel/src/lua.rs:757-767 | codegraph-kernel/src/scala.rs:877-884 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 190 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65ced240f3ff4c606b1f4c21a9e86bdf6cd57a4f4b5e63efd7371c843485ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1239-1246 | codegraph-kernel/src/java.rs:1000-1007 | codegraph-kernel/src/php.rs:1115-1122 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1239\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"20547425ca78f55c3cdf02aa6c8918580e81fdffb94081888e12a566885f03d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/dart.rs:734-741 | codegraph-kernel/src/lua.rs:382-389 | codegraph-kernel/src/scala.rs:525-532 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/lua.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:734\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/lua.rs:379\u0060 calls \u0060text\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/dart.rs:732\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db2aef747a215d9213cd6346ab658b2945cce6bc7ebf2c1d063dfedc53fe0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): codegraph-kernel/src/java.rs:604-610 | codegraph-kernel/src/kotlin.rs:1080-1086 | codegraph-kernel/src/swift.rs:911-918 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:604\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09dd51d9a1bd71f12df3b0a0489de212d013441f45cea735bb56c292483884d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/rustlang.rs:1201-1208 | codegraph-kernel/src/swift.rs:1248-1255 | codegraph-kernel/src/tsjs/extractors.rs:2066-2073 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/rustlang.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 53 separate duplicated blocks between them, totalling at least 597 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/rustlang.rs:1201\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_type_annotations(\u0026mut\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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59fc4f9dc4209705b8a13996db4d68e09b183aed0de2afc1f6cde9e0e2ca81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1834-1840 | codegraph-kernel/src/tsjs/extractors.rs:1885-1892 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1834\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32db3da649e87f13c4b409e9b6faaf89d7981743812a4ad875b9d370cd3e242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/csharp.rs:736-743 | codegraph-kernel/src/swift.rs:932-939 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 856 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/csharp.rs:744\u0060 calls \u0060extract_primary_ctor_param_refs\u0060, \u0060Some\u0060 and \u0060codegraph-kernel/src/swift.rs:941\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"106541393dab6c4bc069b75970cdbc7b6c3e764f99ad9d4ff5d40fc9a957e260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/csharp.rs:747-754 | codegraph-kernel/src/swift.rs:941-948 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 856 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:747\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, \u0060codegraph-kernel/src/csharp.rs:744\u0060 calls \u0060extract_primary_ctor_param_refs\u0060, \u0060Some\u0060 and \u0060codegraph-kernel/src/swift.rs:939\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b924f3e53a257a0938c2732b52f82c98fb7ebaca618ad30ccd5f245c6ad9df97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/dart.rs:1001-1008 | codegraph-kernel/src/scala.rs:781-788 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1001\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"3025dd443361c8872171fd3d91ea9e50dd7dea4e82fa38ca3cd22e1b07290ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): codegraph-kernel/src/dart.rs:1950-1956 | codegraph-kernel/src/go.rs:1170-1177 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 341 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:1950\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7c5747c70ea9cb3f7d82a232486aa74f2273023b55a582e468dc54218a9fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/java.rs:635-642 | codegraph-kernel/src/java.rs:663-670 \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, \u0060codegraph-kernel/src/java.rs:634\u0060 calls \u0060extract_name\u0060 and \u0060codegraph-kernel/src/java.rs:662\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9561c877f5880d6d51cf918bd56e2d75955278ba0fd1849793f268d5449cdd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/java.rs:737-744 | codegraph-kernel/src/kotlin.rs:1166-1173 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:737\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a8cdb47c06e0e2e04b7870b01aca44107411c253ed1d295648563677882f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/php.rs:727-734 | codegraph-kernel/src/rustlang.rs:655-662 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/php.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 438 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53b58a99a9f26f905c74d3785a2931e71e6b829912a202037a712e883df22fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/python.rs:389-396 | codegraph-kernel/src/rustlang.rs:374-381 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 42 separate duplicated blocks between them, totalling at least 491 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/python.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4f38b7f33e4ffce06f309cf10bc381e50ac934fcffa98737a0eaecf4ca51df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): codegraph-kernel/src/ccpp/mod.rs:637-644 | codegraph-kernel/src/csharp.rs:404-411 | codegraph-kernel/src/dart.rs:441-448 | codegraph-kernel/src/go.rs:308-315 | codegraph-kernel/src/java.rs:394-401 | codegraph-kernel/src/kotlin.rs:512-519 | codegraph-kernel/src/php.rs:399-406 | codegraph-kernel/src/python.rs:362-369 | codegraph-kernel/src/ruby.rs:356-363 | codegraph-kernel/src/rustlang.rs:346-353 | codegraph-kernel/src/scala.rs:381-388 | codegraph-kernel/src/swift.rs:489-496 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:637\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fce971bf8afd3adc19eb7f90da211192765f6ce870f62745edae58a45d8870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12): codegraph-kernel/src/csharp.rs:1609-1615 | codegraph-kernel/src/dart.rs:2077-2083 | codegraph-kernel/src/go.rs:1336-1342 | codegraph-kernel/src/java.rs:1361-1367 | codegraph-kernel/src/kotlin.rs:1788-1794 | codegraph-kernel/src/php.rs:1420-1426 | codegraph-kernel/src/python.rs:1038-1044 | codegraph-kernel/src/ruby.rs:1047-1053 | codegraph-kernel/src/rustlang.rs:1516-1522 | codegraph-kernel/src/scala.rs:1390-1396 | codegraph-kernel/src/swift.rs:1553-1559 | codegraph-kernel/src/tsjs/mod.rs:512-518 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d7eec214eac4301c27ffda8010e0bb1d920ba1531e80697a6d77fdc1290271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 11): codegraph-kernel/src/csharp.rs:169-175 | codegraph-kernel/src/dart.rs:248-254 | codegraph-kernel/src/go.rs:130-136 | codegraph-kernel/src/java.rs:169-175 | codegraph-kernel/src/php.rs:179-185 | codegraph-kernel/src/python.rs:179-185 | codegraph-kernel/src/ruby.rs:158-164 | codegraph-kernel/src/rustlang.rs:159-165 | codegraph-kernel/src/scala.rs:194-200 | codegraph-kernel/src/swift.rs:258-264 | codegraph-kernel/src/tsjs/mod.rs:261-267 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/tsjs/mod.rs:270\u0060 calls \u0060is_generated_file\u0060, \u0060is_minified_content\u0060 and \u0060codegraph-kernel/src/csharp.rs:176\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86e3aaa06b928ba901139e8bed072dd69619727e58bb0fd2c6055ca9e39ecbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): codegraph-kernel/src/csharp.rs:1580-1586 | codegraph-kernel/src/dart.rs:2048-2054 | codegraph-kernel/src/java.rs:1310-1316 | codegraph-kernel/src/kotlin.rs:1759-1765 | codegraph-kernel/src/lua.rs:945-951 | codegraph-kernel/src/ruby.rs:1018-1024 | codegraph-kernel/src/rustlang.rs:1487-1493 | codegraph-kernel/src/scala.rs:1361-1367 | codegraph-kernel/src/swift.rs:1524-1530 | codegraph-kernel/src/tsjs/mod.rs:652-658 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a682baa1b428e3c562bd5c5eb62bbe92ad121ca5dd8c112091a7ff7d1f849e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 8): codegraph-kernel/src/ccpp/mod.rs:2352-2360 | codegraph-kernel/src/dart.rs:1947-1955 | codegraph-kernel/src/go.rs:1167-1175 | codegraph-kernel/src/java.rs:1233-1240 | codegraph-kernel/src/lua.rs:851-859 | codegraph-kernel/src/python.rs:927-935 | codegraph-kernel/src/rustlang.rs:1393-1401 | codegraph-kernel/src/scala.rs:1266-1274 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2352\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881993e2396d2404c1911eb943f7d63fca6535e5f923dd37823c5698c240f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): codegraph-kernel/src/go.rs:1111-1117 | codegraph-kernel/src/java.rs:1181-1187 | codegraph-kernel/src/rustlang.rs:1206-1212 | codegraph-kernel/src/swift.rs:1253-1259 | codegraph-kernel/src/tsjs/extractors.rs:2071-2077 | codegraph-kernel/src/tsjs/extractors.rs:2083-2089 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 428 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1111\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_type_annotations(\u0026mut\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cd482782b1713a3f30599142ab2c3ae2d9b047264ab3345887e94126d227c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:1833-1839 | codegraph-kernel/src/python.rs:878-884 | codegraph-kernel/src/tsjs/extractors.rs:1884-1891 | codegraph-kernel/src/tsjs/extractors.rs:1977-1983 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 30 separate duplicated blocks between them, totalling at least 372 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d4ca053da6b2b49fac45dea2a7825faf2e862b8d3cdb03afa2659236bb844d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): codegraph-kernel/src/csharp.rs:206-214 | codegraph-kernel/src/java.rs:210-216 | codegraph-kernel/src/kotlin.rs:290-297 | codegraph-kernel/src/php.rs:214-223 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:206\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, \u0060codegraph-kernel/src/kotlin.rs:289\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060codegraph-kernel/src/csharp.rs:205\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16a5cc88ee009bf2faf8f9f5a35bbc380d9c7bcfd760660634088a6447b6786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): codegraph-kernel/src/csharp.rs:697-704 | codegraph-kernel/src/php.rs:726-732 | codegraph-kernel/src/rustlang.rs:654-660 | codegraph-kernel/src/swift.rs:906-912 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a1dfb68d31bd9d57923ad7335c959e25a206bf8ed3283a2b39bd6adf60feb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): codegraph-kernel/src/csharp.rs:1023-1029 | codegraph-kernel/src/csharp.rs:1057-1063 | codegraph-kernel/src/swift.rs:864-870 | codegraph-kernel/src/swift.rs:886-892 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 856 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1023\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, \u0060codegraph-kernel/src/csharp.rs:1022\u0060 calls \u0060extract_name\u0060 and \u0060codegraph-kernel/src/csharp.rs:1056\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3e315e62a4e1df8bf447a8425354ee427e46837ac1c1ab0a2376cab739573b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): codegraph-kernel/src/dart.rs:1752-1758 | codegraph-kernel/src/dart.rs:1789-1795 | codegraph-kernel/src/scala.rs:507-513 | codegraph-kernel/src/scala.rs:1168-1174 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs: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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5acce08d50dadb567c2d3176598c02f3436697d5ae5a406fe7b0ebf3b733cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): codegraph-kernel/src/java.rs:226-232 | codegraph-kernel/src/kotlin.rs:307-313 | codegraph-kernel/src/php.rs:237-243 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:226\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e401050b64e559924f31d0a8e741fb61de5ba05cd0e145783fa665bbe0671067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/csharp.rs:819-825 | codegraph-kernel/src/tsjs/extractors.rs:550-556 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:819\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"009ba68381557d4253b871b1b0f83e4fdb6b918153b77e3a0642d60d9d8df7d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/dart.rs:706-713 | codegraph-kernel/src/dart.rs:726-733 \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 \u0060codegraph-kernel/src/dart.rs:706\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbc11cce918adf9ba528dc34ecf74b3236123faef5d8423cb0c32cf28c8af52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/dart.rs:992-999 | codegraph-kernel/src/scala.rs:770-776 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/scala.rs\u0060 as WHOLE FILES: this scan already matched 58 separate duplicated blocks between them, totalling at least 767 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:992\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/dart.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c23e971d6714fc913f42628057b31e822560e8f1136ac5965773b278a4b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1001-1007 | codegraph-kernel/src/kotlin.rs:1026-1032 \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 \u0060codegraph-kernel/src/kotlin.rs:1001\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"5621dfb2ca9a6d70151d1aea8d65191321321a64a1536ec4044dbffe587ae75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/php.rs:688-694 | codegraph-kernel/src/php.rs:708-714 \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":"codegraph-kernel/src/php.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e7d772f8ea0f9bc39eb3f44a76edf05c0e1d7d3f7f5dce0564702f6053591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/tsjs/extractors.rs:1144-1150 | codegraph-kernel/src/tsjs/extractors.rs:1291-1297 \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 \u0060codegraph-kernel/src/tsjs/extractors.rs:1144\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"352b208ebf1115a954a877100062c261a1776c8d9f868e5876964a04ddad9493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14): codegraph-kernel/src/ccpp/mod.rs:537-542 | codegraph-kernel/src/csharp.rs:303-308 | codegraph-kernel/src/dart.rs:341-346 | codegraph-kernel/src/go.rs:220-225 | codegraph-kernel/src/java.rs:291-296 | codegraph-kernel/src/kotlin.rs:372-377 | codegraph-kernel/src/lua.rs:194-199 | codegraph-kernel/src/php.rs:303-308 | codegraph-kernel/src/python.rs:270-275 | codegraph-kernel/src/ruby.rs:262-267 | codegraph-kernel/src/rustlang.rs:250-258 | codegraph-kernel/src/scala.rs:288-293 | codegraph-kernel/src/swift.rs:388-393 | codegraph-kernel/src/tsjs/mod.rs:367-372 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:537\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060codegraph-kernel/src/csharp.rs:310\u0060 calls \u0060push_ref_at\u0060, \u0060push_ref\u0060, \u0060line_of\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:544\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20b2d442f7e9648ed9adba6604d25889e1b0afe0b90b347446ce9caf4f44229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 13): codegraph-kernel/src/ccpp/mod.rs:636-641 | codegraph-kernel/src/csharp.rs:403-408 | codegraph-kernel/src/dart.rs:440-445 | codegraph-kernel/src/go.rs:307-312 | codegraph-kernel/src/java.rs:393-398 | codegraph-kernel/src/kotlin.rs:511-516 | codegraph-kernel/src/php.rs:398-403 | codegraph-kernel/src/python.rs:361-366 | codegraph-kernel/src/ruby.rs:355-360 | codegraph-kernel/src/rustlang.rs:345-350 | codegraph-kernel/src/scala.rs:380-385 | codegraph-kernel/src/swift.rs:488-493 | codegraph-kernel/src/tsjs/mod.rs:496-501 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:636\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06f04bbae7076cc17a26379589091ce7136865912dfb70611354b70565134ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 8): codegraph-kernel/src/csharp.rs:37-49 | codegraph-kernel/src/dart.rs:71-83 | codegraph-kernel/src/go.rs:1471-1483 | codegraph-kernel/src/java.rs:44-56 | codegraph-kernel/src/rustlang.rs:1760-1772 | codegraph-kernel/src/scala.rs:72-84 | codegraph-kernel/src/swift.rs:42-54 | codegraph-kernel/src/tsjs/mod.rs:121-133 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f27726aeff78fed9705805a9fe4b6d789bd4835d2c18e0b40edcbe150706b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): codegraph-kernel/src/csharp.rs:317-322 | codegraph-kernel/src/go.rs:228-233 | codegraph-kernel/src/java.rs:305-310 | codegraph-kernel/src/php.rs:317-322 | codegraph-kernel/src/python.rs:278-283 | codegraph-kernel/src/ruby.rs:276-281 | codegraph-kernel/src/rustlang.rs:261-266 | codegraph-kernel/src/swift.rs:402-407 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 423 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dbf38700903944c24bb06bf55fd5119e70b43bb5afede8eae03586c5625e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): codegraph-kernel/src/csharp.rs:779-784 | codegraph-kernel/src/kotlin.rs:1122-1127 | codegraph-kernel/src/php.rs:769-774 | codegraph-kernel/src/rustlang.rs:682-687 | codegraph-kernel/src/swift.rs:932-937 | codegraph-kernel/src/swift.rs:953-958 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5669ed2812c0342bd64df8d0174acfd6249bce6bae3e021592171b1cd3c794b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): codegraph-kernel/src/csharp.rs:717-722 | codegraph-kernel/src/java.rs:611-616 | codegraph-kernel/src/python.rs:567-572 | codegraph-kernel/src/ruby.rs:698-703 | codegraph-kernel/src/swift.rs:919-924 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/python.rs:564\u0060 calls \u0060extract_decorators_for\u0060 and \u0060codegraph-kernel/src/ruby.rs:693\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40d5784fb599b7b4af576c0181f3209c057e09dff572e276993fd71b2209ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): codegraph-kernel/src/java.rs:329-334 | codegraph-kernel/src/php.rs:341-346 | codegraph-kernel/src/python.rs:305-310 | codegraph-kernel/src/swift.rs:432-437 | codegraph-kernel/src/tsjs/mod.rs:433-439 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 608 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/python.rs:302\u0060 calls \u0060Some\u0060, \u0060set\u0060 and \u0060codegraph-kernel/src/java.rs:328\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7f5c735ca70e739e55b50239df0e1507ced46365c405c8aad292abefec8dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): codegraph-kernel/src/java.rs:936-942 | codegraph-kernel/src/kotlin.rs:1324-1330 | codegraph-kernel/src/php.rs:1060-1066 | codegraph-kernel/src/swift.rs:1167-1173 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:936\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2e3dcfb0189589dda13b90d83add513a9ef8a60414cfc2879c82f54cb6f393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1386-1391 | codegraph-kernel/src/ccpp/mod.rs:1413-1418 \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 \u0060codegraph-kernel/src/ccpp/mod.rs:1386\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fe1d6c0952b063922b32570c645106a906a26511db20dc5239a8179904dbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1619-1624 | codegraph-kernel/src/rustlang.rs:738-743 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1619\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c34b6b020c557ff42b836fb22ac8d099db491486434c0ed78e074a33a9d7e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/csharp.rs:344-349 | codegraph-kernel/src/rustlang.rs:288-293 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 537 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf24256dbd6844ad33e38429edca70e8ad57a7e2cba91d20567060c6f7333313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/csharp.rs:1106-1111 | codegraph-kernel/src/php.rs:972-977 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1106\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c916b062dc6685911319722cc7115c9b61e48ddc48a116468c72ad0594436448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/java.rs:1630-1635 | codegraph-kernel/src/tsjs/extractors.rs:651-656 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:1630\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f33edb2e10062ca52c047c67725062c59f496ae2d57abf128f70505ae76c89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1401-1406 | codegraph-kernel/src/kotlin.rs:1447-1452 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada3daee637827152e3b3e7f18b2a065882f8120265b0e545622bdde3b45dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/python.rs:499-504 | codegraph-kernel/src/python.rs:518-523 \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":"codegraph-kernel/src/python.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8d0b5b859be22290cd0b85664af278094979193b306057d57fd97c55429749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 13): codegraph-kernel/src/ccpp/mod.rs:2486-2490 | codegraph-kernel/src/csharp.rs:1588-1592 | codegraph-kernel/src/dart.rs:2056-2060 | codegraph-kernel/src/java.rs:1320-1324 | codegraph-kernel/src/kotlin.rs:1767-1771 | codegraph-kernel/src/lua.rs:953-957 | codegraph-kernel/src/php.rs:1399-1403 | codegraph-kernel/src/python.rs:1017-1021 | codegraph-kernel/src/ruby.rs:1026-1030 | codegraph-kernel/src/rustlang.rs:1495-1499 | codegraph-kernel/src/scala.rs:1369-1373 | codegraph-kernel/src/swift.rs:1532-1536 | codegraph-kernel/src/tsjs/mod.rs:663-667 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2486\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"455c194cfed71fe660f3f05a96c39aba1eb702e49e26fe8441d417eda4d6de87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): codegraph-kernel/src/csharp.rs:783-789 | codegraph-kernel/src/java.rs:707-711 | codegraph-kernel/src/kotlin.rs:1126-1130 | codegraph-kernel/src/php.rs:773-779 | codegraph-kernel/src/rustlang.rs:686-691 | codegraph-kernel/src/swift.rs:957-963 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:783\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7ce7e34d05b2259033210346902024d89d468b6b62b985cd63725fd8f6e9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 12): codegraph-kernel/src/ccpp/mod.rs:585-586 | codegraph-kernel/src/csharp.rs:350-351 | codegraph-kernel/src/dart.rs:385-386 | codegraph-kernel/src/go.rs:258-259 | codegraph-kernel/src/java.rs:335-336 | codegraph-kernel/src/kotlin.rs:456-460 | codegraph-kernel/src/lua.rs:229-234 | codegraph-kernel/src/php.rs:347-348 | codegraph-kernel/src/ruby.rs:297-302 | codegraph-kernel/src/rustlang.rs:294-295 | codegraph-kernel/src/scala.rs:320-325 | codegraph-kernel/src/swift.rs:438-439 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:456\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, \u0060codegraph-kernel/src/kotlin.rs:462\u0060 calls \u0060opt_str\u0060, \u0060as_deref\u0060 and \u0060codegraph-kernel/src/ccpp/mod.rs:588\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf42b5e9ccce96d3b3717604c54815228bb8ed24f125a807e18f49222662441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/csharp.rs:1377-1382 | codegraph-kernel/src/php.rs:1227-1231 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:1377\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78b08e92c3850a69df6006cf907cb5edd18261526dfdf48c9341ad58085580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:1009-1014 | codegraph-kernel/src/python.rs:504-508 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 488 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1009\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"205ad1e8415866d39ab2199190c9efd20b39b402f4dc58499ae04cc44c86bbf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/python.rs:796-800 | codegraph-kernel/src/tsjs/extractors.rs:1849-1853 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:796\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd89c967bd2fe83883691cc54f7154f068ee0f8a00017e6d0ce335ff4c71fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13): codegraph-kernel/src/ccpp/mod.rs:199-205 | codegraph-kernel/src/csharp.rs:52-58 | codegraph-kernel/src/dart.rs:61-67 | codegraph-kernel/src/go.rs:1445-1451 | codegraph-kernel/src/kotlin.rs:41-47 | codegraph-kernel/src/lua.rs:38-44 | codegraph-kernel/src/php.rs:36-42 | codegraph-kernel/src/python.rs:1143-1149 | codegraph-kernel/src/ruby.rs:34-40 | codegraph-kernel/src/rustlang.rs:1628-1634 | codegraph-kernel/src/scala.rs:45-51 | codegraph-kernel/src/swift.rs:57-63 | codegraph-kernel/src/tsjs/fnref.rs:26-32 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"89175c8754c4fc1d4c70a66ffd2841169a01523788c2e6291e4722f1224ef477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:517-522 | codegraph-kernel/src/rustlang.rs:230-235 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693b6861716913e532a32319383ff5c9f474a4f81ea02f745520d3846221c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): codegraph-kernel/src/ccpp/mod.rs:1463-1468 | codegraph-kernel/src/csharp.rs:801-809 | codegraph-kernel/src/dart.rs:1047-1052 | codegraph-kernel/src/php.rs:791-798 | codegraph-kernel/src/swift.rs:975-983 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f464d6c7176bcb2a5a80f56a65f069864b3fc3ad172d77a3eef78da45d4ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codegraph-kernel/src/csharp.rs:86-93 | codegraph-kernel/src/kotlin.rs:78-85 | codegraph-kernel/src/swift.rs:101-108 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 51 separate duplicated blocks between them, totalling at least 627 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dd0f1acb8faf99be0ec4b0fdd6aea6fb799381a7f10cf7efe3e24420b127cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): codegraph-kernel/src/csharp.rs:283-288 | codegraph-kernel/src/dart.rs:318-323 | codegraph-kernel/src/go.rs:200-205 | codegraph-kernel/src/php.rs:283-288 | codegraph-kernel/src/python.rs:250-255 | codegraph-kernel/src/ruby.rs:242-247 | codegraph-kernel/src/scala.rs:266-271 | codegraph-kernel/src/swift.rs:368-373 | codegraph-kernel/src/tsjs/mod.rs:345-350 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd20805c27a57d2500fd75058b0e9973a645e0ccf272924e5dc4cf2ddbc3986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codegraph-kernel/src/csharp.rs:1729-1738 | codegraph-kernel/src/java.rs:1724-1733 | codegraph-kernel/src/php.rs:1498-1507 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba0a5f63093a92f2f1e503f5cee4d29e6d01bdc2a9b20d52c3f8cc27658e827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/java.rs:271-276 | codegraph-kernel/src/kotlin.rs:352-357 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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":"codegraph-kernel/src/java.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb7b6f9fafdc4d7a8f85a4c924cb6760374ddffdc0fa3f469ac7ee9289f27f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:2437-2451 | codegraph-kernel/src/php.rs:1354-1371 | codegraph-kernel/src/ruby.rs:984-1000 | codegraph-kernel/src/swift.rs:1494-1510 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 364 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2437\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8a0878ac79b0e923078741159fc3c453986c74d216dd90531bd39c96fca3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/python.rs:441-452 | codegraph-kernel/src/swift.rs:688-704 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 48 separate duplicated blocks between them, totalling at least 594 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:441\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a94b7244aebf440c6f5c6c8b740926071dc38ee7dd7cf58ad075483560c998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:844-858 | codegraph-kernel/src/ruby.rs:487-503 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 522 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:844\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8998465533ccb60fc66f99401df7830e030c64e81bc9357f2aa046ef8afd8d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1248-1262 | codegraph-kernel/src/go.rs:444-455 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/go.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 476 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1248\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa14dede8e452b95aaec62ee74cb6d0fa9d29f63fc72d75be429912492d8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codegraph-kernel/src/go.rs:433-442 | codegraph-kernel/src/rustlang.rs:501-514 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 668 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:433\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8a248057cd954f9fa37371809efb5ca3a35de19b8f72b9d91a31a75e64c50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codegraph-kernel/src/python.rs:472-485 | codegraph-kernel/src/ruby.rs:583-596 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:472\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a4d285da15152fcc8f1992a3759d533daf0438a227ce49ed9f63c72688fd34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): codegraph-kernel/src/kotlin.rs:847-858 | codegraph-kernel/src/python.rs:417-429 | codegraph-kernel/src/ruby.rs:490-503 | codegraph-kernel/src/swift.rs:637-648 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/python.rs\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 488 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:847\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f9f748ef2b2feb7de42e436498f8c9f1a68caf79e190720ea54ff96a976fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): codegraph-kernel/src/kotlin.rs:1645-1657 | codegraph-kernel/src/php.rs:1266-1276 | codegraph-kernel/src/ruby.rs:918-928 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/kotlin.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 510 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/kotlin.rs:1645\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a2d3a5cba98f847566fa9c14e6777a37061f05b5cf958112541f4a269c4f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codegraph-kernel/src/csharp.rs:649-660 | codegraph-kernel/src/java.rs:563-574 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dfbb4233dbaf5e30cf82c05fc4bddbe8cf0d8fb3f106969f4c3ab223bd8f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/csharp.rs:1034-1044 | codegraph-kernel/src/csharp.rs:1066-1072 \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 \u0060codegraph-kernel/src/csharp.rs:1034\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c282752d265de3d0b7d8ef165e2b8f10693bdbbca9248c291f5d0321c2382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/lua.rs:480-489 | codegraph-kernel/src/rlang.rs:309-316 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/lua.rs\u0060 and \u0060codegraph-kernel/src/rlang.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/lua.rs:480\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a471c1cb8071602903b9abe41566a0c6e22ae5475569dc947afa1f3e16a0b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/csharp.rs:602-610 | codegraph-kernel/src/java.rs:524-529 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:602\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fcb34d7e9111281ad5ffaea1d25d751f97b520ad8ec956141d9b878c47b33c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codegraph-kernel/src/tsjs/extractors.rs:66-74 | codegraph-kernel/src/tsjs/extractors.rs:458-466 \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 \u0060codegraph-kernel/src/tsjs/extractors.rs:66\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn extract_function(\u0026mut\u0060 in one and \u0060super) fn extract_method(\u0026mut\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6fe09a54a57a370c0001d37447f194672c3ac04468a5cefd7b5330e0bae988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/lua.rs:518-525 | codegraph-kernel/src/lua.rs:547-555 \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 \u0060codegraph-kernel/src/lua.rs:518\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d588bb6997d179b118d0ab2a594e4b94b725dd36878059076cf9f9797969b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): codegraph-kernel/src/ccpp/mod.rs:1451-1459 | codegraph-kernel/src/csharp.rs:791-799 | codegraph-kernel/src/php.rs:781-789 | codegraph-kernel/src/swift.rs:965-973 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/csharp.rs\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 369 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1451\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce2418c8a47b1e8e6817f2c3e60ee5ae99efa5071150d11ffdc68af4b7f358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/php.rs:963-971 | codegraph-kernel/src/ruby.rs:738-743 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/php.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 43 separate duplicated blocks between them, totalling at least 507 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/php.rs:963\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":"codegraph-kernel/src/php.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eda635d6bd973ed7723cc6b3a34a0f4baa673b07f4ff7f13ad5b01b97b45da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/dart.rs:2102-2108 | codegraph-kernel/src/kotlin.rs:1839-1846 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/dart.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 344 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/dart.rs:2102\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c87544cfaca0e92837e55b0aadb84e3b9e5db1a177e970e62e0fa8aa49515a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): codegraph-kernel/src/go.rs:1109-1114 | codegraph-kernel/src/java.rs:1179-1184 | codegraph-kernel/src/rustlang.rs:1204-1209 | codegraph-kernel/src/swift.rs:757-764 | codegraph-kernel/src/swift.rs:1251-1256 | codegraph-kernel/src/tsjs/extractors.rs:2069-2074 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 428 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:1109\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_type_annotations(\u0026mut\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"597333e1fe0fcb3ddf68c8b6faa93b205c8f641302d1d3f5f0c81e16dd418729"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/php.rs:696-703 | codegraph-kernel/src/php.rs:716-723 \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 \u0060codegraph-kernel/src/php.rs:696\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/php.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a24360fd58f8c8b1a242045cfa959fdb139ca54e4f1617a880dd0796fa337f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/tsjs/extractors.rs:479-485 | codegraph-kernel/src/tsjs/extractors.rs:502-508 \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 \u0060codegraph-kernel/src/tsjs/extractors.rs:479\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn extract_interface(\u0026mut\u0060 in one and \u0060super) fn extract_enum(\u0026mut\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/tsjs/extractors.rs:501\u0060 calls \u0060visibility_of\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs:478\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d8fdf04bba4b27d7d8be843c88949de01b6e02278baab206bf130f0f7f6d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/csharp.rs:423-429 | codegraph-kernel/src/php.rs:429-435 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 66 separate duplicated blocks between them, totalling at least 752 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:423\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d48060fe8908ebb1ea9c6b8fa50cb3eba816b72e1bd4466986411d7d51e9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/python.rs:742-748 | codegraph-kernel/src/tsjs/extractors.rs:1697-1703 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/python.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/python.rs:742\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_call(\u0026mut\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":"codegraph-kernel/src/python.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a34b668f517dbd2afc8d65e077c80954c76d1c80797d7c21832f27ef353bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/go.rs:867-873 | codegraph-kernel/src/rustlang.rs:941-947 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 668 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:867\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6a321cfe3c86b6e726498e2669436a5bf508a3c885906009e3c999ec58395b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/dart.rs:1652-1658 | codegraph-kernel/src/dart.rs:1684-1688 \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 \u0060codegraph-kernel/src/dart.rs:1652\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8180994bcaf07d154cbc1e89252a2e05a9bdfc1c1b00754d07dcbe715b7f944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codegraph-kernel/src/python.rs:507-513 | codegraph-kernel/src/python.rs:525-531 \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 \u0060codegraph-kernel/src/python.rs:507\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/python.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8472785223880aa48a752c566ef9b6dc7001680b0d6b36851f0980576d0cfdb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/ruby.rs:645-651 | codegraph-kernel/src/ruby.rs:663-668 \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 \u0060codegraph-kernel/src/ruby.rs:645\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97b9cda3675fa32c7460f73972859e5d9fdc3b2e841e9059d8a6b3e1d0b0f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): codegraph-kernel/src/java.rs:217-222 | codegraph-kernel/src/kotlin.rs:298-303 | codegraph-kernel/src/kotlin.rs:1381-1386 | codegraph-kernel/src/php.rs:224-229 | codegraph-kernel/src/swift.rs:1225-1230 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codegraph-kernel/src/swift.rs:1232\u0060 calls \u0060Some\u0060 and \u0060codegraph-kernel/src/kotlin.rs:1388\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"df891d5339fdf0f84c7f313376d43322ebaccbf039e001c0626fb7910136571e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): codegraph-kernel/src/csharp.rs:760-765 | codegraph-kernel/src/java.rs:684-689 | codegraph-kernel/src/kotlin.rs:1103-1108 | codegraph-kernel/src/php.rs:750-755 | codegraph-kernel/src/rustlang.rs:632-637 | codegraph-kernel/src/swift.rs:988-993 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410ac512884a06d3196090dd7f31ec85aa177f83c8bbf26429bb3804f890467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): codegraph-kernel/src/csharp.rs:957-961 | codegraph-kernel/src/java.rs:815-819 | codegraph-kernel/src/ruby.rs:418-423 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/java.rs\u0060 as WHOLE FILES: this scan already matched 62 separate duplicated blocks between them, totalling at least 791 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/csharp.rs:957\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ee7a3cec931e5b1ba4d366e6b9b6cf46868e8ccfcdc3a493d7677d8d720dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:2155-2160 | codegraph-kernel/src/rustlang.rs:1125-1130 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/rustlang.rs\u0060 as WHOLE FILES: this scan already matched 44 separate duplicated blocks between them, totalling at least 545 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:2155\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba42e71ca30b4b9f70ec42ed3aadc654436cd0b8989bb747369fba4ee61c6e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): codegraph-kernel/src/csharp.rs:1581-1586 | codegraph-kernel/src/dart.rs:2049-2054 | codegraph-kernel/src/java.rs:1311-1316 | codegraph-kernel/src/kotlin.rs:1760-1765 | codegraph-kernel/src/lua.rs:946-951 | codegraph-kernel/src/python.rs:1010-1015 | codegraph-kernel/src/ruby.rs:1019-1024 | codegraph-kernel/src/rustlang.rs:1488-1493 | codegraph-kernel/src/scala.rs:1362-1367 | codegraph-kernel/src/swift.rs:1525-1530 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/csharp.rs\u0060 and \u0060codegraph-kernel/src/dart.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 432 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codegraph-kernel/src/python.rs:1009\u0060 calls \u0060contains\u0060 and \u0060codegraph-kernel/src/csharp.rs:1580\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e1c1b45230f13ee19620ea3ab1c6193d2cb2ca9f2734091d37e0e9670850e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/ccpp/mod.rs:1684-1688 | codegraph-kernel/src/tsjs/extractors.rs:1098-1103 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/ccpp/mod.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/ccpp/mod.rs:1684\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4837a035d6c784c48f55972c0fa3a38173379d3022f4e41fca162838fb0f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codegraph-kernel/src/ruby.rs:637-642 | codegraph-kernel/src/ruby.rs:656-661 \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":"codegraph-kernel/src/ruby.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde17d9e13558433315efadb4a826bc4136d8bc6278fb55837f32a251ce7361a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/php.rs:1180-1184 | codegraph-kernel/src/ruby.rs:687-692 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/php.rs\u0060 and \u0060codegraph-kernel/src/ruby.rs\u0060 as WHOLE FILES: this scan already matched 43 separate duplicated blocks between them, totalling at least 507 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/php.rs:1180\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":"codegraph-kernel/src/php.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bac22c64144db5d0188976bab1b4f79811b603f10ee23375000bd182b3621fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/kotlin.rs:681-685 | codegraph-kernel/src/kotlin.rs:686-690 \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 \u0060codegraph-kernel/src/kotlin.rs:681\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796cdb1abe1612eff35524ad1299a1949fe9bfe1732cf4be5c01ec7ed592b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/java.rs:1051-1055 | codegraph-kernel/src/tsjs/extractors.rs:1994-1998 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/tsjs/extractors.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:1051\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b2918f25f764ecf4842c29e719007dc39709ede623c75d2947bd48be94334b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/php.rs:940-944 | codegraph-kernel/src/swift.rs:1601-1605 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/php.rs\u0060 and \u0060codegraph-kernel/src/swift.rs\u0060 as WHOLE FILES: this scan already matched 61 separate duplicated blocks between them, totalling at least 687 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/php.rs:940\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":"codegraph-kernel/src/php.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"086a0b2c39ead37453b7298db84bb57d0545ed8fadf9d5e9de8d2e037e443774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/php.rs:490-494 | codegraph-kernel/src/php.rs:830-834 \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 \u0060codegraph-kernel/src/php.rs:490\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":"codegraph-kernel/src/php.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47f456e410d5724ac38ea8539cf9c50e80634f6cacbb80e252a5cb0e02623a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/go.rs:805-809 | codegraph-kernel/src/php.rs:1198-1202 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/go.rs\u0060 and \u0060codegraph-kernel/src/php.rs\u0060 as WHOLE FILES: this scan already matched 33 separate duplicated blocks between them, totalling at least 399 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/go.rs:805\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"81abc719ad5e0f84af3a05fdb5c3a93755fd55e8e91a2101b2d477b9783d03d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/tsjs/extractors.rs:477-481 | codegraph-kernel/src/tsjs/extractors.rs:1387-1391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn extract_interface(\u0026mut\u0060 in one and \u0060super) fn extract_type_alias(\u0026mut\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f895125e027e7bf72c7091be9533e8f7aa7101e338ece94e55fbcc28b243055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codegraph-kernel/src/dart.rs:1252-1259 | codegraph-kernel/src/dart.rs:1267-1274 \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 \u0060codegraph-kernel/src/dart.rs:1252\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e725aa7f77f9df366c6813f0e771a627a084ad0aad8a7e53fec249b03a827c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/java.rs:1057-1061 | codegraph-kernel/src/java.rs:1070-1074 \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 \u0060codegraph-kernel/src/java.rs:1057\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57508f6d2ad74f642b7a71d0194bccd1d4388aa96f4fe2be19d2d12219cda5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): codegraph-kernel/src/java.rs:1104-1108 | codegraph-kernel/src/kotlin.rs:1518-1522 | codegraph-kernel/src/swift.rs:1281-1285 | codegraph-kernel/src/tsjs/extractors.rs:1903-1907 \u2014 before extracting anything, compare \u0060codegraph-kernel/src/java.rs\u0060 and \u0060codegraph-kernel/src/kotlin.rs\u0060 as WHOLE FILES: this scan already matched 52 separate duplicated blocks between them, totalling at least 641 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060codegraph-kernel/src/java.rs:1104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn extract_decorators_for(\u0026mut\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8fd6c71245d75ee9c1f2dfe925f0eacdb51d90af9ccaeaaf885247f43e588e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codegraph-kernel/src/tsjs/mod.rs:1114-1118 | codegraph-kernel/src/tsjs/mod.rs:1140-1144 \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 \u0060codegraph-kernel/src/tsjs/mod.rs:1114\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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef56761b41da6daf8c6707f3d5e0a7ae9e7ca870e4b39bd480367d468958077a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AntigravityTarget (LCOM4 5): AntigravityTarget\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/antigravity.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8ed1ec295fb51c6e3d269f4c451bd9a542581278060eb19ad389b2c0d43e69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CopilotCliTarget (LCOM4 5): CopilotCliTarget\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/copilot-cli.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ace7b0f679082924bd6b72b35393d6635bd0ebf0a9b63e6099663911a5fd3e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CopilotJetbrainsTarget (LCOM4 5): CopilotJetbrainsTarget\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/copilot-jetbrains.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b7f2832f38564d3b5d8d770749b4f4a9e3762ebdcab8a8cea12835cfd24968"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClaudeCodeTarget (LCOM4 4): ClaudeCodeTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/claude.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4f20c8316a93823c87f78a974550db23db91f1326d9dc668c86f105e1c4998"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CursorTarget (LCOM4 4): CursorTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/cursor.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"186008f065c74b68fb089e01ca90d9737c7516722bc1ea7ced20f5b752b17f6f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CodexTarget (LCOM4 4): CodexTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/codex.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fd674325db0ed2a91d4d4617cd791e4c9de1b1615b28196e7318327c01ca26"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OpencodeTarget (LCOM4 4): OpencodeTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/opencode.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3013dcd79f975d4fdd189ee6f8a3553587adca0c183552efeafd75c92eb451c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HermesTarget (LCOM4 4): HermesTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/hermes.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61ac668aedf731553b2cb5d7a4cb69b08a8c5b44d2326e032138367275cd677"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GeminiTarget (LCOM4 4): GeminiTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/gemini.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2b5edd952d1c42b8f1c797a6925d14dbf43630dee99027c340bc1e2f4296f8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: KiroTarget (LCOM4 4): KiroTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/kiro.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc671bb5b1d936650cf27e4b192e248f55e3cabceef01d406e03c7b2ba755d4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WindsurfTarget (LCOM4 4): WindsurfTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/windsurf.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcf3c400993bae494dcb01f12a96c826ac3a5bd15db7e5f24a7af939681d276"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DshTarget (LCOM4 4): DshTarget\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/dsh.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93c541a468d5373bf86a738ff2bb194c116fba6065b8b1b37163595f638b30c"}},{"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 repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. 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: closes every stream when the API is closed: 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__/ui-events-api.test.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b29b97d6ccc11734bc6496871e89fdad9b45989c75c0dce1f93e0d6e1cd5157"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: terminates a worker that is already loaded right away: This test starts work it did not wait for (\u0060pool\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(20)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/parse-pool.test.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae9582dc25469d1f30d090ed41bf079213c7c2e3e5a318b9f29cbcca2daefa9"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: runs N concurrent calls in parallel (not serialized): This test starts work it did not wait for (\u0060calls\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(40)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/query-pool.test.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"591ab73b6f18a124b0112f6f8ca6f2fd8ef090fdfc72e3144e9683dc9fae8e37"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: recycles an idle burst back to one fresh worker: This test starts work it did not wait for (\u0060calls\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(40)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/query-pool.test.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"23352e6770bad990c6d09641962b0bb5cfae84038e41f89cd6f757a89d281148"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: recycles even when a burst worker reports ready after the last result: This test starts work it did not wait for (\u0060calls\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(40)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/query-pool.test.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c828f9f6ccd6003943a2080dc73d037df0ffeff1d1c44f3b6511015754ed258"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: leaves a heavy worker alone when a call has reached it since the trim: This test starts work it did not wait for (\u0060call\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/query-pool.test.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eb2ae00f7fce224fd2b0da3b93a6b5ce771b70735d5859a6212c6880eef8a4"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: destroy settles outstanding calls instead of hanging: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(5)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/query-pool.test.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c65c5e2be310792f5b41f2fb91cfd58e71a59accd9c0aba5879c9ec9a7e7a5"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: answers callers at once, then waits for the worker to start: This test starts work it did not wait for (\u0060down\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(50)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/query-pool.test.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f651d1ff24cd564e68521eed1af481f76e21f030e0ac2690aef854d6936f15"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: waits for the first message: This test starts work it did not wait for (\u0060ending\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(30)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/worker-teardown.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c46cc8a8f86d8927d474d22855f014cc31d2e1819970c3a7bb51f167bef66ec"}},{"ruleId":"D13","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":"6ccf14b230bab91afcae140b102421c6f56978e463b7d0c6fb4cbfbd21929300"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"ca0fee23b6caf68ebf7aa4247c83ef5a8b153e8c9cd6319a33dad8d4ea522e6f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/name-matcher.ts: src/resolution/name-matcher.ts changed 350 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 454 in name-matcher.matchMethodCall at line 24215. 337 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/name-matcher.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":"src/resolution/name-matcher.ts"},"region":{"startLine":24215}}}],"partialFingerprints":{"codehealthFindingId/v1":"78833f0cefe1e0b48a7c1d47fd8f82a273a925b143e3d24aa8e6b9f409b8737b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/tools.ts: src/mcp/tools.ts changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 656 in ToolHandler.handleExplore at line 4409. 70 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/tools.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":"src/mcp/tools.ts"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef9ee5e6384c75666eafc58c1a056e1924a7ab2c63171a504b6ee07cbc0f09e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/tree-sitter.ts: src/extraction/tree-sitter.ts changed 114 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 338 in TreeSitterExtractor.extractCall at line 5370. 110 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/tree-sitter.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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6cfd6036f09d49919949dc574548bc74a0b8b58ef5fc8aadbefb5ee3c38a52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/codegraph.ts: src/bin/codegraph.ts changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 505 in codegraph.main at line 160. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/bin/codegraph.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":"src/bin/codegraph.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cffa15cc479d28df7331a100556cb19ab037b46082f0d63ffbef82f1929ca9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/index.ts: src/resolution/index.ts changed 134 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 150 in ReferenceResolver.resolveOneInner at line 1654. 125 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/index.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":"src/resolution/index.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6f1eb788d50112a0ba0dd77e0dd1f0da8c8a1deae63e20a7ca0cfa67a1defd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/index.ts: src/index.ts changed 85 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 133 in CodeGraph.sync at line 1110. 64 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/index.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":"src/index.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3426ef97a02ad8f361cb84b26afcffc732082735214f3425782e6077246cbfbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/import-resolver.ts: src/resolution/import-resolver.ts changed 85 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in import-resolver.resolveViaImport at line 3178. 81 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/import-resolver.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":"src/resolution/import-resolver.ts"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb7513522d52d0d9b7242a4233312b8bb61dc12c34543181252b3caefaaa82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/callback-synthesizer.ts: src/resolution/callback-synthesizer.ts changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in callback-synthesizer.goImplementsEdges at line 1132. 40 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/callback-synthesizer.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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2010e6e045b5e07bb7a0b33fc9d0b91a5db2a4d6e5ca6efec819a49cca49a529"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/index.ts: src/extraction/index.ts changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in ExtractionOrchestrator.indexAll at line 2430. 47 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/index.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":"src/extraction/index.ts"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8c86f25361b773670b4c82bb6ec403f46e8817273e5f71a510c8c9c076c685"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/steps.ts: src/ui-server/api/steps.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 202 in steps.buildSteps at line 432. 5 of those changes were fix/bug commits, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/steps.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":"src/ui-server/api/steps.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0338b1da17d6be2724e37da8ee196fda6eb6667f00ee5fb373634cb91bb6ffb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/context/index.ts: src/context/index.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 183 in ContextBuilder.findRelevantContext at line 498. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/context/index.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":"src/context/index.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"897ed5b39031aad1637a998a74f28be032dc31c441b517c95ba4abba132f7f39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/db/queries.ts: src/db/queries.ts changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in QueryBuilder.searchNodes at line 1875. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/db/queries.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":"src/db/queries.ts"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"30728920a02c1c6de4c6c5bff1e21b0416f33bd66702037c4a89dcbcd06e6711"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/react.ts: src/resolution/frameworks/react.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in react.scanRoutes.unit at line 1146. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/react.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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3d4893638e6dcd72cf86f71d8a72d1f2c28f3b378eb9b0dd7bd3bf630125fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/c-fnptr-synthesizer.ts: src/resolution/c-fnptr-synthesizer.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 310 in c-fnptr-synthesizer.cFnPointerDispatchEdges 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/c-fnptr-synthesizer.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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed83b50877bf89da8d9428fa561fc4b43139cf277f5cc7742f15a147f504bbe5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/tsjs/extractors.rs: codegraph-kernel/src/tsjs/extractors.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Walker::extract_variable at line 644. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/tsjs/extractors.rs\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":"codegraph-kernel/src/tsjs/extractors.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"089d58ee9e21fc56968d8095f525ac410e168822343399173c32bbc7aec5a0bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/agent-eval/parse-run.mjs: scripts/agent-eval/parse-run.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in parse-run.parseSession at line 102. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- scripts/agent-eval/parse-run.mjs\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/agent-eval/parse-run.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"291a7374fbaa9488590c5aaab288bcdb79cf73e02711ce6537a28add69e85979"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/languages/c-cpp.ts: src/extraction/languages/c-cpp.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in c-cpp.blankCStatementMacroCalls at line 2131. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/c-cpp.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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7af370a8e8c089107e75460cb92d46e7e78c855a6a73cd208f5d4dd351ae82b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/proxy.ts: src/mcp/proxy.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in proxy.runLocalHandshakeProxy 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/proxy.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":"src/mcp/proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ab497ec3dadda22459efd6295df73bac4477c160cba476bb55a874a0aa8755"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/tsjs/mod.rs: codegraph-kernel/src/tsjs/mod.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Walker::visit_node at line 681. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/tsjs/mod.rs\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":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac6690f8f748c7ee133d942fddb1d4d42b0b71d494bd85d60905160aa9365c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/ccpp/mod.rs: codegraph-kernel/src/ccpp/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Walker::dispatch_node at line 1138. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/ccpp/mod.rs\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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a3b7aaf2e1086ed14f59d910a417d08d1f7a78cff5ba850c1902a2a25aa551"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/lib/steps-model.ts: ui/src/lib/steps-model.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in steps-model.packRegions at line 710. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- ui/src/lib/steps-model.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":"ui/src/lib/steps-model.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b31dee41fb618aae3090a7fbfe2f9b3d7d2ecd60291031fbdee8b42d233fedb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/graph/branch-guards.ts: src/graph/branch-guards.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in branch-guards.triggerInTree at line 835. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/graph/branch-guards.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":"src/graph/branch-guards.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e145dc0262c9ab7bde5120b26b5c9a67eff77ea136ad6b5582123ff5d60eae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/screens.ts: src/ui-server/api/screens.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in screens.buildScreens at line 227. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/screens.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":"src/ui-server/api/screens.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"936974d0bbf3a8cbb2d948e2f6222fc01fce8cc74f3ab754832b4a0b870ec922"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/explore-diagnostics.ts: src/mcp/explore-diagnostics.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in explore-diagnostics.renderTable at line 678. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/explore-diagnostics.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":"src/mcp/explore-diagnostics.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b4508b92003b957908228f2387d4db9e2fd78e8f3e5955eb6ffc284db91f23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/dart.rs: codegraph-kernel/src/dart.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Walker::misparsed_generic_call at line 1364. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/dart.rs\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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"de916aeceb307389ea8d9237a0a6f9f2739ffe5551f42d4f43ff40444ba99229"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/rustlang.rs: codegraph-kernel/src/rustlang.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Walker::extract_call at line 887. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/rustlang.rs\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":"codegraph-kernel/src/rustlang.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6a059fed712f0540f2f4c5da199cb698b89fc94fcd0c4f673c7cc6619bc73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/languages/dart.ts: src/extraction/languages/dart.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in dart.dartMisparsedGenericCall at line 213. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/dart.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":"src/extraction/languages/dart.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1736c8cfb1fb68d820758a82766e13e4649a8077905700fa8788718320d14d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/go.rs: codegraph-kernel/src/go.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Walker::extract_variable at line 692. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/go.rs\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":"codegraph-kernel/src/go.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f5231ed686cbc302168e23aff36f3d342748888351c2a3ca5e54b941131a62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/lib/router.svelte.ts: ui/src/lib/router.svelte.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in router.svelte.parseHash at line 127. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- ui/src/lib/router.svelte.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":"ui/src/lib/router.svelte.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7c08ada06bf9afac5fcd9137a79afb9fac7097eed48a8971bc710ece94814"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/module-importers.ts: src/resolution/module-importers.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in module-importers.passedOn at line 622. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/module-importers.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":"src/resolution/module-importers.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a8295d1c16cbf2f0bafda45ce8add75527e9acb2352a0e9f8fc86c74374948"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/grammars.ts: src/extraction/grammars.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in grammars.detectLanguage at line 600. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/grammars.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":"src/extraction/grammars.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f56d400c64d8e563c48d56e7995d25174034f6e27acea9fd390cc67c4a2a4a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/graph/named-symbol-flow.ts: src/graph/named-symbol-flow.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in named-symbol-flow.resolveNamedTokens at line 283. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/graph/named-symbol-flow.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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e610f8942bbfbf673026df5374aa545660214dd4433f89649a16de2ea8a0ca77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/installer/index.ts: src/installer/index.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in index.runInstallerWithOptions at line 88. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/installer/index.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":"src/installer/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d866df3719ee4656605742fa233943bb3cd238a2228866c7ce1e4f0555c875c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/lib/map-model.ts: ui/src/lib/map-model.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in map-model.buildMapLayout at line 301. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- ui/src/lib/map-model.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":"ui/src/lib/map-model.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ecadf1835ba66fbeeb9f64e317fd74ba80696d8c69f5b2f09b9e6df33d6d40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/cpp-supertypes.ts: src/resolution/cpp-supertypes.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in cpp-supertypes.lookUpCppClass at line 263. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/cpp-supertypes.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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c124553ac22e7e14ec9b1fef5e8a5774fb5baf8f6f05441f113254aadc77a6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/cpp-type-aliases.ts: src/resolution/cpp-type-aliases.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cpp-type-aliases.readCppTypeName at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/cpp-type-aliases.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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd6618679c863c5344b89532fdee9590c3ef81c2e435eab0f8afb194f531f58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/lib/program-model.ts: ui/src/lib/program-model.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in program-model.orderGraph at line 114. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- ui/src/lib/program-model.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":"ui/src/lib/program-model.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1360a0cec3933ea59bdb05365d2f42597655e58ee8b4fa4a77309814a8198d56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/search/query-paths.ts: src/search/query-paths.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in query-paths.extractQueryPaths at line 294. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/search/query-paths.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":"src/search/query-paths.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a24abc092f2257584c5210859ddb8506d19b94da5fe632095ea0f38daef881"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/sync/watcher.ts: src/sync/watcher.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in FileWatcher.flush at line 1080. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/sync/watcher.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":"src/sync/watcher.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfd0bd8ec4639ea4348b2bb63c1e861cf44c1f7610c5c601a8bb37d107992ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/kotlin.rs: codegraph-kernel/src/kotlin.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Walker::visit_node at line 840. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/kotlin.rs\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":"codegraph-kernel/src/kotlin.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"64087a0fb10fe501327356f9d205d5fa376269762b8506e6d5474130dc4569ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/index.ts: src/mcp/index.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in MCPServer.startDaemonProcess at line 654. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/index.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":"src/mcp/index.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"06efdacb790dd4c6b764ce99a225d40b2a4660a61d326e4db88a1818763ee3e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/csharp.rs: codegraph-kernel/src/csharp.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Walker::visit_node at line 515. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/csharp.rs\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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e58da34c91b513ee68042c80cc24a6529017ab409873a9cb80fc67077fe96c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/cpp-macro-visibility.ts: src/resolution/cpp-macro-visibility.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in cpp-macro-visibility.walkTranslationUnit at line 284. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/cpp-macro-visibility.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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bde83a1a85507e4d610ef49a01b50d223526d29064077cd3e4804d76aa8020d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/express.ts: src/resolution/frameworks/express.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in express.handlerRefs at line 518. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/express.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":"src/resolution/frameworks/express.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3331df83e360269b804ecaf68a7c7f9d1c4e07f75f445b7a80a992e28431811"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/daemon.ts: src/mcp/daemon.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Daemon.start at line 251. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/daemon.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":"src/mcp/daemon.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"83504d0b12c3f137c31a54741338b969ad35ddc2b585d888ed1beac8c20d1e81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/graph/traversal.ts: src/graph/traversal.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in GraphTraverser.getImpactRecursive at line 636. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/graph/traversal.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":"src/graph/traversal.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7acf3b35ee6774a0ebc54a86c4c021e327b5eac2cd217b06115314e77aa63c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/java.rs: codegraph-kernel/src/java.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Walker::visit_node at line 501. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/java.rs\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"194c8ae0dc9d0ab250b8e485f3457d481f116c054410c66b5d32d568a9f484ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/ambient-modules.ts: src/resolution/ambient-modules.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ambient-modules.scanGlobalScope at line 261. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/ambient-modules.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":"src/resolution/ambient-modules.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2a8bdb7aef765c2fd53ab7f6933a81e75540324189f142106b8085d4907698"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/tree-sitter-helpers.ts: src/extraction/tree-sitter-helpers.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in tree-sitter-helpers.getPrecedingDocstring at line 170. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/tree-sitter-helpers.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":"src/extraction/tree-sitter-helpers.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6151d4cc199ca20c35dc826d2fc3c1f9424a42571c0778adebccc396f017f2c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/resolver-pool.ts: src/resolution/resolver-pool.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ResolverPool.constructor at line 230. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/resolver-pool.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":"src/resolution/resolver-pool.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"887202bf6a0765a2087545f5b0d746b8881300fe364885612c641a54bb3af179"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/graph/synthesized-hop.ts: src/graph/synthesized-hop.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in synthesized-hop.describeSynthesizedHop 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/graph/synthesized-hop.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":"src/graph/synthesized-hop.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e03300eea422e9ad5b7dba07c1db175558abc2c9478b68cd4892bb72442ae89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/map.ts: src/ui-server/api/map.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in map.buildMap at line 583. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/map.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":"src/ui-server/api/map.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5af8a05f71b36fd5f69531ee7eee50641ca458ce5a1293c7987b6dd5927e1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/ruby-constant-paths.ts: src/resolution/ruby-constant-paths.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ruby-constant-paths.matchRubyConstantPathRef at line 65. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/ruby-constant-paths.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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ed1227fc4c57921c647d9d360a75b6d5203329e4984be3248fd5ec62ac29a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/strip-comments.ts: src/resolution/strip-comments.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in strip-comments.blankStringContents at line 40. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/strip-comments.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":"src/resolution/strip-comments.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cec80b3ef14ce3b373a4fe65dc8eb19c4b166614241ea08024c726bb3663968"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/cfml-extractor.ts: src/extraction/cfml-extractor.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CfmlExtractor.delegateScriptTag at line 632. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/cfml-extractor.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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13f165990ab9210413cd5ce82b366b42a1c829f74280f17f40dde1e6225b6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/angular-router.ts: src/resolution/frameworks/angular-router.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in angular-router.constantText at line 487. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/angular-router.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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d07120d517b5a2832dc8eb79da4f32c346b1900d49ef6889d4144d65c75783"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/lib/screens-model.ts: ui/src/lib/screens-model.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in screens-model.placeLabels at line 762. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- ui/src/lib/screens-model.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":"ui/src/lib/screens-model.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb91a8c6918640903463671b6f9434a25a4cb9a411d78ebb970d72d5a3c51a29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/project-lifecycle.ts: src/mcp/project-lifecycle.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in project-lifecycle.activate at line 120. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/project-lifecycle.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":"src/mcp/project-lifecycle.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd23ec4571ff2edf836a9cf38a130b4e9e48e73c1d90160342920c9134da4fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/writer-lock.ts: src/mcp/writer-lock.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in writer-lock.tryAcquireWriterLock at line 76. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/writer-lock.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":"src/mcp/writer-lock.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"596dc8f9d2a8a8e83c22bca8d64fdb8a377bfb12894685758b5e4a1b9be71909"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/angular-template-synthesizer.ts: src/resolution/angular-template-synthesizer.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in angular-template-synthesizer.angularTemplateEdges at line 632. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/angular-template-synthesizer.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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7241c4b0a0469c6d8a430d74fcf1fe3f9aea00205d153baa0f40111b7b41e076"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/ruby.ts: src/resolution/frameworks/ruby.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in ruby.extractScopedRailsRoutes at line 241. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/ruby.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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98b3da24c4239785d2055d4728b5338a09c18bb69cf6070c8d1e7ea185f2213"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/cpp-raw-strings.ts: src/resolution/cpp-raw-strings.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in cpp-raw-strings.cppNonCodeLines at line 65. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/cpp-raw-strings.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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b479ac69feed908d79d9961a15f4e5f9ee61328d80f91cecc79764e264bc26e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/vbnet-receivers.ts: src/resolution/vbnet-receivers.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in vbnet-receivers.matchVbMemberRead at line 1728. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/vbnet-receivers.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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cfd6a844215ae6a6f814fc7e182ab3eb6be85f2e17dd6a5363552979b2b1eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/node.ts: src/ui-server/api/node.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in node.buildNode at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/node.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":"src/ui-server/api/node.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a732e760bc37a810337ddd59c9f368ec400dad8a3ec1d174c4942a18120b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/graph/symbol-lookup.ts: src/graph/symbol-lookup.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in symbol-lookup.matchesSymbol at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/graph/symbol-lookup.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":"src/graph/symbol-lookup.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac5b24a15391350be4918a35776140cf98cb3aae3b7d5d60e2074cea2b7335a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/react-native.ts: src/resolution/frameworks/react-native.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in react-native.buildRNMaps at line 363. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/react-native.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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdd738263c7d1faf7979e83e49dc8c1d0a81c4449813fcd1b5d9a256916cb70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/path-aliases.ts: src/resolution/path-aliases.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in path-aliases.loadProjectAliases at line 283. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/path-aliases.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":"src/resolution/path-aliases.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"47155648007399d2524e79d877145ae85cb266d51430f7825184a74e9da0c0c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/resolver-worker.ts: src/resolution/resolver-worker.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in resolver-worker.port.on(\u0022message\u0022) at line 49. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/resolver-worker.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":"src/resolution/resolver-worker.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da3ed3faf1986a642f44c1a17214c31b6e41bdc635c64beab791e6a55787006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/package-deps.ts: src/resolution/frameworks/package-deps.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in package-deps.declaredDependencies at line 48. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/package-deps.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":"src/resolution/frameworks/package-deps.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce110e692f4ce4c005a9bc53ee58578bf8e24824b775272664f1056ac45ae2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/scala.rs: codegraph-kernel/src/scala.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Walker::hook at line 603. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/scala.rs\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":"codegraph-kernel/src/scala.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a004bffb50c1835b5a48757c272398bbddc087072a863b0e92335ed5ebf98e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/docstring.rs: codegraph-kernel/src/docstring.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codegraph_kernel::docstring::preceding_docstring_with at line 165. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/docstring.rs\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":"codegraph-kernel/src/docstring.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e88a21afbf153d8ec331e52558f25f5a2ee714ca53332754c0386e830e99dd4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/languages/pascal-preparse.ts: src/extraction/languages/pascal-preparse.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in pascal-preparse.preParsePascal at line 993. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/pascal-preparse.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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13600f4fa4245e3b3b1a1c8deaae8477f05fc319d7317b72d6fe19ef6e1c764"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/csharp.ts: src/resolution/frameworks/csharp.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in csharp.endpointGroupRoutes at line 367. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/csharp.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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d43033be1c54d3c8c883b89806fab84f51673d9c3622de78b6fca19b90b4863"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/graph/dead-code.ts: src/graph/dead-code.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dead-code.overrideCandidates at line 852. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/graph/dead-code.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":"src/graph/dead-code.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"926e26ed06bed42054fa3669ec6f512583c636f49e27aef7d6d0c943081b3a06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/workspace-packages.ts: src/resolution/workspace-packages.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in workspace-packages.collectPathDeps at line 320. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/workspace-packages.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":"src/resolution/workspace-packages.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2138a261f3b7968af227b2b33289cd22334e73299ba435bb50f106ec57cf81da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/type-parameters.ts: src/resolution/type-parameters.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in type-parameters.declaredTypeParameters at line 172. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/type-parameters.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":"src/resolution/type-parameters.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d497194ec4ade1672a3a114dd172bd1ad5c7b9511da4b381d5c1d1ada38b2da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/react-router-synthesizer.ts: src/resolution/react-router-synthesizer.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in react-router-synthesizer.reactRouterLinkEdges at line 118. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/react-router-synthesizer.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":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f025338560a5b06597689240fdec68ad55182425c908202bf6b2aec81016027"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/index.ts: src/ui-server/index.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in index.handleRequest at line 237. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/index.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":"src/ui-server/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c4886bd489555493eb3163422f0961fe8048b9b2bad8b899ef334c83058410"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/effects.ts: src/ui-server/api/effects.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in effects.classifyEffect at line 296. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/effects.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":"src/ui-server/api/effects.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e86d1acbd83d51fa33421a490d1f02f6a6ad803649503eefc70b9d1e2179cde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/route-roots.ts: src/ui-server/api/route-roots.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in route-roots.routeRoots at line 73. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/route-roots.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":"src/ui-server/api/route-roots.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6185f01fe544e2e9133b253c3ec8f22f77b428c63100256462301692787b7bc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/swift.rs: codegraph-kernel/src/swift.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Walker::extract_call at line 1068. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/swift.rs\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":"codegraph-kernel/src/swift.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a0408e2851fae396d6b9959127a25279531ae3dcb4375da85b61469011d56f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/tier-synthesizer.ts: src/resolution/tier-synthesizer.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in tier-synthesizer.collectHttpSites at line 531. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/tier-synthesizer.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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"151a3215fb908656048c6b7b708d499d74532e3de89d7a6affbf7c7ca0710279"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/frameworks/expo-modules.ts: src/resolution/frameworks/expo-modules.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in expo-modules.nativeBinding at line 231. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/expo-modules.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":"src/resolution/frameworks/expo-modules.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a5d215f893785342cfbfc8073a34c88cace1150795affad558f33db851155e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/pascal-scope.ts: src/resolution/pascal-scope.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pascal-scope.nestedRoutineInScope at line 357. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/pascal-scope.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":"src/resolution/pascal-scope.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dfe0abb12ba8a3bad4a89b86120407842968a6eeb8817f8b707b1415ac839b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui-server/api/flow.ts: src/ui-server/api/flow.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in flow.toWireFlow at line 485. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/flow.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":"src/ui-server/api/flow.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4382a9231f10cbcd1efa53943b7ecd3f04bf4da238e2610084d1d470774e816c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: codegraph-kernel/src/lua.rs: codegraph-kernel/src/lua.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Walker::visit at line 423. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- codegraph-kernel/src/lua.rs\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":"codegraph-kernel/src/lua.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27a15b745cd27d1b2bab0f5a522460cf0b901cf31ecc2297f2eedd6fcc0f645"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/agent-eval/probe-allocation.mjs: scripts/agent-eval/probe-allocation.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in probe-allocation.evaluate at line 129. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- scripts/agent-eval/probe-allocation.mjs\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/agent-eval/probe-allocation.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"18def9706b066304db5d4d554bd01b16fbce51ddfb21eb4959feb5ccf8a0215a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/types.ts: src/resolution/types.ts changed 29 times in last 90 days and 24 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is types.isSupertypeTarget at line 537), 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(resolution): what a resolver keeps goes when what it was read from moves (#3214)\u201D; \u201Cfix(java): a record is indexed as a class, with its components\u0027 fields and accessors\u201D; \u201Cfix(nuxt): navigateTo(\u0027/x\u0027) links to the page it opens, as router.push does (#2826)\u201D; \u201Cfix(js,ts): a super.method() call links to the method of the class\u0027s parent (#2818)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/types.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":"src/resolution/types.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3573367378b217c5a0cb38ad40bcd2daf8b1dd40adbbe165cb8220e63982d7c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/tree-sitter-types.ts: src/extraction/tree-sitter-types.ts changed 20 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is (anonymous) at line 82), 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(ts): a re-export\u0027s import node keeps export type * as the file writes it (#2844)\u201D; \u201Cfix(extraction): drop the extractVariables hook, which the core never called (#2809)\u201D; \u201Cfix(pascal): Delphi routines with a parameter attribute like \u0060const [ref]\u0060 are indexed (#2778)\u201D; \u201Cfix(extraction): a function in an initializer is referenced once, by what the initializer declares (#2743)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/tree-sitter-types.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":"src/extraction/tree-sitter-types.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d0b96b2223f64049129cde81dd846ac36de3c898faba564a887acbe91f842"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/mcp/engine.ts: src/mcp/engine.ts changed 15 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is MCPEngine.retryInitializeSync at line 238), 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(security): an MCP session no longer opens a sensitive folder as its default project (#3012)\u201D; \u201Cfix(db): a database SQLite can\u0027t open is reported as that, not as a Node version problem (#2796)\u201D; \u201Cfix(db): reopening an interrupted index no longer gets the server killed at every start (#2794)\u201D; \u201Cfix(windows): helper threads never end mid-start or with GC marking in flight (#2309)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/engine.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":"src/mcp/engine.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4502e9428b0e86b9b2bb533a3118d7c277c82d7143da046fdcfb01bf4f0cf463"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/utils.ts: src/utils.ts changed 12 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is utils.validatePathWithinRoot at line 189), 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(index): a sparse checkout no longer reads the files it leaves out (#3176)\u201D; \u201Cfix(lock): only one process takes over a stale write lock (#3056)\u201D; \u201Cfix(paths): a folder named like ..generated is inside the project, not outside it (#3028)\u201D; \u201Cfix(security): an MCP session no longer opens a sensitive folder as its default project (#3012)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/utils.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":"src/utils.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"01896a1d71477b8c1f1004e8d3e03e18f5bb1163df8ebb4bcc5876bc4dd2f61f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/languages/go.ts: src/extraction/languages/go.ts changed 10 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is go.extractGoReturnType at line 13), 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(go): a package-level var or const named in uppercase is exported (#3043)\u201D; \u201Cfix(go): an interface or struct embedding a standard-library type counts its methods (#2759)\u201D; \u201Cfix(go): a comment directive like //go:embed is not part of a declaration\u0027s doc (#2679)\u201D; \u201Cfix(go): a comment a blank line separates from a declaration is not its doc (#2678)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/go.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":"src/extraction/languages/go.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8705c2016e2194a06e697fd297770b5d9f641406d0c0f7df8e000186bb2e8fcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/languages/typescript.ts: src/extraction/languages/typescript.ts changed 10 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is typescript.classifyTsClassMember at line 29), 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(ts): a re-export\u0027s import node keeps export type * as the file writes it (#2844)\u201D; \u201Cfix(ts): a type-only re-export like export type * from \u0027./types\u0027 now parses (#2837)\u201D; \u201Cfix(js,ts): a named class expression is a class with its own members (#2825)\u201D; \u201Cfix(js,ts): static and instance methods override only their own kind (#2813)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/typescript.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":"src/extraction/languages/typescript.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"768534239629d597024a992d024a3dd1e56ec1eb188d3e903b69ff33a74d3bf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/db/migrations.ts: src/db/migrations.ts changed 10 times in last 90 days and 9 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 migrations.runMigrations at line 357), 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(db): processes opening an index that needs a migration all open it (#3058)\u201D; \u201Cfix(index): a repeat full index keeps the name words of files it didn\u0027t change (#3017)\u201D; \u201Cfix(sync): a member reference through an import binding links its module when the module changes (#2630)\u201D; \u201Cfix(sync): a reference through an import binding links its module when the module appears later (#2450)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/db/migrations.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":"src/db/migrations.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66bf66bf1fbc6734da77d1d4575e0c070ecc94433596fa5a4f9e63e074c1d50"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/db/index.ts: src/db/index.ts changed 9 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 DatabaseConnection.checkpointWal at line 815), 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(mcp): a quiet pool keeps one trimmed worker, so the next call stays warm (#3167)\u201D; \u201Cfix(db): a database SQLite can\u0027t open is reported as that, not as a Node version problem (#2796)\u201D; \u201Cfix(db): reopening an interrupted index no longer gets the server killed at every start (#2794)\u201D; \u201Cfix(mcp): stop pending connections and serve read-only fallbacks (#1963) (#2042)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/db/index.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":"src/db/index.ts"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3461483a0224e9ccf7645f6634de488f9d524fe156c86e89964a3cfed628d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/vue.ts: src/resolution/frameworks/vue.ts changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is vue.resolveComponent at line 343), 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(frameworks): a component\u0027s same-folder preference compares whole folders (#3020)\u201D; \u201Cfix(nuxt): navigateTo(\u0027/x\u0027) links to the page it opens, as router.push does (#2826)\u201D; \u201Cfix(vue): an import through \u0060@/\u0060 or \u0060~/\u0060 in a Vue project links the module\u0027s file (#2633)\u201D; \u201Cfix(vue,ts): link calls in Vue templates and in top-level destructuring (#2340) (#2357)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/vue.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":"src/resolution/frameworks/vue.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a55a125df8c50bdbf2ea3747cbef7d1adcb213d5c9f5028c91d6d7571a7521"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/db/reference-tail.ts: src/db/reference-tail.ts changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is reference-tail.referenceNameTail at line 40), 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(sync): a name imported through a barrel links when an edit gives the barrel its re-export (#2744)\u201D; \u201Cfix(sync): a member reference through an import binding links its module when the module changes (#2630)\u201D; \u201Cfix(sync): a Python import of a name a package re-exports links when the package appears later (#2507)\u201D; \u201Cfix(sync): a Python import alias links its module when the module appears later (#2501)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/db/reference-tail.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":"src/db/reference-tail.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b17914143d0597baf7642d72fd4404a35e1f87fd7075e0bdd7557565a4079e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/languages/objc.ts: src/extraction/languages/objc.ts changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is objc.extractObjcReturnType at line 69), 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(objc): a file-scope constant or global is indexed, in an @implementation too (#2699)\u201D; \u201Cfix(objc,c,cpp): an enum declared with NS_ENUM, NS_OPTIONS or CF_ENUM is indexed (#2694)\u201D; \u201Cfix(objc): a macro alone on its line no longer hides the declaration below it (#2691)\u201D; \u201Cfix(objc): a struct, union or enum defined in a variable declaration is indexed (#2690)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/objc.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":"src/extraction/languages/objc.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddef589838aac24e22d13e5687f30b98d868b6705ca2e6a1567292909e4bcd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/rust.ts: src/resolution/frameworks/rust.ts 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 6 (its worst body is rust.resolveModule at line 330), 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(resolution): what a resolver keeps goes when what it was read from moves (#3214)\u201D; \u201Cfix(axum,actix): link a route to a handler written below its call (#2326) (#2359)\u201D; \u201Cfix(frameworks): name heuristics pick only what the reference can see, own scope first (#2225)\u201D; \u201Cfix(rust): framework name heuristics never reach a function-local item (#2224)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/rust.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":"src/resolution/frameworks/rust.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12c236765fd563fd985616e2ec955cb202561247c4603fc8781c4f461c850ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/mcp/query-pool.ts: src/mcp/query-pool.ts 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 12 (its worst body is QueryPool.drain at line 430), 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(mcp): a quiet pool keeps one trimmed worker, so the next call stays warm (#3167)\u201D; \u201Cfix(mcp): idle query workers are recycled, so a burst\u0027s memory is given back\u201D; \u201Cfix(windows): the query pool never terminates a worker still starting up (#2307)\u201D; \u201Cfix(mcp): retire failed-startup query workers (#1357) (#2041)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/query-pool.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":"src/mcp/query-pool.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0f941912de5d4d71ca36ca8215ee2be17aab78cb9b2e0fae0e1490679059af"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/liquid-extractor.ts: src/extraction/liquid-extractor.ts 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 12 (its worst body is LiquidExtractor.findTagOccurrences at line 187), 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(liquid): a variable named with a hyphen is indexed under its whole name (#3080)\u201D; \u201Cfix(liquid): variables declared with {% capture %} are indexed, as assigned ones are (#2814)\u201D; \u201Cfix(liquid): editor-saved Shopify JSON and {% sections %} groups link their sections (#2812)\u201D; \u201Cfix(extraction): preserve symbols with colliding same-line IDs (#1349) (#2030)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/liquid-extractor.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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e44b7d2aca3dd50b5895e0f5e763274121ab5d5d0b0d76099b281a1fa7e990"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/react-router.ts: src/resolution/frameworks/react-router.ts changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is react-router.reactRouterTable at line 114), 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(sync): a navigation call links its route when the route appears later (#2425)\u201D; \u201Cfix(react-router): a JSX index route is the page at its parent\u0027s address, inside the layout around it (#2423)\u201D; \u201Cfix(react-router): read route tables another file hands the router (#2400)\u201D; \u201Cfix(react-router): read links through a route-config object\u0027s getHref (#2187)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/react-router.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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f826f859bd6bd9c657e565bfda9c522fefa80c56040c609e63dc1dbad55f35c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/svelte.ts: src/resolution/frameworks/svelte.ts changed 5 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 5 (its worst body is svelte.isRuneReference at line 196), 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(frameworks): a component\u0027s same-folder preference compares whole folders (#3020)\u201D; \u201Cfix(frameworks): a framework resolves only references written in its own languages (#2415)\u201D; \u201Cfix(js,ts): index the functions in every named object literal, not only exported ones (#2300) (#2363)\u201D; \u201Cfix(sveltekit): route names drop (group) folders and parameter matchers (#2131)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/svelte.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":"src/resolution/frameworks/svelte.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"179a4dcbd3d843dea05ca55db34d0f9c022144b25fbc741b262fecbf8cbb3a73"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/languages/rust.ts: src/extraction/languages/rust.ts changed 5 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 rust.extractRustReturnType at line 14), 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(rust): an impl\u0027s associated type or const no longer takes a bare name or a module path (#2707)\u201D; \u201Cfix(rust): index unit structs \u2014 bodiless is a definition, not a forward decl (#1800)\u201D; \u201Cfix(rust): qualify generic/lifetime impl methods by the implementing type, not the trait (#1588) (#1596)\u201D; \u201Cfix(c,cpp,objc,rust): index union declarations\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/rust.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":"src/extraction/languages/rust.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25d4dcce2d6ca4c5e9b0a25055224beff60fe8959fe990bdd5851beaf3c8981"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/cargo-workspace.ts: src/resolution/frameworks/cargo-workspace.ts 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 15 (its worst body is cargo-workspace.getArrayValue at line 87), 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(resolution): what a resolver keeps goes when what it was read from moves (#3214)\u201D; \u201Cfix(rust): a module a #[path] attribute loads is the module that declares it (#3064)\u201D; \u201Cfix(rust): calls through a type a path or a use names reach that type\u0027s own function (#3025)\u201D; \u201Cfix(rust): use bindings follow Rust\u0027s scopes, and module paths walk the crate\u0027s modules (#3014)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/cargo-workspace.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":"src/resolution/frameworks/cargo-workspace.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec258053ac260a3519328809ef02f6c828ba16dde1be2dc46fb1ddb24234a8fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/svelte-extractor.ts: src/extraction/svelte-extractor.ts 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 11 (its worst body is SvelteExtractor.extractTemplateCalls at line 203), 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(vue): a self-closing \u003Cscript /\u003E no longer swallows the next script (#3070)\u201D; \u201Cfix(astro,svelte): a self-closing \u003Cscript /\u003E no longer swallows the next script\u201D; \u201Cfix(vue): a \u003Cscript lang=\u0022tsx\u0022\u003E block is read with the TSX grammar (#2824)\u201D; \u201Cfix(sfc): a Vue/Svelte/Astro component owns its script (#2268)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/svelte-extractor.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":"src/extraction/svelte-extractor.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5743866ac1a32c959133b215db639402602e3b68a05d4f54a94ec7a3ea7a841c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/syntax-tokens.ts: src/extraction/syntax-tokens.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is syntax-tokens.isNumberType at line 134), 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(vue): a self-closing \u003Cscript /\u003E no longer swallows the next script (#3070)\u201D; \u201Cfix(astro,svelte): a self-closing \u003Cscript /\u003E no longer swallows the next script\u201D; \u201Cfix(vue): a \u003Cscript lang=\u0022tsx\u0022\u003E block is read with the TSX grammar (#2824)\u201D; \u201Cfix(viewer): highlighting runs in a worker the server can stop (#2266)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/syntax-tokens.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":"src/extraction/syntax-tokens.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7776b2e95774bccb0b502f175114d7966f7b14090eeb902917b2320bd94ef5a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/alias-binding.ts: src/resolution/alias-binding.ts 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 11 (its worst body is alias-binding.resolveAliasBinding at line 76), 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(js,ts): a named class expression is a class with its own members (#2825)\u201D; \u201Cfix(sync): a lazy route relinks a page that appears below its barrel (#2560)\u201D; \u201Cfix(js): resolve calls through CommonJS require bindings (#2189)\u201D; \u201Cfix(resolution): resolve object-literal function references safely (#1932) (#2031)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/alias-binding.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":"src/resolution/alias-binding.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfdaa99465fe1e2a61d36caac5a9ec6240843e617944fec862075f81cea27e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/db/sqlite-adapter.ts: src/db/sqlite-adapter.ts changed 5 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 7 (its worst body is NodeSqliteAdapter.prepare at line 105), 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(db): processes opening an index that needs a migration all open it (#3058)\u201D; \u201Cfix(db): a database SQLite can\u0027t open is reported as that, not as a Node version problem (#2796)\u201D; \u201Cfix(wsl): keep WSL off Windows\u0027 index on /mnt drives, and explain the I/O error (#995) (#2061)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/db/sqlite-adapter.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":"src/db/sqlite-adapter.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0db4c7f3c28c0bb2f7eb9d3b37253fc09d92312ed107378954d793d32be97c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/installer/targets/codex.ts: src/installer/targets/codex.ts changed 5 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 CodexTarget.detect at line 94), 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(installer): the Codex table is found however its config.toml writes it (#2771)\u201D; \u201Cfix(installer): a symlinked instructions or config file is written through, not replaced (#2768)\u201D; \u201Cfix(installer): honor CLAUDE_CONFIG_DIR and CODEX_HOME (#1627) (#1783)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/installer/targets/codex.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":"src/installer/targets/codex.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf6bc50b4452836850b8b8be644e02de733d3aeb911fe876368e33450603236"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/parse-worker.ts: src/extraction/parse-worker.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is parse-worker.\u2026.on(\u0022message\u0022) at line 67), 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(cli): a temp folder on a missing drive no longer hangs every command (#3152)\u201D; \u201Cfix(cpp): a method a macro of its file defines, like protobuf\u0027s \u0060PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, number, int)\u0060, is indexed where the macro is invoked (#2605)\u201D; \u201Cfix(js): a CommonJS require and a module path import the file they name (#2263)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/parse-worker.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":"src/extraction/parse-worker.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40c6befc6f11594e9abf4b6ab4982271c2c0d6dc1df4c1217be3eff9a4b93a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/mcp/daemon-paths.ts: src/mcp/daemon-paths.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is daemon-paths.probeDaemonIdentity at line 127), 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(mcp): one daemon per project however its root is cased on Windows (#2278) (#2285)\u201D; \u201Cfix(daemon): preserve live legacy locks (#1834) (#1850)\u201D; \u201Cfix: harden daemon and large-index recovery paths (#1562)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/daemon-paths.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":"src/mcp/daemon-paths.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f175ddb867f988b33c4e057a713500a900b5412f05798d787cc0e772ef0edbfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/installer/targets/shared.ts: src/installer/targets/shared.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is shared.jsonDeepEqual at line 246), 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(installer): a symlinked instructions or config file is written through, not replaced (#2768)\u201D; \u201Cfix(installer): upgrade keeps everything around CodeGraph\u0027s section in instructions files (#2765)\u201D; \u201Cfix(installer): keep --refresh off the configs of unconfigured agents (#1870) (#1873)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/installer/targets/shared.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":"src/installer/targets/shared.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f92be355c71d6bf270e788cc9c293c3db4f32f4d97f7f751365cd1c3311717"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/ui-server/api/routes.ts: src/ui-server/api/routes.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is routes.oneRowPerRoute at line 111), 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(viewer): the routes list\u0027s limit counts routes, not one route\u0027s calls\u201D; \u201Cfix(viewer): pages that went blank \u2014 repeated ids, and Steps on a function full of checks (#2264)\u201D; \u201Cfix(ui): link every route to its handler, however many files they span (#1975) (#1993)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/ui-server/api/routes.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":"src/ui-server/api/routes.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e207f9c2e5acfd10cc08d25fa7cccd355a2e81233eb04bf9f68f340ff8124d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/mcp/query-worker.ts: src/mcp/query-worker.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 1 (its worst body is query-worker.loadCodeGraph at line 51), 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(mcp): a quiet pool keeps one trimmed worker, so the next call stays warm (#3167)\u201D; \u201Cfix(mcp): idle query workers are recycled, so a burst\u0027s memory is given back\u201D; \u201Cfix(mcp): enable query workers in direct mode (#1465) (#2022)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/query-worker.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":"src/mcp/query-worker.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42bec4882e3d39b012d0e04f58941212a358ea33ab70fc8572d0aeaaf1db280"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/store-worker.ts: src/extraction/store-worker.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 15 (its worst body is store-worker.port.on(\u0022message\u0022) at line 75), 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(cli): a temp folder on a missing drive no longer hangs every command (#3152)\u201D; \u201Cfix(windows): helper threads never end mid-start or with GC marking in flight (#2309)\u201D; \u201Cfix(js): a CommonJS require and a module path import the file they name (#2263)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/store-worker.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":"src/extraction/store-worker.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe86ebdb889d50c2bf61a8a46649f896cc1be632ef6f430304618c32d1e5d65c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/astro-extractor.ts: src/extraction/astro-extractor.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 11 (its worst body is AstroExtractor.extractTemplateCalls at line 248), 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(vue): a self-closing \u003Cscript /\u003E no longer swallows the next script (#3070)\u201D; \u201Cfix(astro,svelte): a self-closing \u003Cscript /\u003E no longer swallows the next script\u201D; \u201Cfix(sfc): a Vue/Svelte/Astro component owns its script (#2268)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/astro-extractor.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":"src/extraction/astro-extractor.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad6020b22a1789fade334aa49b18445bd9da1f742dffaeab817bfe8a07bb0d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/sync/worktree.ts: src/sync/worktree.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 11 (its worst body is worktree.nestedRepositoryBelow 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(docs): agent and command lists match the code; worktree warning drops init -i (#3067)\u201D; \u201Cfix(worktree): a linked worktree is recognized however Windows spells its path (#2937)\u201D; \u201Cfix(mcp): a projectPath in a nested repo the ancestor index leaves out isn\u0027t answered from it (#2110) (#2287)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/sync/worktree.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":"src/sync/worktree.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"290ef918cf765954514e337160253d49d5e1d6491800995a2aa9fd68da732fcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/astro.ts: src/resolution/frameworks/astro.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 astro.resolveComponent at line 175), 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(frameworks): a component\u0027s same-folder preference compares whole folders (#3020)\u201D; \u201Cfix(nuxt, astro): a file-routed page is bound to its component (#2267)\u201D; \u201Cfix(astro): the component name heuristic applies to .astro files only (#2245)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/astro.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":"src/resolution/frameworks/astro.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15a769d48bb6393251af45295fddb9c02a9c51391ce35dc29fc90e85aa792ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/languages/javascript.ts: src/extraction/languages/javascript.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 12 (its worst body is resolveBody at line 33), 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(js,ts): a named class expression is a class with its own members (#2825)\u201D; \u201Cfix(js,ts): static and instance methods override only their own kind (#2813)\u201D; \u201Cfix(extraction): index TS/JS generator function declarations and expressions (#1741) (#1743)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/extraction/languages/javascript.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":"src/extraction/languages/javascript.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1967379a0d2f4f149424fcb4500b1d93f12630fe81e982a700bf13ee26225069"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/resolution/frameworks/go.ts: src/resolution/frameworks/go.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 go.matchGo122MethodPattern at line 175), 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(go): a type written bare links its own package\u0027s, not a namesake struct elsewhere (#2408)\u201D; \u201Cfix(go): an interface links the interfaces it embeds (#2397)\u201D; \u201Cfix(frameworks): name heuristics pick only what the reference can see, own scope first (#2225)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/resolution/frameworks/go.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":"src/resolution/frameworks/go.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8434f09129b3e8ba9f45a0a9632d951820d0228272908e6d13d252bdea7cd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/mcp/daemon-manager.ts: src/mcp/daemon-manager.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 13 (its worst body is daemon-manager.runDaemonPicker at line 83), 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(index): coordinate rebuilds with running MCP daemons (#1325) (#2051)\u201D; \u201Cfix(daemon): preserve live legacy locks (#1834) (#1850)\u201D; \u201Cfix: harden daemon and large-index recovery paths (#1562)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 10:22:32 -06:00\u0027 --until=\u00272026-11-01 10:22:32 -06:00\u0027 --full-history --no-merges -- src/mcp/daemon-manager.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":"src/mcp/daemon-manager.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd27cab54ff87c9e8f8337bd5a3028c03f573699e062c7f21f9cdc4a4c1ffae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a note a blank line separates from the function below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/go-detached-doc-comments.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c324cda6831d3656e12bc780392eda826cd1af38ed6ada501fcf1c21577e82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: an uppercase word before the colon is not a directive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/go-doc-directives.test.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e874731bd69360f71c63d086e4d4961216e590bc6e80bcd82bfcfb62616a9d"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060extractJSImports\u0060 spells \u0060JS\u0060 where 29 names in the project spell it \u0060Js\u0060: 29 of 30 names in project @colbymchenry/codegraph spell the token \u0060Js\u0060 (29 of 30; unit: names in project @colbymchenry/codegraph containing \u0060Js\u0060). Peers: commonjs-requires.commonJsRequireRefs (src/extraction/commonjs-requires.ts:44); tree-sitter.isUnresolvedTsJsChain (src/extraction/tree-sitter.ts:634); tree-sitter.peelTsJsReceiver (src/extraction/tree-sitter.ts:677); tree-sitter.tsJsCalleeName (src/extraction/tree-sitter.ts:705); tree-sitter.keepsBareTsJsReceiver (src/extraction/tree-sitter.ts:760). Rename to \u0060extractJsImports\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e080c397a6b0c511f601ff05d9dfb3459d8e6c6c6bffbcb216c67bf795f4c6a8"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060extractPHPImports\u0060 spells \u0060PHP\u0060 where 16 names in the project spell it \u0060Php\u0060: 16 of 17 names in project @colbymchenry/codegraph spell the token \u0060Php\u0060 (16 of 17; unit: names in project @colbymchenry/codegraph containing \u0060Php\u0060). Peers: php.extractPhpReturnType (src/extraction/languages/php.ts:50); TreeSitterExtractor.emitPhpUseRefs (src/extraction/tree-sitter.ts:5176); TreeSitterExtractor.pushPhpUseRef (src/extraction/tree-sitter.ts:5224); TreeSitterExtractor.extractPhpTypeRefs (src/extraction/tree-sitter.ts:8658); TreeSitterExtractor.walkPhpTypePosition (src/extraction/tree-sitter.ts:8676). Rename to \u0060extractPhpImports\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/import-resolver.ts"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1fee40fce0e2f1cb8d0a05dd5fc9438cc968c8ae5b07f216ceaecbcdadd231"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060baseURL\u0060 spells \u0060URL\u0060 where 34 names in the project spell it \u0060Url\u0060: 34 of 35 names in project @colbymchenry/codegraph spell the token \u0060Url\u0060 (34 of 35; unit: names in project @colbymchenry/codegraph containing \u0060Url\u0060). Peers: AntigravityTarget.docsUrl (src/installer/targets/antigravity.ts:164); BobTarget.docsUrl (src/installer/targets/bob.ts:41); ClaudeCodeTarget.docsUrl (src/installer/targets/claude.ts:106); CodexTarget.docsUrl (src/installer/targets/codex.ts:88); CopilotCliTarget.docsUrl (src/installer/targets/copilot-cli.ts:113). Rename to \u0060baseUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"95645b1fe4fd9b2fc3c7f5e7b0ab6b79951daf58d0a7e2afe61858415c6cb64e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a payment service file\u0022 repeats the code it sits on: 4 of its 4 words (create, payment, service, file) are already in \u0060fs.writeFileSync(\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":"__tests__/context.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f3dbff17b972e472640aafb8358282c277f94c90a97ee8f279d9a7ac3cbe06"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060Valid\u0060 and \u0060Next\u0060 are IteratorBase\u0027s, which Iterator derives from.\u0022 repeats the code it sits on: 4 of its 5 words (valid, next, iterator, base) are already in \u0060expect(calls(cg, \u0027rocksdb::CountKeys\u0027)).toEqual([\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":"__tests__/cpp-smart-pointer-receiver.test.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f611818ef9e63f5348bda9bbc87541b6d81faecd5e9e442818723b298cc9dc7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022UploadConvertible extends URLRequestConvertible\u0022 repeats the code it sits on: 4 of its 5 words (convertible, extends, url, request) are already in \u0060expect(extendsRefs.find((r) =\u003E r.referenceName === \u0027URLRequestConvertible\u0027)).toBeDefined();\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":"__tests__/extraction.test.ts"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d694f42f83b3540b768a48c6585aa8aa67b051fc2d9fa780c39431e4223f077"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060@model LoginViewModel\u0060 \u2192 the view-model class.\u0022 repeats the code it sits on: 4 of its 4 words (model, login, view, class) are already in \u0060const vm = cg.getNodesByKind(\u0027class\u0027).find((n) =\u003E n.name === \u0027LoginViewModel\u0027);\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":"__tests__/extraction.test.ts"},"region":{"startLine":7440}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ced2fdc8c5ec7c880681ba728fb8a8fa2ceac88a9fe8379004bd3e0490d2d5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060\u003CToastComponent /\u003E\u0060 \u2192 the component class.\u0022 repeats the code it sits on: 3 of its 3 words (toast, component, class) are already in \u0060const toast = cg.getNodesByKind(\u0027class\u0027).find((n) =\u003E n.name === \u0027ToastComponent\u0027);\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":"__tests__/extraction.test.ts"},"region":{"startLine":7446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f16278c1a52f16c6e42ac9deec71abb6bf5e0b548e0c44d44acf4693c1b062"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022pluginContainer.ts: class PluginContainer { resolve() {} }\u0022 repeats the code it sits on: 4 of its 5 words (plugin, container, ts, resolve) are already in \u0060const method = node({ id: \u0027m:resolve\u0027, kind: \u0027method\u0027, name: \u0027resolve\u0027, qualifiedName: \u0027PluginContainer::resolve\u0027, fileP \u2026\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":"__tests__/fuzzy-lexical-reach.test.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b9e0bf10f8e862afa853a85abfe949da6f9eb783842832c9dfc47c8d81e082"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022export type \u2192 isExported true.\u0022 repeats the code it sits on: 4 of its 4 words (export, type, exported, true) are already in \u0060expect(result.nodes.some((n) =\u003E n.kind === \u0027type_alias\u0027 \u0026\u0026 n.isExported === true)).toBe(true);\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":"__tests__/kernel-lua-parity.test.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"15542659ab32b66f3f1781b5a5a89bd11014e5a99695cf59f735842d6f82fc7a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The render edge exists and is the synthesized jsx-render kind.\u0022 repeats the code it sits on: 5 of its 6 words (render, edge, synthesized, jsx, kind) are already in \u0060const edgeRows = db\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":"__tests__/react-hoc-component.test.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61f25b896776e7577dd7c7c4a3e6494906a465c9b59c291efc01c0f4e5a29dd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The file\u0027s own hook resolves.\u0022 repeats the code it sits on: 3 of its 3 words (file, hook, resolves) are already in \u0060const own = reactResolver!.resolve({ ...ref, filePath: \u0027src/hooks/useAuth.ts\u0027, fromNodeId: \u0027function:src/hooks/useAuth.t \u2026\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":"__tests__/resolution.test.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e724684fba47738330e2106fbd05ffe62e89110ef57c26c9c9e25ef1a9758"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022excalidraw\u0027s \u0060groupIds: ExcalidrawElement[\u0022groupIds\u0022]\u0060, then \u0060groupIds.filter(\u2026)\u0060.\u0022 repeats the code it sits on: 4 of its 5 words (group, ids, element, filter) are already in \u0060const calls = await callsOf({\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":"__tests__/ts-array-annotated-receivers.test.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e2934906bc28851bf4be28ee71e8dd250cb42157d29dc468f211fcbaaea7d1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060import { store } from \u0027./state\u0027; store.add(\u2026)\u0060 with \u0060export const store = new Store()\u0060 in \u0060state.ts\u0060.\u0022 repeats the code it sits on: 8 of its 8 words (import, store, state, add, export, const, new, ts) are already in \u0060const calls = await callsOf({\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":"__tests__/ts-imported-type-receivers.test.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebd197a011f350890fd59fe95b1fbf99c62fc205010ce81c829f0a19113921a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022bitwarden\u0027s \u0060export { MessageSender as MessagingService } from \u0022@bitwarden/messaging\u0022\u0060.\u0022 repeats the code it sits on: 5 of its 6 words (export, message, sender, messaging, service) are already in \u0060const calls = await callsOf({\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":"__tests__/ts-known-class-methods.test.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6861226e94ccedac4ba60f8571e131cc1ab298a55e19b566bc6c20169a16a7e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060New System.Windows.Forms.ListBox()\u0060 parses as \u0060.Windows.Forms\u0060 read through \u0060New System\u0060.\u0022 repeats the code it sits on: 7 of its 8 words (new, system, windows, forms, list, box, read) are already in \u0060const reads = extractFromSource(\u0027Designer.vb\u0027, \u0060Public Class Form1\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":"__tests__/vbnet-instance-member-refs.test.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea6ffaa4f0b93a901272e389a5be02bd6e248fed6b2039131eeb1ceb6514176"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060Billing.Invoice.MaxLines\u0060 and \u0060Acme.Billing.Invoice.MaxLines\u0060.\u0022 repeats the code it sits on: 4 of its 5 words (billing, invoice, max, lines) are already in \u0060expect(linkedFrom(\u0027Billing::Invoice::MaxLines\u0027, \u0027references\u0027))\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":"__tests__/vbnet-member-access-scope.test.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f633729664275e028460e4866bfb0899b4a3c405c23b236a3acb233567c41"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The call, and the file\u0027s import of the name.\u0022 repeats the code it sits on: 4 of its 4 words (call, file, import, name) are already in \u0060expect(graph.getCallers(fmt!.id).map((c) =\u003E \u0060${c.edge.kind} ${c.node.filePath}::${c.node.name}\u0060).sort()).toEqual([\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":"__tests__/workspace-nested-globs.test.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaeac68ef1bb1995e260714bf59794c337e41a3e53a486d66b5645a05981b09"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get related files\u0022 repeats the code it sits on: 3 of its 3 words (get, related, files) are already in \u0060const relatedFiles = this.getRelatedFiles(subgraph);\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":"src/context/index.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"24706b9c953107ddca7dc752f51dc68b801729efcfd565848d75c1b02420069f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Directory is gitignored by parent repo \u2014 fall back to filesystem walk\u0022 repeats the code it sits on: 7 of its 8 words (gitignored, parent, repo, fall, back, filesystem, walk) are already in \u0060logDebug(\u0027project root is gitignored by a parent repo \u2014 falling back to filesystem walk\u0027, {\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":"src/extraction/index.ts"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b6772bb471babb05a86544ad8b1a1fac01b244fcd841eea4687a96b6185efc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check file size\u0022 repeats the code it sits on: 3 of its 3 words (check, file, size) are already in \u0060if (stats.size \u003E MAX_SOURCE_FILE_SIZE_BYTES)\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":"src/extraction/index.ts"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea348221663c5f29bd8f7e09d388ae69dbdd3b9db0fd0b7f0bbda6e96319f6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create the interface node\u0022 repeats the code it sits on: 3 of its 3 words (create, interface, node) are already in \u0060const ifaceNode = ctx.createNode(\u0027interface\u0027, nameText, node);\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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dabfbebfbda1430589248d31ce1a60ece27c3c5d964fde48be3f8420868cb39"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the use argument (scoped_use_list or scoped_identifier)\u0022 repeats the code it sits on: 5 of its 6 words (find, use, scoped, list, identifier) are already in \u0060const useArg = node.namedChildren.find((c: SyntaxNode) =\u003E\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":"src/extraction/languages/rust.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"06efd30860150524d503f9d6975592d5ed9abc797112d752d85bbbb6b1b8185c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create file node\u0022 repeats the code it sits on: 3 of its 3 words (create, file, node) are already in \u0060const fileNode = this.createFileNode();\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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b170706470020d38e04c288ad2eb8bb5eb07737be58df9beeefc7f1fbea0af5a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract section references\u0022 repeats the code it sits on: 3 of its 3 words (extract, section, references) are already in \u0060this.extractSectionReferences(fileNode.id);\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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc46bb20081c751974bdc2c6e4de2fc86f6665d8663fc8e92b1b3dbca86aeddd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add unresolved reference to the snippet file\u0022 repeats the code it sits on: 4 of its 5 words (unresolved, reference, snippet, file) are already in \u0060this.unresolvedReferences.push({\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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e3c62976a9e584665cbdc180bec4b5785524d1b9c003602ca8b7fd3ff43e9e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Unit/Program/Library \u2192 module node\u0022 repeats the code it sits on: 4 of its 5 words (unit, program, library, node) are already in \u0060if (nodeType === \u0027unit\u0027 || nodeType === \u0027program\u0027 || nodeType === \u0027library\u0027)\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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8757}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c524d75ca49f4435427c777c981221aea3882147b464ddcc489dca7aa6ace98"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022declField \u2192 field node\u0022 repeats the code it sits on: 3 of its 3 words (decl, field, node) are already in \u0060if (nodeType === \u0027declField\u0027)\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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8845}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce0714130d803e9de747ae1b3a9325db46aa5c8058d9a5b46c6ddc27c1d9a8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get adjacent edges\u0022 repeats the code it sits on: 3 of its 3 words (get, adjacent, edges) are already in \u0060const adjacentEdges = this.getAdjacentEdges(node.id, opts.direction, opts.edgeKinds);\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":"src/graph/traversal.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"81986b180226cca512d941e9b20cb6e241e1510e260504e9eecd741fd9b44281"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get outgoing edges\u0022 repeats the code it sits on: 3 of its 3 words (get, outgoing, edges) are already in \u0060const outgoingEdges = this.queries.getOutgoingEdges(\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":"src/graph/traversal.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eacc0b520184b4a87567d1634968a73e9fceab669f4d238df9e5a72feebccd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The aliased type is written in the alias\u0027s own scope.\u0022 repeats the code it sits on: 4 of its 5 words (aliased, type, alias, scope) are already in \u0060const aliased = expand(text ? aliasedTypeIn(text, alias.name) : null, name.names.slice(next), name.templated.slice(next) \u2026\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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"524eae6bf4780b70429b43e690c677a973c98da64745a2ce6818114035332521"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The aliased type is written in the alias\u0027s own scope.\u0022 repeats the code it sits on: 4 of its 5 words (aliased, type, alias, scope) are already in \u0060return expand(text ? aliasedTypeIn(text, alias.name) : null, name.names.slice(next), name.templated.slice(next),\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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"04741cbd5c7c21b5c364a04322ad2f6c0e39d90214cbb2572d860da5dcae0111"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022name \u2192 nodes cache\u0022 repeats the code it sits on: 3 of its 3 words (name, nodes, cache) are already in \u0060private nameCache: LRUCache\u003Cstring, Node[]\u003E;\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":"src/resolution/index.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cee03d2c4333bbaced09240980c8448c24a53ca7766a2672469f4f411c4926b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022lower(name) \u2192 nodes cache\u0022 repeats the code it sits on: 4 of its 4 words (lower, name, nodes, cache) are already in \u0060private lowerNameCache: LRUCache\u003Cstring, Node[]\u003E;\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":"src/resolution/index.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"57acc5adecfdb7f4304e6148415b6c20f376db6ce41a6aa7a88bfa99e4e533cc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022qualified_name \u2192 nodes cache\u0022 repeats the code it sits on: 4 of its 4 words (qualified, name, nodes, cache) are already in \u0060private qualifiedNameCache: LRUCache\u003Cstring, Node[]\u003E;\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":"src/resolution/index.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82bbb4c1d0b00663ad81ec20635ffa6ca4d3f11949be7d61b53ddb29957466d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Prefer exact path match on qualified_name\u0022 repeats the code it sits on: 5 of its 6 words (exact, path, match, qualified, name) are already in \u0060const exactMatch = fileNodes.find(n =\u003E n.qualifiedName === ref.referenceName || n.filePath === ref.referenceName);\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":"src/resolution/name-matcher.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9d89664d124b250637363f3cced0d06c61c32ce4faf7c27e72d773212dc350"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A call is a conversion when it names a type of its package.\u0022 repeats the code it sits on: 4 of its 5 words (call, names, type, package) are already in \u0060const dir = qualifier !== undefined ? goImportPackageDir(qualifier, filePath, context) : goBareTypeDir(name!, filePath,  \u2026\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":"src/resolution/name-matcher.ts"},"region":{"startLine":26194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36c4e7f456ba2545c48d1e13e1e9cabee24fcbc35944d5c806cecf5f00162e5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 3.6/10. The most over is \u0060(repository root)\u0060 (190915 LoC, 785 module-visible types across 26 directories). 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":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"6d871eb4938a68b9c72e7e70483f24ccf36cb92e2ee40cd1343b1c22593e52cd"},"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":"a372f691827a5d9c5403042bca1dfc9d223fd51d2d8f1a1766c3d725e906f2a3"},"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":"b486951f7b77ca5f481d9873ab573185197a8efb99b61b6be76b07a0cf2ab7a1"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"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":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"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":"538b4462a8f944e60a21502f361ca1938d39b9fa1fed0ca1792a30b02d41eef0"},"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":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"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":"8259b8be486050d832e8cd0d3615cb14b1c44312ffed9c1274cb8979ba9ade8a"},"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":"c5bf7ddd9fdd49abee62374c667011fc01c22074cea01b49cdf0e7aa8129179d"},"taxa":[{"id":"CWE-494","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":"60e51c12e3490359f01f8cc76d6edc274287dc727633f543076b5287941e8d63"},"taxa":[{"id":"CWE-494","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":"393008cf24272eaf38a25185bdbc1aa351cd1237b5bf5549216855e68dde458f"},"taxa":[{"id":"CWE-494","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":"b81c5dab0730385b6207f3ede4573aea3776d7f84994ec82f93fe88a634027f6"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"674f5b2998538fdd5dd5df9f33898e0968eecff7c5f302d9969c62284432331d"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"288811849b6a2c2fd920c217893a0023f716c903d976cd2f78b0aa175d099be7"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"16404366bc809ad32e6b644d0cf3b4ee3932af1db903f02a5f21249369752484"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"9fa5faf26f332a369487f591ec39b53a813ce5cf37f2aa84cffd0398b98a0c7e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96c9bcc5c8997e094d9e3c2aa95df1ef140a869a17cf162b613a0f0c977d46da"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe8416c1179cd1c0902ec2d1fbd0006a9657c2cc1c4c2e1184cb4edecd972be8"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb6a07028937ee4c63121757df31965ab6dcfb1014f8a70fc12dfab8bc90f4a5"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"065b001f8b9a3a0c566da7766fd5d64c2d8f629aa1523b2ef00a8906fc6af9a0"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be3e0c841343c5f7ce676fbf5d952a3e95877e21b30fd2142c1e5c3b447c4529"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7eb0f59f880058da59c3862b994097a05e37c1e91e4991e1b423125a9a3a2bb"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13907abd2818976f6d272596f7c25598b682eb9b3caee20d3bdc7d4a56e3a318"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5e1ff90770b165ee18996459978cdd19612c7f3d898be09b9a179e15b9a8041"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ab5af16666a66ffed8a41f3c760067c5d52e1923ea53fec419cf39c2e57c455"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c015fe06c6a0e044714c1cc3226b6e4d59b697d6e09c16181749b980c56902f"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c612067db69832771dbc1b2f836795fc361c3d0712cd226e0de37ae30e801189"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8eceb9fe78817b77c4ade98d39c7c7d902a33e66ca4939a2d668d4b51fa3991"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"009bee11f1d1dc88213894a014a416bd6a769df59b9ea9fcfcc7d4c5ab819a2a"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d17d9333d6198a57bc3cb730de3652c092a925c13833a18bb1f45aefccbd0ef3"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49785464c9a02e364a6f3f24cad3397d4b74607bdc24335037ebd63d85975b81"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29aa26f7537282d7bee5af320ab841f0cbfebbd0b31347a1b3a5d0a7fede2cef"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"518a7fad738d54917c1433ed29c3828401d52ee75b2c298c00a10cb6b83ad3ea"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"624c3f086f113ffe4ae0feafcba53f0b0e17192e449b3e954bddf19e50b7ae94"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a112238a74596c6078e4056398348dc431651c19c81e5a82b1bbf60bc9f0af2"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e283fefaf0f7d1c57fdf1bf0839c17e8ad3e5bdc21924250c3db6f67988f167b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2118205fbb37c99ed698d6a1ca0917f6bfd5bd0f2b61219f0901aed6ca2340d3"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f6c7e041968e5f57b74c57a4671a3211b4ba3038958163172009654e8421dfa"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92e7921b5316488bcdb43b0e757a96a70458a8c16923a6fbfbc5ce7f9acce9f7"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"049d2d48f0037f17f46e06bd9c67847827d50783fcb9974beeac37f88f8d3d02"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38cc02b04ce5fb8803c524cb2bc2d555491699b29040276011bf1ebdd0aea853"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb5e4260e239078f893262ad3fabdf65b4681f7d40c9a784c9561bf3d31db207"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31aa20f6848ab869d673ee1c3261face53d62164c113f54eb563199f27802651"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edc6ca67151ce6d15b7ecf9feef2b8ad278683dfd6c3e93434015cbb26ed36f3"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb0ec4abccf6eb1793eceb92ecd833eace212da9c13302f93bafde7c6e5a22cd"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7f94ca3638e1442dbf5d14d78a587248b07d01fd8fcec837ae51e8d385b41f7"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d8de23d9e2070c8f9be9a1f0794ce384c529dffeb8da6d337b228e85b9854fb"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2ca4027b3a1263664be5300c10e3d38012daf3148bc93adda1253a689d7ab7b"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29ab388983275a288a0f361f0e73b1c81a303e02372fa9236ea0e015d184de38"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32f2f4c8df7610171b85e88d33f470bf73d89ea5d1d1fd2517a343f019054866"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5339b196b462650a3aac33e9eff10b0bef818e09dbcd2aac36f6bae39a52fac"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edaa42a2c892871240ccfa6acc67a7e4a523206180eed2548606e67bd6a1d03b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b47fb4efade33efecdffd6838753c7d61193b085759696688bdd96187a6b49ec"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"924764a1c065568217830230f3f32c1fdbc1008120d70db2ca1302337cb87165"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"340653d20ef54343114368251e903f050836b5502768284e83adb4d9009eb4c4"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09310d0eb7e6096ca5d798b3818dc697cea3d263fc60273ba4c02c861dad96fa"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55739af493564c4a7ecb726e69cd3acc352ef7b23af8d7761ec9ef5d05bb4bb9"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c1e6cb60e6e9502494c775bcc20271a136d0854a4307a7c1ab8639e82767024"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ff4a2fd1e256d6b3ac2fb7912a3d7b5790960c391df7542c2db11c08ccd2572"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da1692af5b4f7d07f7418323b8d9cb7e95fb5007a7fb73cb112081936a7975a2"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c4276d6d0ed5aef6582eb73baf2ae9c8a5525c366e0af8b0bf5e64f0b83236a"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3f1e95bfb529a5be3c5f2731a76ccc0d6b4b74643449eb7efd5c362843541e6"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46799571c8c4700814997f4ef3ebbd053dd51f9d3321f229db49822a48d4b2cb"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b38bdfb8da52672ceb50cb66b3015c88abfa6a776c5c705e24cabe2575be241c"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3fecdd7874ca92a9315dad165482be049c4c069d0c40eef3f8affe916dcedaa"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e74884d2ce2e772165398ca0943b5644f3b186a90b0a54bd05aef4d295a57839"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbcc33d303b4e7eb7d24ed7984496044f64c579d68182691b23c2ee3fa21ef9a"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c61d33a8640e826b9e310deb5bf90be16dbade8040bfe0ee5932af2dd088ca62"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0040a89890bf17c0795e5c2b50e6373d91859910248480752690c2cf5b675ebf"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a481318547abfb6f14513ecd2c32b85254da441c67b75826548977dd0a34a99"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6d1cfc403d412d6fce5cf04778b87be1449e89d8ed6f6d419d2add3eda0e1c"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7514f265854699890cb276cc71b2dd97a6b5a94246003a1c1c2b2f2b96a41d70"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a13e92a641f6080bef46ce29a327cc897b71ed82236a09c5c566277b6815efff"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f64e0e9fddaef5c44a6328dd2b06716c3b2afa80237598fb769a08fc90eb8804"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fecd9f4b916caaf6c0f61b17f237eec91df7d44489e874249e0ed0b403daa864"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce8467e08d56fecda7868486a07af39ec0a50e640ce5aa07cab251a365b1613f"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24ac5cc2398cc89e14f94e17c5cc14c83c046fd275554e7a98ccf5b6507cd6c6"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fec6d76c09a6d5feafd4e24ba4365a2b6b0720f61ac4283ae4d8ca54c09b7a38"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84b3aaf8be098c5c8da2209f142008d78885f83ca5c44e9dfbc4639ae82f4e78"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ae44f59347281b1bc8943360d1f044ebfa3f6088796e165b1380b16f3b9d51d"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24c5cfc9efe5849be6912c1ecc8a5afbad97d3de3de618d3301e57ee058d7b42"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e70712a106066e32a4265aa40d4f68aa89c9714a7b3e3cfaa95a1b1eb2553dbd"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0943ab45d14ca0f63f06ff804fbdad4a3d0c63835d520447e6caa775ceada4b1"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c72183648072492dd0e057907c1b1759ea0159a6097441ffbc1777ee659eb81"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b23b072f8139affcba05ed408bc018bc9ece2fe7e0760e44098e1f938ec430b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fb42a941d2500f8008dbd4ddc8bccb2e36422bca1819a1e0aff5188cf6a7428"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bd1cc06a6bfda7ed9a1f6bdd06acd16d91ba3b9ed71e0c8568cb485da23f8e3"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23f489198143057d0b694982cc30027f66ac898769e9df58238e2fe343cc1aa0"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cb1523bb327ab3b109fca80a2493bce1fe7f3efd0554798326ebaba47bc12f0"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbef09a7cd245d3c2ce3bf53779d4dbaa7478a9c6a45f816a4141e75bbabdbb2"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d1d1eb743a79e6279bc246f3fde493e341daae7de0a3e03ad6c5f4ef9a33399"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38c1f9b5d6d9dac963753a1a4c5946e6301d97cdb5da383137c0f34b44a81b08"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f26b7db6b1d634f9431eb8877d845c8300a05161afc752d0320684cb33d9a21c"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9370451794813e8445d4600a93e65c201bf4a48bd26ae521a853ab5d929a33fd"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf73f6471ae44b12c568dba1b99fbdd98a0bf8e03d834ede2daa26a285ce0bed"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a310fb49f24be4e1051078784c5b409d323b7184858fa38a1b204ccc34aee4e"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2183bb63abc6a8bb149aa7cf771c3bf9f5f994fd92e06e7b3c3b5ecaa029fab5"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0af7ba9ab9eb8792cec06d030eb0e15ff6d2e2e33fcc6d8d617821605e1d21d"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"469eb2264a639366e69560c9fa6f5f8300ef67894be9caea1b597aca9056128b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10f7ae636baf3a318c2927d2308392ed8e3fa5d7b4f93796662063d2373b0d52"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cccdaf24b5de2e3ad46571831c0ef672ba119aaadbcbb1d96cb3869ef129fe1"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d73c6f5fb8abd6c03f75f5f108fe43d4758ed8f00b5e04bafdc7cf6605835bce"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"513752033d37a2d0adfa68ac81a9e6eece72eb643e25aebdef9c39bbe650f53f"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61bea43aa2fca419df3e954b005533eb4fed06c0b134d2849aa01d9d8a5da9a7"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b51f37c1d4dfdf9dcd810da5d461f6160e65fea87bb05e315131fb36edd26f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24113f45c4b380adafdea3257f911c13e1593f4aa7a95a676bf499d737970841"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"27da27b09680dc8f3b31a8bc8da616a88f06c9fa97d91e887c54ae29ec8637cf"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"f9c91301d0484fabcd67eb3a58d5e199034fe886f5e47f39ede3c9578c91c0db"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"10a1452382212b1eab1f1ce162588ac16cd2351a67cd85601764a1f0e759ff66"},"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":"a857a22ab07d740417ccf9a44c2baa033a4a8faff5d53df3c4a4e49ba712cab5"},"properties":{"dependency":{"package":"astro","version":"6.3.7","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]","[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":"2a97b7f163f2008119363b8420b4cfa12eea98423470b15ce1ecb79adbbd8728"},"properties":{"dependency":{"package":"rollup","version":"4.57.1","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":"b694dace86fb7d15873b2ddd65002632093db12bc6146d23cde087273cc549f5"},"properties":{"dependency":{"package":"vite","version":"7.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"ui/vite.config.ts","line":2}}}},{"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":"29add68a969a97392ca2692c155d675daa401e8923c133d54e4a50089eea338d"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"09ffa90a90b64d1c5d14444ec94f28776490141f325032a41bcaf981ebf8ef07"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"d0e89d61e82f24513f2e9502b8d7d0ae5f76ca76a60cafb571cdff12051c7dd6"},"properties":{"dependency":{"package":"smol-toml","version":"1.6.1","advisory":"[GHSA redacted]","aliases":["[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":"2e03f057639a0da7e83c50fe72b9bceeaec862b7e6094d2c1b544a0b17d29e7e"},"properties":{"dependency":{"package":"svgo","version":"4.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"7b62391cd66ceaa546d353492ac30f04dd606ef5410609285f75a548e7537b2e"},"properties":{"dependency":{"package":"vite","version":"7.3.3","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":"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":"9aab073d443fe8dc174ab180b65672201bdb5bb7206af0324dd462b7c2e16012"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE 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":"bf05a1dac0cd33e96b3a43f0ac20fc0ab41be4b4c57dfa5d1f1762c330c76f8f"},"properties":{"dependency":{"package":"sharp","version":"0.35.2","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":"3336da28e8608c73b0fd6c67f68338e0bd8e1bb7989f368e985837497b58d830"},"properties":{"dependency":{"package":"undici","version":"7.28.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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":"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":"be2c5c93187d6dab12960258f095c95ac951ab8ca561f7da9d0718137e5d5143"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"327b08b0bfd3847b37f1ce9c852fd8542e6a83785f5b857a3786846ab5538bb6"},"properties":{"dependency":{"package":"undici","version":"7.24.8","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":"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":"c04edcf25b73e652dc8b43d77075d021578287c2967efaae4442be6ddd8271a7"},"properties":{"dependency":{"package":"ws","version":"8.20.1","advisory":"[GHSA redacted]","aliases":["[CVE 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":"cf3efdab7f9486659511cd5c3b55773bb474b1f054cfd0a4b6adb62b94a1e84e"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"86c060fe2f14a3978cb3e6254cb3f67efc2d36b3a2650922e34c90429e514794"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e48ac159ff7e45e7e8caf46fd08634e372e75c9d630e99e5dd84a5fa49a5f3b3"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[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":"36d87a149df5a7bb0e7c3e7e07d401ab1dd6062a9554e7bc0e930e1544da9148"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a7f6c6b926c80fe21d582fa3afef4b5897b1a6ade519f06bc7b75e506a9d92d"},"properties":{"dependency":{"package":"esbuild","version":"0.27.3","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 350 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 350 of the 387 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/search/query-parser.ts. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba962b5ff919e0a8c57b7eb01c0bad499c1337c3c5d13ab3f68a8e7b16baf20"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: grammars.ts \u2192 langs.rs, lib.rs, index.ts, index.ts: \u0060src/extraction/grammars.ts\u0060 changes together with 4 other files \u2014 \u0060codegraph-kernel/src/langs.rs\u0060, \u0060codegraph-kernel/src/lib.rs\u0060, \u0060src/extraction/kernel/index.ts\u0060, \u0060src/extraction/languages/index.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a5508185a2dfa7205c24dfd2f7e7aa3c005dd2e42e9d15e62f02be15c7c617"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: langs.rs \u2194 index.ts: \u0060codegraph-kernel/src/langs.rs\u0060 and \u0060src/extraction/kernel/index.ts\u0060 change together 88% of the time (14 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060d1b75a1a\u0060 feat(kernel): R7b Dart walker \u2014 dart module, vendored-grammar-C d4d8f\u2026; \u0060bdd687b4\u0060 feat(kernel): R7b Scala walker \u2014 scala module, vendored-grammar-C mas\u2026; \u0060e3213517\u0060 feat(kernel): R7b Lua\u002BLuau walker \u2014 one lua module, vendored-grammar-\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/langs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63875a0cafc0f70560112f752729a69f05fa0ed9352387ff2b832df1e0c11fa4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: index.ts \u2194 parse-worker.ts: \u0060src/extraction/index.ts\u0060 and \u0060src/extraction/parse-worker.ts\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603b37fb01\u0060 perf(index): start the parse workers a project needs, and let them pa\u2026; \u0060c4babfce\u0060 fix(js): a CommonJS require and a module path import the file they na\u2026; \u006028068fa0\u0060 perf(kernel): direct-to-store decode \u2014 buffers flow to the store work\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54c1e71e4b0aa98d9cc49806028b9f0676baeb0d778a6c9dbd7cb5332acec4d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 typescript.ts: \u0060codegraph-kernel/src/tsjs/mod.rs\u0060 and \u0060src/extraction/languages/typescript.ts\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060013b91c1\u0060 fix(js,ts): a named class expression is a class with its own members \u2026; \u006068fcf2f1\u0060 fix(js,ts): static and instance methods override only their own kind \u2026; \u0060a33040f7\u0060 fix(js,ts): an import of a package the repository declares itself lin\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegraph-kernel/src/tsjs/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b912d11f0e37e6870654448a99fb005353def364031575d9a65dd27f175f68cc"}},{"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":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/views/StepsView.svelte"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0835a375dd9d474cc4a6e470414ec34cfd48bd2faa9c31f15b9e4f3d81c5b60"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/views/ScreensView.svelte"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6186de39295ba0979ee1fc723da9e761bc551abd78d4b3a68e913acfb6265c0"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/views/StepsView.svelte"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f7ce0aedba8338e50102e1f9688b1a45bbc5fe5b5b69221bffd5de04c31061"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ParameterFlowAdapter (16 required operations): \u0060ParameterFlowAdapter\u0060 declares 16 required operations: \u0060readCall\u0060, \u0060receivers\u0060, \u0060isKnown\u0060, \u0060cannotCall\u0060, \u0060signature\u0060, \u0060family\u0060, \u0060handsOn\u0060, \u0060rebinds\u0060, \u0060shapesClass\u0060, \u0060passesOn\u0060, \u0060passesWord\u0060, \u0060argumentValue\u0060, \u0060methodOn\u0060, \u0060answersItself\u0060, \u0060declared\u0060, \u0060written\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/parameter-flow.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7bfd8ce9fb2c171f424ca9d7e2a82764db49e25233d327f71b52511645712c"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 3 ADR-shaped document(s) detected by content \u2014 \u0060docs/design/native-extraction-kernel.md\u0060, \u0060docs/design/telemetry.md\u0060, \u0060docs/design/template-markup-parser.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/directory.ts\u0060 reports through \u0060console.*\u0060 at line 59 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/directory.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db3d697010036eada9d3afe5a1c2f0682efeb03f95d32bc07beaea6508142c2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 17 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2ff261796fc138338724fb1dcdf478165d67d69967f423d2bb122a930703c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 19 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"08636db96712cc82b39261219b3dfda36eb0bd5b64dc2125e598dbcfe9cfa218"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 40 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04c3f061c8975d3d369e797075f02649411c1c4432abbac90c476ff6dc288b4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 196 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e36e3f1a3f5bc310d528d0a5de41d55a6628cb248499128e9b6c37e18427ce0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 200 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32f1ffd1a7bd894d0f07a8fdd01e88cf07f2cf302545c26e14b11e4d3e21b02"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 203 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ef12b69207f3b9f92735ebb155067005cc96f95c8d6eb4eb3000cbf2927a57"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/utils.ts\u0060 reports through \u0060console.*\u0060 at line 26 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29abe68d51c2a0185ced7636d8ffb65d1bc736b55eecd8a7dbbfff1a4ebb90c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/c-fnptr-synthesizer.ts\u0060 reports through \u0060console.*\u0060 at line 1447 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f538fe464f773bada0c25dbdfd00502c9264299cb8b652ace7be0dbddf21eb4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/callback-synthesizer.ts\u0060 reports through \u0060console.*\u0060 at line 5529 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8a2ac71a1baf289f1207c7d03bb96e60cd8625283955614d26196f22f87563"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/callback-synthesizer.ts\u0060 reports through \u0060console.*\u0060 at line 5588 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9485459a0126a62d7098414c6b1471fa100094c6e0f284250e1378540307f6b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/callback-synthesizer.ts\u0060 reports through \u0060console.*\u0060 at line 5652 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5652}}}],"partialFingerprints":{"codehealthFindingId/v1":"15372c544f3578b45fac23b039c9dfca28329cc02bad8fef9451b7565e268652"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/resolver-pool.ts\u0060 reports through \u0060console.*\u0060 at line 218 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/resolver-pool.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc3fd885552f645d098b3d8f12bdd8a5598250aaa6485985f8cfdc0d6dab42"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/resolver-worker.ts\u0060 reports through \u0060console.*\u0060 at line 63 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/resolver-worker.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f0ed07e143419b4f0b1ccfb2c5ec5e7e77fbc64f9bacc61490a7c5399974c2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/resolution/resolver-worker.ts\u0060 reports through \u0060console.*\u0060 at line 94 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/resolver-worker.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b19017bfa5034fed51ecec36cd7f3dbf397dfc562971b08eb35a8bc017fdd7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/installer/targets/shared.ts\u0060 reports through \u0060console.*\u0060 at line 218 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/shared.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d2e7946c4209c7be0094bb94bb9881cef066ba7b36945d07637c19d48d5f4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/installer/targets/shared.ts\u0060 reports through \u0060console.*\u0060 at line 219 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/shared.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e55d081d8ceb4379181525dd25c4f768ade4c180f2b92b39afe524591056f7c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/extraction/grammars.ts\u0060 reports through \u0060console.*\u0060 at line 548 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bc0d957fdba805d751e11a8ef387827db4776c78a9e771585df24c295c2fd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/extraction/store-worker.ts\u0060 reports through \u0060console.*\u0060 at line 127 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/store-worker.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"17983c68dedb3c3195dd15c2b7d5a165097947115ac4ef12f8eff2097feccd81"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/db/queries.ts\u0060 reports through \u0060console.*\u0060 at line 737 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3320fdb5f17a746e37ede28328eca20a248db3c0bb682d0ca43100bc86dcece"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/db/queries.ts\u0060 reports through \u0060console.*\u0060 at line 823 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"92560f7c8423e8a240cafc06ab743235b033c247cf4a4a63d71f1d0c0f1572f3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/db/queries.ts\u0060 reports through \u0060console.*\u0060 at line 979 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"df76f52bc4235d52c275b032ce0de7908b5197e44122c41375f3ed47a2060744"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/db/wal-valve.ts\u0060 reports through \u0060console.*\u0060 at line 143 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/wal-valve.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b961a3e5b0259ec83b52102a4691415aaff9bba21864f4c4cda2aaf262d34e0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/db/wal-valve.ts\u0060 reports through \u0060console.*\u0060 at line 165 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/wal-valve.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17de56799e816ebfc80d68f1d5806d7498bd404b714fd34383dc6f16fe48cd3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/db/wal-valve.ts\u0060 reports through \u0060console.*\u0060 at line 295 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/wal-valve.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceea9dfe57ce58181b04fbdca6375586294bb64ff79a7eacab751072183ac25"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060superagent\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41ff11a52b7f8a9b6c64d2b11775779cd3240d18e55fbf859f1e3a1e82ddea5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060superagent\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/effects.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8afb8b655354ec07d98409e146bfcab1b5d603511427f9a5ebb1f4a5e90dd93"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060extractNodeCode\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b676b3789c70c3ba607b17efb33d3a0d09bf2ae6337d18d1187e412d93c2628f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractNodeCode\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fabd04c4030e5f2a7c95fb48c7c13a39adde32e00a289e3590d4ae54fff16e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060indexAll\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":2551}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc2510dd63c285d228202e17864047e7f25eb480233f15dc716927995afd237"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060indexAll\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee5799b3664233dc896269f6b16b0300a5dc03aea61459b30c3be8eef12fc9a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to unique.filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":3870}}}],"partialFingerprints":{"codehealthFindingId/v1":"deffb6a039f7063512a8fb8bf6cd6b26b8d38e0c6d3e445300dad8302a6d0df5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060sync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":3935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1175c827b9f94daf483811c1d315a33439cdb7d265be225b18e458bd2279d5fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060sync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b28ed1e9f75d98aa156f1e25c27eadda42c8bf3e4a6d65655a272c6dd57a77"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060treeFor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"972c738f8c37daad936f5bc80db51db1aed3e180b5f685006d68142a5052ad6f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060treeFor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"23faaa797dfea5aa5bdc0a4fefa8b9473258e1f76b0e0bf440479b504792e0c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060runInstallerWithOptions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aa5aabbc7e4dd9ec16694f5840115e629a274d8734e95c2249fd6a15298991"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060runUninstaller\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0331b8998f814805e2f95077c669fb65dca691d72a898d92246c79077df85971"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060clearStaleDaemonArtifacts\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcec5bd8390f1320ea3529dc5ed60d62766ed49c7a067584f820a3d525aceb8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to some\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dd77eec2c06e50f645ab0f031acef18020a32e78d9722727c9880435c04938"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060clearStaleDaemonArtifacts\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b3f08adddcbb7f153de8cd58a707bbb68a71310c3a2d5f773aa7b5da3aa0c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060stopDaemonAt\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4de4f74e52cb4941cc5b5888c4891c61196b47f0d7ccab4b67aacef8e9db0d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060daemonStopFailureMessage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8b1208984a8fe81d0970d16d6a13b3dd0a53aa6a1d42a1acdbc48a22515232"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060sameLock\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d4f4617ac3a83b2d9842ab937fc572275f04a0294a8a270acc2f71783f9b8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060stopOlderDaemon\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8591db4c838d7e34e9f5e8aa34ea6fbcf578a8c26b96bfc7caa90fbcc3e42e28"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d034e3c4e075f3c0fba3f04c74b1f497d3d28ff569748925a360c79cc0c218b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"37333948666de71830d815cecbbf5ea1a99fa561b0126d8a4493996ab69c897e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060callback to server.listen\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfbe6479391091ce2e397364fecff6d1a33b123729c6cfb053467b6c3e4730c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b799f9deaa0eef7ad1f7cc1fbcdf5e1fa6eab083b9c8aef8aa134c68ac50136"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060stop\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f21ba5cb459406507c669a3854218d0eedd7d2089966fb3c5bbd7441eaf6724"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060outwaitCandidate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/index.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9cf1d0f96762de8dbe920879dc9058d6f1274e431c33dadfbfa4633ce5184c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060runProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/proxy.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b349324f86d44eedd481e2ce6515808c90e5a1fa3c0ab4ec7a0c2494c30cf6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060connectWithHello\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/proxy.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8447642775a8567a19ccfdfb2f7a30f42cfe8ca81ba8c8ecd367e5d6cda1727c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060execute\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3098}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7f90e30b91685e0ba922bfe68ef3188754be13f74a42de9857568b702fc059"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060handleExplore\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":5996}}}],"partialFingerprints":{"codehealthFindingId/v1":"04420fb305759f8c9b94b4ef2c2464e3eaf77a70fa1e24fb53646e3ff8477012"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060handleExplore\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":6003}}}],"partialFingerprints":{"codehealthFindingId/v1":"984cac7853efa662751a217d7b0e37cb1f67a1534d125f330b61603d7504c9aa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060handleFileView\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":8374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dd55769b48b8ea2b994fc1e028ceaf466c9cd2e7f4ad5c5c8e92f8a7244e2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060flushNow\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa6c0298e80ca52598041e3ff5b4954c2febcb02a5b1c505fc7d582aed0c78a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060flushNow\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf636a10458f5145b19a6ec12f6bb1ab0639af98f0997c7835c04a2ceb97d0fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060buildSource\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/source.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da70e537792cf17ad14d004824960a71a5404344995a6cef8ca43c08b6cfbe7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060buildSource\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/source.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ae166506424bb25337792879fc7e2bcc99a3bfc9d1e3b503afb10599b4fe5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 10 sibling directories (46 clone groups): 46 duplicated blocks under src/ have copies in at least two of the sibling directories context, db, extraction, graph, installer, mcp (\u002B4 more sibling(s) not listed) \u2014 36 of them are reported below, and 10 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 46 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 46 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 46 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/parse-pool.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce082f9d855f28bf57f78c8527dcf66cfb63d2c7ea7bc3b31d5100755fba96a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (29 clone groups): 29 duplicated blocks under the repository root have copies in at least two of the sibling directories scripts, src, telemetry-dashboard, telemetry-worker, ui \u2014 15 of them are reported below, and 14 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 29 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 29 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 29 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/flow.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6561213d011ac00262edd134838f1dce75a4cd58057d64377420c0e3d2c58b8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (181 matched lines \u00D7 2 locations): ui/src/views/ScreensView.svelte:41 \u00B7 ui/src/views/StepsView.svelte:72 \u2014 the two spans are one implementation copied and then locally edited \u2014 1608 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":"ui/src/views/ScreensView.svelte"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39bfcd95833c2950a66eab352110f5a990ac951e6866e62f0bb853e5d944d51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (135 matched lines \u00D7 2 locations): src/extraction/parse-pool.ts:39 \u00B7 src/mcp/query-pool.ts:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 1023 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":"src/extraction/parse-pool.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeaa6d901e45ebd4462839d3e2ffd0b1ce2f53c6276925cb8f72cba49424165"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (97 matched lines \u00D7 2 locations): src/extraction/astro-extractor.ts:72 \u00B7 src/extraction/svelte-extractor.ts:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 743 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":"src/extraction/astro-extractor.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3be869c8b3b5b29438b1c8cbe1a971583c81ded12fdc5caacb26eb87baff1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (91 matched lines \u00D7 2 locations): src/installer/targets/copilot-jetbrains.ts:96 \u00B7 src/installer/targets/copilot-vscode.ts:65 \u2014 the two spans are one implementation copied and then locally edited \u2014 762 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":"src/installer/targets/copilot-jetbrains.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d6ae8a97dceef5c586f7a5dbb5ca9ce71b1a23918a1ba16032012f17401c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (84 matched lines \u00D7 2 locations): src/extraction/svelte-extractor.ts:25 \u00B7 src/extraction/vue-extractor.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 596 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":"src/extraction/svelte-extractor.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb59c86e52912ffee4a73ebafc7057e50f9d087fc7357cb015d0fbc46cc8c65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (84 lines \u00D7 2 locations): src/ui-server/api/flow.ts:91 \u00B7 ui/src/lib/wire.ts:488 \u2014 the 2 copies are spread across 2 files, 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":"src/ui-server/api/flow.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"708115e3317931c287ab1a5684242bfec08018abc6aee42b50d2db1d3de8d83f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (76 matched lines \u00D7 2 locations): src/installer/targets/gemini.ts:48 \u00B7 src/installer/targets/kiro.ts:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 632 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":"src/installer/targets/gemini.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d7797d1428c186bdefc10205c6f640850984deee57a9087c67f9eed0a5d66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (68 matched lines \u00D7 2 locations): src/resolution/frameworks/svelte.ts:53 \u00B7 src/resolution/frameworks/vue.ts:95 \u2014 the two spans are one implementation copied and then locally edited \u2014 375 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":"src/resolution/frameworks/svelte.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"660377a6ef227aa06573bfdf664933aa4784c8910a9d5a888f05a28dae4cc9e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (66 matched lines \u00D7 2 locations): src/extraction/languages/javascript.ts:31 \u00B7 src/extraction/languages/typescript.ts:211 \u2014 the two spans are one implementation copied and then locally edited \u2014 441 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":"src/extraction/languages/javascript.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d0fabbceff624c9c68d23a4dbeca4d9f032bb7c97e06a52dfe5e20bbeff5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (63 matched lines \u00D7 2 locations): src/ui-server/api/steps.ts:59 \u00B7 ui/src/lib/wire.ts:711 \u2014 the two spans are one implementation copied and then locally edited \u2014 332 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":"src/ui-server/api/steps.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f15150b70877a6d268bc5098ad0aeb8f060e8005bf3f3b736af308770d5a01a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): src/extraction/vue-options-api.ts:42 \u00B7 src/resolution/frameworks/object-literal.ts:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 399 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d596c8f89225fb0d66b9a590600e3bfa2932df1118b68e41014b58fc988df47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): scripts/agent-eval/probe-file-spend.mjs:34 \u00B7 scripts/agent-eval/probe-suite-envelope.mjs:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 487 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":"scripts/agent-eval/probe-file-spend.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ef093b05cb00737987452eae3f74064b21cf42122104521e6a08c8402cb1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): src/resolution/frameworks/tanstack-router.ts:330 \u00B7 src/resolution/frameworks/vue-router.ts:306 \u2014 the two spans are one implementation copied and then locally edited \u2014 380 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028a9bee0fcc6665663944c8c064bdf95828799cfa166a2c8be925fe173cd5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:734 \u00B7 src/resolution/frameworks/nextjs.ts:221 \u2014 the two spans are one implementation copied and then locally edited \u2014 365 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06069c91213264fa3dc788635679b0e40e600d2700dc0fd5b978bde07e7f7ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): src/extraction/liquid-extractor.ts:246 \u00B7 src/extraction/liquid-extractor.ts:319 \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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"288cd3190deaf71f2d98981812ac4d3924735ada38104e2de316bf6483957074"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): ui/src/views/MapView.svelte:58 \u00B7 ui/src/views/ScreensView.svelte:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 304 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":"ui/src/views/MapView.svelte"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"214269d1aecaa29e7c5e7124faefc3f678c90f5af54fcc85b964584c420f78b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): ui/src/components/file/FileCodeBlock.svelte:37 \u00B7 ui/src/components/symbol/SourceBlock.svelte:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 352 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":"ui/src/components/file/FileCodeBlock.svelte"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1bf9481da0bb83459b533820f28d9dc672e9f79c492486f9a8cc4872c320d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): src/resolution/sveltekit-synthesizer.ts:47 \u00B7 src/resolution/tanstack-router-synthesizer.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 471 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":"src/resolution/sveltekit-synthesizer.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e245d1fb5c6f1c2d617b0adb579eac328be48b261527a5b178a1ac6625b892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): ui/src/components/file/FileCodeOutline.svelte:25 \u00B7 ui/src/components/file/FileOutline.svelte:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 368 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":"ui/src/components/file/FileCodeOutline.svelte"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5084c113cd3fcbf88caf5bce038997f98b7b72aa50877253f855d4d8e17c8d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): src/ui-server/api/screens.ts:44 \u00B7 ui/src/lib/wire.ts:660 \u2014 the 2 copies are spread across 2 files, 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":"src/ui-server/api/screens.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f134b1c22da1705228db3fed0b08f5bcf8fef3ffad012ad0abe4f6d334ed6236"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): src/installer/targets/kimi.ts:49 \u00B7 src/installer/targets/pi.ts:56 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/kimi.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc3d91f82b1cde408511a9efa9c4c3062e9faaedeb90ea3b708e771f181306"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (40 matched lines \u00D7 2 locations): src/resolution/frameworks/astro.ts:26 \u00B7 src/resolution/frameworks/vue.ts:90 \u2014 the two spans are one implementation copied and then locally edited \u2014 222 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":"src/resolution/frameworks/astro.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"db52a0252ec018749eb1ab0070f28b067f451ca7ed22e2fd53580c8184e6b38b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (40 matched lines \u00D7 2 locations): src/resolution/frameworks/react-router.ts:95 \u00B7 src/resolution/frameworks/sveltekit-router.ts:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 421 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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeb4304650466704fd758bafcbf29ccdb40eb46422fb666ae4a7d8e6fd1dc1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (40 matched lines \u00D7 2 locations): ui/src/views/FileCodeView.svelte:91 \u00B7 ui/src/views/FileView.svelte:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 262 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":"ui/src/views/FileCodeView.svelte"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"049e77b44b00252fabe92748aba787f96e6064a1852d7b5ed3c2bee3615bf094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): src/ui-server/api/trails.ts:72 \u00B7 ui/src/lib/wire.ts:980 \u2014 the 2 copies are spread across 2 files, 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":"src/ui-server/api/trails.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4ff810755a4dfda71dd59bfed5954b974d5c6a02da5a78b1c8810f9ea19f72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): src/installer/targets/claude.ts:106 \u00B7 src/installer/targets/cursor.ts:88 \u2014 the two spans are one implementation copied and then locally edited \u2014 270 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":"src/installer/targets/claude.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea237d887a6d76041fc94c8d79a82305eea5511ded6b9fd6362c00b53dcf3670"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): src/extraction/dfm-extractor.ts:38 \u00B7 src/extraction/liquid-extractor.ts:62 \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":"src/extraction/dfm-extractor.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"756da62934973739d05f169c802977184f1fd3401ba4eef715cde8f5be471896"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): src/db/queries.ts:2798 \u00B7 src/db/queries.ts:2854 \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":"src/db/queries.ts"},"region":{"startLine":2798}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b36016dc2803e0cb618841df7c947517235b1a4751738a02283cf9be10d393"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): src/installer/targets/copilot-cli.ts:126 \u00B7 src/installer/targets/copilot-jetbrains.ts:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 208 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":"src/installer/targets/copilot-cli.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c6f99df89bf99d9f2a6c6236148f1b77b3786b9e0e81a09a40abacafb12ea1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): src/mcp/tools.ts:3454 \u00B7 src/mcp/tools.ts:3538 \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":"src/mcp/tools.ts"},"region":{"startLine":3454}}}],"partialFingerprints":{"codehealthFindingId/v1":"75425fc6b5feb6fae27862b1723e5a26ff320fc0ca47a4ee3e6fe1675b6bcd6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): src/resolution/frameworks/astro.ts:89 \u00B7 src/resolution/frameworks/svelte.ts:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 236 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":"src/resolution/frameworks/astro.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"02323efa902ceebf3ce5502465d7ac438b4cd28e7bd4151c8d318be95d144600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): src/ui-server/api/filecode.ts:81 \u00B7 ui/src/lib/wire.ts:282 \u2014 the 2 copies are spread across 2 files, 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":"src/ui-server/api/filecode.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0a46c722a22da517e9578228a7a43ef964dd2c4c53352cc9ad6f0a86bf5cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): src/graph/traversal.ts:310 \u00B7 src/graph/traversal.ts:368 \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":"src/graph/traversal.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df41ed7b423cf20ebb80ee1eb8771ac635b5c6d03c68848c825d3d48dfa5f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): src/resolution/frameworks/react.ts:388 \u00B7 src/resolution/frameworks/react.ts:428 \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":"src/resolution/frameworks/react.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f3b5107bdd102ed71817c27c0e5c74ff951b1824f4a890dd74f76b809e723"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): ui/src/lib/map-model.ts:481 \u00B7 ui/src/lib/steps-model.ts:1060 \u2014 the two spans are one implementation copied and then locally edited \u2014 291 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":"ui/src/lib/map-model.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8f54fb3eb07d57e204aa4c50b748b0850fe41c0450ab7d8ba9148128330ad4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/extraction/liquid-extractor.ts:60 \u00B7 src/extraction/mybatis-extractor.ts:87 \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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e14bd06388be1aaf1e7e759d43fa16e82cb638c0dd5ab13a62198933c82cd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/ui-server/api/program.ts:37 \u00B7 ui/src/lib/wire.ts:850 \u2014 the 2 copies are spread across 2 files, 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":"src/ui-server/api/program.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aa51b267fd237bc3a0c3bc2f209741c3fbabf8101db4dffd5d66c42836e391"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/db/queries.ts:753 \u00B7 src/db/queries.ts:983 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e51edea09a28abb8987292f169d2fc7cb2be59e06dd9ae593d2dfc6e3a91fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/resolution/strip-comments.ts:545 \u00B7 src/resolution/strip-comments.ts:619 \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":"src/resolution/strip-comments.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aff8ac81a09a3d459511301d4c93756a4458f2a5004bb9b831a169722195fa3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): src/graph/file-cycles.ts:36 \u00B7 ui/src/lib/map-model.ts:666 \u2014 the two spans are one implementation copied and then locally edited \u2014 230 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":"src/graph/file-cycles.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"add1979167829f902641555bc246285f883ba26e04e48707009c8145381eafd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/resolution/frameworks/csharp.ts:114 \u00B7 src/resolution/frameworks/java.ts:187 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"417f14385ac219d03e3c48458f6d984738d2e5a15f353012f27ef6d0ca05dd08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:2144 \u00B7 src/extraction/languages/c-cpp.ts:2582 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2303f6702416a345dcd7a84022c3ba4c5c353c93b06241799259c4a290d83a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/graph/traversal.ts:525 \u00B7 src/graph/traversal.ts:550 \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":"src/graph/traversal.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d209b2c91349b00ea9756fbb92f6514a9693978f10972edbccbc8ebdb45ef8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/resolution/frameworks/rust.ts:184 \u00B7 src/resolution/frameworks/rust.ts:218 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/rust.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d859c2bba67894368b7b9ffc61f4a8c861dcf3738039f844e56fb7f378d31107"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/resolution/frameworks/csharp.ts:210 \u00B7 src/resolution/frameworks/laravel.ts:137 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1fe4aedf5cedb0772e8c759a22f7751b4824c6b55b3bd323db950ea12068f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:200 \u00B7 src/resolution/tier-synthesizer.ts:97 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"20782bc0de884af2fdd89449037ee064059a21001a42b6e0072f3ba4840e3cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/resolution/index.ts:2474 \u00B7 src/resolution/index.ts:2596 \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":"src/resolution/index.ts"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d62a62aca01adc0a6513d88f89fe14893d00eade1d0a9dc0d8e79c1867416cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/resolution/tanstack-router-synthesizer.ts:38 \u00B7 src/resolution/vue-router-synthesizer.ts:36 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tanstack-router-synthesizer.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f117264de7bb1d0681e1254eb95e79ed53872c5f15f3950b72b26581170e1db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): src/extraction/tree-sitter.ts:3694 \u00B7 src/extraction/tree-sitter.ts:3875 \u2014 the two spans are one implementation copied and then locally edited \u2014 200 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caf47a84785265431820fad8ea3f9c741d9102a669edd55a403347139636a92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): src/resolution/frameworks/csharp.ts:210 \u00B7 src/resolution/frameworks/go.ts:142 \u00B7 src/resolution/frameworks/laravel.ts:137 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5db68cc966ab3041d65ce9aa25db5193a9a2f2224b06ef220222a2c428bb14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:1321 \u00B7 src/extraction/languages/c-cpp.ts:1586 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bec810cda0c6cb06580e074201c0c5f9cec2854af27be0ed11cc22acaf16c64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/graph/branch-guards.ts:1001 \u00B7 src/graph/branch-guards.ts:1072 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cae035236540e8abbd727a5035db3f696b17e66b4c20dcf6815ec7754890e43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/prepare-release.mjs:75 \u00B7 scripts/prepare-release.mjs:111 \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":"scripts/prepare-release.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88e3a8aac5328d0a7efd15d25e09d6e8ae3c378870f58866378f2df3c89cc31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4 locations): src/resolution/frameworks/nextjs.ts:342 \u00B7 src/resolution/frameworks/react-router.ts:214 \u00B7 src/resolution/frameworks/tanstack-router.ts:455 \u00B7 src/resolution/frameworks/vue-router.ts:532 \u2014 the 4 copies are spread across 4 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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc804b6f5d56939f6906bb89cd2adfee14914fafea39d259ea451c7a07436be6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/extraction/kernel/decode.ts:106 \u00B7 src/extraction/kernel/decode.ts:135 \u2014 the two spans are one implementation copied and then locally edited \u2014 226 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":"src/extraction/kernel/decode.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"02530b368e39160e2a9fbe6f60b4d69e77e6a5b52f27a52e0ca181ba6d7765ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/file-limits.ts:77 \u00B7 src/file-limits.ts:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 166 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":"src/file-limits.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd13dc089ab2261a4e3adf36063f7ffb7f96feefbad9698eb1d2151be302401"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/installer/targets/antigravity.ts:246 \u00B7 src/installer/targets/gemini.ts:131 \u00B7 src/installer/targets/kiro.ts:131 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/antigravity.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e670cd3767bab4369c673055cf4d0965b7f49376990c5801efa665c48afbaee1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/installer/targets/droid.ts:60 \u00B7 src/installer/targets/kimi.ts:73 \u00B7 src/installer/targets/pi.ts:80 \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":"src/installer/targets/droid.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c14bb5a420761773122969b90e63229abc4c6db92e6d3fdda9dd62a51d8e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/mcp/tools.ts:3401 \u00B7 src/mcp/tools.ts:3490 \u00B7 src/mcp/tools.ts:3572 \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":"src/mcp/tools.ts"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"697f327a9641e1f21c2ec915ca8aa63a0ce434aba24bc68e9ebfeeba6edc71ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/resolution/frameworks/ruby.ts:398 \u00B7 src/resolution/frameworks/ruby.ts:428 \u00B7 src/resolution/frameworks/ruby.ts:476 \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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"642438d68daa9310165b2f106c99da9e213b7560f5e95a2d93f64bf2c210eaed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/resolution/name-matcher.ts:28653 \u00B7 src/resolution/name-matcher.ts:28737 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":28653}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c7851faba2dda273c17d78c353466292cf8d981620e51c155649b1eba9f937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/resolution/next-router-synthesizer.ts:89 \u00B7 src/resolution/sveltekit-synthesizer.ts:87 \u00B7 src/resolution/tanstack-router-synthesizer.ts:77 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"36680630b0022614bf3c603e8df4cc96db3441f8e3c7d9caf904b1a41a4f0578"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): scripts/agent-eval/parse-arms.mjs:21 \u00B7 scripts/agent-eval/seq-matrix.mjs:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 311 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":"scripts/agent-eval/parse-arms.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d362cdd609b77185e1b56c4e2bd0177d6aec68493db2e73eb3af03a9eaebbc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/context/index.ts:1166 \u00B7 src/context/index.ts:1195 \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":"src/context/index.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"653cc602b08846e939ea4becddb9f4f196faadb0dde12543eb5752df88072fa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/extraction/cfml-extractor.ts:96 \u00B7 src/extraction/liquid-extractor.ts:60 \u00B7 src/extraction/mybatis-extractor.ts:87 \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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c2096407136492221872f59273ee04c5d1e2e4070c9050444a097ebf7d0954"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/graph/branch-guards.ts:1679 \u00B7 src/graph/branch-guards.ts:1859 \u00B7 src/graph/branch-guards.ts:2019 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3fbd2bca27ef87ec9a4ee9b6c14a31304c499f289520f866772c10c49619a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/project-config.ts:213 \u00B7 src/project-config.ts:262 \u00B7 src/project-config.ts:290 \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":"src/project-config.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e368c99bb35e58fd755b482e4bcd6b6b7dbcbfc4fe0d5513cf5f9bf6d9c667"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/resolution/frameworks/nestjs.ts:587 \u00B7 src/resolution/frameworks/nestjs.ts:848 \u00B7 src/resolution/tier-synthesizer.ts:195 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc5b974b08a2a06905566ef1fddff330bd9c3bed7d3eeaf77c57eec107711b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/resolution/frameworks/python.ts:482 \u00B7 src/resolution/frameworks/python.ts:528 \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":"src/resolution/frameworks/python.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d0769c86ba7d0f3e709da52dda4d14fee878a370172c50dba52cdeb539b1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/resolution/frameworks/react-native.ts:133 \u00B7 src/resolution/frameworks/react-native.ts:194 \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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a6d56702fc09384f124191a4e2a977dd19206ba7ff0c5f80ee8363617ecd5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/resolution/jsx-code.ts:244 \u00B7 src/resolution/jsx-code.ts:418 \u2014 the two spans are one implementation copied and then locally edited \u2014 116 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":"src/resolution/jsx-code.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"22701d3f878e4788d827cf605cf49bf6fb26f1ff9b71c8e9746477144c4662f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ui/src/views/FileView.svelte:171 \u00B7 ui/src/views/SymbolView.svelte:332 \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":"ui/src/views/FileView.svelte"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d84e839a7bb847a7e52e5d80720b5ad815f89580735e0c36661b817523b2177"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/db/queries.ts:910 \u00B7 src/db/queries.ts:2707 \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":"src/db/queries.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"a535551e2ff95e959ae8f8fd6a9e8eac02ed7ef92772a2c21996febc96952cea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/db/queries.ts:2752 \u00B7 src/db/queries.ts:2783 \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":"src/db/queries.ts"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20c1703bebeb551b932251abf50b605385e3bea0f73c97f66baef66cb9043bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): src/extraction/astro-extractor.ts:29 \u00B7 src/extraction/svelte-extractor.ts:25 \u00B7 src/extraction/vue-extractor.ts:41 \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":"src/extraction/astro-extractor.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c39df1af2e3aa95bff49538def2dee42e1053e177776877cfc732d06cdd14a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/extraction/languages/swift.ts:121 \u00B7 src/extraction/languages/typescript.ts:243 \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":"src/extraction/languages/swift.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b15d6b9950cfaa346827673409e593113dae60678c393d49d416c969b36154"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): src/graph/branch-guards.ts:398 \u00B7 src/graph/branch-guards.ts:616 \u00B7 src/graph/branch-guards.ts:800 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/branch-guards.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"281d003bfc2ad4c289551a5ae3ab216383adbc98ac34e768cd78e1caf3e75f88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/installer/targets/antigravity.ts:158 \u00B7 src/installer/targets/copilot-cli.ts:107 \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":"src/installer/targets/antigravity.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e37703f582796ac46c4b9b2ea1955fea5b3a931b4723836ee6159f3889b045"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/mcp/tools.ts:3212 \u00B7 src/mcp/tools.ts:3306 \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":"src/mcp/tools.ts"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3184a8210f0bb86cd2a68a19e230fbff09af4126246d5a18cb287ed69bd4b22a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:1382 \u00B7 src/resolution/c-fnptr-synthesizer.ts:1419 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e9b24f6423b6754df854e0a497c1c44ace261e5ded43b2f9ba53d1b9083f9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/resolution/frameworks/csharp.ts:181 \u00B7 src/resolution/frameworks/rust.ts:132 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26331ea842787d2d18f8f66f6ea56508bfaf10af46d85fb457a1624c6595429"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/resolution/frameworks/fabric.ts:154 \u00B7 src/resolution/frameworks/fabric.ts:234 \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":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"080f01b5e218366421c225271363189b0fa5c8a1c0e6a4b26af7c128248e9925"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:267 \u00B7 src/resolution/frameworks/nestjs.ts:142 \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":"src/resolution/frameworks/java.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f979e11e33a857c84ebc2a3ff0c1d9be26e07a1813cd81376624e5187f9166e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/resolution/name-matcher.ts:22919 \u00B7 src/resolution/vbnet-receivers.ts:125 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":22919}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb69d37f24cb3fc897ab0e690941a14227dfeab36cafb69c2acc22bfe26124b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/extraction/index.ts:2003 \u00B7 src/extraction/index.ts:2024 \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":"src/extraction/index.ts"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d649c4df90547bbece06e4d7aa2d93bb2f8596c393a2b621efb54c8ec8dfccf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/extraction/kernel/index.ts:267 \u00B7 src/extraction/kernel/index.ts:334 \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":"src/extraction/kernel/index.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9101744bccb352030ba76d89836cf7e1216a484719780081a48388109e67b74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/extraction/languages/lua.ts:113 \u00B7 src/extraction/languages/r.ts:191 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/lua.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8c5e5a3b637f4586c4830f8e334403f18d685a498a542722d93babb3a43687"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/extraction/razor-extractor.ts:55 \u00B7 src/extraction/svelte-extractor.ts:10 \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":"src/extraction/razor-extractor.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dd5cb23c7f077b77e0031b40976de2cf86cc429c366cb15dcf9aa9f3b6d089"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/extraction/razor-extractor.ts:87 \u00B7 src/extraction/tree-sitter.ts:1089 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c85fcf2af1932912d40fbd001cf98a50bd98aa9ca95392abf505ba1a13f33c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/installer/targets/dsh.ts:276 \u00B7 src/installer/targets/windsurf.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"src/installer/targets/dsh.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65f2d0e83058566b4f8e387cca241f936713a5638ad645bda876b588468aa05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/mcp/stdin-teardown.ts:26 \u00B7 src/mcp/stdout-teardown.ts:25 \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":"src/mcp/stdin-teardown.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"79166a4a555c952243536520bde99fa0f5284de2e9f659d43902637314af2874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/resolution/angular-template-synthesizer.ts:174 \u00B7 src/resolution/frameworks/angular-router.ts:878 \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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f9c3e9758c854b2183a4d92b2ea19ed1fba0f022c688acb12d01f534d005d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:393 \u00B7 src/resolution/callback-synthesizer.ts:3219 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df3e89bacfdfc864eb6a3bfc9f427ae17d20d614dc3126b2338bcf83508e93c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/resolution/cpp-type-aliases.ts:222 \u00B7 src/resolution/name-matcher.ts:894 \u00B7 src/resolution/type-parameters.ts:322 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f884dccd8abe0fd3efbc9b08a41791ce25cb4c3fd782dbfc6139c9bafd4e718b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/resolution/frameworks/angular-router.ts:1013 \u00B7 src/resolution/frameworks/vue-router.ts:427 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd66d46d82b7c631b950964a57d394f906327a41d0aceaf153179838abbdcaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5 locations): src/resolution/frameworks/angular-router.ts:1100 \u00B7 src/resolution/frameworks/nextjs.ts:348 \u00B7 src/resolution/frameworks/react-router.ts:220 \u00B7 src/resolution/frameworks/tanstack-router.ts:461 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 5 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2655c64b6210e1623bd3e4c9e3e8cb168c5bc1854cdd5b3fe692640824acc79e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/resolution/import-resolver.ts:3247 \u00B7 src/resolution/import-resolver.ts:3299 \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":"src/resolution/import-resolver.ts"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c129f5ab25b2e5b741ea733743fe39b3541c02a02d77f1859f83523beb1dd55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/resolution/strip-comments.ts:392 \u00B7 src/resolution/strip-comments.ts:444 \u00B7 src/resolution/strip-comments.ts:504 \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":"src/resolution/strip-comments.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb4d72793a123f9508a20714fb66b07272fdf5f36ba4cf5a80eb999d5e55c12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ui/src/components/SearchPalette.svelte:68 \u00B7 ui/src/views/HomeView.svelte:42 \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":"ui/src/components/SearchPalette.svelte"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6113689b537f58116829c3706aa3f60207979a4e47b7b9dfecddb79e26a425f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): scripts/agent-eval/probe-decl-only.mjs:70 \u00B7 scripts/agent-eval/probe-factory-closure.mjs:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 170 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":"scripts/agent-eval/probe-decl-only.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a8c1f208607280d0e39ac5ae9c9c18d0a9fa560df7ab7e326c9ecbe7876e7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/db/queries.ts:3777 \u00B7 src/db/queries.ts:3814 \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":"src/db/queries.ts"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be0205d26997f217feca7821e1c8eaf2b6541db6a4e9c9b2d3a7d00c109774"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): src/extraction/languages/rust.ts:119 \u00B7 src/extraction/languages/swift.ts:121 \u00B7 src/extraction/languages/typescript.ts:243 \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":"src/extraction/languages/rust.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa87d32c75ddc2171b5d22098f2770283b21a27dfb876b6097b61c5fe8432e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/extraction/store-writer.ts:83 \u00B7 src/resolution/resolver-pool.ts:233 \u2014 the two spans are one implementation copied and then locally edited \u2014 132 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":"src/extraction/store-writer.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1537ca766d45029bedffe44a27bdcd79ea07fd82f6e21c15c4a8feda38da94f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:634 \u00B7 src/resolution/callback-synthesizer.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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8732bf3e3ad75c14673804d5cf030e0243e60e6bd70910b51a31ada877d9acaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/frameworks/express.ts:213 \u00B7 src/resolution/frameworks/express.ts:251 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/express.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f831c29c3b575f978e3c1ef27de54891d9571e7a2ade5064032147b87c7e24ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/frameworks/fabric.ts:193 \u00B7 src/resolution/frameworks/fabric.ts:268 \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":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd37f29720bcbefbc8cb8d2051cb6889f1b264b0cd312f0ef7b4b32ecfc3461"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:45 \u00B7 src/resolution/frameworks/nestjs.ts:63 \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":"src/resolution/frameworks/java.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9a7e35b4b1ed443a6e314ae95749392a369fc052ee29d8d12ac441313a363c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/frameworks/laravel.ts:519 \u00B7 src/resolution/frameworks/laravel.ts:539 \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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0830b301cdb41b6d3a745a38ca68ad685c64452e600ae152dc12f257e06a68af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/frameworks/react-router.ts:192 \u00B7 src/resolution/frameworks/tanstack-router.ts:438 \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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"450010c2c78bdc2c10b20f6a11058b6dc5eec95b9824ae27860d2ddd8a7811af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/frameworks/react.ts:148 \u00B7 src/resolution/frameworks/svelte.ts:140 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/react.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88af1225cd999e7fae33c1b6fbd746a51c60f5353167b4bf17e3834a9dba32b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5007 \u00B7 src/resolution/name-matcher.ts:7935 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bb543de0eee7401df5a59e00d031986c33a4cf7e883fd5fb393be8ccbad713"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): src/resolution/react-router-synthesizer.ts:116 \u00B7 src/resolution/sveltekit-synthesizer.ts:53 \u00B7 src/resolution/tanstack-router-synthesizer.ts:47 \u00B7 src/resolution/vue-router-synthesizer.ts:45 \u2014 the 4 copies are spread across 4 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":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96664de180577b9d29fbbe10c5a7f072f6cef8a30d36ce13f2b5ab02dcb22d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/extraction/index.ts:2990 \u00B7 src/extraction/index.ts:3045 \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":"src/extraction/index.ts"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec722d0f14769f56320c2a05a144aec01ea3026fb2a801c91a49c469c1053b76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:313 \u00B7 src/extraction/languages/scala.ts:165 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"502b98d541aeb4ccd42150fe34ab15b8621e5ebbaf1c4d26ecb239ad210f6105"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/extraction/store-worker.ts:75 \u00B7 src/resolution/resolver-worker.ts:49 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"src/extraction/store-worker.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc338d761bf4e798a02d2545b72d2388cd648a692d3d11c78f2243771830b40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/installer/targets/bob.ts:57 \u00B7 src/installer/targets/qoder.ts:60 \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":"src/installer/targets/bob.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e201f01ff8285f34de8ac9480ca019b8d35ecbdefc323d267ef939bef0a9b49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/mcp/proxy.ts:627 \u00B7 src/mcp/proxy.ts:758 \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":"src/mcp/proxy.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de9d6ded1771bc1125cfcb3e994cfafe1816985f81b8729a11a9d7da9a00a91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/resolution/callback-synthesizer.ts:4132 \u00B7 src/resolution/callback-synthesizer.ts:4222 \u00B7 src/resolution/callback-synthesizer.ts:4318 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2656a24a52c645a7658741433e203976c5db6ea2ef7bad6f90033bce2203fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4206 \u00B7 src/resolution/callback-synthesizer.ts:4302 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d527d20a69a1ec398507f5ba5df25b12966346e5c2e66895cb17826b417a7c9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/frameworks/csharp.ts:20 \u00B7 src/resolution/frameworks/swift.ts:93 \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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"35495b0f6479e9c72fcc2d467077d9e5f1260123ce5c21d2b564e67ad7e923fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/resolution/frameworks/goframe.ts:86 \u00B7 src/resolution/frameworks/rust.ts:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"src/resolution/frameworks/goframe.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1307f86f4dcbd6c4d778a11cb10ab2b720e6c731ee0e034b247e33a956f24405"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/frameworks/react.ts:306 \u00B7 src/resolution/frameworks/react.ts:338 \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":"src/resolution/frameworks/react.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b1b3298f98dc2274aa8ef8212a9324bf79ee28bea5de5247896859d60b340b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5139 \u00B7 src/resolution/name-matcher.ts:7478 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f602f26160a350d78501a18600fc841c76ae8905ae6eda9ca9c8b999d2af40e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/strip-comments.ts:426 \u00B7 src/resolution/strip-comments.ts:486 \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":"src/resolution/strip-comments.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34ac64ad90555be9c2a4e810ddcac28c73741fbe4d2a411c6f02f2543113fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/workspace-packages.ts:440 \u00B7 src/resolution/workspace-packages.ts:460 \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":"src/resolution/workspace-packages.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af9ca9e9db84ac8bf158aa5f5bc6e3c6d368c5b898d52ee963d3d142eb724dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/sync/git-hooks.ts:104 \u00B7 src/sync/worktree.ts:32 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/git-hooks.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98ff60db7bca4ec973b85030e1267d8f92458d90fb4f512d5d5ea9513d39605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/sync/git-hooks.ts:228 \u00B7 src/sync/git-hooks.ts:289 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 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":"src/sync/git-hooks.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"20593e1948c640d2520a1d2d5cafb801e5c901a597fbfe496c4ab0114db75e46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): ui/src/lib/program-model.ts:337 \u00B7 ui/src/lib/steps-model.ts:400 \u2014 the two spans are one implementation copied and then locally edited \u2014 144 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":"ui/src/lib/program-model.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4030e1d6bf31bc49a478f6a09a1c6e58d88f99f8035e7b2af9ae161b74f9df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): scripts/agent-eval/repro-concurrent-explore.mjs:97 \u00B7 scripts/agent-eval/repro-daemon-clients.mjs:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 205 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":"scripts/agent-eval/repro-concurrent-explore.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7de224a61091930dd4a16199346123b232fc03b55aba2290be67815368373da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/context/index.ts:73 \u00B7 src/search/query-utils.ts:248 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"643700c7d7f48fb6744e4d3e8bdc73e3b40dce3bbd534fd8529271c4807eee87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 10 locations): src/db/queries.ts:3536 \u00B7 src/db/queries.ts:3565 \u00B7 src/db/queries.ts:4431 \u00B7 src/db/queries.ts:4449 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/queries.ts"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9bf20b3e88fcaf9c119478582b07d1fe82de57edb4768d3edf94158a1cb568"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/db/queries.ts:4691 \u00B7 src/db/queries.ts:5617 \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":"src/db/queries.ts"},"region":{"startLine":4691}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ac952f5cb823be78b92c6dd1aeebcac8268ffad53758e414fd5259b8b4c07d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/extraction/cfml-extractor.ts:662 \u00B7 src/extraction/sfc-script.ts:150 \u2014 the two spans are one implementation copied and then locally edited \u2014 106 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba77d55a6a6a7ebbe0b8ae9f6148761c04bc15073ed16b103c68edade506487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/extraction/languages/c-cpp.ts:593 \u00B7 src/extraction/languages/c-cpp.ts:3046 \u00B7 src/extraction/languages/objc.ts:150 \u2014 the 3 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3a3719cf3809205465f9b83fa9b7ec391821ba106a6254c7a7d067a87140b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/extraction/languages/cpp-brace-scopes.ts:218 \u00B7 src/resolution/ambient-modules.ts:453 \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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd90e26b374d86f97f097b250f8e7f766017fd9f6b2a72f4ee2220efff9e5e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/extraction/languages/java.ts:150 \u00B7 src/extraction/languages/java.ts:268 \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":"src/extraction/languages/java.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f598590248e93403b541c4a0f3b6bad20e354c2b6ca1460bf7780dcccc9e7eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:6 \u00B7 src/extraction/languages/swift.ts:133 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/kotlin.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7727f8610ec264e12b0dd033e7879c626a2a80299f0dbeff3a2671dad593880c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/extraction/languages/python.ts:51 \u00B7 src/extraction/languages/swift.ts:120 \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":"src/extraction/languages/python.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"820a49808453cf33f5face2ca13cb8e6308292e06616d150c0987e71b3cbf69d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:7650 \u00B7 src/extraction/tree-sitter.ts:8986 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eec08200eca3b03530dbc5ad1a832e2168d6041fa6ede526db4bf4743bd2122"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): src/graph/branch-guards.ts:1597 \u00B7 src/graph/branch-guards.ts:1684 \u00B7 src/graph/branch-guards.ts:1864 \u00B7 src/graph/branch-guards.ts:2024 \u2014 all 4 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":"src/graph/branch-guards.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee9e3f05e4eb00d16c5b79040b10ea678614221b06859bba3a1a8e440e81657"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/graph/queries.ts:219 \u00B7 src/index.ts:3166 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"src/graph/queries.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"399df121cb5b0d058554c61ff1af61480ddfe1f7269453c4ee2da0b91aa3a032"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/index.ts:685 \u00B7 src/index.ts:1184 \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":"src/index.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0baff4ebdd92687e44f8acdd121fed7085ec5f1e8f6dd90307a4c6970d3acf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): src/installer/targets/bob.ts:41 \u00B7 src/installer/targets/droid.ts:39 \u00B7 src/installer/targets/kimi.ts:49 \u00B7 src/installer/targets/pi.ts:56 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/bob.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bffc9e2fe5fcc006c85b52026e8a7efbb242f3c5e641b15a1d57a01b73210af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/mcp/ppid-watchdog.ts:75 \u00B7 src/mcp/proxy.ts:787 \u2014 the two spans are one implementation copied and then locally edited \u2014 120 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":"src/mcp/ppid-watchdog.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0d07c9753ed39c44dfb320650a7d6d817ef240715ac0613bfac7d3ff6463c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/mcp/tools.ts:4301 \u00B7 src/ui-server/api/node.ts:359 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0a399825e6e7bbbce8befb38e6f4a2e291eb1d360654222deebeb1261b26bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:453 \u00B7 src/resolution/callback-synthesizer.ts:494 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff772f7612255da4c5ecdd42d424112d569a7e462f9ec2488f70d107aab206e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/frameworks/codeigniter.ts:138 \u00B7 src/resolution/frameworks/drupal.ts:622 \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":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff2336e5cc05b6cd92b782ef6a21e1246e9d38702ef868ac7108a269aff4c95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:310 \u00B7 src/resolution/tier-synthesizer.ts:134 \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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf5e9122393065ce2dbf78a2b7d7a9c9f05adeb7a41a85c815f3894cbaecf7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:459 \u00B7 src/resolution/frameworks/java.ts:490 \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":"src/resolution/frameworks/java.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e13e1044bac07d09b9be163af4ee55155eedd34fe15454f69473393ac0818c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/frameworks/laravel.ts:57 \u00B7 src/resolution/frameworks/laravel.ts:94 \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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19ec8b4448d09b1e3c2ec0b168099b9af11caaa649c6349eb959054c5fb4f8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/frameworks/object-literal.ts:81 \u00B7 src/resolution/frameworks/object-literal.ts:102 \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":"src/resolution/frameworks/object-literal.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561194cfb375522351b3b866553186d15a7e2f55a95f83450e3bbf148e07964"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): ui/src/views/MapView.svelte:174 \u00B7 ui/src/views/ScreensView.svelte:207 \u00B7 ui/src/views/StepsView.svelte:417 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"ui/src/views/MapView.svelte"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b163a7572ea11220db182fdaf9adbb8dafc2f4d00da371c6cc193894bd7c6e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/db/queries.ts:5157 \u00B7 src/db/queries.ts:5512 \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":"src/db/queries.ts"},"region":{"startLine":5157}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ea04fcb4de2f289da132e97a9f17934911fd921c4c09201989b52b28eacedc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/db/queries.ts:5465 \u00B7 src/db/queries.ts:5498 \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":"src/db/queries.ts"},"region":{"startLine":5465}}}],"partialFingerprints":{"codehealthFindingId/v1":"171abd76fbc0ed0452e71586dcd6cfd5841c6b14651c576f2815c8cad727f42a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/db/queries.ts:5684 \u00B7 src/db/queries.ts:5711 \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":"src/db/queries.ts"},"region":{"startLine":5684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18c298e140b6f03558eb4f90939f8493b243c2544e6f9fcd3ee855adc5e5a5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/extraction/languages/cpp-macro-methods.ts:484 \u00B7 src/resolution/ambient-modules.ts:455 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"644c8c3d3f3a0c1a9e7c4d18dc3dd316f81afd71787182ac8a44ca9584457c5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:528 \u00B7 src/extraction/languages/swift.ts:165 \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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fb941d0a68d715f55c5fcbd2245c7ab58cce38ee9da3e15dc89cee693c4241"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/languages/nix.ts:160 \u00B7 src/extraction/languages/nix.ts:290 \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":"src/extraction/languages/nix.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f379a7ecd6373882d9ffb46820ea954b9817d9bdae348dcfbbf7e9e1a4db710e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/languages/pascal-preparse.ts:218 \u00B7 src/extraction/languages/pascal-preparse.ts:247 \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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbfca0405a61d774e931f24585d39a8733e4bfb7ac6e76ff50f4fdb242f5714"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/languages/php.ts:89 \u00B7 src/extraction/languages/typescript.ts:254 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/php.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"16269746b95942a8378a733b0f5ec8372ba2b433b5f5a5077a585182981cc1a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:2394 \u00B7 src/extraction/tree-sitter.ts:2833 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5711b53405f595959c4c14da170c811ee25e7bd951ac9b3413944c0629ef7c26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:2423 \u00B7 src/extraction/tree-sitter.ts:2896 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf167e943d9103b4d29ca1673f6c1e32a555592983b7e2460681d11f75e485"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:6647 \u00B7 src/extraction/tree-sitter.ts:6664 \u00B7 src/extraction/tree-sitter.ts:7223 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e831218f2c615cc07fefe6dc96c94933790a91d44450bdb4ff8c1d1f686ae239"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:6699 \u00B7 src/extraction/tree-sitter.ts:8363 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6699}}}],"partialFingerprints":{"codehealthFindingId/v1":"135115b11d54813aff90d8ab63fc5100b96d387306243366e377bfedaf3b1a33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:7499 \u00B7 src/extraction/tree-sitter.ts:7529 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7499}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcf82a44ba9c2e3f5e1481bc2bd93f97bc652fc0bfc7c1d86680dcd57224e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): src/extraction/tree-sitter.ts:8027 \u00B7 src/extraction/tree-sitter.ts:8094 \u00B7 src/extraction/tree-sitter.ts:8114 \u00B7 src/extraction/tree-sitter.ts:8236 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8027}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef1668053c491d94017dccb0c9e47a557ef2146fc449878fa76cbc49ac24d46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:130 \u00B7 src/resolution/c-fnptr-synthesizer.ts:162 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9659bf2147d1fc81c295a6711a00bd00c55e6cce2564950c54b4ea4b60c1e041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8 locations): src/resolution/frameworks/csharp.ts:74 \u00B7 src/resolution/frameworks/csharp.ts:100 \u00B7 src/resolution/frameworks/java.ts:147 \u00B7 src/resolution/frameworks/java.ts:173 \u00B7 \u002B4 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf49bfc24cfb9ffc967cc3d47732c9eaa8de6fa3cedba7a7b90b3d6780dba3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/resolution/frameworks/ruby.ts:76 \u00B7 src/resolution/frameworks/ruby.ts:90 \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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c450ae49fd7ffaea275177c5f5937cac368128070693e194de2ed2cd519de9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/resolution/import-resolver.ts:2537 \u00B7 src/resolution/path-aliases.ts:97 \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":"src/resolution/import-resolver.ts"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ed0dd1aca9c476485e601b5d5f4c2120b525f127c8fac487088eab056ff50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/resolution/name-matcher.ts:7704 \u00B7 src/resolution/name-matcher.ts:8425 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":7704}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a4eb03c1b7d3a245afabed44ba02c0c7b3865c83df8f75163b22c7d2066014"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): src/resolution/next-router-synthesizer.ts:44 \u00B7 src/resolution/sveltekit-synthesizer.ts:47 \u00B7 src/resolution/tanstack-router-synthesizer.ts:38 \u00B7 src/resolution/vue-router-synthesizer.ts:36 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85974b3c78d38f90c4ae8edfbda71b2c7816665b2ef3eb7b065c5519631c130"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): telemetry-dashboard/src/api.ts:485 \u00B7 telemetry-dashboard/src/api.ts:535 \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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"148a2a591cb87c8d20b9c9b712d8dc5ab738aa3f318b377d776118674dfe45eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/context/formatter.ts:65 \u00B7 src/mcp/tools.ts:9103 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 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":"src/context/formatter.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"550e1fe5f9ce670b73f6dded1375bb94ef69015a2017eb0be0ee97d9a9de7e61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/db/queries.ts:2305 \u00B7 src/db/queries.ts:2390 \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":"src/db/queries.ts"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f54d3a1000ee322a46410611cc07c1f09b117826580b9b5be4838607d86fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/extraction/cfml-extractor.ts:190 \u00B7 src/extraction/dfm-extractor.ts:66 \u00B7 src/extraction/liquid-extractor.ts:92 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/cfml-extractor.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"404c35e1e8152578c2249360ced6688537b4dc4064fd26d75cd2a39f413633d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/index.ts:1840 \u00B7 src/extraction/index.ts:1892 \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":"src/extraction/index.ts"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110c54dbd473abf3a2fe6ad50a909636fde84e6f223a9eba1ecdfabc30bd791"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/index.ts:3401 \u00B7 src/extraction/store-writer.ts:54 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed82fa72a39d9031bdebcba1935fb4098dc921fa584c4deeb4d5601ffa451ff4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/languages/arkts.ts:73 \u00B7 src/extraction/tree-sitter.ts:7322 \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":"src/extraction/languages/arkts.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0ab433e76a62cd21872bf0dc4a58d7c6e4a9c71d19537cab0b33733afaa50d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:777 \u00B7 src/resolution/cpp-raw-strings.ts:173 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c8db6a52234b3fe8502dead018a74f51f45ec324262f4f5cc6b825335b919e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/languages/cfscript.ts:6 \u00B7 src/extraction/languages/csharp.ts:105 \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":"src/extraction/languages/cfscript.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4571ca8de97f1dbf89baaba24f2e77c39e06bc155acdd15a5d6f8b33279a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:7975 \u00B7 src/extraction/tree-sitter.ts:8363 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7975}}}],"partialFingerprints":{"codehealthFindingId/v1":"5045f97c088ea7f2b2366b7a33ec0f582c30928cea3819f0b1a6f6b9ff884452"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8262 \u00B7 src/extraction/tree-sitter.ts:8279 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8262}}}],"partialFingerprints":{"codehealthFindingId/v1":"92330891893a06c9d0d5e320212727f6b8ad21224aff33231fb4fc15c437d9c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8767 \u00B7 src/extraction/tree-sitter.ts:8858 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8767}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68ca46a93b9aabd2693ba9bf2f7794b3bed930f32799d33e657cb85fac2f805"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/graph/branch-guards.ts:1353 \u00B7 src/graph/branch-guards.ts:1460 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"170743a833239790a5dba224dbaca5efa2844df66f39b8fde24b23d5b35a2ccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/graph/traversal.ts:70 \u00B7 src/graph/traversal.ts:174 \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":"src/graph/traversal.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"93299829e504a9fccef060c980659f0bdd0d29213155d59a6baa1a55e9b442b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/mcp/dynamic-boundaries.ts:377 \u00B7 src/resolution/cpp-type-aliases.ts:428 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4f9fb4ec509645cbb6ee93e02ec3f1d2e4286ddf40c95603864c7f87ebd059"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/project-config.ts:247 \u00B7 src/project-config.ts:273 \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":"src/project-config.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca278c47e91b38fb8d70918d7e8e3727b25f0840a595bd9e71b1c210596f73f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/angular-template-synthesizer.ts:675 \u00B7 src/resolution/angular-template-synthesizer.ts:810 \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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3279d174b9d5b2fbdd52ef1f3d520ef6191ccc881e117d84c4ac9609cc0066"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:2133 \u00B7 src/resolution/callback-synthesizer.ts:2219 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c60f06198062f4d8005992d72a9aa15bda9aa4c5054930e62b1415701e332b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/resolution/dart-libraries.ts:442 \u00B7 src/resolution/dart-libraries.ts:556 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff6b81e1eb6407b751db79d3abb6a6cc0a1e0dc442b1c3a68f755747228a0be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/dart-local-scope.ts:594 \u00B7 src/resolution/strip-comments.ts:589 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/dart-local-scope.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"911c391abfc02201400d5c2ada3d5f9c9bdb443c8fb33243505ccc442447447c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/frameworks/expo-modules.ts:160 \u00B7 src/resolution/frameworks/react-native.ts:540 \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":"src/resolution/frameworks/expo-modules.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3eda1da3ecca55fa9cfbf574c44c16f70901bb11a691ebbc617a16a7de1037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/frameworks/express.ts:188 \u00B7 src/resolution/frameworks/nestjs.ts:113 \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":"src/resolution/frameworks/express.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf2f08b9d217610c9dea3ca84c5f02840431dacae0f4b6b0d01ef376c25476c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/frameworks/fabric.ts:210 \u00B7 src/resolution/frameworks/fabric.ts:285 \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":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded5c9947b98f50c5fe2c5c4eaed66e5cd4f4499e4178738de6e1d7156c21d0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/resolution/frameworks/rust.ts:36 \u00B7 src/resolution/frameworks/rust.ts:49 \u00B7 src/resolution/frameworks/rust.ts:62 \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":"src/resolution/frameworks/rust.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb001a632b930bd45527699d5f995b58c616a18eb9d9a7d149fb0e9419a2556"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/index.ts:3935 \u00B7 src/resolution/index.ts:4063 \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":"src/resolution/index.ts"},"region":{"startLine":3935}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d0a1786c755e9cfadf173bd436e0da3fe1d5eee4121fe3b3395781598c213e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/name-matcher.ts:3631 \u00B7 src/resolution/name-matcher.ts:15799 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b15760a4bda38cb7458db2f45e763e9b70fc82e354768cb7f999978ed1cde8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/name-matcher.ts:10610 \u00B7 src/resolution/name-matcher.ts:10708 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":10610}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e576e3371e01495d26402b2b352dca3b78de6023c05940b15f7b52ff84215fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/name-matcher.ts:19072 \u00B7 src/resolution/name-matcher.ts:19415 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":19072}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59128b919f336fb56a34a62986098f8ef978e2cc2ea583cbc45c7e9348a21d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/resolution/strip-comments.ts:281 \u00B7 src/resolution/strip-comments.ts:346 \u00B7 src/resolution/strip-comments.ts:479 \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":"src/resolution/strip-comments.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa7cd3fa50a446077a7e7f30f4454c2e09f70559fe97d0561e59954c6e26093"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): src/resolution/tier-synthesizer.ts:743 \u00B7 src/resolution/tier-synthesizer.ts:875 \u00B7 src/resolution/tier-synthesizer.ts:1198 \u00B7 src/resolution/tier-synthesizer.ts:1264 \u2014 all 4 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0fbfed59488698409ae98dccf390ab66dc2949225053d900b05943cb0355ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/search/query-paths.ts:414 \u00B7 src/search/query-paths.ts:469 \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":"src/search/query-paths.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef03d151c7b3b4e897952ce0de49f56cc041e47649224075cbb702ac25b4a025"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/ui-server/api/map.ts:345 \u00B7 src/ui-server/api/map.ts:841 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 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":"src/ui-server/api/map.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dcbc992cf1671f3c6a8bff02dd99485766ed01b43d2aecbf69d433ce73a381"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): telemetry-dashboard/public/panels.js:257 \u00B7 telemetry-dashboard/public/panels.js:274 \u00B7 telemetry-dashboard/public/panels.js:309 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-dashboard/public/panels.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08e10f1dc42e7b013d7b16ce4f04a27f57b8b021e463cf7dd74bc8e2f4a5c22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): telemetry-dashboard/src/api.ts:459 \u00B7 telemetry-dashboard/src/api.ts:499 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b996ab1579e49942b8a9a6e3fa26653080f0d052c96fb3a8004d101746e8906"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/src/lib/program-model.ts:298 \u00B7 ui/src/lib/steps-model.ts:678 \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":"ui/src/lib/program-model.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d593eeb12a8bee55257764af65e3e2b8929f8cf62f9f8d852a82309359ed0d4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): ui/src/views/FlowView.svelte:91 \u00B7 ui/src/views/MapView.svelte:99 \u00B7 ui/src/views/ScreensView.svelte:87 \u00B7 ui/src/views/StepsView.svelte:179 \u2014 the 4 copies are spread across 4 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":"ui/src/views/FlowView.svelte"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"207a1dc250627d638532e046b74833451ebd272abb372c6c578bab0a635caea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/add-lang/check-grammar.mjs:164 \u00B7 scripts/add-lang/dump-ast.mjs:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"scripts/add-lang/check-grammar.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42cf59fd5215349f92aa0eb5e9d3e5d5a121bdfc588ed71883712544c819611"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/db/queries.ts:1839 \u00B7 src/db/queries.ts:1857 \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":"src/db/queries.ts"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30f08152583ca9857dd877f728c88bd0647a7f4dfdd8359e26f44847599db54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/db/queries.ts:1958 \u00B7 src/db/queries.ts:2132 \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":"src/db/queries.ts"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894d42cca7352b707df0ea388755a1a4b7e1b39bac832dbd50fca864eeccc14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:1350 \u00B7 src/extraction/languages/c-cpp.ts:1608 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bd192bab16bfeb7adc0a5d0b8447fcccbb1195ada3f89523e581c875145453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:3034 \u00B7 src/extraction/languages/java.ts:349 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b2897dc61c60854b126117b1a6056db879ed7092c4a87b7fb90e1b0ca9cce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/cpp-brace-scopes.ts:231 \u00B7 src/extraction/languages/cpp-macro-methods.ts:509 \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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f5524a31e504170bd4d24cd6989e0a2b402a2db08321917fcf48e4e78d5e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/cpp-brace-scopes.ts:288 \u00B7 src/extraction/languages/cpp-macro-methods.ts:539 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"92093f4d83b96e444a836649936cef6f9fb91e29ff7d497e6bc2d36fa3262f32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/extraction/languages/dart.ts:713 \u00B7 src/extraction/languages/javascript.ts:83 \u00B7 src/extraction/languages/typescript.ts:285 \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":"src/extraction/languages/dart.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e379cd2f24730879ffde4f9738208581d23a7a463c1b10d27ccac3d2fbe91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/go.ts:197 \u00B7 src/extraction/languages/rust.ts:120 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/go.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c531aa721abed8b2846db3f2c3d0785cc694fd63d7ef54e85c387d4a494180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/extraction/languages/go.ts:25 \u00B7 src/extraction/languages/rust.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"src/extraction/languages/go.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ee1cf8bd67616a7200185d86184a98cc01a185427254496d1cc5b826fe2ac0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/java.ts:347 \u00B7 src/extraction/languages/swift.ts:131 \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":"src/extraction/languages/java.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c44d87639ce3edb84a8174686efd35a1f98318bfc12423c3aa06c53373692c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/pascal-preparse.ts:555 \u00B7 src/extraction/languages/pascal-preparse.ts:623 \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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"82565c1488f697b1d005a0796ea5627e1eb828a4526d2970106eb5d439775e40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/extraction/languages/pascal.ts:41 \u00B7 src/extraction/languages/scala.ts:118 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"src/extraction/languages/pascal.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5f3f5fdde1038bf749eae8492e8ac360cfef1820267fcfbf95698f0f05eefd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/ruby.ts:81 \u00B7 src/extraction/languages/solidity.ts:188 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/ruby.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93e01f074daeeda38f4a9792cab4bb54089d94b0b0ef8a46d180e1228f0aca0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/languages/terraform.ts:565 \u00B7 src/extraction/languages/terraform.ts:596 \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":"src/extraction/languages/terraform.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5a392005dd9e0d762ac9fa1ec63b2ac5c0259d5b8cdabed599ce8e1ded416f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/parse-pool.ts:530 \u00B7 src/mcp/query-pool.ts:437 \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":"src/extraction/parse-pool.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a1f612b8ef11ec54469f953bb8ffa017fdaf49dea267372679f7e5dd8e53df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:2759 \u00B7 src/extraction/tree-sitter.ts:2991 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eae23eda8b4875412dea3533ce53416a247ef98f4777ab914a92ecb0060bcc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:4518 \u00B7 src/extraction/tree-sitter.ts:4620 \u00B7 src/extraction/tree-sitter.ts:4663 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"459077ac2bba3f540eae26f5a14effab4d0f59748f0669ab2f274058f6bcc5c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:5387 \u00B7 src/extraction/tree-sitter.ts:6663 \u00B7 src/extraction/tree-sitter.ts:7974 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5387}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd031e88d1c04279617512d1ced709899da45ce8f4320c3c9f5f4fcdc90e188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:8598 \u00B7 src/extraction/tree-sitter.ts:8616 \u00B7 src/extraction/tree-sitter.ts:8680 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8598}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e872f664f60141741c0e7df906a80aca242ff0cb1fa85b9a83e42173527aae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8801 \u00B7 src/extraction/tree-sitter.ts:8853 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92cb3ceba5475f303ef373d118c5e57ce402e73c78e0407874418d9403733bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/graph/branch-guards.ts:932 \u00B7 src/graph/branch-guards.ts:949 \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":"src/graph/branch-guards.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b432bf106c80bd3fc261dc39966fea4c4e57341e739e84785b6faeb25f3b2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/graph/queries.ts:49 \u00B7 src/graph/queries.ts:63 \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":"src/graph/queries.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df278f67ee220d5284742b360b5fe6c2edb1d7f02925814ef8bd6939f954114"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/index.ts:465 \u00B7 src/index.ts:565 \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":"src/index.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecddc9a5640c7be4daa4494192f782afe74ec52595e78feb01b772dba4c23ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/installer/targets/antigravity.ts:183 \u00B7 src/installer/targets/opencode.ts:171 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"src/installer/targets/antigravity.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"245feefd1ca8b9cb3b38c843d5f1e3370323f1d0ed3d26a969c704408e13c186"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/installer/targets/copilot-cli.ts:139 \u00B7 src/installer/targets/hermes.ts:74 \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":"src/installer/targets/copilot-cli.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5f75fe899dcedaebc1f73ea612011c8601f3b217f7723ca2b8d2ba130012af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/mcp/daemon.ts:734 \u00B7 src/mcp/writer-lock.ts:92 \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":"src/mcp/daemon.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"816474a486b27d78cff78fa6e2da46e697385a6b6fba07fd5a4ff25c2c2e1180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/mcp/daemon.ts:843 \u00B7 src/mcp/proxy.ts:802 \u00B7 src/mcp/writer-lock.ts:20 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/mcp/daemon.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d72c5b4b9bbafafccc8d82886fc0267fcb4a051567d26565853b0642b090c92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/mcp/dynamic-boundaries.ts:377 \u00B7 src/resolution/callback-synthesizer.ts:2533 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e22a3d05bcad2e33284ea7bcff80f57f723476d642c9e491364a647968b8a74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/resolution/callback-synthesizer.ts:1916 \u00B7 src/resolution/callback-synthesizer.ts:3317 \u00B7 src/resolution/callback-synthesizer.ts:3450 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e28845c562790e46eab7fa0775f2b2d0043ae3d8e09fc6c7906a16991e4620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3067 \u00B7 src/resolution/callback-synthesizer.ts:3081 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ad303d515661c36920b7893ca4ed05cc17a9a1e54d1cec75a56edb6d4c91c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4088 \u00B7 src/resolution/callback-synthesizer.ts:5222 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4088}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad08376e3338fdb41916f8ada8336a83dbc4b3b99709e9c8130b7c2bddd5780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4419 \u00B7 src/resolution/callback-synthesizer.ts:5230 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46237aed516095ac1ef8c0f14150bbf013e22d5952c0c8659ce7566e55b9144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/cpp-namespaces.ts:102 \u00B7 src/resolution/name-matcher.ts:7140 \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":"src/resolution/cpp-namespaces.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"99005a1b9aacdd14e2333b67ea3ddc872bc3ea242c34f776a103419f44d216c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/resolution/dart-local-scope.ts:226 \u00B7 src/resolution/dart-local-scope.ts:405 \u2014 the two spans are one implementation copied and then locally edited \u2014 121 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"804963663c17b602bd32f4bcfa3f894eac7862c85354aae0b529de39ee04a6e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/frameworks/express.ts:55 \u00B7 src/resolution/frameworks/swift.ts:419 \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":"src/resolution/frameworks/express.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"776d5b0a617019c09ab77638281e5974f3edc9e0418e3104158685460f5e9737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:579 \u00B7 src/resolution/name-matcher.ts:16652 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/java.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d6bce4671da7d7be1eed3e1537c29ace8a684e75738d21d7fd717ded65576f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/resolution/index.ts:1278 \u00B7 src/resolution/index.ts:2483 \u00B7 src/resolution/index.ts:2603 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f4886f5634ddcf75d4754a2a3518a8b8eb4b41e55ff2fdcd28051c9252fdb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/index.ts:2408 \u00B7 src/resolution/index.ts:4133 \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":"src/resolution/index.ts"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"533f1ab840f0ccd63514aecb7094a72513f4d1362e57145f7d728280ab86e382"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/index.ts:3039 \u00B7 src/resolution/index.ts:3057 \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":"src/resolution/index.ts"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9bfb88598b673d80ff857e74d2b267b881f873001e2c66424456ffd2d6946"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/index.ts:3473 \u00B7 src/resolution/module-importers.ts:796 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ca84d21025333d2c63efd22eb0791a8928d2466aa603bb794d1fd5c95cf5df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/resolution/module-importers.ts:273 \u00B7 src/resolution/module-importers.ts:329 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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":"src/resolution/module-importers.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5ce775974065dd200c3e3352f0b5d114801f982bc2f8f60ee3c96ccbaffc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/resolution/name-matcher.ts:4889 \u00B7 src/resolution/name-matcher.ts:5136 \u00B7 src/resolution/name-matcher.ts:7475 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":4889}}}],"partialFingerprints":{"codehealthFindingId/v1":"46df1eb07624485fcaa83b476117f4ff4865cfe6a3e4889572643d817429a984"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5524 \u00B7 src/resolution/rust-scopes.ts:121 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5524}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af95b62584ab9ac58f6376298ce48fb2df77bf36111d5dc1b68b3d4c66f9dc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/name-matcher.ts:6185 \u00B7 src/resolution/name-matcher.ts:7449 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b92827cd4ae95e864a50638fc4f76f90e638136fd4c2ab015f67cc667f89021"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/name-matcher.ts:18734 \u00B7 src/resolution/name-matcher.ts:18774 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":18734}}}],"partialFingerprints":{"codehealthFindingId/v1":"7639e858628dffd4d8da374f7740f96a57482c4d087581b8ec28246a002b6cf6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/name-matcher.ts:29080 \u00B7 src/resolution/name-matcher.ts:29860 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":29080}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b78c83188055a4d73faaf8098cb80068d98db25793375b8a5455e970325f18b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/resolution/name-matcher.ts:31156 \u00B7 src/resolution/name-matcher.ts:31410 \u00B7 src/resolution/name-matcher.ts:31506 \u00B7 src/resolution/name-matcher.ts:31537 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":31156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7226f6c8976b6191b597061a47222232ac82f3af7ae4682f090b00503e8cd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/tauri-synthesizer.ts:542 \u00B7 src/resolution/tauri-synthesizer.ts:564 \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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"366dc0ac0fd155ab5d0095431d8a4e98d75420bc4a235e89bdaf660b3473e654"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/ui-server/api/source.ts:204 \u00B7 src/ui-server/api/source.ts:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"src/ui-server/api/source.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d132eb21b88a57074ff05e374755de0687361776e95aa7685232268df96eec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/lib/adapter.ts:275 \u00B7 ui/src/lib/navigation.ts:101 \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":"ui/src/lib/adapter.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"86873720b3cac1a4af9739927d209205a364ef7d0ac70e1b55a4c119921c2bf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/src/lib/filecode-model.ts:195 \u00B7 ui/src/lib/symbol-model.ts:205 \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":"ui/src/lib/filecode-model.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12b60f7a47ebcccac836f0829b64a6f3451799c2568ec5d052883390a8b253c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/agent-eval/probe-context.mjs:9 \u00B7 scripts/agent-eval/probe-node.mjs:8 \u00B7 scripts/agent-eval/probe-trace.mjs:8 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/probe-context.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c9da40b2dc88180cb68e72e587567f973d7198c4902d89336e65a17fa6a50f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/context/index.ts:734 \u00B7 src/context/index.ts:745 \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":"src/context/index.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99b00451ef98b9d2f62c3330e602be02feff7afbb3d20c16f9f2f322338b10a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/index.ts:328 \u00B7 src/db/index.ts:381 \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":"src/db/index.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"917aa22a8e283cfa1e1b9fcc38bff8b8fe219cc4ded02109c64dbbebb11d43b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/queries.ts:2467 \u00B7 src/db/queries.ts:2530 \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":"src/db/queries.ts"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17613b23e7734060216a5a650a62d4c9b8482d78f893484b015cdae4f0a74a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/queries.ts:3026 \u00B7 src/db/queries.ts:3589 \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":"src/db/queries.ts"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"2867267a7e1dce9448082d25e1933318561b0e293bb04fc4dd16f30b79c6ec3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/queries.ts:3071 \u00B7 src/db/queries.ts:3119 \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":"src/db/queries.ts"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb5234cbc4a58393241f413c7ff9cc8cfeb09cb3ca3acc89fa259a18c04677"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/queries.ts:4744 \u00B7 src/db/queries.ts:4832 \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":"src/db/queries.ts"},"region":{"startLine":4744}}}],"partialFingerprints":{"codehealthFindingId/v1":"32822b054162479fd79182a2f40608507c50de3500a54980078b2726aa478f79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/db/queries.ts:5131 \u00B7 src/db/queries.ts:5296 \u00B7 src/db/queries.ts:5324 \u00B7 src/db/queries.ts:5542 \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":"src/db/queries.ts"},"region":{"startLine":5131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8909366fa26b8309df88175b62ef552466499cdab067097d93c180840a56f654"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/extraction/cfml-extractor.ts:177 \u00B7 src/extraction/dfm-extractor.ts:52 \u00B7 src/extraction/liquid-extractor.ts:76 \u00B7 src/extraction/mybatis-extractor.ts:103 \u2014 the 4 copies are spread across 4 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ecc42a277740275ea6eb8c4777d626fd5060381ed72b5f830c787b2a40ac1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/index.ts:3769 \u00B7 src/resolution/index.ts:649 \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":"src/extraction/index.ts"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd3fe950112665ffa25d2e2a1975c19f766822e69b33d9e7541374af5f1fb22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/languages/cpp-brace-scopes.ts:127 \u00B7 src/extraction/languages/cpp-macro-methods.ts:207 \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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6ca9f9a99f9e6dfc52d23da0b420db4b226756bb9c0f1a9e0a0e774c5b82d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/languages/csharp.ts:123 \u00B7 src/extraction/languages/csharp.ts:148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/csharp.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"de42ac4a1583f8a1204d4872bb0f6590fe10e4b6dc1d1e790a5c4371d74a971f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/languages/csharp.ts:148 \u00B7 src/extraction/languages/swift.ts:167 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/csharp.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaad871d3bea3e1053a51789e951b40bfea7c90e6a75b5e6d5cda7787ad4785"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/languages/dart.ts:763 \u00B7 src/extraction/languages/dart.ts:774 \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":"src/extraction/languages/dart.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e0ad656237fb3d53ae1c82282da6ed339d8c8cb9347593556c6e129aacc248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/extraction/languages/java.ts:364 \u00B7 src/extraction/languages/kotlin.ts:532 \u00B7 src/extraction/languages/swift.ts:168 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/extraction/languages/java.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deac8ce2397869afcb30959a4b8fa50cb6b7fb737e7e068ab0f38168c1d0048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/extraction/languages/objc.ts:174 \u00B7 src/extraction/languages/solidity.ts:210 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/extraction/languages/objc.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2995ca79b9ab62ccae4cb2711f4270c74e1beb3aa0ff933ea95a3ca4f5b39378"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/languages/pascal-preparse.ts:506 \u00B7 src/extraction/languages/pascal-preparse.ts:700 \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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"50860d59af83589e8e6eb9854a9150bc72a43edde2455cc8d0481211319555cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/extraction/languages/scala.ts:32 \u00B7 src/extraction/tree-sitter.ts:8694 \u00B7 src/extraction/tree-sitter.ts:8731 \u2014 the 3 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":"src/extraction/languages/scala.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa31862b3522c1ea3e684c16089d7b77477f1b9dd796f5750cb96ce189de7b1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/languages/solidity.ts:225 \u00B7 src/extraction/languages/solidity.ts:240 \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":"src/extraction/languages/solidity.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdfa4e073f637247b19537a70be8978b73f51105fb54436ce559bc995b73b12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/liquid-extractor.ts:197 \u00B7 src/extraction/liquid-extractor.ts:401 \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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d160d538c699ab03ea3eba3b8628708a6bcc513d2c556db0fd61266791d536dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/razor-extractor.ts:116 \u00B7 src/extraction/vue-extractor.ts:117 \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":"src/extraction/razor-extractor.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cdf67f1c35db681c548fbd1c7c2b2a766844378673d5be0f80376b081db38c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/extraction/razor-extractor.ts:201 \u00B7 src/resolution/frameworks/swift.ts:404 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc4e8cd0eb60b1010ebdb5c837880b35a7c5852a7007860a4c0e8a8bf3b205e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:2377 \u00B7 src/extraction/tree-sitter.ts:2816 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22525cf2b1862432e0994995e2995fedb2e08117d49568d99aae31426348c28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:2937 \u00B7 src/extraction/tree-sitter.ts:3010 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c08f726c384a87d4cacf7cf38367158dfe35d7c32b280f16977ee66229d718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:5783 \u00B7 src/extraction/tree-sitter.ts:7898 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7aef69f164cc0f9362d3af1667f7971ba0283b0dfe4183827fad9da7744b40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8836 \u00B7 src/extraction/tree-sitter.ts:8847 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8836}}}],"partialFingerprints":{"codehealthFindingId/v1":"6108e02eac62b20fdde4bfcfb5fe6e43cbb698e47af81bb886531341632543ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8897 \u00B7 src/extraction/tree-sitter.ts:9000 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8897}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3ed86a59859c85608d32cb1f49ba2373eb3c6f519d3db6557b302a4bfc787"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/extraction/vue-options-api.ts:79 \u00B7 src/resolution/frameworks/nestjs.ts:921 \u00B7 src/resolution/frameworks/object-literal.ts:27 \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":"src/extraction/vue-options-api.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4519a094a454b9396d6c548c5477ba5201af25984d8cd6eb14bdd93a321ff128"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/graph/branch-guards.ts:241 \u00B7 src/graph/branch-guards.ts:1030 \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":"src/graph/branch-guards.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7146bc4485b5b264bd31feaf2c88f5dac8b0c4d24576141877d9da7652e0afa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/graph/branch-guards.ts:1340 \u00B7 src/graph/branch-guards.ts:2011 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"042b8601c72842ce8c7b8f3223ace36acd10a069a398b931c62f11f97ec2f8bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/graph/branch-guards.ts:2125 \u00B7 src/graph/branch-guards.ts:2227 \u00B7 src/graph/branch-guards.ts:2322 \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":"src/graph/branch-guards.ts"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2882c0c4c7bf500f3c2a0686a76455d11a21e0482953d829c149d8cf054bd6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/graph/named-symbol-flow.ts:606 \u00B7 src/graph/named-symbol-flow.ts:636 \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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73906e6e258b7df1e94232d5fbb26f50155330139219f73313b7aa06b60c8b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/graph/named-symbol-flow.ts:101 \u00B7 src/mcp/tools.ts:3366 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f645a419b7e87b0636930477e50067c08709339ad8ebf0262401a0a80ed67dda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/index.ts:1181 \u00B7 src/index.ts:1958 \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":"src/index.ts"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c26420bab3cb8619e68b265bbd5654c6e8eca5d1b8349c26d8048e8e75ca78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/installer/targets/claude.ts:236 \u00B7 src/installer/targets/gemini.ts:115 \u00B7 src/installer/targets/kiro.ts:115 \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":"src/installer/targets/claude.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"310dfd7154c92189ad836d1aaab6375969370b1074af716185460161cb1e326f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/installer/targets/cursor.ts:125 \u00B7 src/installer/targets/kiro.ts:95 \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":"src/installer/targets/cursor.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04054fa7bb8562e4fdee8fb4498d5e26e05c04b98224213ea5b7ece83b900d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/installer/targets/droid.ts:29 \u00B7 src/installer/targets/gemini.ts:54 \u00B7 src/installer/targets/kimi.ts:39 \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":"src/installer/targets/droid.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8c5ec6affc7b50721fd53b8724e577f42ae497e045be34599ea62e4014c013"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/tools.ts:5611 \u00B7 src/mcp/tools.ts:5638 \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":"src/mcp/tools.ts"},"region":{"startLine":5611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c135cb4de935b71955eb09955e5172c9f7f96049d792d5e41f5be2d3cb2d592a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/resolution/ambient-modules.ts:609 \u00B7 src/resolution/c-feature-variants.ts:49 \u00B7 src/resolution/cpp-includers.ts:41 \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":"src/resolution/ambient-modules.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"354bf5da562a3647181d913f0c21a1914034100b1a82a5ec225dfb0b05f9fdb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:178 \u00B7 src/resolution/c-fnptr-synthesizer.ts:198 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdc4b3f4997701bcd168077fa145e2320e99084fb5f32a777206fe73151fd3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/resolution/callback-synthesizer.ts:328 \u00B7 src/resolution/callback-synthesizer.ts:393 \u00B7 src/resolution/callback-synthesizer.ts:680 \u00B7 src/resolution/callback-synthesizer.ts:3219 \u2014 all 4 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5065dcabacd2be712916a1f9dc6786b066576c2b4fcd785016ef3918a9fd48ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:1870 \u00B7 src/resolution/callback-synthesizer.ts:1901 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acb64ea3ca4feb2a3460659fd618a02eb2bc561eb980208886aa4175d64ff8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4429 \u00B7 src/resolution/callback-synthesizer.ts:5093 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51f6b9117d1133c4ed5a1612226884c684bd3ae7794cbed9a95deb13158446c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4704 \u00B7 src/resolution/callback-synthesizer.ts:5074 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c978b7629f2f12bd9bfbdae37431f66d65588259ae798e9ef25fec448a18294"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/angular-router.ts:702 \u00B7 src/resolution/frameworks/vue-router.ts:248 \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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d16ffaf41574a4ebe3135858f2e9b97dcc0f37b5a071d6645dfcdf81f6eee49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/expo-modules.ts:118 \u00B7 src/resolution/frameworks/fabric.ts:299 \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":"src/resolution/frameworks/expo-modules.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a7ef7f8f805f6d4a721c701808168be713bff0fd670e0171d732822cf4a64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:719 \u00B7 src/resolution/tier-synthesizer.ts:420 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"68920589452bb2ed3670f5d2af23fe6e58ae928b5356da6311ead14d9043f68a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/resolution/frameworks/goframe.ts:86 \u00B7 src/resolution/frameworks/java.ts:301 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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":"src/resolution/frameworks/goframe.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec655a15356ab87cb020cf3905f1e738dec25660ab1b2e98d669c41254e9220e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:144 \u00B7 src/resolution/frameworks/swift.ts:114 \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":"src/resolution/frameworks/java.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"768b514f7ede1bf6762131a2c974eda555f9e8211108a739e037ac0dce0cdf47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:750 \u00B7 src/resolution/frameworks/rust.ts:308 \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":"src/resolution/frameworks/java.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"82399dfd60a2d3ee7d1e4db49ed1ea6c419537ef6eedfed322806a31adb13f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/resolution/frameworks/nestjs.ts:557 \u00B7 src/resolution/frameworks/nestjs.ts:889 \u00B7 src/resolution/frameworks/nestjs.ts:914 \u00B7 src/resolution/frameworks/nestjs.ts:941 \u2014 all 4 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"5792d4cc171f052813468a5bf19912d770c9bed4917a0d39fe0760ff243ac9b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/next-proxy.ts:213 \u00B7 src/resolution/name-matcher.ts:902 \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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c08fb5182cf907e94f4cce1645eb8f16fa791c71f3d185b71fe40a728aa283"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/nextjs.ts:320 \u00B7 src/resolution/frameworks/tanstack-router.ts:436 \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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d91a766466fa730e5a2045b2d3d11ac743057e2e43aacec0f5edfdb1c4d30c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/python.ts:642 \u00B7 src/resolution/frameworks/swift.ts:555 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/python.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f8277261f603bf1dd331c4b6e7ea17c67933e04bfee2bb8af8c68e169d9780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/resolution/frameworks/python.ts:614 \u00B7 src/resolution/ruby-parameter-flow.ts:116 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fa72b30a0dfcb44f2fc6163f39d19950afaca883448b9b749e39b9d6af6ecf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/react-native.ts:401 \u00B7 src/resolution/frameworks/react-native.ts:450 \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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d5d3d9be9f52e4cbe424e8ffc02cc247391fedac440938675cbdd1f471412a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/react.ts:1683 \u00B7 src/resolution/frameworks/react.ts:1765 \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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d9150eca27509b66eace618d1f31a6ab3186a764b38454d0b03f9ed3864a31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/frameworks/swift.ts:22 \u00B7 src/resolution/frameworks/swift.ts:183 \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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eacc7e824365c3c452538b2dd2ae12cbd71b0e99d7dcf44a78b36a87797c7bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/index.ts:2353 \u00B7 src/resolution/index.ts:2363 \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":"src/resolution/index.ts"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"336cf9347adcb9a5637eefa815ba09c58dd5a68da81834f9e7de3ac0c383aa84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/name-matcher.ts:842 \u00B7 src/resolution/name-matcher.ts:27980 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfa8f74ef5e59012099fc359fcbf995b3b5aee4898051f325ddff40f84acd8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/name-matcher.ts:8010 \u00B7 src/resolution/name-matcher.ts:8076 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":8010}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f75a5719608748108af8f86ab52e786a178a97e10b9162a822e93044a0812b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/resolution/name-matcher.ts:11739 \u00B7 src/resolution/name-matcher.ts:13489 \u00B7 src/resolution/name-matcher.ts:29468 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":11739}}}],"partialFingerprints":{"codehealthFindingId/v1":"3327ad0f4b37f99802c821fe7ede2fafe12bf740f27cff28791aac8e2fdb6eaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/name-matcher.ts:13980 \u00B7 src/resolution/name-matcher.ts:23857 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":13980}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b978d30b214f5bc9d7974c27950b64bde9941af8d572cc023b5c7a96f7ef198"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/name-matcher.ts:30148 \u00B7 src/resolution/name-matcher.ts:30753 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":30148}}}],"partialFingerprints":{"codehealthFindingId/v1":"086001657a5e11172d1640b4bb691e1b7bdfde1a3b788ff3ce6bd0aae77da7c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/resolution/name-matcher.ts:694 \u00B7 src/resolution/name-matcher.ts:722 \u2014 the two spans are one implementation copied and then locally edited \u2014 141 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":"src/resolution/name-matcher.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"041c195a3753268a395eebbf1443d67c4f198bc9fe50d6dbb950f8b18ca4fcc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/resolution/ruby-parameter-flow.ts:118 \u00B7 src/resolution/ruby-parameter-flow.ts:169 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7661bd1002e798e6fbc88813b7920403e9a415c05515b96fd5de9d4773fd6000"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/rust-scopes.ts:438 \u00B7 src/resolution/rust-scopes.ts:474 \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":"src/resolution/rust-scopes.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"231feb2185c3774c1635454e0992b4fb8e5c28107efda535f8db5a9cc99ead48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/strip-comments.ts:521 \u00B7 src/resolution/strip-comments.ts:604 \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":"src/resolution/strip-comments.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"91719c6233830907607c46350f03de18c0a8b49db7f5c3d4cefb30b3ae243021"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/ui-server/api/when.ts:209 \u00B7 src/ui-server/api/when.ts:225 \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":"src/ui-server/api/when.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d5a249c390299adc934311c6a24be4cc94111028f10a862ed1dbae5b50f3a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/ui-server/static.ts:106 \u00B7 src/ui-server/static.ts:117 \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":"src/ui-server/static.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d871d9b5749b4f3a05885ce816e9917ad99c34cc97abd24939316d57b2fbffa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/utils.ts:762 \u00B7 src/utils.ts:786 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"src/utils.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"448d4fff55cd96b881f0b9312b9305e65dc05c5b6a7956a1ef7c28e6633bac6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/lib/program-model.ts:437 \u00B7 ui/src/lib/screens-model.ts:377 \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":"ui/src/lib/program-model.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ca7a83d83f08eca0a49ecc2eb883c502432af9ad54dc9b14a5e0ececf39da5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/lib/screens-model.ts:314 \u00B7 ui/src/lib/steps-model.ts:430 \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":"ui/src/lib/screens-model.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"107b15cac6f48571e68d61316820511c03809fedd9738cbb8c489fc18475b675"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/src/views/FileCodeView.svelte:69 \u00B7 ui/src/views/FileView.svelte:37 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/views/FileCodeView.svelte"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc4489114f1f0a7fa1f5a50fc1a880c39a665af7f79bea05acabdbd30d7e2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/db/queries.ts:4759 \u00B7 src/db/queries.ts:5149 \u00B7 src/db/queries.ts:5507 \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":"src/db/queries.ts"},"region":{"startLine":4759}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e0fc9019ec52ea3199309f175d037ca6e925b141d92aaea0516355f2e1b9d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/db/queries.ts:4914 \u00B7 src/db/queries.ts:5024 \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":"src/db/queries.ts"},"region":{"startLine":4914}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfe40345a0f24cba64b086b6f697e0cb869156a3fc82cb0edff4d3c80987a5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/extraction/astro-extractor.ts:310 \u00B7 src/extraction/svelte-extractor.ts:214 \u00B7 src/extraction/svelte-extractor.ts:261 \u00B7 src/extraction/vue-extractor.ts:298 \u2014 the 4 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":"src/extraction/astro-extractor.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd7de5bfd48f860b6baa4fd7c9ae435f02047765d29a4140de9a2e2284d02cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/cfml-extractor.ts:632 \u00B7 src/extraction/cfml-extractor.ts:742 \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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7471a86b6334b9974aa65b962aa75bf481cbd24326aa2cf4ab3d39836ca49da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/extraction/function-ref.ts:236 \u00B7 src/extraction/function-ref.ts:319 \u00B7 src/extraction/function-ref.ts:329 \u2014 all 3 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":"src/extraction/function-ref.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c78dc33d082f4864ba0093aaf73e8244336f24010d6372d5e4dead3879a906"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/extraction/languages/c-cpp.ts:1144 \u00B7 src/extraction/languages/c-cpp.ts:2355 \u00B7 src/extraction/languages/c-cpp.ts:2406 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a584feed076db78473b09c42676e44979a63d62a14d5d07178d3f1586efc8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/extraction/languages/c-cpp.ts:2576 \u00B7 src/extraction/languages/c-cpp.ts:2633 \u00B7 src/extraction/languages/c-cpp.ts:2695 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8be982685d554a96055e6f5a38ac0b3250c2af9de0a989bbe41fcff8518427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/languages/csharp.ts:46 \u00B7 src/extraction/languages/vbnet.ts:37 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/csharp.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"420af0adce8e44f6a78e90049ef8f4d9f801a8d101a6e0328e2d69e1b3d6b87c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/extraction/languages/terraform.ts:356 \u00B7 src/extraction/languages/terraform.ts:574 \u00B7 src/extraction/languages/terraform.ts:604 \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":"src/extraction/languages/terraform.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"43978c58633974404fe37114745949105fa3aed1387237d331286084b65a4803"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:3084 \u00B7 src/extraction/tree-sitter.ts:8924 \u00B7 src/extraction/tree-sitter.ts:8935 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b31c23f7948013e628e44ebfb7c49a55caa744cce0f557345acace1d9ba4a7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:4844 \u00B7 src/extraction/tree-sitter.ts:7734 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c98b170c7fe78c2cac0620f6713fb3aed6256112c66b672d099e24a24b8f62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:4918 \u00B7 src/extraction/tree-sitter.ts:7280 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4918}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bb7cec845114dba9dc4146dcd8ffc5f473f1091909f0302ba0119b5c7cfdad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:5978 \u00B7 src/extraction/tree-sitter.ts:6043 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5978}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd49538b7afb101ee319b30a603e375b2b64fcbbb53804a70324a5a84e72fe05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:7518 \u00B7 src/extraction/tree-sitter.ts:7570 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9685364bc170dfddba12421a656f8d9be6d804852ddb66e121e29615de41afb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8635 \u00B7 src/extraction/tree-sitter.ts:8698 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8635}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cc421740655033b65b5bb6dd5041f3483f6189f9b8fda01712b4b1ba99d9cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8925 \u00B7 src/extraction/tree-sitter.ts:8936 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8925}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd9d93a3fe42ec376911983092c7c07dd32ff4dc0c0f90ed3069e3ac7974bb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/graph/branch-guards.ts:122 \u00B7 ui/src/lib/conditions.ts:25 \u00B7 ui/src/lib/conditions.ts:106 \u2014 the 3 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":"src/graph/branch-guards.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0e1faedceb8e0f73a11ad5504f8ae1788e6b5bb163df7bf2d8112658ed02f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/graph/branch-guards.ts:1320 \u00B7 src/graph/branch-guards.ts:1439 \u00B7 src/graph/branch-guards.ts:1656 \u00B7 src/graph/branch-guards.ts:1824 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"src/graph/branch-guards.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f60a06d7d1c40c57a499e8f88c7ffd4cdd2456ca0e283384fafb6308f154aef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/graph/branch-guards.ts:1889 \u00B7 src/graph/branch-guards.ts:1964 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d456aaf312160c95e42340af0ca67a3c71e2c781c11148166eac99b41e0883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/index.ts:409 \u00B7 src/index.ts:438 \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":"src/index.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"828ee37402cf0b23634862197651aa8cb110dd123bfe92ade1c301e244ad088f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/installer/targets/antigravity.ts:228 \u00B7 src/installer/targets/windsurf.ts:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"src/installer/targets/antigravity.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"35618f48465a0d224a3eb502b4a2007ae88dd5bcccd9bd5ab3c40be855040ece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/installer/targets/copilot-vscode.ts:147 \u00B7 src/installer/targets/cursor.ts:149 \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":"src/installer/targets/copilot-vscode.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0635cf6ca01f2a0536cdb41f712f5b8b209853ddc1aeb5b5d4bccaadb41f791e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/installer/targets/copilot-vscode.ts:157 \u00B7 src/installer/targets/opencode.ts:209 \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":"src/installer/targets/copilot-vscode.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"588d0401e776f63443ddc51c88cef000cf11237a1a581c68039d672c8e9669f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/installer/targets/dsh.ts:106 \u00B7 src/installer/targets/hermes.ts:164 \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":"src/installer/targets/dsh.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c39f1220d31ba5aa1fcb32a0204d48bf330019a01500c6e344d36bdb6d3f4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/mcp/tools.ts:3440 \u00B7 src/mcp/tools.ts:3525 \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":"src/mcp/tools.ts"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f024ef8f05991e7162ae4f553bc1d2e1e2fe6b6325a98ea6d5431c7c7f589"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/angular-template-synthesizer.ts:348 \u00B7 src/resolution/frameworks/express.ts:466 \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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1dc98abc6b40b299771b3a890b5d8181e75c027b21eb71b85455305348d810"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/angular-template-synthesizer.ts:786 \u00B7 src/resolution/angular-template-synthesizer.ts:808 \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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd05a87de02d4501686e53aebf6e4b45f5721f0c8004f30388d4de06ef25c55a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:1284 \u00B7 src/resolution/c-fnptr-synthesizer.ts:1345 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c761528e7c645a1445fa6f3f471092149e3386f194fd7584a4aab3c3efa8c5d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:2637 \u00B7 src/resolution/callback-synthesizer.ts:2782 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56f15ea9d05257634886bd825cd4f908866690120ade420446abc107a3fcd05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3084 \u00B7 src/resolution/callback-synthesizer.ts:3104 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c1eb587efc53ba7a56af430ae429caa70181f143b9669e13fade9f25f3708d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3172 \u00B7 src/resolution/synth-utils.ts:58 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2022b0f9c7de404619b806dff2f27f32c16401588b7ae207ea76599428375ab2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3385 \u00B7 src/resolution/callback-synthesizer.ts:3436 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3385}}}],"partialFingerprints":{"codehealthFindingId/v1":"335547da1c8e435c3481c84b3250094c72187d1dadd705e788ecaf59d8e60660"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3593 \u00B7 src/resolution/callback-synthesizer.ts:4987 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3593}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7b7b1ac389dc74015c03b189f96e3c49e280629b6ec5b8e1c7ccd42484090c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): src/resolution/callback-synthesizer.ts:3871 \u00B7 src/resolution/cpp-type-aliases.ts:218 \u00B7 src/resolution/dart-local-scope.ts:273 \u00B7 src/resolution/frameworks/laravel.ts:447 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81a9c7ab32dd666a5f61f04889a63b1ce88f42823fcbb47d9eea723a995073"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4108 \u00B7 src/resolution/callback-synthesizer.ts:4204 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4108}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c5daa2e121ee55ab12f756545b584771cc13cc5b6f87781d78f1f7f940edc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/resolution/callback-synthesizer.ts:4300 \u00B7 src/resolution/callback-synthesizer.ts:4421 \u00B7 src/resolution/callback-synthesizer.ts:4708 \u00B7 src/resolution/callback-synthesizer.ts:5232 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4300}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e27cff8b74776bc7b255990f8f9f60b74ca26935d6b5ec454e4e77f3c2a8dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:5010 \u00B7 src/resolution/react-router-synthesizer.ts:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5010}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9a7cb0362166820cb490791d3eb2800fffe6bf568d007561d86c432a7a0be0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/resolution/const-alias-synthesizer.ts:83 \u00B7 src/resolution/ruby-parameter-flow.ts:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7ebe6169860538c54b405a11fdf3877fe868d7bdd24063a70f14e3aee10f6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/cpp-constructor.ts:39 \u00B7 src/resolution/cpp-macro-visibility.ts:182 \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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf896624c8dc5aa4925066c3c2d9484718aabe7d12e604e001a2a3b058b4e82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/dart-local-scope.ts:108 \u00B7 src/resolution/name-matcher.ts:1987 \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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a5625c292dd61b968d151644c1598a387a5627cb4834be791144aab45460b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/resolution/frameworks/express.ts:337 \u00B7 src/resolution/frameworks/laravel.ts:261 \u00B7 src/resolution/frameworks/python.ts:368 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"823ad95210bee61c7ef943882704a97ee1985f2a89ee67df41b718d7b6b739b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/frameworks/laravel.ts:444 \u00B7 src/resolution/frameworks/next-proxy.ts:194 \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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c329effe6f647d3ea275064520d6567b479aeac1b562724d9be88128a2e028d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/resolution/frameworks/name-heuristic.ts:54 \u00B7 src/resolution/frameworks/nestjs.ts:90 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 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":"src/resolution/frameworks/name-heuristic.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"acec31f910cf45536db9fba931458781e57f7a3be0fb5e7e79fc4ff4ed398af1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/frameworks/nestjs.ts:884 \u00B7 ui/src/lib/conditions.ts:20 \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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa27dc204d5e961316309336449a60e00f6715956132cf7d07d672c2eb0edb85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/frameworks/nestjs.ts:950 \u00B7 src/resolution/frameworks/object-literal.ts:26 \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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf6e5da4d0dea1328b4869e4f1bfe3b7295555bdc8ef457079640011b2c8c80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/resolution/frameworks/play.ts:34 \u00B7 src/resolution/frameworks/terraform.ts:46 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"src/resolution/frameworks/play.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55b8481bbfa01720dbb2ae848983251c9e4ab177d9b25870ec397b893843109"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/resolution/frameworks/python.ts:613 \u00B7 src/resolution/name-matcher.ts:1463 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c687be4938fec50fb4421bb1c97bad0631bebbd17e4339a787e810e9b374cd42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/frameworks/sveltekit-router.ts:134 \u00B7 src/resolution/frameworks/tanstack-router.ts:378 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/sveltekit-router.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a101c8c90d97f73729e380668087a26179d825eea8711c8103bca9154efb90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/resolution/index.ts:1293 \u00B7 src/resolution/index.ts:2492 \u00B7 src/resolution/index.ts:2612 \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":"src/resolution/index.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c130649fcc72687fe838b7e205abd1253a7d7dd52d7782d94b058577bdbaf2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/index.ts:2549 \u00B7 src/resolution/index.ts:2564 \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":"src/resolution/index.ts"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"8490bcd707110181edbda09bf5ca8a37b8ef34a576141b7d433182bf5dae251c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/index.ts:4098 \u00B7 src/resolution/index.ts:4189 \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":"src/resolution/index.ts"},"region":{"startLine":4098}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef00719e524642e07ede361b93be8d73d30d0b35741b26d170e1fe72d674cdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/resolution/name-matcher.ts:1886 \u00B7 src/resolution/name-matcher.ts:2974 \u00B7 src/resolution/name-matcher.ts:4106 \u00B7 src/resolution/name-matcher.ts:29935 \u2014 all 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70092bb46315eab717046cfa094b968d5f761a0dab6a03470918431c9659d7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/resolution/name-matcher.ts:2975 \u00B7 src/resolution/name-matcher.ts:3000 \u00B7 src/resolution/name-matcher.ts:4107 \u00B7 src/resolution/name-matcher.ts:29936 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4011a685a4940536134e5c1d675c3779834adeb53d914ada8180489d97c459b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:3848 \u00B7 src/resolution/name-matcher.ts:8268 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08545455fc1692426e3379b5de6d6721847ffca980f8609dd4edc241a197e00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:8988 \u00B7 src/resolution/name-matcher.ts:23047 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":8988}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e845e514cc9a6df751f5043657ab55ba15b4cb9fedb48e5f1b8dc76d4fcce3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/resolution/name-matcher.ts:13692 \u00B7 src/resolution/name-matcher.ts:16981 \u00B7 src/resolution/tier-synthesizer.ts:1014 \u00B7 src/resolution/vbnet-receivers.ts:115 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":13692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7371c425871504078e3e28a16c566d152a547ef72e92232936efaccceac37190"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:14408 \u00B7 src/resolution/name-matcher.ts:31952 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":14408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1516f35e6a8a2fb481dd08c72a17d9e507f9f647058790f2f859a34b49c414"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:14418 \u00B7 src/resolution/name-matcher.ts:31988 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":14418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7697dd224c522101a877a85e7000668e816e47538c31db211ad41e2918c15e40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/resolution/name-matcher.ts:15434 \u00B7 src/resolution/name-matcher.ts:31160 \u00B7 src/resolution/name-matcher.ts:31412 \u00B7 src/resolution/name-matcher.ts:31508 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":15434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb78c61241307ed4d9bc748bce30df60378d3ab3dd3412eda07b62e68527fe9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:16961 \u00B7 src/resolution/name-matcher.ts:16971 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":16961}}}],"partialFingerprints":{"codehealthFindingId/v1":"9409b4fbc88febfae5d907fb6676ee8a1da1f23d3f0be5368f2d4ac2f7beaf67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:16981 \u00B7 src/resolution/vbnet-receivers.ts:115 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":16981}}}],"partialFingerprints":{"codehealthFindingId/v1":"083d17673a771a1818e5a7f5012cdf27e873bc378e8cd11ae2409621192419fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/name-matcher.ts:21395 \u00B7 src/resolution/name-matcher.ts:23064 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":21395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8e8678711ba45b27307ea5bad77db61ef0ada2341265d063648ee6e743eff5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/resolution/strip-comments.ts:245 \u00B7 src/resolution/strip-comments.ts:437 \u00B7 src/resolution/strip-comments.ts:497 \u00B7 src/resolution/strip-comments.ts:570 \u2014 all 4 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":"src/resolution/strip-comments.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"567e53fdb3cb4ed85b61779282c892eb2c7aa80b6254cf30613569428d4f6ee8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/synth-utils.ts:42 \u00B7 src/resolution/synth-utils.ts:60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/synth-utils.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"22da0f6b4d6829ffd7a07dd7ce0ae50827fb9c31078f2ce8a2beee7f82403651"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/tier-synthesizer.ts:670 \u00B7 src/resolution/tier-synthesizer.ts:713 \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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef55d88b529526a962a242ecac6e93f19d2fc02f91bfe62036075a46fde8c510"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/tier-synthesizer.ts:1014 \u00B7 src/resolution/vbnet-receivers.ts:115 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d62971cdcef02b675543762fb3bfd7ab1a69c944921083647ec2b9c89a2db5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/search/query-utils.ts:90 \u00B7 src/search/query-utils.ts:132 \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":"src/search/query-utils.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"09be584812676db1140f6d642aeb9edec19cbbeed23c9362770dc495be22006b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): telemetry-dashboard/public/panels.js:279 \u00B7 telemetry-dashboard/public/panels.js:314 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-dashboard/public/panels.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae34161d67cfc9605f107cf6f85d7c5fc6c6d217b52444731c0f7e45bb2b578"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/map/MapSidePanel.svelte:76 \u00B7 ui/src/components/map/MapSidePanel.svelte:85 \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":"ui/src/components/map/MapSidePanel.svelte"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"411cd4f50a66a33ce67bce616819ff5baa449ab8bd48a46fa8b5b2dd977f5032"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/components/map/ModuleNode.svelte:23 \u00B7 ui/src/components/screens/ScreenNode.svelte:29 \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":"ui/src/components/map/ModuleNode.svelte"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba4f89bfe1a0925f52f5a5df8a1dbe069193a9399a9285a43be4b2dd81c7854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/src/lib/screens-model.ts:413 \u00B7 ui/src/lib/steps-model.ts:1190 \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":"ui/src/lib/screens-model.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9d7bb364ea6ecf605210327d214b7a7385ca8cb6f9745c13a9dd9f6b6167f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): ui/src/views/DeadCodeView.svelte:56 \u00B7 ui/src/views/MapView.svelte:97 \u00B7 ui/src/views/ScreensView.svelte:85 \u00B7 ui/src/views/StepsView.svelte:177 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 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":"ui/src/views/DeadCodeView.svelte"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"33631b425b550f1906022e69b58291410aee7323bbee9f2daed99f54a929d289"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/agent-eval/probe-allocation.mjs:61 \u00B7 scripts/agent-eval/probe-file-spend.mjs:72 \u00B7 scripts/agent-eval/probe-suite-envelope.mjs:49 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/probe-allocation.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03f9dd15bd171fa4dd8086d5064f1657820cb2374afa1ec5d45c23c1f88ca46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/context/formatter.ts:284 \u00B7 ui/src/lib/file-model.ts:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"src/context/formatter.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6d1a335e97e2dfba8ba4501860c160d3ab0049efeddcf9ee9042942ed42d52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/db/index.ts:388 \u00B7 src/db/index.ts:444 \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":"src/db/index.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ab3eb5ef3cd3715a9eb7991034b9d77f86f319bdf15b4a13ddde2e83bcdd47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/db/name-substring-index.ts:131 \u00B7 src/extraction/languages/cpp-brace-scopes.ts:365 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/name-substring-index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56caf530f0fe9451de98b9edb6bc74413ec6929786cb7e009119762adf76623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/db/queries.ts:4889 \u00B7 src/db/queries.ts:5012 \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":"src/db/queries.ts"},"region":{"startLine":4889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f597c298865eca771ac8d03131721249f7d896a12d220e33397f95a676b6e95b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/directory.ts:429 \u00B7 src/resolution/workspace-packages.ts:331 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"src/directory.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e915a06f03773b0361a30911eaed3da47d0a993d28a5814f23f6ff7935c33b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/function-ref.ts:675 \u00B7 src/extraction/languages/kotlin.ts:497 \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":"src/extraction/function-ref.ts"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c809cc1ff5a848b75aeb438048696b160aef2ff0155a3bb984ece592e38f1d98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/function-ref.ts:849 \u00B7 src/extraction/function-ref.ts:864 \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":"src/extraction/function-ref.ts"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ecfa89bb726342624238ea6639bb14e37591462f27629808b245c23e64039f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/index.ts:809 \u00B7 src/extraction/index.ts:1988 \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":"src/extraction/index.ts"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fd6b9cc81b66255077ee4757153487b7bf57aecf655c7716d1f53040f073b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/index.ts:1168 \u00B7 src/extraction/index.ts:1246 \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":"src/extraction/index.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e330d885fd569dc97c7bda5d4834de89fd032e9bdb2da40abe575f99c75771cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:1312 \u00B7 src/extraction/languages/c-cpp.ts:2741 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae5f9b2c148795a6077410765eb307a42fd4f6f7297be0053ec2fa4d5fb84f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:2179 \u00B7 src/resolution/tier-synthesizer.ts:128 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"62430f8abc6cfc828132125d574c84e1a3056a208a7bc60b36c3c10e516ec350"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/extraction/languages/cpp-brace-scopes.ts:61 \u00B7 src/resolution/rust-scopes.ts:361 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"64934045a9587d9b7d8b190eb39445a2749a25c0dccf2d9b1d26610114e1dc72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/extraction/languages/cpp-macro-methods.ts:201 \u00B7 src/resolution/frameworks/java.ts:583 \u00B7 src/resolution/name-matcher.ts:16657 \u00B7 src/resolution/name-matcher.ts:29517 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b18486c7abe7dd77bc1bf5800382700d8c03f51faceec32b33d1ad4bf875a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/extraction/languages/csharp.ts:104 \u00B7 src/extraction/languages/java.ts:348 \u00B7 src/extraction/languages/php.ts:88 \u00B7 src/extraction/languages/swift.ts:132 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"src/extraction/languages/csharp.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4caf3d382acb2b77e160151c21ce779c13338885322ad570b066a4e53212da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/extraction/languages/dart.ts:409 \u00B7 src/extraction/languages/go.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"src/extraction/languages/dart.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdce2dc0aeab3e37a640a8f11b3206f3473477a268faf23c75ba8c1073c5e140"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/extraction/languages/typescript.ts:33 \u00B7 src/graph/branch-guards.ts:655 \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":"src/extraction/languages/typescript.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eefdfac920d763f81403d8e0c2afcba9580638f1de0fb5b6e66d2062053437"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:169 \u00B7 src/extraction/tree-sitter.ts:198 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d96918c9aca48a16a8b560a3af5f6afaaf64cc0bf007cd02c88986de65cebe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:2029 \u00B7 src/extraction/tree-sitter.ts:7630 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96dbd86fd1f97f2aa1fae3f0fe72da79bbbde1c684ae9f99c239c53318dc8dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:3879 \u00B7 src/extraction/tree-sitter.ts:3898 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea350143b19b76cff0113e3b77d02c24ba9a3d3de89058cb257334906a552c76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:6620 \u00B7 src/extraction/tree-sitter.ts:9395 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cdd15da7eb59277550f41c6e64b6484017a982aff6bda50cdc50f90dfc0a04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:8554 \u00B7 src/extraction/tree-sitter.ts:8578 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d7cd1914d5b6ee5a88ebd11b52943f134e9a18bbd442565e9e7b958b046d09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7 locations): src/extraction/vue-options-api.ts:58 \u00B7 src/resolution/angular-template-synthesizer.ts:326 \u00B7 src/resolution/angular-template-synthesizer.ts:438 \u00B7 src/resolution/name-matcher.ts:876 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 5 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d5f9f0b97001080ab0d9b730a6988e491b3f5840b3764d191c695b5337df37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/vue-options-api.ts:72 \u00B7 src/resolution/name-matcher.ts:2921 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/vue-options-api.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4f61ec2d1d79e9b75e7e7c139e40952852aca0c40d9bb8dbd822c9c16d2f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/extraction/vue-options-api.ts:129 \u00B7 src/resolution/frameworks/object-literal.ts:80 \u00B7 src/resolution/frameworks/object-literal.ts:101 \u2014 the 3 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"630de9f36aeb0f35cfb7eaf966fc7054933a6db445de9fc4d63fe405723aa3e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/graph/branch-guards.ts:1787 \u00B7 src/graph/branch-guards.ts:1881 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"398c2cb288d294829be88ab89ea9e5b6893a19f2147f2efbd75934dce31eb68e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/graph/branch-guards.ts:1817 \u00B7 src/graph/branch-guards.ts:1986 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bec65fd4f727a36292abbd352db95c3765186e8053d9ce2b3afc53f249b2b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/index.ts:1491 \u00B7 src/index.ts:1555 \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":"src/index.ts"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"567e116b32e3e1916fb0fc704469de7e3a1407279b44b39b7c8b015825443a68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/installer/targets/antigravity.ts:228 \u00B7 src/installer/targets/qwen.ts:110 \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":"src/installer/targets/antigravity.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb1b1e6ceedb34264566abbe841764283ba03b2992797002d1846bd0c4f1cab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/installer/targets/grok.ts:36 \u00B7 src/installer/targets/kimi.ts:32 \u00B7 src/installer/targets/qoder.ts:29 \u00B7 src/installer/targets/qwen.ts:38 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 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":"src/installer/targets/grok.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee73edda2ebf72effbe9ef655effce57ec49a2cb79121d227d1a6d187409c71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/mcp/daemon.ts:906 \u00B7 src/mcp/daemon.ts:914 \u00B7 src/mcp/daemon.ts:922 \u00B7 src/mcp/daemon.ts:930 \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":"src/mcp/daemon.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a9db50926c6736f799c0258a487c298d21d522f110fcf607c15a36683bcd00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/daemon.ts:931 \u00B7 src/mcp/tools.ts:2058 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11b81087e5665285d677a65c38856e2f9f70084986e08e0e5688f715b6e204d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/tools.ts:933 \u00B7 src/mcp/tools.ts:2057 \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":"src/mcp/tools.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad5622c29ab548737bab6e0c77aa802ccfed3ef9b4980a10400a312796bc545"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/angular-template-synthesizer.ts:339 \u00B7 src/resolution/angular-template-synthesizer.ts:360 \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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c44a04e641d763a2d9b99f19d08f05ddfba48d6656595915fb81afc59ddc0e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:252 \u00B7 src/resolution/c-fnptr-synthesizer.ts:259 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05c45f2617befb7d4f4fbbde8189e44b3e1468bfce864b932251700a3e1a46b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/resolution/callback-synthesizer.ts:340 \u00B7 src/resolution/tier-synthesizer.ts:741 \u00B7 src/resolution/tier-synthesizer.ts:873 \u00B7 src/resolution/tier-synthesizer.ts:1196 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbe6d6d98fc2e3cd0816510e636ff1b9cb486e855117e029dcea393c85e4cd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:360 \u00B7 src/resolution/callback-synthesizer.ts:2603 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8fe8ebe2eaec6449c4fdf2ce125bd49d3708b0e404e8ac77797f18957e8560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/resolution/callback-synthesizer.ts:692 \u00B7 src/resolution/callback-synthesizer.ts:4433 \u00B7 src/resolution/callback-synthesizer.ts:4626 \u00B7 src/resolution/callback-synthesizer.ts:5097 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aafc87420bb24d8b8dbd87877c09556fbad72909f9e52da52c38e3aad87161f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9 locations): src/resolution/callback-synthesizer.ts:771 \u00B7 src/resolution/callback-synthesizer.ts:4127 \u00B7 src/resolution/callback-synthesizer.ts:4217 \u00B7 src/resolution/callback-synthesizer.ts:4313 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e541bf813ce137900238d02ebc5190f88c5ee010914f01d27e0d0c92cfc0acd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4487 \u00B7 src/resolution/cpp-supertypes.ts:429 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f7376215e862719d9da7d762aa0bf22c415dd1ff21bafa7a2ff49cc5f7a58f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:5557 \u00B7 src/resolution/callback-synthesizer.ts:5569 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c2033a0791ea68c7052d51633c6571988d06e56a1d69f5e9f1f750c7df029d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:5016 \u00B7 src/resolution/tier-synthesizer.ts:287 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5016}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17839a5a6ce0360f22483efa0db8e4162d444b5fd9fbd28386984f9c6ed18ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/dart-libraries.ts:399 \u00B7 src/resolution/import-resolver.ts:661 \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":"src/resolution/dart-libraries.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"328a20518240507e4b53ab0e329e1968baca37edcf491327621dd0ca90e1a9aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/dart-local-scope.ts:531 \u00B7 src/resolution/name-matcher.ts:5475 \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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"3595d567b47277850e4fbd7485bd46dbcbe98dfcc709f935e0e812f12b5dc77b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/expo-router-synthesizer.ts:57 \u00B7 src/resolution/sveltekit-synthesizer.ts:117 \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":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4c7f7fdbe0edc7e57a5d2112fb1a559c94f0275eb356aebe5ccb9bf7dd6c91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/angular-router.ts:372 \u00B7 src/resolution/frameworks/drupal.ts:493 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87fe916469851e84ba1494b7ff418318f8009e326a6f8dc635e90dc09c352c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/angular-router.ts:831 \u00B7 src/resolution/frameworks/angular-router.ts:838 \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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c02a1399c2da4dea863a9f0041e9716e6beb47527728f53b4d84be97969f133"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/codeigniter.ts:124 \u00B7 src/resolution/frameworks/expo-modules.ts:115 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d94372bf6361d8f10b2d8c1d7cffa98515e9d6d1a9bafc642b2f0f4775b60a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:167 \u00B7 src/resolution/tier-synthesizer.ts:62 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6255097ee34c8e4c156612637701bc55123313a822889b23f6065818080dec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:512 \u00B7 src/resolution/name-matcher.ts:11977 \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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb3aced21045f7e9a2025159c96bbed5de19f787d02ce0155c768116006a33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/resolution/frameworks/expo-router.ts:834 \u00B7 src/resolution/frameworks/nextjs.ts:322 \u00B7 src/resolution/frameworks/react-router.ts:192 \u00B7 src/resolution/frameworks/tanstack-router.ts:438 \u2014 the 4 copies are spread across 4 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0529d6925e1e1b3213bcfd12142f75ff4aff4d874253d1453d3071d102b1b48f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/python.ts:206 \u00B7 src/resolution/frameworks/python.ts:273 \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":"src/resolution/frameworks/python.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"073c5c4b0d15eca6e50214a0411d10414632a3243ef1ca2cafcc5b815c928e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/sveltekit-router.ts:85 \u00B7 src/resolution/frameworks/vue-router.ts:261 \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":"src/resolution/frameworks/sveltekit-router.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd40f18030d5b9a8bcb4af152280cdfbbeab0bc4b569356cb764602576df3b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/frameworks/vue-router.ts:313 \u00B7 src/resolution/frameworks/vue-router.ts:322 \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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7cdd6ace74ff837daa6e0531030dc16c2ee577c79e049c66530bd3368593a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/resolution/import-resolver.ts:417 \u00B7 src/resolution/name-matcher.ts:23108 \u00B7 src/resolution/name-matcher.ts:30147 \u00B7 src/resolution/name-matcher.ts:30753 \u2014 the 4 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":"src/resolution/import-resolver.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b211744b10dd07bb3254a709d5e2b27cffd0aa433ac1b02787d703046b8869ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/import-resolver.ts:1873 \u00B7 src/resolution/name-matcher.ts:32991 \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":"src/resolution/import-resolver.ts"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a407b2869642476791594e7c9b01d7f20ac6118a2c21684c3f67cbda7c54a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/index.ts:985 \u00B7 src/resolution/index.ts:993 \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":"src/resolution/index.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a310cf8036f3a2b7763ce2c22916b6060e3998edd9e26b7ef562a9b2da2716"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/resolution/name-matcher.ts:4917 \u00B7 src/resolution/name-matcher.ts:13926 \u00B7 src/resolution/name-matcher.ts:30289 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":4917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64cb4b7b6225ef86d6ee0907c02edf58b9710cdcaaebb6794af8fe5d365b42d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5076 \u00B7 src/resolution/name-matcher.ts:6273 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5076}}}],"partialFingerprints":{"codehealthFindingId/v1":"99af3b9c558c16c0a676e48fce74cdbad5d8158f52b83312bde98ff3f7d48190"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5620 \u00B7 src/resolution/name-matcher.ts:5633 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5620}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3db1e506223f0ffb36b270d080942724c2fd22610e0b3a15d2ee7024c31e446"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:6195 \u00B7 src/resolution/name-matcher.ts:7828 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6244ea8f5a9679d460dd08722e61c48f7fd0e02f6a44db1c7be8d522d2ef478f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:7793 \u00B7 src/resolution/tier-synthesizer.ts:125 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":7793}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a358e3788ce2a49fced969dd6e7b431a2e28db16e91a888c27b73f77fc58169"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:11977 \u00B7 src/resolution/ruby-parameter-flow.ts:411 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":11977}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a6e71fa467324427884c7938512fffa3329a852802995edb801296d7e30044"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:14001 \u00B7 src/resolution/name-matcher.ts:23905 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":14001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a8b1dbbad905a187cc26d291d521b491988c25a490c710ee52c0153a5876d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:14400 \u00B7 src/resolution/name-matcher.ts:31944 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":14400}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d7f7abdd3a73b916b6d8f10a3b2744f19eedf96ebfc01bde365aefe4407fc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/resolution/name-matcher.ts:14819 \u00B7 src/resolution/name-matcher.ts:16983 \u00B7 src/resolution/vbnet-receivers.ts:117 \u2014 the 3 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14819}}}],"partialFingerprints":{"codehealthFindingId/v1":"988d93a4978ebd40c0521340e7ae98e9b0291e9e3dbe1e2ba8cd2fd90e52c973"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:17381 \u00B7 src/resolution/name-matcher.ts:22854 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":17381}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e1dafae2dd2a7516b56a8aef5b2b01c5163d2b05089438efbbca5e9cc7209f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:18701 \u00B7 src/resolution/name-matcher.ts:18729 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":18701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3520b8e05e868d8ab235e023354ca1aadb68510ef60f2cb0636495e873b6f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/resolution/name-matcher.ts:20143 \u00B7 src/resolution/name-matcher.ts:20179 \u00B7 src/resolution/name-matcher.ts:20199 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":20143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5696d6798ad91bfb8318d1ce4548bb43ad6c4fd15757e13843b9b62fd79fbbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/resolution/name-matcher.ts:20683 \u00B7 src/resolution/name-matcher.ts:20758 \u00B7 src/resolution/name-matcher.ts:20797 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":20683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5defd835a910b516c93ec87d2d94d069d1cff5d083915075b203b5d273407c27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:26293 \u00B7 src/resolution/name-matcher.ts:26302 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":26293}}}],"partialFingerprints":{"codehealthFindingId/v1":"478f7890ee67a341c66c78a846ffaf9250ebbcf7bc82b5c6ff9290679b6f8aac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:27075 \u00B7 src/resolution/name-matcher.ts:27301 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":27075}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aa62479d23f9351f2fe15a208105f19a5b6516674702d50636f649400b63f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:28531 \u00B7 src/resolution/name-matcher.ts:28888 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":28531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70df62a0b2c6d1384b11f89672d41d1e4a3d9256dcb1ce40c884d19e4c3966b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:32857 \u00B7 src/resolution/name-matcher.ts:32946 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":32857}}}],"partialFingerprints":{"codehealthFindingId/v1":"d125b5bfdb5b98dbfe354012d360cacd008a996a6a0aceca166544ce0d72fde5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/name-matcher.ts:32874 \u00B7 src/ui-server/api/effects.ts:514 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":32874}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f91f7c34acee6d296c84f8be91e4c50f97193581299d2dc7f9892e1eff07ffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/resolution/next-router-synthesizer.ts:64 \u00B7 src/resolution/react-router-synthesizer.ts:135 \u00B7 src/resolution/tanstack-router-synthesizer.ts:62 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd3201495c39c22cb69b9ef88d5207411eaada1677f5ba1d608c86012374efc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/rust-scopes.ts:727 \u00B7 src/resolution/tier-synthesizer.ts:146 \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":"src/resolution/rust-scopes.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"03141ca401f0843faee8fa430ac92d675a7a52d63f6fa8f40ae56072761e46ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/strip-comments.ts:62 \u00B7 src/resolution/strip-comments.ts:474 \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":"src/resolution/strip-comments.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a4d25eadc8ebc735b1df5ab6d77c053f24411599c90b7a5d543d050edee0bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/swift-type-visibility.ts:267 \u00B7 src/resolution/vbnet-receivers.ts:949 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6754c29ca4d10e9bad16d718a26266cf4e17d6a5cae446eeff905e956b824ad9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/resolution/tauri-synthesizer.ts:592 \u00B7 src/resolution/tier-synthesizer.ts:1235 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"f511c4d0c8037b7353042cd7c243ab35415d9d7d2e9f98de0610c942b190e070"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/ui-server/api/flow.ts:502 \u00B7 src/ui-server/api/flow.ts:510 \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":"src/ui-server/api/flow.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a682efb6db2656d13f199c0fba8b9256b564b169743cedaa4522a31a433bd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/src/lib/api.ts:230 \u00B7 ui/src/lib/api.ts:242 \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":"ui/src/lib/api.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff999d2e8989729f785611dd1862d3b5a5112e7671443fe683e64df388cb438"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/agent-eval/offload-eval-cost.mjs:117 \u00B7 scripts/agent-eval/offload-eval-cost.mjs:122 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"scripts/agent-eval/offload-eval-cost.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f1e56c69846e256fd8f020687499923272c6a8b7aa563e0952257e0effd81c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): scripts/agent-eval/offload-eval-effort.mjs:26 \u00B7 scripts/agent-eval/offload-eval-hook.mjs:49 \u00B7 scripts/agent-eval/probe-explore.mjs:14 \u00B7 scripts/agent-eval/probe-file-spend.mjs:70 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/offload-eval-effort.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"001878bead2dfadd7d851b58564e9c6929d17723b257d815c3f67d47b68351aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/agent-eval/parse-run.mjs:981 \u00B7 scripts/agent-eval/parse-run.mjs:1000 \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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e6db9c9d090fef86fcf4e1eb2b401ee9509dedbe1fb4147ea77ce776fbf07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/agent-eval/parse-run.mjs:1007 \u00B7 scripts/agent-eval/parse-run.mjs:1021 \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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d4cfe89c7f4ba4ef7134f79a80789da84140cf4ef51c31b7fbef311436103a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/agent-eval/parse-session.mjs:32 \u00B7 scripts/agent-eval/parse-session.mjs:50 \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":"scripts/agent-eval/parse-session.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"654fded0da86f6e5e0f25d9629954ddbe89f1def1db09f9aadf23d0dd73db4f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/agent-eval/probe-decl-only.mjs:120 \u00B7 scripts/agent-eval/probe-factory-closure.mjs:77 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/probe-decl-only.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab65019c4bd609a8756d10189ace5dd6cb4593a221572f63c185a5cd2f041e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): scripts/agent-eval/probe-file-spend.mjs:68 \u00B7 scripts/agent-eval/probe-suite-envelope.mjs:45 \u00B7 scripts/agent-eval/probe-sweep.mjs:20 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/probe-file-spend.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9baf51cc4ba2f1ea55f6922c47b1b72451f2f8378554c9cbd358989036194e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/agent-eval/repro-daemon-clients.mjs:49 \u00B7 src/mcp/proxy.ts:437 \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":"scripts/agent-eval/repro-daemon-clients.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1785687c3cb90aef5c39136a100e20455bb7304846bce5118972ca6fd5d198"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/context/index.ts:1203 \u00B7 src/context/index.ts:1234 \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":"src/context/index.ts"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c1d9157c903557073b1d08ca167618785c478bfa7852e36cd45afacb8584fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/db/parameter-flow-queries.ts:252 \u00B7 src/db/queries.ts:4383 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"src/db/parameter-flow-queries.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9bd895744b5098700c7e4ba7eb8394edbf41095e85dda1b372201b366f382d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11 locations): src/db/queries.ts:1232 \u00B7 src/db/queries.ts:1373 \u00B7 src/db/queries.ts:2840 \u00B7 src/db/queries.ts:2890 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 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":"src/db/queries.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e907176375b268531bd9ac47c21b6040fc715aab67862b07bf0239cff89358"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/db/queries.ts:2063 \u00B7 src/db/queries.ts:2296 \u00B7 src/db/queries.ts:2382 \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":"src/db/queries.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"91382d4e133987d1e6fd90e12a3cd2203630ba4021ac6db527f12dce1811bbbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/db/queries.ts:2432 \u00B7 src/db/queries.ts:2456 \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":"src/db/queries.ts"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d029b336c3f445f9e989de08d3c3f161a4fd56d25fd96f871d770ca5002895"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/db/queries.ts:2619 \u00B7 src/db/queries.ts:5358 \u00B7 src/db/queries.ts:5400 \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":"src/db/queries.ts"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e20ae56fcb5e21ab7780dc23885a561ddc6b673f0bef4877ec5a6c2ef1aacf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/db/queries.ts:4795 \u00B7 src/db/queries.ts:4820 \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":"src/db/queries.ts"},"region":{"startLine":4795}}}],"partialFingerprints":{"codehealthFindingId/v1":"53618371f18ea7c8d1a8d6ba0bfc87776e880042c071d597ad82e854fd8486bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/directory.ts:157 \u00B7 src/directory.ts:171 \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":"src/directory.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb2445fe0ed5080f02fa922097d7d3c679216870f46db048480a89b0c60d4eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/extraction/astro-extractor.ts:160 \u00B7 src/extraction/svelte-extractor.ts:126 \u00B7 src/extraction/vue-extractor.ts:202 \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":"src/extraction/astro-extractor.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c312a8c140b9d3650b437e10ca85b591aa42ac39ad701c9db1b2d9afd3899b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/index.ts:3013 \u00B7 src/extraction/index.ts:3073 \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":"src/extraction/index.ts"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf85499cc43cb749ca9eac470070d81a42386c11119ed2635bae2b21e374d0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/extraction/languages/c-cpp.ts:701 \u00B7 src/extraction/languages/c-cpp.ts:848 \u00B7 src/extraction/languages/c-cpp.ts:1063 \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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c714aebf720dc5b85f1279e5ad6f72a4beecdc4cb0cad730740b6ccc7674f40d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/extraction/languages/c-cpp.ts:846 \u00B7 src/extraction/languages/c-cpp.ts:901 \u00B7 src/extraction/languages/c-cpp.ts:961 \u00B7 src/extraction/languages/c-cpp.ts:1061 \u2014 all 4 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ae85a824ca72ae2aba2dccb2cc9430746ebf3ae70ae6a53803868d8ed95f91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/extraction/languages/c-cpp.ts:1473 \u00B7 src/extraction/languages/c-cpp.ts:2577 \u00B7 src/extraction/languages/c-cpp.ts:2634 \u00B7 src/extraction/languages/c-cpp.ts:2696 \u2014 all 4 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c596599fded8f0ca45ba139fbcb70d7875705b97db00720ea6d6934544577c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/c-cpp.ts:1389 \u00B7 src/resolution/cpp-type-aliases.ts:430 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"98be7c94254d409786f3188b41eba95c71909c8aa2e5331da6ebb065658b7524"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/cfscript.ts:131 \u00B7 src/extraction/languages/dart.ts:749 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"src/extraction/languages/cfscript.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cf01656d17e9fdd4d223d1fe9874f563091045c02eda7ddd77d635a6a38327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/cfscript.ts:131 \u00B7 src/extraction/languages/objc.ts:187 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"src/extraction/languages/cfscript.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1e4ddad28ab34bce9562b481891022dcf9f24804be08b477fb527002025d16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/cpp-macro-methods.ts:455 \u00B7 src/resolution/frameworks/react.ts:1100 \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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedebb14a25d2d63aae8dad4b0f3c9010b2e749e68c8272b99413d2b426e2547"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/dart.ts:670 \u00B7 src/extraction/languages/dart.ts:691 \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":"src/extraction/languages/dart.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e9feeee81efb208dfff332ffcdbb457a0a8a194cec80eada95e900a84aa488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/dart.ts:816 \u00B7 src/extraction/languages/dart.ts:827 \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":"src/extraction/languages/dart.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fa46ec0bc7bbaa91d5a620f24a1da43adf45053f9e903ddc5f2113416c99e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/dart.ts:749 \u00B7 src/extraction/languages/objc.ts:187 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"src/extraction/languages/dart.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"403feb562aa7063040589662b2316b46a808c48aaac3857280106129080c445b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/go.ts:25 \u00B7 src/extraction/languages/swift.ts:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"src/extraction/languages/go.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4d3b29333185a55349a1b2093ff0c7c7fdc600cd303b4dd96e2aee90f1ae15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/java.ts:386 \u00B7 src/extraction/languages/pascal.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"src/extraction/languages/java.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4433dabfb1e91dfff47cb0319d27461c7b1870395ac9b2d273c2133a6228f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:21 \u00B7 src/extraction/languages/swift.ts:14 \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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aea7db45c9175fe81d85a955daf41879cbaf82044988e7891af0e7c0a9bb105"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:480 \u00B7 src/extraction/languages/kotlin.ts:503 \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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a0aa0c63efbb1d7a83b294a825f84848dcf110280e1ba800bdb40a38b8ad48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:549 \u00B7 src/extraction/tree-sitter.ts:7904 \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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7799a5a01d2443df301ea0b4c51aaa6cad0d480b715a6c592372fe0037e6979b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:565 \u00B7 src/extraction/languages/swift.ts:178 \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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a63ff4624707a399f162956b521581e2fd9aad55c18ec8f21b62efd98ba19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/kotlin.ts:418 \u00B7 src/graph/branch-guards.ts:655 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e92a939d1cf62c32dea63dfd836ddbdb2abd8d6068ccc6efbb581f97568a512"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/extraction/languages/objc.ts:177 \u00B7 src/extraction/languages/typescript.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"src/extraction/languages/objc.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cec646dd424242f811ee8aa0fdad4772f9f964c77bd810bc312648d26457da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/php.ts:171 \u00B7 src/extraction/languages/ruby.ts:145 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/php.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6a4657b0ccc95d4c42e8ede09ccf686e9e6e5de8608268e3aafd0ba99d3087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/r.ts:58 \u00B7 src/extraction/tree-sitter.ts:3763 \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":"src/extraction/languages/r.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16c2ccea797adffd2e8418192cbf1b8955df4df985de7e6a8dd86fc38bff57a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/extraction/languages/r.ts:113 \u00B7 src/extraction/tree-sitter.ts:5319 \u00B7 src/extraction/tree-sitter.ts:5759 \u2014 the 3 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":"src/extraction/languages/r.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4229e380365cdc03e178634b25f4d72b09f0cd51c15ba4cf7de948ff93b13964"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/languages/r.ts:226 \u00B7 src/extraction/tree-sitter.ts:2525 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages/r.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d114b1f3da75f4ab36d0e8d3242cc3cc8ef7f4ae9d4d4ade0334fb6ad83050f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/extraction/svelte-extractor.ts:206 \u00B7 src/extraction/svelte-extractor.ts:257 \u00B7 src/extraction/vue-extractor.ts:290 \u2014 the 3 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":"src/extraction/svelte-extractor.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5b818c72cdef9e3b6edc08fa59f1e55e262b7a97c046223cea7cc66d215af2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): src/extraction/tree-sitter.ts:1655 \u00B7 src/extraction/tree-sitter.ts:3084 \u00B7 src/extraction/tree-sitter.ts:7106 \u00B7 src/extraction/tree-sitter.ts:8924 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/tree-sitter.ts"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b1d48708493b01620683164d61134ff61ff647dade8a993f7740199cbe453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:3005 \u00B7 src/extraction/tree-sitter.ts:8932 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3005}}}],"partialFingerprints":{"codehealthFindingId/v1":"02630e5180949696656d68310f6fe488b32a60dd304f415e4f7be2feb80b1a23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:3622 \u00B7 src/extraction/tree-sitter.ts:3692 \u00B7 src/extraction/tree-sitter.ts:3917 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3622}}}],"partialFingerprints":{"codehealthFindingId/v1":"913cb4d23d2ba0c3a90ac25ac38299a095a7f4bdcddeb23b6b4ecf1eac4e136b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/extraction/tree-sitter.ts:4147 \u00B7 src/extraction/tree-sitter.ts:4196 \u00B7 src/extraction/tree-sitter.ts:4399 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ffe543303a62cf1cd0e84b417f450f007fb6b25ea4f9de2deafcab5ddf9fba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/graph/branch-guards.ts:1476 \u00B7 src/graph/branch-guards.ts:1515 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0cf76300459d3be67dad658ddffb5253d9f1d27ecc5757707589feea07a5c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/graph/branch-guards.ts:1526 \u00B7 src/graph/branch-guards.ts:1622 \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":"src/graph/branch-guards.ts"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55f1885851245e8b805d9ac90c584b21a9d93f1d438029cbd17330ac54e4e29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/graph/named-symbol-flow.ts:575 \u00B7 src/graph/named-symbol-flow.ts:587 \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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae42a90fa09d69b140f8f87ed30c4e92113539e1dcc246bdd73b32f3175a05c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/graph/traversal.ts:457 \u00B7 src/graph/traversal.ts:496 \u00B7 src/graph/traversal.ts:607 \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":"src/graph/traversal.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fc00176b8832ed612a45e666816b1da0625fd2dd7975216a6391a6b294455a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/graph/type-hierarchy.ts:216 \u00B7 src/graph/type-hierarchy.ts:255 \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":"src/graph/type-hierarchy.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"49145a8ba63ab5a84401b877503bc7419e6dca8854ffbe004b7b798191bc8282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/index.ts:2367 \u00B7 src/index.ts:2383 \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":"src/index.ts"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba58cdf07c26f6bc1ed23d95915f83618348b7e3849a2fa47c104fb5886909ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/installer/targets/antigravity.ts:275 \u00B7 src/installer/targets/claude.ts:292 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/antigravity.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf00524f4ae86cd9c80b5a963c0d2b995a362906c5ca7e0e61aabc55b1fda93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/installer/targets/claude.ts:445 \u00B7 src/installer/targets/claude.ts:497 \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":"src/installer/targets/claude.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"804b8b5e0e5c341d30deda7d722c95151aeb717ff74f155cae9cfd04209d9663"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/installer/targets/claude.ts:510 \u00B7 src/installer/targets/gemini.ts:156 \u00B7 src/installer/targets/opencode.ts:341 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/claude.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a29d3a384c96ddd6aacd79cd3d923ac2a824c13a21977d2e6408f269c3b62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/installer/targets/codex.ts:64 \u00B7 src/installer/targets/pi.ts:42 \u00B7 src/installer/targets/qwen.ts:47 \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":"src/installer/targets/codex.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4ee27d519af98f7f979313b83bdd61ea100ef88a5873a57bbb30e06c19eb84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/explore-dedup.ts:105 \u00B7 src/mcp/explore-session-state.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":"src/mcp/explore-dedup.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ed7fe4f14ebe28beee2a5dfe100175b90742288709d90cc7f551539fb66744"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/mcp/explore-session-state.ts:267 \u00B7 src/mcp/explore-session-state.ts:331 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"src/mcp/explore-session-state.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39cae0d88f0a2140ca649200957744d7bf658edbe30f980e1ce572d0510302c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/ppid-watchdog.ts:66 \u00B7 src/mcp/startup-handshake.ts:41 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/ppid-watchdog.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c06b14c22bda2278410bfc11c31cb44d5b5630d091eb1597dcaae602d94b936"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/query-pool.ts:162 \u00B7 src/mcp/tools.ts:935 \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":"src/mcp/query-pool.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce2cbaa860663016520e51450fc319ad9cc1033ed01b6ee57c6d21d6bfbec63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/mcp/tools.ts:3342 \u00B7 src/mcp/tools.ts:3402 \u00B7 src/mcp/tools.ts:3491 \u00B7 src/mcp/tools.ts:3573 \u2014 all 4 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":"src/mcp/tools.ts"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabd7f79ab518e97887f0d04bb7561db05d78755d50d774922a02808cafee0ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): src/resolution/angular-template-synthesizer.ts:83 \u00B7 src/resolution/frameworks/angular-router.ts:333 \u00B7 src/resolution/frameworks/angular-router.ts:374 \u00B7 src/resolution/frameworks/nestjs.ts:530 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 6 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a426baf6322139e7740e72dbd6652ecc2bf5f31585a3d2838da65a0680dd40cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:269 \u00B7 src/resolution/c-fnptr-synthesizer.ts:275 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789902f01343417b697f535ce43162be4032e3a24b4a37c96e89f4ed6d44aa2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:608 \u00B7 src/resolution/callback-synthesizer.ts:4568 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e168a538880b010658d2c1eb9002f5bbef750b4c80fe6360f389184cd0c91e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:698 \u00B7 src/resolution/c-fnptr-synthesizer.ts:1343 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99a2b2f9c3700e6dbd1a278f32dc187b58dbf485b09d724164541f87415f2c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:724 \u00B7 src/resolution/c-fnptr-synthesizer.ts:777 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cdd7202bbc9d3c5d58ed825c2c4a68b415d43756de9c383619983b008bf570"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:761 \u00B7 src/resolution/callback-synthesizer.ts:3619 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5d87cd8d80ba64f68b55e69579bb7e50098bf7b977606b8ad88a24785d89b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/c-fnptr-synthesizer.ts:997 \u00B7 src/resolution/c-fnptr-synthesizer.ts:1003 \u00B7 src/resolution/c-fnptr-synthesizer.ts:1009 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df3a323746f6ebb1fea88b60287ce05b8cb55ca4c6f69c60a3b662cd4f0cf25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/callback-synthesizer.ts:484 \u00B7 src/resolution/callback-synthesizer.ts:3764 \u00B7 src/resolution/callback-synthesizer.ts:4029 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"543246f6d831b5b1197a399d81ba91e89e100a94015aa38ed574b0dd8b5e16f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/callback-synthesizer.ts:1132 \u00B7 src/resolution/callback-synthesizer.ts:3404 \u00B7 src/resolution/callback-synthesizer.ts:3473 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2c83107e8a166267204685441ec747d3f014880816ee009b3ea1d2919c369"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:1207 \u00B7 src/resolution/callback-synthesizer.ts:1679 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"831a6e979e355c6300cbdb56228e6f649038e1a444d35d510efc88b357068e8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): src/resolution/callback-synthesizer.ts:3306 \u00B7 src/resolution/callback-synthesizer.ts:3644 \u00B7 src/resolution/callback-synthesizer.ts:3983 \u00B7 src/resolution/callback-synthesizer.ts:4044 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d808e60d7e20e02824f2f19f3330e1fab3f0f62f98a62b952a4e33e4d7e7536f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3402 \u00B7 src/resolution/callback-synthesizer.ts:3456 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8144c13dd1849ff3ffe4159ca4eeb16029e486a31cb6493b96b18fd4af9f16a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4378 \u00B7 src/resolution/callback-synthesizer.ts:5185 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6902e33db820ba1da2c5e21b96c6e7dc22817c5a1bd94f9e69bdc1a7cdf9bc06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/cpp-includers.ts:82 \u00B7 src/resolution/cpp-includers.ts:97 \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":"src/resolution/cpp-includers.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe549c6c5ebd381260a0e4d5ad501e9502831f1bb622b8724949ab671cb38d02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 30 locations): src/resolution/cpp-raw-strings.ts:65 \u00B7 src/resolution/cpp-supertypes.ts:484 \u00B7 src/resolution/name-matcher.ts:2887 \u00B7 src/resolution/name-matcher.ts:3787 \u00B7 \u002B26 more site(s) not listed \u2014 the 30 copies are spread across 4 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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7cb7811416126d7c2f7866350ef3dff45c113414061708333efafb66283344"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/cpp-type-aliases.ts:76 \u00B7 src/resolution/name-matcher.ts:6191 \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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd23ef98e279b2a959724f96d20f2aa7ee9b4555904550d0d4855f61cb62ad0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/cpp-type-aliases.ts:163 \u00B7 src/resolution/name-matcher.ts:32934 \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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116d7d7ee86ce8090b724a7c2ef149b7cc23d93a620f7835af5d422df26d7d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/cpp-type-aliases.ts:272 \u00B7 src/resolution/name-matcher.ts:4064 \u00B7 src/resolution/name-matcher.ts:19619 \u2014 the 3 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e900da62603863b97806cc4cfb34e1be32208ffaa950f67c1afb1c07a6cb38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10 locations): src/resolution/cpp-type-aliases.ts:494 \u00B7 src/resolution/name-matcher.ts:8905 \u00B7 src/resolution/name-matcher.ts:19556 \u00B7 src/resolution/name-matcher.ts:19586 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"866aebc744f873f5b9afcac6d3b7010de306b6fd96ff4fb0a7934095d895ca7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/resolution/dart-local-scope.ts:43 \u00B7 src/resolution/type-parameters.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb75bf27a2fde120638ece52f4bd93218c9f9d955e177ee9e362f72da403ad1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/frameworks/angular-router.ts:331 \u00B7 src/resolution/frameworks/angular-router.ts:373 \u00B7 src/resolution/frameworks/vue-router.ts:182 \u2014 the 3 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edeafb556970af4ea114738a2c9cbf2097ea793c605f38b6170f51d6a485cc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/frameworks/codeigniter.ts:157 \u00B7 src/resolution/frameworks/drupal.ts:86 \u00B7 src/resolution/frameworks/drupal.ts:333 \u2014 the 3 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":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b419ad3ce6a14f55bdbfc33f96241fc8b6c4b3c957459a2e0c3ddbb5a1935"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/frameworks/codeigniter.ts:192 \u00B7 src/resolution/js-super-calls.ts:110 \u00B7 src/resolution/pascal-scope.ts:744 \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":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9628bbc46c293d2845b4fe73aa7d5456d711e3a6bf2094e9db2d4a3ce5ec79c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/csharp.ts:336 \u00B7 src/resolution/frameworks/csharp.ts:382 \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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5d58c04f3d69c433f7c9d81b975d66656b653314eaa7aa1ceaf1198d4ae898"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/drupal.ts:668 \u00B7 src/resolution/js-super-calls.ts:111 \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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2c06f1e6bcf7072b6d8b496cb2e8bcf66e572e31e1e150d1faf4ef79eb7d91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/express.ts:25 \u00B7 src/resolution/frameworks/express.ts:474 \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":"src/resolution/frameworks/express.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26a4d3ff3c9f00dbaa6cd9afcbb2919ff48679468f7a0d073a66fc2750a998b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/express.ts:713 \u00B7 src/resolution/frameworks/ruby.ts:395 \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":"src/resolution/frameworks/express.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad526dafd03b0ef218c157e8e47ff0ad20ce8a7bfac4a3d79a90e63d60b16ce1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/laravel.ts:121 \u00B7 src/resolution/frameworks/python.ts:69 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb3e0f99a7bfcb16ecfdf9c79ac541d319df1e5ff7ab9dd26c356364b69bc06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/frameworks/nestjs.ts:364 \u00B7 src/resolution/frameworks/nestjs.ts:372 \u00B7 src/resolution/name-matcher.ts:27565 \u2014 the 3 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0c70764c01065ca751c149bfc2a11ddeb9fea669e1305ca0897885d6eed0dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/frameworks/nextjs.ts:134 \u00B7 src/resolution/frameworks/react-router.ts:114 \u00B7 src/resolution/frameworks/sveltekit-router.ts:77 \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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"773920d44e5bad449d19a3d63bda4e317322f4fa157ec98f8f93f6fbe4ba9203"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/resolution/frameworks/nextjs.ts:155 \u00B7 src/resolution/tier-synthesizer.ts:1047 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fd3c3297fe3c841ae2fe49278ced1653d149fbb08fcab8a3b6435d829f229f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/react-native.ts:430 \u00B7 src/resolution/frameworks/react-native.ts:456 \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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"425e22b5dc2f0f790e71337c90892b34a348cd26497bc5613faf0a808fdaf71b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/frameworks/react.ts:2434 \u00B7 src/resolution/frameworks/react.ts:2474 \u00B7 src/resolution/frameworks/react.ts:2505 \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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c448fc82539a502233e5cff31435fb28899956452fd88651177d4e9019788"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/frameworks/ruby.ts:185 \u00B7 src/resolution/frameworks/ruby.ts:295 \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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa18434fc4dc3f3ece8202180e23fec3a327f7523b9a52308c59f7ca22ac1a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/import-resolver.ts:1793 \u00B7 src/search/query-parser.ts:79 \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":"src/resolution/import-resolver.ts"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c838e9995fc2e41f8e5075178d38c0690b3cd15cd6df94af7d5bcc182cbbde3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/import-resolver.ts:2072 \u00B7 src/resolution/ruby-parameter-flow.ts:205 \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":"src/resolution/import-resolver.ts"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"08844304baa0d38790698db1f25acbda37237e9e646801ac87a69805b9c1aba8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/resolution/import-resolver.ts:3218 \u00B7 src/resolution/import-resolver.ts:3249 \u00B7 src/resolution/import-resolver.ts:3274 \u00B7 src/resolution/import-resolver.ts:3302 \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":"src/resolution/import-resolver.ts"},"region":{"startLine":3218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9a1873916dffa660cbbca13fd08452484c5bd5c81b56f13edb275dcb16f8b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/index.ts:1361 \u00B7 src/resolution/index.ts:1378 \u00B7 src/resolution/index.ts:1401 \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":"src/resolution/index.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"579734811153e850080a644088400180f6597021745079cafd9a3d61e4aa42f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/resolution/name-matcher.ts:3529 \u00B7 src/resolution/name-matcher.ts:3644 \u00B7 src/resolution/name-matcher.ts:13749 \u00B7 src/resolution/name-matcher.ts:23921 \u2014 all 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8919a4a7653224b1a8260116f5cbef40f89d7322fb8c027c4d9d44ef9aec6ab9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/name-matcher.ts:4387 \u00B7 src/resolution/name-matcher.ts:10623 \u00B7 src/resolution/name-matcher.ts:10720 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":4387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f877a512ab3b5ef63be9ba18af3859c1a911b31d110f063d49e0ffb250d1228"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:4745 \u00B7 src/resolution/name-matcher.ts:17240 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":4745}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bec1ba4d4ed50d8f65d0ae6908094aef993ef2a9c2aeaba9c5ea3e82cd964c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/name-matcher.ts:6069 \u00B7 src/resolution/name-matcher.ts:8583 \u00B7 src/resolution/name-matcher.ts:13160 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6069}}}],"partialFingerprints":{"codehealthFindingId/v1":"15772a25a8ae2ff945a84a70251b988c0024fccce61766c3e2a7c363c97c8980"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:6632 \u00B7 src/resolution/name-matcher.ts:7752 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c231fb0b7dcdac40ec693791447fd6a575c1b5446ddce06df6cdc227e0632871"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:6954 \u00B7 src/resolution/name-matcher.ts:7350 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6954}}}],"partialFingerprints":{"codehealthFindingId/v1":"347d61eb40051974e5743410861c0de6403a90e42327576a5e0dc8eea6790e5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:7118 \u00B7 src/resolution/name-matcher.ts:32778 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":7118}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a72c63aab4ab3dbc526bb74279d6862aed36c9b42bc046e87755d4148a820"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/resolution/name-matcher.ts:7238 \u00B7 src/resolution/name-matcher.ts:7455 \u00B7 src/resolution/name-matcher.ts:7824 \u00B7 src/resolution/name-matcher.ts:7960 \u2014 all 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7238}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d76a512f7962def3b37c775569e5ada4af8cab7aa2be3d4e53b64f13970f7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/name-matcher.ts:7500 \u00B7 src/resolution/name-matcher.ts:8350 \u00B7 src/resolution/name-matcher.ts:8769 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":7500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33b53fef3f68c2ec0424bab6af89917a723555c30e53640160ab9fad0405f43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:11889 \u00B7 src/resolution/name-matcher.ts:27548 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":11889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13484c9301630ae997802bd3f957ba8ece71e4cfe9511e1ce1687ee38828c53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:12575 \u00B7 src/resolution/name-matcher.ts:12686 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":12575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8006a8fcd78bc7bff42df6844fc73b52da0a08cea4d189358c58a549af59788b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:13960 \u00B7 src/resolution/name-matcher.ts:23941 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":13960}}}],"partialFingerprints":{"codehealthFindingId/v1":"6112a912bfa83746f4d266a6aec24fb88dd6ac9ce3e6bf1cea4a4c1d28d9f9b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:29843 \u00B7 src/resolution/name-matcher.ts:30667 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":29843}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc3d40b52c20c9f3378ec21733e4340fbf9080f64b61630e9d6d2cfaee6aca3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/name-matcher.ts:30333 \u00B7 src/resolution/name-matcher.ts:30735 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":30333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb10a7174edd46d66b0a607fc2ca8e76a462e2f3c6da0fa09374674b6cbbbb38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/ruby-constant-paths.ts:171 \u00B7 src/resolution/ruby-constant-paths.ts:222 \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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcf327f2e2cea76c23c9fc6cbc743895b61e4398a69c554d03c6aadeed686e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/ruby-constant-paths.ts:329 \u00B7 src/resolution/tier-synthesizer.ts:1027 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"548e755baffc9710f3e7b406c48a3b453d397e79f00b6c2dbbc4414de8b0f9fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/vbnet-receivers.ts:375 \u00B7 src/resolution/vbnet-receivers.ts:457 \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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57892424a9450ace024275547abcf0db87d31c3d40b5b2304f0648a0505ac20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/vbnet-receivers.ts:998 \u00B7 src/resolution/vbnet-receivers.ts:1237 \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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf01d9d707b5aa0aad80c1f7b602b622c06654de91ed9a0e79546262c9a5afb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/sync/watcher.ts:574 \u00B7 src/sync/watcher.ts:588 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/sync/watcher.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e469458ff762ae992e773b7e2c048a9ec81a7204ed41a42f97cc209e38aa15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/ui-server/api/program.ts:402 \u00B7 ui/src/lib/conditions.ts:169 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/program.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb82aae8dd85f5b7f1420e54134a75dcd346f70aeb1462b0d5b6b7984c7d920b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/ui/shimmer-worker.ts:50 \u00B7 src/ui/shimmer-worker.ts:73 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"src/ui/shimmer-worker.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f43d69d18a707391ea0be29daeae750380b301166cd5871bc4e3f2caa7694b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): telemetry-dashboard/src/api.ts:587 \u00B7 telemetry-dashboard/src/api.ts:705 \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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf125c9f4cb63f2856579f9ccd837cfdfeeba153e15bc8c43d7e68af08e372c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): telemetry-dashboard/src/api.ts:71 \u00B7 telemetry-worker/src/rollup.ts:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d59200d0b656125ffadbd70e1d81d33c1b7dc11e944f6e92ea159334879c04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): telemetry-dashboard/src/auth.ts:78 \u00B7 telemetry-worker/src/rollup.ts:549 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-dashboard/src/auth.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83447727fd2db6701792084a68885c8d7e3832a4fe71da765c56eadab746fb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/src/lib/adapter.ts:426 \u00B7 ui/src/lib/adapter.ts:433 \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":"ui/src/lib/adapter.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3413c0b04a35605ce8824a05cccf8708bbeb16f23836dcf70bb8a22a4f162819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ui/src/views/MapView.svelte:40 \u00B7 ui/src/views/ScreensView.svelte:41 \u00B7 ui/src/views/StepsView.svelte:69 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/views/MapView.svelte"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75fee5ed1cd594d6004b887a6381c8e6c41a95818b77ff9bfd143a2d961a44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/agent-eval/parse-run.mjs:1089 \u00B7 scripts/agent-eval/parse-run.mjs:1141 \u00B7 scripts/agent-eval/parse-run.mjs:1201 \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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb6dfcda3600e3f694c288537491d95768bb08ae2a886391a14ce30448aa701"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/agent-eval/probe-allocation.mjs:119 \u00B7 scripts/agent-eval/probe-named-symbol.mjs:131 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/probe-allocation.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0c2e019cb9df7e83315ccb4bd89475410578f6dbcdac08b2cc3f450b1965f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/agent-eval/probe-allocation.mjs:246 \u00B7 scripts/agent-eval/probe-decl-only.mjs:176 \u00B7 src/mcp/explore-diagnostics.ts:747 \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":"scripts/agent-eval/probe-allocation.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaefa32f7d696bcca224b4cad85d83e0fddd09145927939f7ccefad797bbb5be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/agent-eval/probe-named-symbol.mjs:117 \u00B7 scripts/agent-eval/probe-named-symbol.mjs:142 \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":"scripts/agent-eval/probe-named-symbol.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5e2208b8bd787e3885c4e957328c398fa88025f10cfc454b4b230314b17b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/context/formatter.ts:36 \u00B7 src/context/formatter.ts:82 \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":"src/context/formatter.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"295309e632322f4422072eeec6c4574c3c579a3bf18d793c479ddbbda8948cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/db/index.ts:80 \u00B7 src/extraction/parse-pool.ts:111 \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":"src/db/index.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"91527d2428d181613296379433215239199b798c815d62133f5bbea4ca8d9555"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/db/queries.ts:1248 \u00B7 src/db/queries.ts:2837 \u00B7 src/db/queries.ts:2887 \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":"src/db/queries.ts"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced0a00abf9be92c396941b45d6321719741a6725e2520bd3e5ccf8f4a385caf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): src/db/queries.ts:1371 \u00B7 src/db/queries.ts:2810 \u00B7 src/db/queries.ts:2864 \u00B7 src/db/queries.ts:4682 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"src/db/queries.ts"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f411f815d6666e295bab898c2d2e71548cf860b4ef4b43f5e7e8eb29df70c72d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/db/queries.ts:2741 \u00B7 src/db/queries.ts:2778 \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":"src/db/queries.ts"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"925c2c00c9eb1b10afc94b3c2964e5189e580657e9b7fcb59defa27d1f133996"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/db/queries.ts:2948 \u00B7 src/db/queries.ts:3072 \u00B7 src/db/queries.ts:3120 \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":"src/db/queries.ts"},"region":{"startLine":2948}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab9e9ebd155820cf681dad7c0bf9849cb64c3e312c9cf06506d8aa210059132"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/db/queries.ts:3657 \u00B7 src/db/queries.ts:3675 \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":"src/db/queries.ts"},"region":{"startLine":3657}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61ba0b805bd1fec6d4e08d3b9ce5acefe6606dfc00a4310cc4c43a5a2ca841d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/db/queries.ts:3800 \u00B7 src/db/queries.ts:5099 \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":"src/db/queries.ts"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e5c3ddd9b0a263429cfac965b3c408a63a141d61e3d1b2d2a80c6dcb7de75e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/db/queries.ts:4813 \u00B7 src/db/queries.ts:4836 \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":"src/db/queries.ts"},"region":{"startLine":4813}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c03737bad4d5b2538a750c0606f55fb4a777d15d2889951df1e48f2d7e1d0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/db/queries.ts:5567 \u00B7 src/db/queries.ts:5613 \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":"src/db/queries.ts"},"region":{"startLine":5567}}}],"partialFingerprints":{"codehealthFindingId/v1":"063266a53e276be3faf8bc50993109105ba649005fc15188cbc72aa16ef534d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): src/extraction/astro-extractor.ts:254 \u00B7 src/extraction/astro-extractor.ts:310 \u00B7 src/extraction/svelte-extractor.ts:214 \u00B7 src/extraction/svelte-extractor.ts:261 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"src/extraction/astro-extractor.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce68d5f19093b646df54c00bdcba900617e15a8c400040a796ab68f83b7852e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/cfml-extractor.ts:778 \u00B7 src/extraction/tree-sitter.ts:6751 \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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3719e8be0b9097c8f5e03df994cbea0f36e860231b347fa6ddb7254b296375ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/languages/cpp-brace-scopes.ts:255 \u00B7 src/resolution/dart-libraries.ts:87 \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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c309e008feed842dd39e9b49ff53247205a3e5d6d56bfdb2ef8f129d2c6d5c7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10 locations): src/extraction/languages/cpp-macro-methods.ts:185 \u00B7 src/extraction/vue-options-api.ts:62 \u00B7 src/resolution/angular-template-synthesizer.ts:333 \u00B7 src/resolution/angular-template-synthesizer.ts:442 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 7 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edf27d9b2c4e293fbb3bd414985996fab7a2fd62cacb5946b3490004beba4c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/extraction/languages/cpp-macro-methods.ts:281 \u00B7 src/resolution/callback-synthesizer.ts:3883 \u00B7 src/resolution/name-matcher.ts:3507 \u00B7 src/resolution/name-matcher.ts:3602 \u2014 the 4 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15a324b24ff49aac9da743f0c0a8abf5045fc1307612cdbadb7f93fc31094f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/languages/dart.ts:293 \u00B7 src/extraction/languages/dart.ts:441 \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":"src/extraction/languages/dart.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a674f74862ce71b78c06426b174b372cbcb0777e30e162f5f0dc853b895317"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/languages/ruby.ts:49 \u00B7 src/extraction/tree-sitter.ts:2530 \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":"src/extraction/languages/ruby.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c25e20de58408c92dacd92bd459627d9088dfd218bcb0f0219b73013fe7befe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/extraction/languages/scala.ts:70 \u00B7 src/extraction/languages/scala.ts:188 \u00B7 src/extraction/tree-sitter.ts:3625 \u2014 the 3 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":"src/extraction/languages/scala.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d12ab68faba72f894da102b3b213a771e16847d52c706aabf4e2bdf745fa28f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/extraction/languages/solidity.ts:29 \u00B7 src/extraction/tree-sitter.ts:4776 \u00B7 src/extraction/tree-sitter.ts:8554 \u00B7 src/extraction/tree-sitter.ts:8578 \u2014 the 4 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":"src/extraction/languages/solidity.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d4f1c68a330c8cc721e2cd02d97ea27f1ff2d3c76668374d4057f8f46fb32d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/extraction/languages/terraform.ts:555 \u00B7 src/extraction/languages/terraform.ts:577 \u00B7 src/extraction/languages/terraform.ts:607 \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":"src/extraction/languages/terraform.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b851f18fc94adb2caac736b9a5d8ebc455a3491587fad582ec83ca0f64a9ebc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/razor-script.ts:41 \u00B7 src/resolution/tauri-synthesizer.ts:70 \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":"src/extraction/razor-script.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4740915e1b09324cdf472d3c9e158d9b75311a086cff10bffe6a2e666a216bb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:3073 \u00B7 src/extraction/tree-sitter.ts:4549 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3073}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee083715091bcba49e338fd0e737405ba27856006259c465be4591efd46dea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/extraction/tree-sitter.ts:5907 \u00B7 src/extraction/tree-sitter.ts:5934 \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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5907}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00bcaea6e4372a5bdc72f9c40ac18bfc117bd98a524d9f6916d08c9f0e66a99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/graph/branch-guards.ts:304 \u00B7 src/graph/branch-guards.ts:1040 \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":"src/graph/branch-guards.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74e5b2d414d12db44ad1ba27f858a06204f2e25316570fc56e1aef51698f916"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/index.ts:1334 \u00B7 src/index.ts:1349 \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":"src/index.ts"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"953a27145c55e86b6319ec2cc36bc38b8280b8e68f135358b07499ff283a83f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/installer/targets/hermes.ts:182 \u00B7 src/resolution/ruby-parameter-flow.ts:115 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"src/installer/targets/hermes.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a98469eef0cf9f6fea9c5f1dac2a893151acd705ec5aaa0d37a150321121ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/installer/targets/shared.ts:342 \u00B7 src/installer/targets/toml.ts:256 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/shared.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca291e3d54a3ce50d13c60ab3fe809b5a3ab0afea2672150f20c50cf3a6fde7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/mcp/daemon-registry.ts:324 \u00B7 src/mcp/daemon-registry.ts:497 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc05d0940a0e8bd97ccad25a9afe8ff35ad3dc8abac5e5aa6b4e47ca615914f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/alias-binding.ts:95 \u00B7 src/resolution/expo-router-synthesizer.ts:134 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/alias-binding.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7bf1e26034034c67603a3a4efbd77d8744972ccd3cdd998ba16d93c8710583"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/resolution/angular-template-synthesizer.ts:73 \u00B7 src/resolution/frameworks/react-native.ts:133 \u00B7 src/resolution/frameworks/react-native.ts:194 \u2014 the 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f4555f73258ba7113b501e0b5bb5fd0869c1897eea337d208891d19c804f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): src/resolution/angular-template-synthesizer.ts:363 \u00B7 src/resolution/frameworks/express.ts:492 \u00B7 src/resolution/frameworks/laravel.ts:460 \u00B7 src/resolution/frameworks/nestjs.ts:896 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65d913299cdb54d9a2871fd0d4c4b859ebc0e7c601043aca3d6c02683686836"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/resolution/angular-template-synthesizer.ts:497 \u00B7 src/resolution/frameworks/angular-router.ts:376 \u00B7 src/resolution/frameworks/laravel.ts:380 \u00B7 src/resolution/frameworks/tanstack-router.ts:176 \u2014 the 4 copies are spread across 4 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4702bd465fd3f4b5c3474cbedc775d927c976b1faef056422333ab871ea39b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/angular-template-synthesizer.ts:699 \u00B7 src/resolution/angular-template-synthesizer.ts:803 \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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e53d7c8073579cd6ac46f10d10e6692f70249ec47a9478115aa50e8d79b153b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/c-fnptr-synthesizer.ts:1214 \u00B7 src/resolution/c-fnptr-synthesizer.ts:1233 \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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb16eccad5206a3eb5a3741c4a8ec02d550250392ab2c5fb30c8c1f9452e71fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:531 \u00B7 src/resolution/callback-synthesizer.ts:3762 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b97ce57520bbda1490e673d137cf5637241d78375285817f0565639e9376ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:1740 \u00B7 src/resolution/callback-synthesizer.ts:3288 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a8d84e04c3cd042c392234e1c191c24b30c048a6a2b962a1e62671f8dd29b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/resolution/callback-synthesizer.ts:1961 \u00B7 src/resolution/callback-synthesizer.ts:3476 \u00B7 src/resolution/callback-synthesizer.ts:4992 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"f543f24aee6e5835cc80e23030be344e3dc8887d2ab49b3c6b7033a12845d743"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:2521 \u00B7 src/resolution/name-matcher.ts:13961 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd74ece9cc1c74f10e68464693f78d37270fed3aea43183fc722a530bc04ce1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:3766 \u00B7 src/resolution/callback-synthesizer.ts:4031 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"255e528d4791660ec440ea524e7b5643cf9fb1494f6f62c44faff4126de37aee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/resolution/callback-synthesizer.ts:3929 \u00B7 src/resolution/callback-synthesizer.ts:4705 \u00B7 src/resolution/callback-synthesizer.ts:5075 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3929}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceb56a76114f15dd8bbbb1eac1ab4eabda90bf9d5bd6a63c8d82f65f5fc7d64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/callback-synthesizer.ts:4164 \u00B7 src/resolution/callback-synthesizer.ts:4257 \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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c43bac94c8edb8c891fc0857628f65abac4a8bce29b32e1fed55ac8f7364b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15 locations): src/resolution/cpp-supertypes.ts:126 \u00B7 src/resolution/name-matcher.ts:2209 \u00B7 src/resolution/name-matcher.ts:5090 \u00B7 src/resolution/name-matcher.ts:6264 \u00B7 \u002B11 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c425c399e2d20b46617cd954f976bbe9fe68df9a40d7349bce77ae75db1000"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10 locations): src/resolution/cpp-supertypes.ts:481 \u00B7 src/resolution/name-matcher.ts:4710 \u00B7 src/resolution/name-matcher.ts:7811 \u00B7 src/resolution/name-matcher.ts:19548 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cd0fd1cdd3a6376b430b15ff412c298d55a864815dcb8e49e3a9c687805223"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/dart-local-scope.ts:119 \u00B7 src/resolution/name-matcher.ts:3421 \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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf6dea76cfb3d3670a38fab849bfea03c1ad2ccf593f8c57252b73bb525add2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/expo-router-synthesizer.ts:68 \u00B7 src/resolution/react-router-synthesizer.ts:129 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af27dedfe1ed251b2735a19119a6d90df8599d6dd8fca4895351c84a0e58b94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/angular-router.ts:459 \u00B7 src/resolution/frameworks/angular-router.ts:467 \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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"63da965dd2800d3317101a6102f4c06526ed7a1d28f7c413ca37221361ae68e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/angular-router.ts:1087 \u00B7 src/resolution/frameworks/vue-router.ts:506 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"71da131430c673839934c0eff9ed0509510f0813164b5e0f16b5bc513b8fa75e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/resolution/frameworks/codeigniter.ts:199 \u00B7 src/resolution/index.ts:4036 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7e8de0ac9fbae065ae8cef2deab22dc48f1f9e25f0441bba87a22f1d7cd1ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/csharp.ts:392 \u00B7 src/resolution/frameworks/java.ts:558 \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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afbf1db5817f83902063589e6509116af781fbe0039381f01e75b86e457b2b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:62 \u00B7 src/resolution/frameworks/expo-router.ts:89 \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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abfc8873c33c3043f60c532a5d163826ebf0511970a13af15d289c24d00014a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/expo-router.ts:303 \u00B7 src/resolution/frameworks/express.ts:23 \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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42cde986817149099249bca79880623705662b36542240b25e0481e998fc2f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): src/resolution/frameworks/expo-router.ts:851 \u00B7 src/resolution/frameworks/nextjs.ts:342 \u00B7 src/resolution/frameworks/react-router.ts:214 \u00B7 src/resolution/frameworks/tanstack-router.ts:455 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c137f3c126eab86d0bffd6ae752601d09e1163eb7a79745d120c27850fa9b2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/express.ts:448 \u00B7 src/resolution/frameworks/react.ts:1163 \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":"src/resolution/frameworks/express.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e88642f808090106a5dd6983e06ed7b890dce93f9d47ffb0fdfaefea284a8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/resolution/frameworks/express.ts:680 \u00B7 src/resolution/frameworks/react.ts:2434 \u00B7 src/resolution/frameworks/react.ts:2474 \u00B7 src/resolution/frameworks/react.ts:2505 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/express.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"6402cf5be794bd02903b4f65d30ca935db9221de154ec8943a71e402b499840b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/java.ts:387 \u00B7 src/resolution/frameworks/java.ts:413 \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":"src/resolution/frameworks/java.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddedc4865ceaaf0699752b1cd3ba4dbfb55b96eddb90f51d58fbac2dbc55381"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/resolution/frameworks/name-heuristic.ts:68 \u00B7 src/resolution/vbnet-receivers.ts:745 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"src/resolution/frameworks/name-heuristic.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f87e4fb44c346809b4f148b64cbfbb9e4335720f9a69ead9b49f9233d55cb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/react.ts:865 \u00B7 src/resolution/frameworks/react.ts:898 \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":"src/resolution/frameworks/react.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd19349386e4183f87289ece86bd045380ef0b9eb1d22cb423d74f7d055d7c65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): src/resolution/frameworks/rust.ts:299 \u00B7 src/resolution/name-matcher.ts:13692 \u00B7 src/resolution/name-matcher.ts:16981 \u00B7 src/resolution/tier-synthesizer.ts:1014 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 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":"src/resolution/frameworks/rust.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"781625c617fa5e7cccba9a847b9fb3eedc794001a682d800be10ae4e4eae46de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/frameworks/swift.ts:350 \u00B7 src/resolution/frameworks/swift.ts:381 \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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad1d2d24b8daee29fd53af36879351a5b0fa14d8ece422c315fa534698a4ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/index.ts:2579 \u00B7 src/resolution/name-matcher.ts:32091 \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":"src/resolution/index.ts"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99685f43ccd6a7c9ed60c917dc9d68a0707193fef0613a71e3f642a30fc381c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/index.ts:4697 \u00B7 src/resolution/workspace-packages.ts:398 \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":"src/resolution/index.ts"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"008c819849025fd9aca45765ad652bcd77a655574a16d2b31afb7a7f28ff8cf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:881 \u00B7 src/resolution/name-matcher.ts:28830 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"364e9e437d53d9d7837bce0f949edfde20b742e093187c5a7e98fa460220f5df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:1284 \u00B7 src/resolution/name-matcher.ts:1353 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e3b3328d525ed1fb6445e9305711df1f9c20793e9b8fb5bc36e66cd43fcf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:1452 \u00B7 src/resolution/name-matcher.ts:11393 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21545479f2f65b645fec44925bcbea0649c147f5949a944000f909910394fc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11 locations): src/resolution/name-matcher.ts:1828 \u00B7 src/resolution/name-matcher.ts:2208 \u00B7 src/resolution/name-matcher.ts:5089 \u00B7 src/resolution/name-matcher.ts:6263 \u00B7 \u002B7 more site(s) not listed \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed2071190a57fc8b335799c4df2df236ba05395db8576520fb2241b076eb45d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:3429 \u00B7 src/resolution/rust-scopes.ts:176 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c735b7bedbcf8038ce2cfbbc0c68e68b6a2c8f0ae3d0f94a798b8ccb5a32d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:3645 \u00B7 src/resolution/name-matcher.ts:15366 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd68887e0cd23970e890938f1689d7c1351aaffa190af7f2dcb9657b1be1189"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:3664 \u00B7 src/resolution/name-matcher.ts:27663 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":3664}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fda16b550287ec3038dd8020ccc05be730a78e961d6c3b3ba78948ca30111e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:3799 \u00B7 src/resolution/name-matcher.ts:23083 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1290ef0fd2e688762d2c5cb2a9d8e0644826177a543322ea56a4ca3893ea43be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:4491 \u00B7 src/resolution/name-matcher.ts:32787 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c55e204e324edf9a5926f2e73c4b5c91defcf290f9e5983aefe1e2a270a3367"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:4988 \u00B7 src/resolution/name-matcher.ts:8124 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":4988}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef00f43797a267a966d6e5a5f504a816c899137a3088fa46be67269c4597c00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5348 \u00B7 src/resolution/name-matcher.ts:5559 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3a0e3221da07584c5ac7b2575d569a60703e76a5001686cffcc5d58c6bcf56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:5458 \u00B7 src/resolution/name-matcher.ts:15891 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":5458}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c247079afbacc5f9f8bfbf57b3c540b4f3cb2430b6669161fa4c8a08f18327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/resolution/name-matcher.ts:6607 \u00B7 src/resolution/name-matcher.ts:8218 \u00B7 src/resolution/name-matcher.ts:28831 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b3bb73642dda6477ea409a86d1c2c50c6cbc4b41641d2d2f0861179aa1ab9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:6990 \u00B7 src/resolution/name-matcher.ts:7350 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":6990}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a68a7fb2b969a1ffc5d7bce7ffe05951481b71fe4aafd3fd249c191f0624f10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:7698 \u00B7 src/resolution/name-matcher.ts:7930 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":7698}}}],"partialFingerprints":{"codehealthFindingId/v1":"17092e2a978d58b00b216255f4de6d36baf5c37b13cc9d24e25ebf63839f3928"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:8133 \u00B7 src/resolution/name-matcher.ts:8247 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":8133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b584d9d765db62d3eb40230d20b1718c3c21dd8942485352fe671c86e0af91bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:8247 \u00B7 src/resolution/name-matcher.ts:9187 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":8247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1232ad1d9c3338984332a233379906f46cfc237da2bb4951752fffb8b98dcb81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:9398 \u00B7 src/resolution/name-matcher.ts:23275 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":9398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48740298bc69889843008a7700e99275084545f8b081cc9b07598a3d6ea8eef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:11014 \u00B7 src/resolution/name-matcher.ts:11040 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":11014}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b501a7104d16fbca8434517ff1918698ed16263d6650f32f8a81918f3d5579e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:17721 \u00B7 src/resolution/name-matcher.ts:17757 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":17721}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d266e1e10928f3382245480674c20618e5d5bc38d9aef8d09a72a8eab3ba7c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/resolution/name-matcher.ts:18328 \u00B7 src/resolution/name-matcher.ts:18772 \u00B7 src/resolution/name-matcher.ts:18808 \u00B7 src/resolution/name-matcher.ts:20721 \u2014 all 4 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18328}}}],"partialFingerprints":{"codehealthFindingId/v1":"05de79519f8b5dfb8445ef3c4b6de0da6085b4595d49c1ec0c2369a57b727c41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:18634 \u00B7 src/resolution/name-matcher.ts:18732 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":18634}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d5fd394c7b21007fb35dd684ff730895baaa44a9f77881dcd739376a067fb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/resolution/name-matcher.ts:18848 \u00B7 src/resolution/name-matcher.ts:25429 \u00B7 src/resolution/name-matcher.ts:32229 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":18848}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a99b2ebafaedaa4887363fd94aab0e4d1fa5f1f11689328da1f6ac11ee5335"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/resolution/name-matcher.ts:18902 \u00B7 src/resolution/name-matcher.ts:19894 \u00B7 src/resolution/name-matcher.ts:32989 \u00B7 src/resolution/ruby-constant-paths.ts:225 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":18902}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb6a96a2f53790c5c9f0444db5ffad7619e6aab709dec4485be98ce42364437"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:19697 \u00B7 src/resolution/name-matcher.ts:20081 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":19697}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1636606c58a2b904bc5f25953236e3aa6f5dbadfcb7d1317d9df52d1da380c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:20097 \u00B7 src/resolution/name-matcher.ts:23427 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":20097}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf239dad82ecc7f0c5c3aa219b743f2f77112ad72ec3562e66b5f039b3b9e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:21188 \u00B7 src/resolution/name-matcher.ts:23296 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":21188}}}],"partialFingerprints":{"codehealthFindingId/v1":"977d3d4669500914239cbf992fe4df0cf4eba7bf04c12e52d6853f777b86c323"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:21276 \u00B7 src/resolution/name-matcher.ts:21862 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":21276}}}],"partialFingerprints":{"codehealthFindingId/v1":"67087ea24d3e64d364f445cbc04612ea53460526a356c6190f36857f9b468c72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:23088 \u00B7 src/resolution/name-matcher.ts:32744 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":23088}}}],"partialFingerprints":{"codehealthFindingId/v1":"826ce20fdfb077012818efd832305027002d974a9fd1a96ebd843f135ac6b1fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:23608 \u00B7 src/resolution/name-matcher.ts:23799 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":23608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a661029e5f9176c5d56c13f0be70585897979733682489e7c48f498f1f2129f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:24849 \u00B7 src/resolution/name-matcher.ts:24902 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":24849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08c3ed7704439b60b92287075938731cbdbbcb6c26987d062327d58edd6f5d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:25881 \u00B7 src/resolution/name-matcher.ts:26750 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":25881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e257e346b46710dab646c1582c9f23dd42b7c0d6fcabdd55d2e1a7922939183"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:27620 \u00B7 src/resolution/name-matcher.ts:27625 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":27620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1078d3cbe6c819126f043e210525118c45c89c5885e947029a2b4bfa4c71bfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:27772 \u00B7 src/resolution/name-matcher.ts:27810 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":27772}}}],"partialFingerprints":{"codehealthFindingId/v1":"f958acb90847743ae5504b54281e63d93e630bc1dfb8b2e54dbfdf2d3dbbcacf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:28736 \u00B7 src/resolution/name-matcher.ts:28987 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":28736}}}],"partialFingerprints":{"codehealthFindingId/v1":"7521acce58ea707018513c38609127511d15a3e2e0a3fb53ae06f623ed94c067"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:29732 \u00B7 src/resolution/name-matcher.ts:29752 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":29732}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccaa54471451f0620ae95b9b5f1b15219ef80fda910e9cca617b1d633e5903b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/name-matcher.ts:31215 \u00B7 src/resolution/name-matcher.ts:31380 \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":"src/resolution/name-matcher.ts"},"region":{"startLine":31215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3080828603962d2977664fa6038f9df10bb5501db049a5ac3932194f7701f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/resolution/next-router-synthesizer.ts:72 \u00B7 src/resolution/sveltekit-synthesizer.ts:74 \u00B7 src/resolution/tanstack-router-synthesizer.ts:69 \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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fcfe9e9817e301fb97011bfc433d10a909fe9d3887a50ac44e055f014cc65e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/resolution/override-parameters.ts:360 \u00B7 src/resolution/rust-scopes.ts:722 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"src/resolution/override-parameters.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e0faf4f180c1cfaa09219811a19fb36232ee8a1fbdf5119732fad164ecb2a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/pascal-scope.ts:209 \u00B7 src/resolution/pascal-scope.ts:475 \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":"src/resolution/pascal-scope.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cd5be760ef79b8309d82af62806091e10714e1449cac50c7e47cff1a8f0fee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/pascal-scope.ts:361 \u00B7 src/resolution/pascal-scope.ts:773 \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":"src/resolution/pascal-scope.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0b53eb126f76ca65f8f095c1d3b1e43a0c80129b5d13c8c8f0c8caa46c94df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/ruby-constant-paths.ts:83 \u00B7 src/resolution/ruby-constant-paths.ts:94 \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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"abef16119e1e63521b4a73cc5c3758a0d1892e86abaca72bcee0fdf6bb4bb0e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/resolution/swift-type-visibility.ts:90 \u00B7 src/resolution/swift-type-visibility.ts:452 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d0b21df11ba8a7142c349119049024edd93136ce70453b073554f6f85ad0f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/ui-server/api/index.ts:268 \u00B7 src/ui-server/api/index.ts:282 \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":"src/ui-server/api/index.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"035f53a7be2a949cf172cacf715ec944cc31c8ee626546eb075c2c429f3d8381"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/ui-server/api/index.ts:278 \u00B7 src/ui-server/api/index.ts:288 \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":"src/ui-server/api/index.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"df25faf3d71c9e69eb0995375d137e4a1fe4dbbe23e889b7bc4855979512503f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/ui-server/api/trail-store.ts:169 \u00B7 src/ui-server/api/trails.ts:414 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"src/ui-server/api/trail-store.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a7efc3b96a43770acc2defe421980ae3442304637f2de88d057d8820974fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): telemetry-worker/src/index.ts:401 \u00B7 telemetry-worker/src/rollup.ts:579 \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":"telemetry-worker/src/index.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5231e7719cdf469911e6386a83e87806e3927398d90f57cea338f6944389dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): ui/src/components/flow/FlowCard.svelte:70 \u00B7 ui/src/lib/export-svg.ts:469 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"ui/src/components/flow/FlowCard.svelte"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18b06ed9b3a52ca4fae1fca7439c11eedb4d681e0854886341a50a4e9ce93d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/lib/adapter.ts:393 \u00B7 ui/src/lib/navigation.ts:152 \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":"ui/src/lib/adapter.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"582f3619b621d1b308915cd10b11112334a063c8a42ced0c4425d9c3fb98c42e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/src/lib/adapter.ts:419 \u00B7 ui/src/lib/navigation.ts:171 \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":"ui/src/lib/adapter.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3d26885ef7f8c11f10a04cc5a326723794f4cfb7c08969edb728163b214b22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): ui/src/lib/screens-model.ts:773 \u00B7 ui/src/lib/screens-model.ts:831 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd3d39b2bb0e53c8b80aa90deaef9533257091698f539ae01bb81b2c462f1be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): ui/src/views/FileView.svelte:42 \u00B7 ui/src/views/FlowView.svelte:40 \u00B7 ui/src/views/MapView.svelte:40 \u00B7 ui/src/views/ScreensView.svelte:41 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/views/FileView.svelte"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"197bf35e70a2305f070656a2cad354c4a929f090670f8064c5577db0fed1f239"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/type-hierarchy.test.ts:31 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/hierarchy-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/type-hierarchy.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"665f6f9188b44aa131a0e76f3ba93618706d986e2e68d606e6644e7a51cc1986"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-conditions.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/conditions) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-conditions.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8689f698e755b35ea627461978a5d8e9fe29296ec62fd5a11e1a03677d11ac6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-entry-model.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/entry-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-entry-model.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"451241edf34d4f9f9f51f3c51492c0a2f5fcbf42e15ebe6a90f52c1ef1f6dcb3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-entrypoints-api.test.ts:34 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/entry-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-entrypoints-api.test.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f8d36a8462668b8fa934f5ce91958931f8260f95e71c6f8d9507855088cef2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-export-svg.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/export-svg) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-export-svg.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d564c30753ffaa61c5ae9828a1fc4a66faaf21cef97b1baf678c38d945af853"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-export-svg.test.ts:33 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/flow-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-export-svg.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dbc17bbd56335a3bcb0716a3ddc21c4df5d4cef06261af189825eb6e706903"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-export-svg.test.ts:34 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/map-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-export-svg.test.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"724c9d4b83509bbe434279d71184d80f844e4431a28851ec009318a1476eea44"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-file-model.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/file-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-file-model.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b6cfa1041255dbc275c65f643ce90efdd724160b9e68d1fb250800e7796f0e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-filecode-model.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/filecode-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-filecode-model.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8345f94b63cb27b371e31b2e0dc3a39849f547215910ae8e53a0f93d3336b7bb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-flow-model.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/flow-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-flow-model.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"500648ade96f735a7fc226f454f2df882f4409a8a94d7a8212b89e411b46c89c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-highlight.test.ts:40 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/highlight) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-highlight.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b37d73e911e5736ad9eb52884d6c85e39758e06cbb9581ce24dc134cd5f531"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-highlight.test.ts:41 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/symbol-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-highlight.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe54a6aee973ef5d85ac64d10833148bd9b7b47b42918e9644f989ab8840ef0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-map-model.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/map-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-map-model.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee8b4ef561d955d0e4e23d90ef25cb3311e2e443039484ca321ea70f339bb03"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-package.test.ts:25 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/index) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-package.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f246963c863fee50bb3ba1ef82d65cf93f85b8af8c4c8d12ddaa0be433ce5a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-package.test.ts:679 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/router.svelte) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-package.test.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a1e39c954db91c8f56a0a8c28ae0cad291671e2f4a901c1bf73df5f324dfaa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-package.test.ts:697 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/router.svelte) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-package.test.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d77308c298f8f3d290a610d02e9c521525f262f33412ac4f7d7245b974bba2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-package.test.ts:698 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/navigation) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-package.test.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5ef4596a3cec08b44c213bd7db7151f5270c9c1ced24bb782184bdb254c028"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-program-model.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/program-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-program-model.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9513791c9a662f77f61216f2047d88142bbc61d9679f01ebd143ad76f3400b8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-program-model.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/steps-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-program-model.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"df03713b95bf72b042aa046b54c5e47cd86650b1082535c7dd0ee4e182d21982"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-program-model.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/screens-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-program-model.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84ddcdca4caef39840993da8b58e39b5fc1014c9dd5fb3213d8cc6b22fc90b0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-screens-model.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/screens-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-screens-model.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"85288cf4673dc122b85f45700af749ce00cdd2dcb2ea0360df13e7e0c21f8b18"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-screens-model.test.ts:45 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/map-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-screens-model.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a48674ac4c4ed3f5ab27fe72e1f55173fced8a42d1c09bd18ea3eca5082ea"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-search-model.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/search-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-search-model.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe1f8a7a3255ed24b8f6008f76bcadb96e6f93cea635c08100b198db4e53055"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-search-model.test.ts:24 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/trail-codec) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-search-model.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9419ad6cfaef90519557f333f87d2cf4c7b42e0cbb9a545450fafc4d82ac51"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-steps-model.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/steps-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-steps-model.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1334ad2a150527b6724ad5fae2a7c9b6fcd665da358feb2e79508cb5f24004"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-steps-model.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/screens-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-steps-model.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50cb93164e6187b23d462f5220bb3adf4c48a895ff3b065e1849bbdaea785f1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-symbol-model.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/symbol-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-symbol-model.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"62535c3ce276dd4385c729a7d25dff39bdca8128237f251d8a00bfcc69242f62"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-symbol-model.test.ts:29 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/highlight) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-symbol-model.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7af05986fb5ccae6db9eb13a836e76a3a33a38391819eb7fec40371e866e308"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/ui-trails-model.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../ui/src/lib/trails-model) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-trails-model.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"441b1e8b0b3bdd811d6e40acc98a4ce8333cf901e5cb28587efc7e53990a731b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: scripts/add-lang/check-grammar.mjs:61 imports tree-sitter-wasms/out/, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/add-lang/check-grammar.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cfb5e5b11a26fea9efb2d35b679fb10298be3afcc5751a8974b2ef6a0f06ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: scripts/add-lang/dump-ast.mjs:45 imports tree-sitter-wasms/out/, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/add-lang/dump-ast.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c77f4509107bda7ceaddd65cf25da7377feb4480fb7702a79fbc0a33d2dbc2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/sync-ui-version.mjs:25 reaches into another package with a relative path (../ui/package.json) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync-ui-version.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e316a7d0637ea139be5bd0cda06d7953223661874a453d5c702ba33c5381e39c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: src/extraction/grammars.ts:458 imports tree-sitter-wasms/out/, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"de64cc0ac7713cd0a1eae3feb87fc379a1cd3ce21f6895cd5ba55478847c49b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractCall (cyclomatic 337, cognitive 746): extractCall has cyclomatic complexity 337 and cognitive complexity 746; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd369eeb5aabd352e90ebe8472d4a79de73aec1b8461268ec90762c508c559a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleExplore (cyclomatic 327, cognitive 631): handleExplore has cyclomatic complexity 327 and cognitive complexity 631; 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":"src/mcp/tools.ts"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8733ba6a7c85addc223c18f19009b4f62af086231e5edc6bc067d096f25390dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchMethodCall (cyclomatic 319, cognitive 433): matchMethodCall has cyclomatic complexity 319 and cognitive complexity 433; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24215}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e1e811743a3b0633dcfdc02d753e8a0dbe576ab1a4310bd56f368870f795e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSteps (cyclomatic 213, cognitive 528): buildSteps has cyclomatic complexity 213 and cognitive complexity 528; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0069864c83dd2b26e7fea7f89e5e4b5be47b5f0047e86840c78118397ad86aff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cFnPointerDispatchEdges (cyclomatic 164, cognitive 418): cFnPointerDispatchEdges has cyclomatic complexity 164 and cognitive complexity 418; 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51299e07f043585e2eaffa7f1ccf930fbcf8d9fc0de30449817ebb75be37da1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRelevantContext (cyclomatic 160, cognitive 364): findRelevantContext has cyclomatic complexity 160 and cognitive complexity 364; 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":"src/context/index.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbf829d963e8e4c09ad3aa37f3b663dcabdf5c061506999d3732ef4336f4622"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOneInner (cyclomatic 146, cognitive 162): resolveOneInner has cyclomatic complexity 146 and cognitive complexity 162; 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":"src/resolution/index.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc3f8940160b966bb6fc7cc3959bf651f0c426ca7fad773551d3fbc7f38b6ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractVariable (cyclomatic 140, cognitive 374): extractVariable has cyclomatic complexity 140 and cognitive complexity 374; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"8856e701a6e1b8a869c26cd1779776449b4f63fd7f5606a8fa05ba650d985f6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 128, cognitive 211): (anonymous) has cyclomatic complexity 128 and cognitive complexity 211; 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":"src/index.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64e24bd4f7940db419180e3db9e76e94935c230b0d3454c88e4b5cf94ebc8ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 126, cognitive 62): (anonymous) has cyclomatic complexity 126 and cognitive complexity 62; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef575845ae4e0eaa58a34e21ed4f711d9e3e31e6c64372c1df1ee62be19c806"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchNode (cyclomatic 125, cognitive 190): dispatchNode has cyclomatic complexity 125 and cognitive complexity 190; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b6b91f4d6d8db2ac44e23a1145a4d5d768eb88265e4937952381b9cd74920c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractInheritance (cyclomatic 123, cognitive 302): extractInheritance has cyclomatic complexity 123 and cognitive complexity 302; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7890}}}],"partialFingerprints":{"codehealthFindingId/v1":"f628ecd255336440ff38bc4310b76ed87dc37bd18882a07ec2b02bdcc70f0a50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchReferenceInner (cyclomatic 103, cognitive 135): matchReferenceInner has cyclomatic complexity 103 and cognitive complexity 135; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a08a488aa5db0f5912938af6d7d31f1dc82b0282c02900cf97bccae0aaaa21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSession (cyclomatic 97, cognitive 155): parseSession has cyclomatic complexity 97 and cognitive complexity 155; 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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f643b70b0af5bfa429ea1350b0776566a74c0909c3fa4054697bcf3cacf42f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchByExactName (cyclomatic 86, cognitive 79): matchByExactName has cyclomatic complexity 86 and cognitive complexity 79; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8909440c1d8c4473d9044d5a0fa4fc28f5d1131c129125d04348f275a734c862"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unit (cyclomatic 85, cognitive 126): unit has cyclomatic complexity 85 and cognitive complexity 126; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"095f9ee47b3d9baa959fe6d321bfc7638b62a3bb86e7afd97e5bc760ea62f252"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveViaImport (cyclomatic 83, cognitive 174): resolveViaImport has cyclomatic complexity 83 and cognitive complexity 174; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8b08e798d019b5fc1ae48d75f36849d9d64386a1269d2d88e12b15bb2c6c3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSpecial (cyclomatic 80, cognitive 121): normalizeSpecial has cyclomatic complexity 80 and cognitive complexity 121; 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":"src/extraction/function-ref.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bb2f4231e02b5a2732e6f9ca913f3e6e405ae9fdc9ea46b7f331deb0494e9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferCppReceiverType (cyclomatic 78, cognitive 127): inferCppReceiverType has cyclomatic complexity 78 and cognitive complexity 127; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20087}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ae89ebfc7f4eb911493f9453a8ae7fe62572fe2d5f2ba816c73a3b7c6c635f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 78, cognitive 84): (anonymous) has cyclomatic complexity 78 and cognitive complexity 84; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e838b5111686dbec27a5017ee05aa4d6ad1d227d2a8739904546e980593c96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustNameInScope (cyclomatic 77, cognitive 87): isRustNameInScope has cyclomatic complexity 77 and cognitive complexity 87; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b5fa8990a4e89b0cef0eb90d65743fa0a35dc9c76b26b9f3f1b8d48a786c5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sync (cyclomatic 73, cognitive 115): sync has cyclomatic complexity 73 and cognitive complexity 115; 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":"src/extraction/index.ts"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d0a21aa7acd52c5942e74728be278acc7fa42d3157017dc81fa9d557d369dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rnEventEdges (cyclomatic 72, cognitive 193): rnEventEdges has cyclomatic complexity 72 and cognitive complexity 193; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"9268081a5d1f05aa13638cfe837afd668d559aa43da067d8605f293212601086"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanCppBraceScopes (cyclomatic 72, cognitive 140): scanCppBraceScopes has cyclomatic complexity 72 and cognitive complexity 140; 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc457974145548d6dc4aac4dd095aa9cf7c165c3597b51c9aa43930c0db3301"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanExpression (cyclomatic 71, cognitive 144): scanExpression has cyclomatic complexity 71 and cognitive complexity 144; 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"17939023ddb881fd211e1eec8f1ca4fa0d4283afa22b5cde3e0fad00656c866a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRustBindings (cyclomatic 70, cognitive 131): readRustBindings has cyclomatic complexity 70 and cognitive complexity 131; 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fab5b753584b68f08ad9b4ebb994b6a6bf6e0bdfee9c8c326c3c0223294000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 70, cognitive 100): (anonymous) has cyclomatic complexity 70 and cognitive complexity 100; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7602}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e3b9b978f934cfbf901a0a976e9690d51bd2a8045df0e90647acd34ce9c2e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reactJsxChildEdges (cyclomatic 68, cognitive 176): reactJsxChildEdges has cyclomatic complexity 68 and cognitive complexity 176; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b9f3bd16f216ede609a504ff2764e7c29b8d5a6f58719ff198a043c4c89eef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 67, cognitive 91): (anonymous) has cyclomatic complexity 67 and cognitive complexity 91; 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":"src/index.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeea15dbe6f59820ca777e75a2c7c64a8a771be00cfc28afb3364068c717e1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 67, cognitive 31): (anonymous) has cyclomatic complexity 67 and cognitive complexity 31; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31967}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab97d74221af4b484cb43239376e7a86888a04d22c3729b4a372ff81bdbe383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statementsShape (cyclomatic 66, cognitive 77): statementsShape has cyclomatic complexity 66 and cognitive complexity 77; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabe913c283a134d7973bb3876b403e6635231046dd17223cd368c7202962c71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAndPersistBatched (cyclomatic 64, cognitive 100): resolveAndPersistBatched has cyclomatic complexity 64 and cognitive complexity 100; 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":"src/resolution/index.ts"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f061d52ad95d8bb6bf9c04b70aedd43b7ecc5038e53a01a50106dfd0351a703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchFuzzy (cyclomatic 63, cognitive 48): matchFuzzy has cyclomatic complexity 63 and cognitive complexity 48; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31921}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73cda162042f753ae152d29c336b93102185a41b9f98a7775f4e67d136076fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractQueryPaths (cyclomatic 62, cognitive 103): extractQueryPaths has cyclomatic complexity 62 and cognitive complexity 103; 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":"src/search/query-paths.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb002b2a252d5c06f5726620fd1f85e4437b147c1323278a0c53bab9fec2ec46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushValueRefs (cyclomatic 61, cognitive 81): flushValueRefs has cyclomatic complexity 61 and cognitive complexity 81; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"824d1bb7800f6cb78514bb1fc97ed195bfa8f4ecfdc88a13efacd0b1bb65546b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synthesizeLombokMembers (cyclomatic 60, cognitive 86): synthesizeLombokMembers has cyclomatic complexity 60 and cognitive complexity 86; 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":"src/extraction/languages/java.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c51f9c17a304ba21a47cf47d6a6ec8b6bbda10f34dc1dbf76419e5d0c58b3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustValueType (cyclomatic 59, cognitive 87): rustValueType has cyclomatic complexity 59 and cognitive complexity 87; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12366}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c86ee89e41a84401073d554bf697105211b7c2ccd36b54734dfd2a00ef20e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppExpressionType (cyclomatic 59, cognitive 74): cppExpressionType has cyclomatic complexity 59 and cognitive complexity 74; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17592}}}],"partialFingerprints":{"codehealthFindingId/v1":"704f0191149451afe18a9c6ed0f85462c9f7189ac8b7f3a728d9923ba3287c85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isVisibleAcrossFiles (cyclomatic 58, cognitive 50): isVisibleAcrossFiles has cyclomatic complexity 58 and cognitive complexity 50; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4192}}}],"partialFingerprints":{"codehealthFindingId/v1":"953120546cc99c563a36a72ce8866da67195b817439488413d36da98900b0a37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexAll (cyclomatic 56, cognitive 117): indexAll has cyclomatic complexity 56 and cognitive complexity 117; 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":"src/extraction/index.ts"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"484d4cc03b487479f2d978027c8ab9997f116e2ce224da7c6e52fdefc27ff8af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFlowLayout (cyclomatic 55, cognitive 88): buildFlowLayout has cyclomatic complexity 55 and cognitive complexity 88; 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":"ui/src/lib/flow-model.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffa47a2ee85b18b43ce646d7a065abb3d89a3df23f4f12f068fefa44d51bcf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function code (cyclomatic 54, cognitive 70): code has cyclomatic complexity 54 and cognitive complexity 70; 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":"src/resolution/jsx-code.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"46be79ae9c6dd0002a6b6f84f3b8c5e548d24aec90ba747de62828fe03db5ade"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCUnbalancedConditionalBranches (cyclomatic 53, cognitive 102): blankCUnbalancedConditionalBranches has cyclomatic complexity 53 and cognitive complexity 102; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b33694374fe3764f81dfcc48b9014c1e818be0376e24769f25bee126d5ed5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonStatementBindsAt (cyclomatic 52, cognitive 61): pythonStatementBindsAt has cyclomatic complexity 52 and cognitive complexity 61; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b39c2d00bf9c66326c3851419a20f7e8fb6f4f1d1e476ca190e98e50b264f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 51, cognitive 84): (anonymous) has cyclomatic complexity 51 and cognitive complexity 84; 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e60ce4db64d8254e906b572996adb637ef778aa0124547e9fd94e92de43a8b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRNMaps (cyclomatic 50, cognitive 133): buildRNMaps has cyclomatic complexity 50 and cognitive complexity 133; 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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"738142aabc68fa04f0166546edb35936d7cb50365efbfb3d124b48a1d2286b29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goReceiverChainType (cyclomatic 50, cognitive 79): goReceiverChainType has cyclomatic complexity 50 and cognitive complexity 79; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26971}}}],"partialFingerprints":{"codehealthFindingId/v1":"078da7f7dfce7d5520bda6af1a026ba028d2cd1e6034777d9e50f755c0f4f1e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTypedMethodCall (cyclomatic 50, cognitive 65): rustTypedMethodCall has cyclomatic complexity 50 and cognitive complexity 65; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4680ac639eafbeede38db0a7eedde2dfe86e73d2c6442040b4e07933fd79055"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 49, cognitive 114): visitNode has cyclomatic complexity 49 and cognitive complexity 114; 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":"src/extraction/languages/nix.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea44250f9f771c443ed90cff4b7051a360d1055b3799478b5d979679563523c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractScopedRailsRoutes (cyclomatic 49, cognitive 103): extractScopedRailsRoutes has cyclomatic complexity 49 and cognitive complexity 103; 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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a1930ed2389aad304dc81dceb533d12013aff13c9b22661d8936332cf84a57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 49, cognitive 99): tokenize has cyclomatic complexity 49 and cognitive complexity 99; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6cf5d817755e3dab4c8746863eb3779d1b2c29da4a44f4bf6a1e6eb05cc707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBuiltInOrExternal (cyclomatic 49, cognitive 61): isBuiltInOrExternal has cyclomatic complexity 49 and cognitive complexity 61; 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":"src/resolution/index.ts"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f244537e57470b0a502a410bfd10500f9cafa60478c42a67b6449abca6d49a41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 48, cognitive 93): visitNode has cyclomatic complexity 48 and cognitive complexity 93; 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea895400aa1aa7efdab7eccb779b1e4ed156f90e66f5492e20d36274404bc94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRustScopes (cyclomatic 48, cognitive 86): readRustScopes has cyclomatic complexity 48 and cognitive complexity 86; 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b544754584cdd7e0efd93e7025b5a20980c3d0c4737c31b0207e53c005db9f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchMemberFunctionRef (cyclomatic 47, cognitive 80): matchMemberFunctionRef has cyclomatic complexity 47 and cognitive complexity 80; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e386211cb73d9c1af616bfe87d17374afac926d589c2dc4ae17ca4e018b9f2c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findExportedSymbolWalk (cyclomatic 47, cognitive 79): findExportedSymbolWalk has cyclomatic complexity 47 and cognitive complexity 79; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4291}}}],"partialFingerprints":{"codehealthFindingId/v1":"32824c33e8a82dcc95764e9b014fcb7a41cbc95ea93d230071c212b330b50b4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractStaticMemberRef (cyclomatic 47, cognitive 61): extractStaticMemberRef has cyclomatic complexity 47 and cognitive complexity 61; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6813}}}],"partialFingerprints":{"codehealthFindingId/v1":"de709273df410247737969f89154ae09d55e3cfb89d78f3b51214fa9d0b6a872"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function angularTemplateEdges (cyclomatic 46, cognitive 99): angularTemplateEdges has cyclomatic complexity 46 and cognitive complexity 99; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa8268f21b7d801dcf2bdbec09e4d88fe6729413a8a9fcc7f7b83e926c82e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildScreens (cyclomatic 46, cognitive 91): buildScreens has cyclomatic complexity 46 and cognitive complexity 91; 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":"src/ui-server/api/screens.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d9798acad2105fb35429822252675bed62a23cdab28289767f6ded7cabc27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readGoScopes (cyclomatic 46, cognitive 72): readGoScopes has cyclomatic complexity 46 and cognitive complexity 72; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1451e071731b186b801c562f5469b1574580ba1a42cdafa79619b07984b39f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractImport (cyclomatic 45, cognitive 100): extractImport has cyclomatic complexity 45 and cognitive complexity 100; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"39941bac33fa1bc81066def00e79a73a96407fcefa7fadf21a60bcb093ecc7da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 45, cognitive 94): visitNode has cyclomatic complexity 45 and cognitive complexity 94; 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":"src/extraction/languages/r.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80d971a234dc01769d0347c11adcd288dcb8555d693b753dd5cc0e4fbe3b30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTypeAlias (cyclomatic 45, cognitive 81): extractTypeAlias has cyclomatic complexity 45 and cognitive complexity 81; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9efb7dadde0826a74a6339d37cdaca0db71f52c1761b8393189c005ed8ace42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDeadCodeReport (cyclomatic 45, cognitive 80): buildDeadCodeReport has cyclomatic complexity 45 and cognitive complexity 80; 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":"src/graph/dead-code.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d0b405badf6af90ebcc2082395d545408d071bfa231965256715340c3b63d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferLocalReceiverType (cyclomatic 45, cognitive 63): inferLocalReceiverType has cyclomatic complexity 45 and cognitive complexity 63; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9154dcbc2c463997ffab02cca99ccfb46663b81540ba7991b795c6f1ccd755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFileView (cyclomatic 45, cognitive 61): handleFileView has cyclomatic complexity 45 and cognitive complexity 61; 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":"src/mcp/tools.ts"},"region":{"startLine":8256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94ab47cb6b05bdc709db7289e69a68f21192971c00cfd409aa12bab5d99622d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateTargetKind (cyclomatic 45, cognitive 48): gateTargetKind has cyclomatic complexity 45 and cognitive complexity 48; 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":"src/resolution/index.ts"},"region":{"startLine":4299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d859434d2229fc32b2aa949562d2900e386e05990d43990cb061ab0510d24de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function interfaceOverrideEdges (cyclomatic 44, cognitive 128): interfaceOverrideEdges has cyclomatic complexity 44 and cognitive complexity 128; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b4eeddb8b74dceec26f195b4e7efefb1d1039d035b43d3836d7aa303ce9b39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppUnnamedNamespaceSpans (cyclomatic 44, cognitive 105): cppUnnamedNamespaceSpans has cyclomatic complexity 44 and cognitive complexity 105; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed160266c608cf81da636eefaf26c39f670f4fa4f4e546f54fa448d9e7ddd4a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goImplementsEdges (cyclomatic 44, cognitive 83): goImplementsEdges has cyclomatic complexity 44 and cognitive complexity 83; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab86dbf82da80323281799c742fbc4c161d50fda9b7c632cb0a9e396fcec5d4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMethodOnType (cyclomatic 44, cognitive 64): resolveMethodOnType has cyclomatic complexity 44 and cognitive complexity 64; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b427f97daaec491a9abf8412fa3cf2f81bdf6030c39e13e3ebb429d7eec68fa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readArgumentList (cyclomatic 44, cognitive 47): readArgumentList has cyclomatic complexity 44 and cognitive complexity 47; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ca190714e82049105f8127f86cb6bf5bf3da622b1abd9e59736172f29bf3f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchFunctionRef (cyclomatic 44, cognitive 43): matchFunctionRef has cyclomatic complexity 44 and cognitive complexity 43; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a4d6748e005f905834410e00b9755eee6030b9e7d56dca7dfbbf78810610e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCStatementMacroCalls (cyclomatic 43, cognitive 109): blankCStatementMacroCalls has cyclomatic complexity 43 and cognitive complexity 109; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"10be6c5ae895433c6dbd24d053f5715a5d6a35a6eae0f4562cc4e2c3f75c308e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postExtract (cyclomatic 43, cognitive 85): postExtract has cyclomatic complexity 43 and cognitive complexity 85; 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b95a380d6da8d942fde2d9a73f8875f7fc7207112f3ffe8d57c6d197366fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFlowFromNamedSymbols (cyclomatic 43, cognitive 68): buildFlowFromNamedSymbols has cyclomatic complexity 43 and cognitive complexity 68; 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":"src/mcp/tools.ts"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb34bbdb5bd31fe141ee08bc8d99044c0c467546a32554bff2e725c12233917a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppCodeScan (cyclomatic 42, cognitive 96): cppCodeScan has cyclomatic complexity 42 and cognitive complexity 96; 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"10beea3683e920ae0ce12886c53f9d5378cd1293ad0795a54720cc85c7329b12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preParsePascal (cyclomatic 42, cognitive 73): preParsePascal has cyclomatic complexity 42 and cognitive complexity 73; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9b130a45193f3d359f592e0776eec9e65ea4e3637ece72619cd841d9ac07c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOneIn (cyclomatic 42, cognitive 38): resolveOneIn has cyclomatic complexity 42 and cognitive complexity 38; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/index.ts"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"baccc1e8effa9eb5d754abdf9298f84abede2c05c055821293282912e1220de9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInstallerWithOptions (cyclomatic 41, cognitive 74): runInstallerWithOptions has cyclomatic complexity 41 and cognitive complexity 74; 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":"src/installer/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6954f2c95ada0c6ee788ee6762b2601c8f76d2195f719347b3b8b49e243d7ed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBindings (cyclomatic 41, cognitive 59): readBindings has cyclomatic complexity 41 and cognitive complexity 59; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c7162f3988c37344a0e6dbb164dfe6858d3cecf42426e000055a6871caf4a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAwaitedCallType (cyclomatic 41, cognitive 49): resolveAwaitedCallType has cyclomatic complexity 41 and cognitive complexity 49; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23639}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e58da9bc6c3a60e1a133fda9dd41051fdfe83b3c7bbba965f3aee0f68da44c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRequestPath (cyclomatic 40, cognitive 85): readRequestPath has cyclomatic complexity 40 and cognitive complexity 85; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"01012976af2c528488735162f15c5942e1b5658c6bc39db4e7f3ef34050256e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postExtract (cyclomatic 40, cognitive 68): postExtract has cyclomatic complexity 40 and cognitive complexity 68; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b089fd5851b71c165341404fd3e757e108ca119f3b135dd61f551d4368b8d700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitPascalNode (cyclomatic 40, cognitive 62): visitPascalNode has cyclomatic complexity 40 and cognitive complexity 62; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a56346425ef67e51a60a735f6d24beb6f524abd484de567c2a19385dbe2f84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objcFileMembers (cyclomatic 40, cognitive 61): objcFileMembers has cyclomatic complexity 40 and cognitive complexity 61; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a138734fab9667ce9cf937cd7de887bdc6da894c40e4eb91bd9495a874ad413"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 40, cognitive 56): execute has cyclomatic complexity 40 and cognitive complexity 56; 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":"src/mcp/tools.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107b3051469d3bc08b2a428653827b6ebc73c7d1fb87eda5a008abc8cd3cad3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPascalParenlessName (cyclomatic 40, cognitive 47): extractPascalParenlessName has cyclomatic complexity 40 and cognitive complexity 47; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c3f8c41aedd2d769c1ed82e65870563ed76320648b67f72949e7968afe721b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchReference (cyclomatic 40, cognitive 29): matchReference has cyclomatic complexity 40 and cognitive complexity 29; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc3267600bf20f2885fb3bb90db4a0d6dc6a7c2dea4f9ec34ebb7b8468ca07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attribute (cyclomatic 39, cognitive 83): attribute has cyclomatic complexity 39 and cognitive complexity 83; 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":"src/ui-server/api/screens.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79fa81bc1489900462fde70506189d821eb0da2c8bcae411cee2f67f751a6a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanMarkup (cyclomatic 39, cognitive 82): scanMarkup has cyclomatic complexity 39 and cognitive complexity 82; 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"832d07f868d1b5f74d416a9c8835c564528975b302ec4f1631b8d86168fa52b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triggerInTree (cyclomatic 39, cognitive 70): triggerInTree has cyclomatic complexity 39 and cognitive complexity 70; 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":"src/graph/branch-guards.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3be7ff441cb64bd8b2904cb7fdf39eb006a46bc4a76633631ee050e1fe6c775"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 37): (anonymous) has cyclomatic complexity 39 and cognitive complexity 37; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/ui-server/api/steps.ts"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13715ae888bfc80ec3106a5cf5b798eb0ea19a9363eb5ef4ce1f5d603d1deb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCTypeKeywordArgs (cyclomatic 38, cognitive 86): blankCTypeKeywordArgs has cyclomatic complexity 38 and cognitive complexity 86; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f051963aa95136940ad14f0be81150c6d0663f18f64a36f11f62beb98eda9544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runUninstaller (cyclomatic 38, cognitive 76): runUninstaller has cyclomatic complexity 38 and cognitive complexity 76; 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":"src/installer/index.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e0b249f85495ddd94a10be16641093e09463e22a8dc209e2da0b2d055543e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonLineBindings (cyclomatic 38, cognitive 62): pythonLineBindings has cyclomatic complexity 38 and cognitive complexity 62; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1547f05b8c14a5747968c03a3e97824d6e0c9a82916da7904b3f9b70601f4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonAttrStatementsUncached (cyclomatic 38, cognitive 57): pythonAttrStatementsUncached has cyclomatic complexity 38 and cognitive complexity 57; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28098}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15667070269e0461f489cb9ee6b481241ecf62b1678d4e3ed2767da7befd5c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureFnRefCandidates (cyclomatic 38, cognitive 54): captureFnRefCandidates has cyclomatic complexity 38 and cognitive complexity 54; 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":"src/extraction/function-ref.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdbf1d64948a6b09d100c69d7f2fc11e0da374df0ed9a374bea1e6981bcc719"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJavaTypeVisible (cyclomatic 38, cognitive 39): isJavaTypeVisible has cyclomatic complexity 38 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"220c1b8bc18e9176b0c61f651fa2ddb7bf922c6c9223de9059d44ca51837332b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function springEventEdges (cyclomatic 37, cognitive 75): springEventEdges has cyclomatic complexity 37 and cognitive complexity 75; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"105e1da6787c9b6ffc028c5adf24e10ffc716f74c25d95a8e1b769c1f7e696ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFrontend (cyclomatic 37, cognitive 70): readFrontend has cyclomatic complexity 37 and cognitive complexity 70; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c547ddfc47cf072d308600480328ca78f31a059add61a32f545c009c11db0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppForBodyEncloses (cyclomatic 37, cognitive 67): cppForBodyEncloses has cyclomatic complexity 37 and cognitive complexity 67; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17813}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e3804a3a8351d5e2facf9c8c44e742321773a55257f9d9669296d04308b5c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateLiteralTextAt (cyclomatic 37, cognitive 52): templateLiteralTextAt has cyclomatic complexity 37 and cognitive complexity 52; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ae1633064a48b904b7c6eb8e1dd9af0d503552362f3b7a7dfdef8561e4e080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMapLayout (cyclomatic 37, cognitive 49): buildMapLayout has cyclomatic complexity 37 and cognitive complexity 49; 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":"ui/src/lib/map-model.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b809c68c12274dbb79baa18321b55fdfba4d72a25567ddb6500bee0e0491728"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTypeLookup (cyclomatic 37, cognitive 46): rustTypeLookup has cyclomatic complexity 37 and cognitive complexity 46; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2058417f20777d03a97645f9d0dafbc18d0b8addd90b5d2b4c936e7095f417c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeSynthesizedHop (cyclomatic 37, cognitive 32): describeSynthesizedHop has cyclomatic complexity 37 and cognitive complexity 32; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/graph/synthesized-hop.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35501bac23e6e10bd761f66c20a10c151d9534341de344db044f16bb62b2044"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 74): (anonymous) has cyclomatic complexity 36 and cognitive complexity 74; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2ce147d8febfe81b09279abae596ca1d47511d1f898b4dc583c58f436a3b2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateMemberUses (cyclomatic 36, cognitive 72): templateMemberUses has cyclomatic complexity 36 and cognitive complexity 72; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c4eb5bddeddae03e97ee14b16321b90ca6b2926ca31a52d85d338f179e3470"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNameRaw (cyclomatic 36, cognitive 55): extractNameRaw has cyclomatic complexity 36 and cognitive complexity 55; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd881951b29c4acdcc7064ee79d6e736d6e318424a950c8a6040283be79c46bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleNode (cyclomatic 36, cognitive 53): handleNode has cyclomatic complexity 36 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":"src/mcp/tools.ts"},"region":{"startLine":8069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db2b8ce32689c023d8d83f2a7b45f4e9a617f44de0fafc5a86e7af22d456a67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 36, cognitive 44): evaluate has cyclomatic complexity 36 and cognitive complexity 44; 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":"scripts/agent-eval/probe-allocation.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eed3a44438b911856c020e15e4ad02c62e540150697278b65f46100c847f0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laravelEventEdges (cyclomatic 35, cognitive 75): laravelEventEdges has cyclomatic complexity 35 and cognitive complexity 75; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff84fcb06c576e3884195b5482607ef418b0ce05be1b389960698c16cd3b65d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTable (cyclomatic 35, cognitive 55): renderTable has cyclomatic complexity 35 and cognitive complexity 55; 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":"src/mcp/explore-diagnostics.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec58f541c0333a64129e9f04fc40cbc6b88941791d9e179591c107903a61d20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppDeclaratorsAfterFirst (cyclomatic 35, cognitive 49): cppDeclaratorsAfterFirst has cyclomatic complexity 35 and cognitive complexity 49; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16780}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d5eceea30f181d295af195ea1b08649ba60ba51e2404346a418b6ff06edcc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkComponentWrapper (cyclomatic 35, cognitive 46): walkComponentWrapper has cyclomatic complexity 35 and cognitive complexity 46; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4406b6f78aa3d29ae9e3ced3eab940ba22de3d9c866a173ced0bccc133667eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 45): (anonymous) has cyclomatic complexity 35 and cognitive complexity 45; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fc1eb10028efb0875464f269cdfae46d3cd9002a4e5cd17c29582d50a0f9d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 35, cognitive 39): visitNode has cyclomatic complexity 35 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa7d97c1081c124a483cfb2e94e763d9491f8a909bbd4a6ed8228f1d72b984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pascalNameMode (cyclomatic 35, cognitive 33): pascalNameMode has cyclomatic complexity 35 and cognitive complexity 33; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9859}}}],"partialFingerprints":{"codehealthFindingId/v1":"274974e7050bbb549940775e6a1e925000a9791dfa7a90554823e553bc3b6711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRustSide (cyclomatic 34, cognitive 75): readRustSide has cyclomatic complexity 34 and cognitive complexity 75; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"127622a39ce239f91391fb1f81ffb67bb64989476923b2ec10fc449fac44ac5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postExtract (cyclomatic 34, cognitive 71): postExtract has cyclomatic complexity 34 and cognitive complexity 71; 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"30900a32b81c308569ce070e902af524955b8cb81e692d081db8efbbab5d783f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mediatrDispatchEdges (cyclomatic 34, cognitive 66): mediatrDispatchEdges has cyclomatic complexity 34 and cognitive complexity 66; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66f75b51c5cdc0857abcde9e4096af894cff194d721cab3696a4163f5d89769"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 34, cognitive 61): parse has cyclomatic complexity 34 and cognitive complexity 61; 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":"scripts/agent-eval/seq-matrix.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"50637daac38221d2ad47f6560f83c6726c2eb103e9dda36309f34bdf45c25c17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankDartLiterals (cyclomatic 34, cognitive 60): blankDartLiterals has cyclomatic complexity 34 and cognitive complexity 60; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81d088f1af0a5b340f2a59ee89de51ab37c99ef2f084186a46b6fd0443054f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankDartCode (cyclomatic 34, cognitive 59): blankDartCode has cyclomatic complexity 34 and cognitive complexity 59; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0acfc5b37f294fab5989ba8714735b196e06702dab40b3bc75f63a40c05715a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTopLevel (cyclomatic 34, cognitive 51): readTopLevel has cyclomatic complexity 34 and cognitive complexity 51; 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf700f262865f11c0304b0510852845033d34f8afd93918a59882fa52c89d3dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsx (cyclomatic 34, cognitive 49): jsx has cyclomatic complexity 34 and cognitive complexity 49; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab974000463a49871b004cef39af472fc153daa838a1525e862287abaef325a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRustUseBoundName (cyclomatic 34, cognitive 45): matchRustUseBoundName has cyclomatic complexity 34 and cognitive complexity 45; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10991}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf60f840690e296d1eba451d3fcd4f362efc86cbf587ceb2a79bb17112c6e637"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function abbreviateArgument (cyclomatic 34, cognitive 42): abbreviateArgument has cyclomatic complexity 34 and cognitive complexity 42; 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":"src/graph/branch-guards.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ed30e1e1945179ca449d392c7287ae4bdd9a293767555011c9e2a2941bc53c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function erlangBehaviourDispatchEdges (cyclomatic 33, cognitive 69): erlangBehaviourDispatchEdges has cyclomatic complexity 33 and cognitive complexity 69; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56062d166949f7778e93d6f0ae0b988dab2808c1deee6e4089eee02e0892c9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripGo (cyclomatic 33, cognitive 66): stripGo has cyclomatic complexity 33 and cognitive complexity 66; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef9f792598a0363c2c4f4a56aba9a7a60384def22710b2c8a33f4721948d72b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankRustCode (cyclomatic 33, cognitive 62): blankRustCode has cyclomatic complexity 33 and cognitive complexity 62; 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee500ad451ad0ef0ecc728cb55cd2fd3a042365e5b0b32effe028d795fb11e7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePythonModuleMember (cyclomatic 33, cognitive 53): resolvePythonModuleMember has cyclomatic complexity 33 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3698}}}],"partialFingerprints":{"codehealthFindingId/v1":"601753336072902c0b8065186b3c179fe11a8bcc36b14e0d8c9c466985e2151b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaLambdaParameterType (cyclomatic 33, cognitive 50): javaLambdaParameterType has cyclomatic complexity 33 and cognitive complexity 50; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac761c844d54766d1348562a9f5600c06a8f43214ece0a5053f2953cff0c2c6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustItemOf (cyclomatic 33, cognitive 48): rustItemOf has cyclomatic complexity 33 and cognitive complexity 48; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12835}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9f25ad489d445357969de47f7eaf8f443c497725d615ce32ec5016183589ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsBindingSites (cyclomatic 33, cognitive 48): jsBindingSites has cyclomatic complexity 33 and cognitive complexity 48; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23848}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7b855228d03fa1d9a5c8724584bbe9b5a4610f886fc5033436cb1ec3f8aa7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppLibraryElementOf (cyclomatic 33, cognitive 31): cppLibraryElementOf has cyclomatic complexity 33 and cognitive complexity 31; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17528}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae12b0e2f14f5270d0ca7b49cb192246111bbdad693d46dc50bdda6099fcaef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closureCollectionEdges (cyclomatic 32, cognitive 64): closureCollectionEdges has cyclomatic complexity 32 and cognitive complexity 64; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"338f33892fbfb6982a865a81e9518a4b4c93a2e9d093588246918e979c484fbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flattenMidStatementConditionals (cyclomatic 32, cognitive 57): flattenMidStatementConditionals has cyclomatic complexity 32 and cognitive complexity 57; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a067ce462f0954ceae8dfe79e0aff635c429b7e1425578b39d6e6df8453a8ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustReadType (cyclomatic 32, cognitive 48): rustReadType has cyclomatic complexity 32 and cognitive complexity 48; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1cb29aafd48e90493753b775a256176b91d69992f305f53fa95ddfa30bc010"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverSingleArgMacroDefinedName (cyclomatic 32, cognitive 44): recoverSingleArgMacroDefinedName has cyclomatic complexity 32 and cognitive complexity 44; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b778630847204ee7a943e00cb4db9da155c556a9bf5a419a6c2bbb43c24756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportedComponent (cyclomatic 32, cognitive 44): exportedComponent has cyclomatic complexity 32 and cognitive complexity 44; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9db64da5a5be2aba7ed95f89ce4d37e6a8845f4dc7f26270b88e80d36eae2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchJavaStaticFieldCall (cyclomatic 32, cognitive 36): matchJavaStaticFieldCall has cyclomatic complexity 32 and cognitive complexity 36; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5451e2810f32c0a1189f0cc3e08054ab0f13bb87ad64c2b4bf69f949bd494f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHash (cyclomatic 32, cognitive 35): parseHash has cyclomatic complexity 32 and cognitive complexity 35; 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":"ui/src/lib/router.svelte.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4164b0f3e4724c9fa517df636a47319688d3c4e452a95f043fbe967090eb5a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nixOptionPathEdges (cyclomatic 31, cognitive 61): nixOptionPathEdges has cyclomatic complexity 31 and cognitive complexity 61; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4875}}}],"partialFingerprints":{"codehealthFindingId/v1":"708b69026033d4eb83695ca0184493b1fb7b52bdc54b3946a3fa6f578659fa3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 31, cognitive 49): visitNode has cyclomatic complexity 31 and cognitive complexity 49; 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":"src/extraction/languages/scala.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf88918c5d3fa502604d5a9fbacf0642015c8ae9fdf7448949c7ccb114a6b66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTrail (cyclomatic 31, cognitive 39): parseTrail has cyclomatic complexity 31 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":"src/ui-server/api/trail-store.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b64df4fe288b8e46e3872d3881f23a7ef5e428917c57e955f7b117dd57e052b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractField (cyclomatic 30, cognitive 66): extractField has cyclomatic complexity 30 and cognitive complexity 66; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaaec0ddbb45c1daa98a6761131474d73fdc2de7d7887e3fa87cad4bbb6711e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arkuiEmitterEdges (cyclomatic 30, cognitive 63): arkuiEmitterEdges has cyclomatic complexity 30 and cognitive complexity 63; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee53427b2ed27dfc119d8386a504c6356fd01030f95084a0fbdb6d934b2f942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripRust (cyclomatic 30, cognitive 58): stripRust has cyclomatic complexity 30 and cognitive complexity 58; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"b125926c4f84eb071fc1c84305ed4b669a06ac438f070c26ebaa49d868728ac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppLocalBindings (cyclomatic 30, cognitive 52): cppLocalBindings has cyclomatic complexity 30 and cognitive complexity 52; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19798}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0792aa380eb657ecdb76f3b4396fbc7357247c5b99580ae2cf9457bdf5f66c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNamedSymbolFlow (cyclomatic 30, cognitive 46): resolveNamedSymbolFlow has cyclomatic complexity 30 and cognitive complexity 46; 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6b870edd44da0063fb1c695669fb941b6b82d612de2283b1ab754978f5d62b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findBestMatch (cyclomatic 30, cognitive 45): findBestMatch has cyclomatic complexity 30 and cognitive complexity 45; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31750}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f01719fc61ff759e6c2a5e0edf098aa23bebe301392e60d9795a796627fbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchNodes (cyclomatic 30, cognitive 44): searchNodes has cyclomatic complexity 30 and cognitive complexity 44; 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":"src/db/queries.ts"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d75f2282c3eebd0e54930752aa86c9e5380927445b1658cad396cfd7564f765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePythonModule (cyclomatic 30, cognitive 43): resolvePythonModule has cyclomatic complexity 30 and cognitive complexity 43; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8590ecbcdcfbd7d0b7882ce9a1558691ff9447d2b613f074f6152c45e404c4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferJavaFieldReceiverType (cyclomatic 30, cognitive 41): inferJavaFieldReceiverType has cyclomatic complexity 30 and cognitive complexity 41; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21177}}}],"partialFingerprints":{"codehealthFindingId/v1":"950ca772ab5b24326325217646282959326bb21b2ced90504e5bf827ff2cd431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyEffect (cyclomatic 30, cognitive 39): classifyEffect has cyclomatic complexity 30 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":"src/ui-server/api/effects.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf2d6dbfe92bfbc5cd3dc604d4edf53eace93ea2a1839d2fb9dcc2134ad7ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustPathTarget (cyclomatic 30, cognitive 32): rustPathTarget has cyclomatic complexity 30 and cognitive complexity 32; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0fdc2555179c8c69f3fbf2d6259d046d6ab432f3728cb3a4b6774a8a3c78a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesSymbol (cyclomatic 30, cognitive 31): matchesSymbol has cyclomatic complexity 30 and cognitive complexity 31; 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":"src/graph/symbol-lookup.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4a65ba8ea1cab004824e2629a58734cc02273454afe200534f498b77ee34b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextLinkEdges (cyclomatic 29, cognitive 63): nextLinkEdges has cyclomatic complexity 29 and cognitive complexity 63; 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf3e4d4346a271790413636820bd61592717f42864ac2c5982f8d4883dc1d4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectRegistryEdges (cyclomatic 29, cognitive 62): objectRegistryEdges has cyclomatic complexity 29 and cognitive complexity 62; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f68f58b34b78f6c2c1048e27f3758a3a1e2b0c7b26d4881cd138a0a11038e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripRuby (cyclomatic 29, cognitive 62): stripRuby has cyclomatic complexity 29 and cognitive complexity 62; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0256431ade1ea5f1dc9165ae00e5131fd91677ef39f28493e00007fab5ef8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vueRouterLinkEdges (cyclomatic 29, cognitive 60): vueRouterLinkEdges has cyclomatic complexity 29 and cognitive complexity 60; 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":"src/resolution/vue-router-synthesizer.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde80fd4d85a5eacc1e8c3461e4ac3aa24bddb33a54efc56095bf609b77b3819"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vueTemplateEdges (cyclomatic 29, cognitive 59): vueTemplateEdges has cyclomatic complexity 29 and cognitive complexity 59; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca404bb3e79bb1d5ea8b7959a9962f4db8fbc001992b906ed48e204cc9cd7f10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventEmitterEdges (cyclomatic 29, cognitive 56): eventEmitterEdges has cyclomatic complexity 29 and cognitive complexity 56; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6616f8e9f43a7bbf028491080e7bfb9691cf9b69f04a8cb5e27635646b1de311"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppDataMemberIn (cyclomatic 29, cognitive 56): cppDataMemberIn has cyclomatic complexity 29 and cognitive complexity 56; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1eb2078ed4ac9cd3e030c7190b242084424c90860312c5d922886e782708e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestScope (cyclomatic 29, cognitive 47): manifestScope has cyclomatic complexity 29 and cognitive complexity 47; 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":"src/resolution/index.ts"},"region":{"startLine":4688}}}],"partialFingerprints":{"codehealthFindingId/v1":"37498556af085095802f931e74e52494783a92d5e77a47106d0375bb029f46d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postExtract (cyclomatic 29, cognitive 46): postExtract has cyclomatic complexity 29 and cognitive complexity 46; 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"98479913f6184536204a601d0ca43b8e7f161811b14fe03c8d68d31623232b5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goExprType (cyclomatic 29, cognitive 45): goExprType has cyclomatic complexity 29 and cognitive complexity 45; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8693aa457e24400a571b476cb99f9c16da36430fb0335f1893a2bad884ffdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchGoFieldChainCall (cyclomatic 29, cognitive 45): matchGoFieldChainCall has cyclomatic complexity 29 and cognitive complexity 45; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d806fae0d98aebc905ea0aa3cfa5ac6b919c5ad4058f3f6679d28d5196cf5a2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function angularRouteTable (cyclomatic 29, cognitive 44): angularRouteTable has cyclomatic complexity 29 and cognitive complexity 44; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02b407865639f448ea9ddc17e5d7bcf6b592196cb62f041b8cd505dffc3c893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function responseStatus (cyclomatic 29, cognitive 41): responseStatus has cyclomatic complexity 29 and cognitive complexity 41; 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":"src/ui-server/api/effects.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf89a45f638f0619374556ac767ce302141d63c3daf55b9bfcee2d14fec5853"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonFactoryTypeUncached (cyclomatic 29, cognitive 40): pythonFactoryTypeUncached has cyclomatic complexity 29 and cognitive complexity 40; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2f8e34d20fcf556f3f2914f644489d83f1fe5e2590a76b4748f20432ac423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushFnRefCandidates (cyclomatic 29, cognitive 37): flushFnRefCandidates has cyclomatic complexity 29 and cognitive complexity 37; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a2675c937245a8257a34939d8b705b9ff9e932310d95931a3ef00e0807d5f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 34): (anonymous) has cyclomatic complexity 29 and cognitive complexity 34; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af6df5e32cbdfac6d66f9aef065e752c5a2af9aaa4da77f132b273f42ba01ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 29, cognitive 34): resolve has cyclomatic complexity 29 and cognitive complexity 34; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67258079367e8bc57c2aace42fc342e8db4f605d8006b4e779adadd3f327fa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isScalaMemberInScope (cyclomatic 29, cognitive 33): isScalaMemberInScope has cyclomatic complexity 29 and cognitive complexity 33; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8064fa2b3a712fa295f35c8745405d9ec4b98b6bb7bbd7bf4509134bfda264d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSwiftCallTarget (cyclomatic 29, cognitive 32): isSwiftCallTarget has cyclomatic complexity 29 and cognitive complexity 32; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92c0d76ac6ab4aafa161c8f078c7e609105b8776206926977fe4669bf0ebb2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustShadowingLocal (cyclomatic 29, cognitive 28): rustShadowingLocal has cyclomatic complexity 29 and cognitive complexity 28; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11084}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f21924f3f4f9a9d9e1e4fa84d1f15fca59458511e8db4f1664c494a00f5c8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelOf (cyclomatic 29, cognitive 25): modelOf has cyclomatic complexity 29 and cognitive complexity 25; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/ui-server/api/effects.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c35555f575e90c37ec3cac032951ce8a056e28363e46a195e404befa18c95d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifySufficiency (cyclomatic 28, cognitive 64): classifySufficiency has cyclomatic complexity 28 and cognitive complexity 64; 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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0023018cb68c1fe8c637fd53f6a780f5e95dd37951a50d90007cc285170874de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkBidirectional (cyclomatic 28, cognitive 64): walkBidirectional has cyclomatic complexity 28 and cognitive complexity 64; 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b710d8aeb04a0c42afc7f1c3e1cac6ca699e9004228c590f852246f15015b4dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reactRouterLinkEdges (cyclomatic 28, cognitive 64): reactRouterLinkEdges has cyclomatic complexity 28 and cognitive complexity 64; 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":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dbbd5ff4a86bc6ea3ab43e5cc128ba8a40415eb63ee71fbad498a90052987e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goLocalBindings (cyclomatic 28, cognitive 59): goLocalBindings has cyclomatic complexity 28 and cognitive complexity 59; 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":"src/extraction/function-ref.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"b050f7be40e9c3bbb4f67656e67608e9351c81687d0b07ac2452ecb23fe31c6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fieldChannelEdges (cyclomatic 28, cognitive 59): fieldChannelEdges has cyclomatic complexity 28 and cognitive complexity 59; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768b4402ef94cb3ef3fa435637cf01247496b579f57512632713db3c14d823a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectMembers (cyclomatic 28, cognitive 53): objectMembers has cyclomatic complexity 28 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f40c5296ad77ad18261e6a38304db506a75ca955044b760a24b6da57e7ab4f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeExtractBuffers (cyclomatic 28, cognitive 48): decodeExtractBuffers has cyclomatic complexity 28 and cognitive complexity 48; 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":"src/extraction/kernel/decode.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9201128c638229a393738d3700d6e765e80b12d596a111f2efc4a999015bc613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleRequest (cyclomatic 28, cognitive 48): handleRequest has cyclomatic complexity 28 and cognitive complexity 48; 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":"src/ui-server/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"209c28f858796818772d8e38d5f59d98cf4897da499bd3f35c296259faa83b89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goframeRouteEdges (cyclomatic 28, cognitive 47): goframeRouteEdges has cyclomatic complexity 28 and cognitive complexity 47; 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":"src/resolution/goframe-synthesizer.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc913222a5f6ef4317831278bc683786ef9835ce6bc61871707a82873b2fb7ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function byNameHookCandidates (cyclomatic 28, cognitive 45): byNameHookCandidates has cyclomatic complexity 28 and cognitive complexity 45; 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":"src/graph/dead-code.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cd29843d9e1cc300e27bbd743aa7c5a6fa72c4f1fd3844d692cba89870bb40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reopenNavigationsFor (cyclomatic 28, cognitive 45): reopenNavigationsFor has cyclomatic complexity 28 and cognitive complexity 45; 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":"src/resolution/index.ts"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25bbe7687b614123b7bcfc9117dad686be62147283667c32093f8cae8e398cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookUpCppClass (cyclomatic 28, cognitive 43): lookUpCppClass has cyclomatic complexity 28 and cognitive complexity 43; 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ae86674778a80ac890e295e714b28c652aebd77d8a028fe249a8b1ca3beed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 28, cognitive 42): enclosing has cyclomatic complexity 28 and cognitive complexity 42; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c53388a107994723c950f682ace48d09c148fdaaeba5da9dbdc628b5662b54c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addDirective (cyclomatic 28, cognitive 41): addDirective has cyclomatic complexity 28 and cognitive complexity 41; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab8821169a7144dfcdb72d1578858ebbde6d82d42a9be557ad21c90864037df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 28, cognitive 41): resolve has cyclomatic complexity 28 and cognitive complexity 41; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"648e0114638e3d01220e78f84ad80f354833c82c892e07b0c861c4e8c0ad8933"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchEnclosingScopeMember (cyclomatic 28, cognitive 40): matchEnclosingScopeMember has cyclomatic complexity 28 and cognitive complexity 40; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81d71c6da8386d536f77363cb52374b6b09df5cd68b75e3fa32f060dd75f28d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleStatus (cyclomatic 28, cognitive 39): handleStatus 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":"src/mcp/tools.ts"},"region":{"startLine":8558}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd41fec0e3e4743a5bbe1d90c27069ba59b8f21262834dc6eeed036ae9804bbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runUpgrade (cyclomatic 28, cognitive 39): runUpgrade 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":"src/upgrade/index.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"687bf96f26e316e73343e754b423c0b06f426688e4132f447977a6b638b23715"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 28, cognitive 37): extract has cyclomatic complexity 28 and cognitive complexity 37; 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e432aaafa2561903eb745781bfe1282283a86fdee06a645a393153b7357c707e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packRegions (cyclomatic 28, cognitive 36): packRegions has cyclomatic complexity 28 and cognitive complexity 36; 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"693137457d08afbed436eff5eb1ec3452f00e937d325fdd814a005000c8ce807"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMap (cyclomatic 28, cognitive 34): buildMap has cyclomatic complexity 28 and cognitive complexity 34; 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":"src/ui-server/api/map.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06a3b8242d94b3c6e2261bf7b344a9583c6d322d1394194a7b6bedb8b6d675e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonParamAnnotation (cyclomatic 28, cognitive 31): pythonParamAnnotation has cyclomatic complexity 28 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28822}}}],"partialFingerprints":{"codehealthFindingId/v1":"856157944c61ac97e1228d1ba1cb3c1188469590421293834a31b9f966c78602"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vbReceiverPath (cyclomatic 28, cognitive 29): vbReceiverPath has cyclomatic complexity 28 and cognitive complexity 29; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"767cf65475fe559c111f7656a9f09e7e48dbe12f5d719c0f60bb10ab13aa76d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isLexicallyReachable (cyclomatic 28, cognitive 24): isLexicallyReachable has cyclomatic complexity 28 and cognitive complexity 24; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19f8d9eeeb1a3703529a63a4595d182bae6ea1f14a2d3179044682b7479defa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDartChain (cyclomatic 27, cognitive 53): readDartChain has cyclomatic complexity 27 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"61da6b0a3c06b31153cf8723e0b4d55f3dffa81ad1b96ae35d0901fbc799d6c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function holdsBody (cyclomatic 27, cognitive 47): holdsBody has cyclomatic complexity 27 and cognitive complexity 47; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0250cfc469ec887ad8b0b474667212aa246ae2ad8ff06997ebd3681fe20c7e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goListItems (cyclomatic 27, cognitive 45): goListItems has cyclomatic complexity 27 and cognitive complexity 45; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d380799c5e94f2aa4c27918018dc076cbe997ef79507c86b143d657bea5a5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustFieldChainAt (cyclomatic 27, cognitive 42): rustFieldChainAt has cyclomatic complexity 27 and cognitive complexity 42; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29550}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc5e8f5f9f08f42cd7fcf4b4b2d64774e4421911d53f720434661446ea16b8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 41): (anonymous) has cyclomatic complexity 27 and cognitive complexity 41; 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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedbabfe40aa76710a1c69d64311d9e2119e3df40f8355814e924c9f4782366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bodyOpenAfter (cyclomatic 27, cognitive 39): bodyOpenAfter has cyclomatic complexity 27 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5eb32db44098440cb7f34d53bcd09583fdbe90130ee4f4f82ff07d16fd8e57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCfmlComponentPath (cyclomatic 27, cognitive 38): resolveCfmlComponentPath has cyclomatic complexity 27 and cognitive complexity 38; 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":"src/resolution/index.ts"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2c7eda053307aecb86378a50e2dbec19fdc519274c13eb5c7acd3c647cb2fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retargetSelfOverload (cyclomatic 27, cognitive 35): retargetSelfOverload has cyclomatic complexity 27 and cognitive complexity 35; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3cf92689c2b9041edfac67995bead60e58b37af3bc3ee104bdb1be54d16679"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaArgumentType (cyclomatic 27, cognitive 32): javaArgumentType has cyclomatic complexity 27 and cognitive complexity 32; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14856}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bca0980893b3b41734c2b8f94d8433ae37a101937c2505ec91a616e49507c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustSiteType (cyclomatic 27, cognitive 29): rustSiteType has cyclomatic complexity 27 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12883}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c2c3741398cd2f60321769c96a4361092f941545953acbafec22ee4dffdd54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferMemberReceiverType (cyclomatic 27, cognitive 28): inferMemberReceiverType has cyclomatic complexity 27 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22818}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a4853221a1fc7fe4dc256726b2f0ab6c3d9a395dc2ea26b23b569967d7b626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 27): (anonymous) has cyclomatic complexity 27 and cognitive complexity 27; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"78641968eb414bb52a22c7469d53aa065249dc8820bb58e409e17ac71b52f0a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartMisparsedGenericCall (cyclomatic 27, cognitive 26): dartMisparsedGenericCall has cyclomatic complexity 27 and cognitive complexity 26; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/dart.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"299b95a4083c3be5ef6847458cfa8864000b6d135dbdadad9a280009fbd8848a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeDartChain (cyclomatic 27, cognitive 26): typeDartChain has cyclomatic complexity 27 and cognitive complexity 26; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70f60ecd96c4b7f208b083d21ce3bfa712cb94c977d1ed1cd2110dc7326695d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCppLocalCallableCall (cyclomatic 27, cognitive 25): isCppLocalCallableCall has cyclomatic complexity 27 and cognitive complexity 25; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19879}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbd50ccb50345bbcff6455a744d5da29b6a3bd1df4accbbdb9b02993335ebaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRustDeclaredFields (cyclomatic 27, cognitive 23): readRustDeclaredFields has cyclomatic complexity 27 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12953}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d076c593e549ac5159d6c3c4362cbf5964b8387e99e88258380109d6cda009c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectPathDeps (cyclomatic 26, cognitive 71): collectPathDeps has cyclomatic complexity 26 and cognitive complexity 71; 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d927a31fda6c19d9364bc44e9f3ec6c76ff9ef998e7a6e0229401afb4cbe94af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRubyConstantPathRef (cyclomatic 26, cognitive 54): matchRubyConstantPathRef has cyclomatic complexity 26 and cognitive complexity 54; 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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb7cb5c95b653142867535d4df9cd3429a97f857cc04ed4e9f1c501c85ee6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memberTypesInTree (cyclomatic 26, cognitive 52): memberTypesInTree has cyclomatic complexity 26 and cognitive complexity 52; 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":"src/graph/branch-guards.ts"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ad8594c99430494e1278300a9901301c792fa043089b89adec41ca83da8f2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isUnexportedModuleBinding (cyclomatic 26, cognitive 48): isUnexportedModuleBinding has cyclomatic complexity 26 and cognitive complexity 48; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"80333ade046652da8969028ab3ecb66385ddbea76bd620eb4979d5d94e53a007"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 46): (anonymous) has cyclomatic complexity 26 and cognitive complexity 46; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f1b2d6d9ebf6ace979fbf0728f09fc7913a9ca427e00c0ebae8ea28916e7aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripPython (cyclomatic 26, cognitive 46): stripPython has cyclomatic complexity 26 and cognitive complexity 46; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b739668a53462c7f89303d70dad935a650478f592974eaab9bb3a2e61453f1c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripPhp (cyclomatic 26, cognitive 45): stripPhp has cyclomatic complexity 26 and cognitive complexity 45; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38594855afd1a647662d5f9095633693553bd43be6522e5d9c9c896826eb55d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function erlangArityAt (cyclomatic 26, cognitive 41): erlangArityAt has cyclomatic complexity 26 and cognitive complexity 41; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5681a2beb589e4c02e07cd5eeac1abae9400f37298c6d8cf5cc05d6346c56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasAnyPossibleMatch (cyclomatic 26, cognitive 41): hasAnyPossibleMatch has cyclomatic complexity 26 and cognitive complexity 41; 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":"src/resolution/index.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f931958fdc46b105d28970aa71ead4d3c98f61588d9948d689491e2a08e79237"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateTypeParameter (cyclomatic 26, cognitive 41): gateTypeParameter has cyclomatic complexity 26 and cognitive complexity 41; 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":"src/resolution/type-parameters.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44e06eb5708f05f6c242234f23cb0ff5bf052ab19ba484d8e3515efc5d3a65e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 41): (anonymous) has cyclomatic complexity 26 and cognitive complexity 41; 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f1f2d51b3bf7157f42a0215c7f5e5a7847df1c57db0f7a9062c2d5761b31b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constantText (cyclomatic 26, cognitive 38): constantText has cyclomatic complexity 26 and cognitive complexity 38; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8534deeb9e4ed3f54eaf8d4c18cd7b204e83f8395c8c78c49dd254cb55afee49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 34): (anonymous) has cyclomatic complexity 26 and cognitive complexity 34; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23e0795ca1789c308529ed88ac2da21038a10b9d938991dea374453e17ab33a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldScriptResult (cyclomatic 26, cognitive 33): foldScriptResult has cyclomatic complexity 26 and cognitive complexity 33; 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":"src/extraction/sfc-script.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"143d4c3335cfb8c134a98b1bbc6495d2efbb028a5870c288d638132bab20e8e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlerRefs (cyclomatic 26, cognitive 33): handlerRefs has cyclomatic complexity 26 and cognitive complexity 33; 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7207eeab30afd1a23225a1874c7fcd96258c49199802105c2bc6209c5470113"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withStalenessNotice (cyclomatic 26, cognitive 32): withStalenessNotice has cyclomatic complexity 26 and cognitive complexity 32; 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":"src/mcp/tools.ts"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"918a594604535bc3e95633439e752bd9b9eb74cbfff2cdbab32a870c25f002d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 32): (anonymous) has cyclomatic complexity 26 and cognitive complexity 32; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"569183a6f3a3c2420ae4bedb45ce6c9a4df69fb13030958b89cc2b27873910b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPascalCall (cyclomatic 26, cognitive 31): extractPascalCall has cyclomatic complexity 26 and cognitive complexity 31; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3735cf28e2e105d3d792480709dec3ae094286deaf80256d3a6ced2abb3c674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchVbMemberRead (cyclomatic 26, cognitive 31): matchVbMemberRead has cyclomatic complexity 26 and cognitive complexity 31; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0188ff8c829750a73d365044f3748d1cc726898f58b9ab8fcbdd19d6f2c07f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goFileConstraint (cyclomatic 26, cognitive 29): goFileConstraint has cyclomatic complexity 26 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba770cc1aa545daf8ceb3b3a81b4a235d1607ae5600806514ad89d4f4c606e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statementEnd (cyclomatic 26, cognitive 28): statementEnd has cyclomatic complexity 26 and cognitive complexity 28; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea7e0497076f898eeed4ad07aef62c20a78337a5fdf5e8f61609623b28ef295"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaArgumentFit (cyclomatic 26, cognitive 28): javaArgumentFit has cyclomatic complexity 26 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14917}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b0de6e9f4161b4bbffe17de20a8364885ccf23e51f19d9ee9126bd34e4a060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStemVariants (cyclomatic 26, cognitive 26): getStemVariants has cyclomatic complexity 26 and cognitive complexity 26; 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":"src/search/query-utils.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9a0d95efc5bb2bff9bf4fe89d064d1da30346fc936155631ed50ddac1469ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regexLiteralEndAt (cyclomatic 26, cognitive 25): regexLiteralEndAt has cyclomatic complexity 26 and cognitive complexity 25; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"63132e9b6b2ad64d9d235c3212a28a93426e8407e58fd2889341e9c4a926a2b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkDescendants (cyclomatic 25, cognitive 57): walkDescendants has cyclomatic complexity 25 and cognitive complexity 57; 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":"src/graph/type-hierarchy.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"292eaf8a0094338c49d8e17ef802dcba5726b7f32a3daa13060e387c76744b2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBindings (cyclomatic 25, cognitive 54): readBindings has cyclomatic complexity 25 and cognitive complexity 54; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a51255c10903004939cec0dabd4d04637475a4c75b31eff47f8c46ab4751f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankStringContents (cyclomatic 25, cognitive 54): blankStringContents has cyclomatic complexity 25 and cognitive complexity 54; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a124267d947b1d480a6cb059dfdbd4837f2c1701ecf36f531d8446b864fd84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractDecoratorsFor (cyclomatic 25, cognitive 51): extractDecoratorsFor has cyclomatic complexity 25 and cognitive complexity 51; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe92f197f8372a7911b761ae821b2dc428f12dc0a56aa47d3b360c41b04a5060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustCrateGraph (cyclomatic 25, cognitive 50): rustCrateGraph has cyclomatic complexity 25 and cognitive complexity 50; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9630}}}],"partialFingerprints":{"codehealthFindingId/v1":"6354d67d8aa8fc3b26216b0114ff95030738b0ab5e8c72b933a7bd571b83fd73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNamedTokens (cyclomatic 25, cognitive 49): resolveNamedTokens has cyclomatic complexity 25 and cognitive complexity 49; 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"363aa348dfa35ff60169628167b024f778d406e09d1ae9ce01a533d44cd48d14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tanstackLinkEdges (cyclomatic 25, cognitive 49): tanstackLinkEdges has cyclomatic complexity 25 and cognitive complexity 49; 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":"src/resolution/tanstack-router-synthesizer.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba528a5ec58c986369bd80c38cbe7891f3edfefe1c755ce59c4900562bf9060a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function svelteKitLinkEdges (cyclomatic 25, cognitive 48): svelteKitLinkEdges has cyclomatic complexity 25 and cognitive complexity 48; 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":"src/resolution/sveltekit-synthesizer.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e37c839c042b770df5cbe8e6d65dcc16d146c18f6040d7b7064297a353fe00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCppAnnotationMacroCalls (cyclomatic 25, cognitive 45): blankCppAnnotationMacroCalls has cyclomatic complexity 25 and cognitive complexity 45; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"810e3a4615369cdca1d1f0bb044307e4f33debf3513e7a3436208cfc4045ae8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piniaStoreEdges (cyclomatic 25, cognitive 45): piniaStoreEdges has cyclomatic complexity 25 and cognitive complexity 45; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecdf41b92e4e2f1400162190f27ad39294a41f409d31cf5433c4c4fe2d1cefe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getChangedFiles (cyclomatic 25, cognitive 44): getChangedFiles has cyclomatic complexity 25 and cognitive complexity 44; 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":"src/extraction/index.ts"},"region":{"startLine":4197}}}],"partialFingerprints":{"codehealthFindingId/v1":"da469f0e4ade44609bca925f91221b42624b028326169cddb616233fa7f9a7f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ginMiddlewareChainEdges (cyclomatic 25, cognitive 44): ginMiddlewareChainEdges has cyclomatic complexity 25 and cognitive complexity 44; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c7a958401864873e572869fe961b4dca95dca5100f4d0cc5a779461f25d965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function referenceStripCStyle (cyclomatic 25, cognitive 42): referenceStripCStyle has cyclomatic complexity 25 and cognitive complexity 42; 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":"__tests__/strip-cstyle-differential.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a655e173d512b606ded09b7670c89423538c950ff35d0d6172b98cd2c936ba74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueOf (cyclomatic 25, cognitive 42): valueOf has cyclomatic complexity 25 and cognitive complexity 42; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8097f90e3045811f11d1e4baf91eed33a92a942bba359ff7fe6d7e256c2ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripCStyle (cyclomatic 25, cognitive 42): stripCStyle has cyclomatic complexity 25 and cognitive complexity 42; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5843b0c1c5cfdcb8adcc9bb44a8326693a1c37a6326f2a3d2beeea31f8fd3730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSymbolsFromQuery (cyclomatic 25, cognitive 40): extractSymbolsFromQuery has cyclomatic complexity 25 and cognitive complexity 40; 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":"src/context/index.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8c0d58c477cf38e7bf8c0172b15196521d1e0fba9ca4dc3bde4c86eeb33f45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goChainLinks (cyclomatic 25, cognitive 40): goChainLinks has cyclomatic complexity 25 and cognitive complexity 40; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26490}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a68fbf6099721460eeee5656427929e3d900d3826f17ad76c1f89e23c04a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonLocalClassUncached (cyclomatic 25, cognitive 40): pythonLocalClassUncached has cyclomatic complexity 25 and cognitive complexity 40; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28902}}}],"partialFingerprints":{"codehealthFindingId/v1":"604f8a3be74027e454930d43c44291033f7ebcbb7a68728b1903488bc2fd061e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppStackConstructions (cyclomatic 25, cognitive 37): cppStackConstructions has cyclomatic complexity 25 and cognitive complexity 37; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6739}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceb6ce171b6763cc066f40b9fcbbe2a1b43b0996280678312a280d86d9de3b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonAssignment (cyclomatic 25, cognitive 33): pythonAssignment has cyclomatic complexity 25 and cognitive complexity 33; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3b5b933243f1abe6c9b8b7897898aedbd8031423ab1cd7c9190e346c997534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cStatementLines (cyclomatic 25, cognitive 32): cStatementLines has cyclomatic complexity 25 and cognitive complexity 32; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee0fa4dcfe5febeb624469c0cb66f3d28335280de6b1c2895aa14e38affdbff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 25, cognitive 32): enclosing has cyclomatic complexity 25 and cognitive complexity 32; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfe20aaf822dd28730c0dc8a448b6d527811c6cc26149e238301ce023c947b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsBodyEnd (cyclomatic 25, cognitive 31): jsBodyEnd has cyclomatic complexity 25 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63e48f9844945f6b23f9ebb1703e834229a6b9ce53cf097598516db2efa7caa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 28): (anonymous) has cyclomatic complexity 25 and cognitive complexity 28; 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ecce13a5fa3d48b4f5048dc7cf4bd6c8a6697e4b0c25d25ab9ba94ff347cbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 27): (anonymous) has cyclomatic complexity 25 and cognitive complexity 27; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc5c427e61c97c751501b587a2886a5ec85c8b9c350c59670f8d83e9fccd034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 25, cognitive 26): resolve has cyclomatic complexity 25 and cognitive complexity 26; 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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"67461025051b9908bedde30494ffac1a7c10b52faf1fa0fd92aa06c5228d64ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 25, cognitive 26): fetch has cyclomatic complexity 25 and cognitive complexity 26; 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":"telemetry-worker/src/index.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"80362944ba8bbf4bd08948f6401292de1f95e4d8a98f939d47440aeb8697b964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 25): (anonymous) has cyclomatic complexity 25 and cognitive complexity 25; 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":"src/mcp/tools.ts"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a13425be3a23874db638304aaa16aec644552d506a704c620836f1b4f9ddf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 25): (anonymous) has cyclomatic complexity 25 and cognitive complexity 25; 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":"src/resolution/index.ts"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ff280e32f22bf2849e1ea89caa9db5d9a53b2b9ca66414cf39577645bf8c00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importBindingTail (cyclomatic 25, cognitive 23): importBindingTail has cyclomatic complexity 25 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ffd2b72d5cc075b982ddba3e81eab4a574960939b69fe9e1ec65a6de9f9251"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function curriedWrapperBoundName (cyclomatic 25, cognitive 21): curriedWrapperBoundName has cyclomatic complexity 25 and cognitive complexity 21; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7554}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0384047d40d38286c7ce78146465e3d35bf00224262160eaaf5cd377bff89d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 25, cognitive 20): detect has cyclomatic complexity 25 and cognitive complexity 20; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ec4640ecf968514e2cc78b42092cd7bde44c95b30916a9e87c24341c0c4027"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 24, cognitive 45): extract has cyclomatic complexity 24 and cognitive complexity 45; 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":"src/resolution/frameworks/rust.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d361fdf3062513f8df6a5ef48fac8a9f4a505937f2bbd7daa1c532c7fe3da6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 24, cognitive 42): visitNode has cyclomatic complexity 24 and cognitive complexity 42; 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":"src/extraction/languages/solidity.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"339498b14311b0b801069c39b180cade06497eb8fa81ddb43da45249d2a23765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 41): (anonymous) has cyclomatic complexity 24 and cognitive complexity 41; 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":"src/mcp/tools.ts"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c62aa97caab3c61b8432c6351a11c634ea12dbd5fb89011ae27f2ce3df3a27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 39): (anonymous) has cyclomatic complexity 24 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":"src/mcp/tools.ts"},"region":{"startLine":7131}}}],"partialFingerprints":{"codehealthFindingId/v1":"00149963af0dab48d05063678595ebac8f6ffebcd26dbcf0785f203579ae6c99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaOverloadsFitting (cyclomatic 24, cognitive 39): javaOverloadsFitting has cyclomatic complexity 24 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14952}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee9d552bab0c6196ce1ca189915e446862734e0c7374e0d6a0909fb74e945d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOpenTag (cyclomatic 24, cognitive 38): parseOpenTag has cyclomatic complexity 24 and cognitive complexity 38; 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1a7fe804a7c768b1922f0432d21d82a5abf43e9e2a9c84bb3630f9308ec470"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPythonModuleIndex (cyclomatic 24, cognitive 38): buildPythonModuleIndex has cyclomatic complexity 24 and cognitive complexity 38; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e97867455b465172729aaadad9dfb8049220dcd5098eddbc72d489bb17b660"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromSource (cyclomatic 24, cognitive 37): extractFromSource has cyclomatic complexity 24 and cognitive complexity 37; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9977}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bce052f958f6514b3f507abb99bb91561aaf2f36db4d6625982d3c15a459e7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isExternalImport (cyclomatic 24, cognitive 37): isExternalImport has cyclomatic complexity 24 and cognitive complexity 37; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bf0b5eaa6b85c9c434c3d565be08bcb120d5e3627b21a040ee2dfc19e38142"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartLocalType (cyclomatic 24, cognitive 35): dartLocalType has cyclomatic complexity 24 and cognitive complexity 35; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5980}}}],"partialFingerprints":{"codehealthFindingId/v1":"849fe429868b6e4b839571af3634b7c6f707d6303acfb6f1b26d576627f552cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchPascalParenlessRef (cyclomatic 24, cognitive 35): matchPascalParenlessRef has cyclomatic complexity 24 and cognitive complexity 35; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4917b64e2ed1e30b6905ad5b502eb003f4254ebe15b8abed6791c8b20416580"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadWorkspacePackages (cyclomatic 24, cognitive 33): loadWorkspacePackages has cyclomatic complexity 24 and cognitive complexity 33; 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3337ce7cff9073f69ea8d290a2f6a265b739aab1efc0266bd665bde2d5fabe99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOrderModel (cyclomatic 24, cognitive 29): buildOrderModel has cyclomatic complexity 24 and cognitive complexity 29; 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":"ui/src/lib/program-model.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b3ec6eef1b302bb5821983ba0d167b792cc96c31650063259ce90632cb0f49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 28): (anonymous) has cyclomatic complexity 24 and cognitive complexity 28; 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":"src/db/queries.ts"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bd38b357b4aa3a41279691e4b06374f62faa80f3635fab4f09eeb05130a44a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 24, cognitive 26): extract has cyclomatic complexity 24 and cognitive complexity 26; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23db0eb0716baa337127ceb161f7ca2c44378e679a507185b2fc7e31c84da30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinSupertypeNames (cyclomatic 24, cognitive 25): kotlinSupertypeNames has cyclomatic complexity 24 and cognitive complexity 25; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21731}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c7670d70cd2b4ac56c567622517c8a86cd64c14b1da55e4471441947748fb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchGoPackageValueCall (cyclomatic 24, cognitive 25): matchGoPackageValueCall has cyclomatic complexity 24 and cognitive complexity 25; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26104}}}],"partialFingerprints":{"codehealthFindingId/v1":"12950df40be269a37d10327111a55dc305179011d548791560ca07eb503655cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinDeclaredTypeIn (cyclomatic 24, cognitive 24): kotlinDeclaredTypeIn has cyclomatic complexity 24 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f945f29649a76a226b5045314840331b64cfba83e12d9093c9a8f3c3b8033569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertNode (cyclomatic 24, cognitive 20): insertNode has cyclomatic complexity 24 and cognitive complexity 20; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/db/queries.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9a568810d57bb58e114bcab98847eac978c8fc2699535527fd32abe71e5f80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateNode (cyclomatic 24, cognitive 20): updateNode has cyclomatic complexity 24 and cognitive complexity 20; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/db/queries.ts"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb51e30e13f1a6a890e260435da3d95f5ec83a4fc103eb7e20a03913592d3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaredPythonRoots (cyclomatic 23, cognitive 66): declaredPythonRoots has cyclomatic complexity 23 and cognitive complexity 66; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1636c53dcf264cd76e28439021883c8dc086731eb001be432eb54dfff4b81d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppNonCodeLines (cyclomatic 23, cognitive 54): cppNonCodeLines has cyclomatic complexity 23 and cognitive complexity 54; 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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06515fafd97e1bdc720c0106c28edec6dc0051139010d315f56d1f164b92b7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanCall (cyclomatic 23, cognitive 41): scanCall has cyclomatic complexity 23 and cognitive complexity 41; 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"493959c15086859e16566f0e2d290b69d90f66628217bb70d2535bdb0fb15a2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonExprScan (cyclomatic 23, cognitive 41): pythonExprScan has cyclomatic complexity 23 and cognitive complexity 41; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0be5b696487a8be87446ea7255c1d6af419bcf8379f0873f9e4efbe6fe4da5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanForInVariable (cyclomatic 23, cognitive 36): scanForInVariable has cyclomatic complexity 23 and cognitive complexity 36; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8584fb4e7c2d7b867eb5b03c9a9d51491a8b2671bccc1fdbe121d0222ab4d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindParameters (cyclomatic 23, cognitive 35): bindParameters has cyclomatic complexity 23 and cognitive complexity 35; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8424fd4688764ab790d4835617c61aea348d2bbc9ae7679f49db63167336d3a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAliasedImport (cyclomatic 23, cognitive 35): resolveAliasedImport has cyclomatic complexity 23 and cognitive complexity 35; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"401ffdef751bb8cc47bb806b2d5d28ddf17bf1f4499f4263666ac572b2b8c1ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonConstructorCall (cyclomatic 23, cognitive 33): pythonConstructorCall has cyclomatic complexity 23 and cognitive complexity 33; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"51101c5821242c6143d9c398d4487041480770644682eb9341acfe2e072077e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 33): (anonymous) has cyclomatic complexity 23 and cognitive complexity 33; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfb839b859061e0a34f7718feff873284595ee1fe7df862725c3d5c8f22327b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFlow (cyclomatic 23, cognitive 33): buildFlow has cyclomatic complexity 23 and cognitive complexity 33; 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":"src/ui-server/api/flow.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"13016829a6970944399191a9343a925616c60b1fa5334bc104141c9f109200e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 23, cognitive 31): resolve has cyclomatic complexity 23 and cognitive complexity 31; 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ff726be23b5e7aaccc3fa1cbccde4cbde32604e57f9120a1d86b2de7da8f83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goClosingBracket (cyclomatic 23, cognitive 31): goClosingBracket has cyclomatic complexity 23 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26544}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec9e10678a7e0e1670997aec08662204782602aeb42af591eac745666f17ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localDeclarationScope (cyclomatic 23, cognitive 29): localDeclarationScope has cyclomatic complexity 23 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd7b91839113c11593e0fd6c8fc8ff644a50295408861c3ee99c7307e5ee2b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 28): (anonymous) has cyclomatic complexity 23 and cognitive complexity 28; 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":"__tests__/child-process-windows-hide.test.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"429ffff8b56c81c621ab0d144e29de95fe0d5d5942267bd62302e9a174f7c5b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function destinationOf (cyclomatic 23, cognitive 28): destinationOf has cyclomatic complexity 23 and cognitive complexity 28; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"404908a49692c3a9438534108675ccce4d03ab25d6adc61e78858ca64a4ff20a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFunction (cyclomatic 23, cognitive 27): extractFunction has cyclomatic complexity 23 and cognitive complexity 27; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd6480b50a80b40dd124d92c52e2e42ca29bf101e7a254364ed4ca14fc9eae5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustFirstArgIs (cyclomatic 23, cognitive 27): rustFirstArgIs has cyclomatic complexity 23 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1b52fea24569780eefad80e884849914fa85fac7f0fbe0c5482bf3b3566a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppTemplateArgumentsEnd (cyclomatic 23, cognitive 26): cppTemplateArgumentsEnd has cyclomatic complexity 23 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32888}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41de863ef3cd6827d86e25295e07c709c95f2710275bfcf2490b6aa2bc8b01b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 24): (anonymous) has cyclomatic complexity 23 and cognitive complexity 24; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac67418c0416fbd6e0645ff7e5fa7fc76af046cd7965b3dce3c98f3394acba2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsFieldElementType (cyclomatic 23, cognitive 24): tsFieldElementType has cyclomatic complexity 23 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30024}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e2537d3311e36fd9008ea9612f228c263ec031463d646e56e076c71ce013eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateDartLocal (cyclomatic 23, cognitive 21): gateDartLocal has cyclomatic complexity 23 and cognitive complexity 21; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a131495c35bd1a82759b2e0d860014264908a729a4817ff422028c1645f489b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppDeclaratorMayEndAt (cyclomatic 23, cognitive 14): cppDeclaratorMayEndAt has cyclomatic complexity 23 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da98c6208559c52fc07b55fbca596aa1d6eead6fb5c3763a985bf0af5decd6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function passedOn (cyclomatic 22, cognitive 54): passedOn has cyclomatic complexity 22 and cognitive complexity 54; 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":"src/resolution/module-importers.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee25c4dc0ce2e05ec98903fd120a6f7e176fa0ff37d30f51e8ac238075e0f33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDeferredThisMemberRefs (cyclomatic 22, cognitive 50): resolveDeferredThisMemberRefs has cyclomatic complexity 22 and cognitive complexity 50; 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":"src/resolution/index.ts"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf706234b4012653fee39b044bb634522a0309d5c6bcb7c737d47a9d446c6cc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getImpactRecursive (cyclomatic 22, cognitive 49): getImpactRecursive has cyclomatic complexity 22 and cognitive complexity 49; 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":"src/graph/traversal.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a42ec3349b7d7f1500be3ffedd6483788050563df95a9fd577300cb0d21919c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 22, cognitive 48): parse has cyclomatic complexity 22 and cognitive complexity 48; 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":"scripts/agent-eval/parse-arms.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d7a08cf3f208bac7910543754c582aa753b3f2a6ba4a5fac90c722d79d8319"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkPattern (cyclomatic 22, cognitive 44): walkPattern has cyclomatic complexity 22 and cognitive complexity 44; 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9535656a2990276a227ed727231895cfc9fc22deed3638fea888f602113e97a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPolymorphicBoundaries (cyclomatic 22, cognitive 43): buildPolymorphicBoundaries has cyclomatic complexity 22 and cognitive complexity 43; 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":"src/mcp/tools.ts"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dda096f073c3bd932c64319fb41f3bcd546274bf238944e36cf514dbd0c4fcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaredDependencies (cyclomatic 22, cognitive 39): declaredDependencies has cyclomatic complexity 22 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":"src/resolution/frameworks/package-deps.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b949cab52460ba7dcd631fc1ca0e89652f7ddbb48c9fdfadad14f600ffb995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overrideCandidates (cyclomatic 22, cognitive 38): overrideCandidates has cyclomatic complexity 22 and cognitive complexity 38; 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":"src/graph/dead-code.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf193e65473ecb6e99fe056b72e04f70187966173f0b52832e604f5276699df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 22, cognitive 38): extract has cyclomatic complexity 22 and cognitive complexity 38; 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dd128166c7ed24c6fce6427790e24fe46d270d81db821288aaa462f30d32f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFields (cyclomatic 22, cognitive 38): readFields has cyclomatic complexity 22 and cognitive complexity 38; 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":"src/resolution/frameworks/object-literal.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"045f1d9ef7272d2a4337894300fd3d204d5509ce786af34160a0ffae1bd7f2f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reopenNameMatchedImports (cyclomatic 22, cognitive 38): reopenNameMatchedImports has cyclomatic complexity 22 and cognitive complexity 38; 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":"src/resolution/module-importers.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40858a59e7c94e6bd17c7c7f538b86ab5914af55a9ef5dd02cf31b3ca58ffb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveJavaImportedReference (cyclomatic 22, cognitive 37): resolveJavaImportedReference has cyclomatic complexity 22 and cognitive complexity 37; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fa772de42add3796d75883e416817108027698f93cf49c499d45d3e62f69ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustReadPathDecls (cyclomatic 22, cognitive 36): rustReadPathDecls has cyclomatic complexity 22 and cognitive complexity 36; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10092}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37d0296fb8c89ad0528939353c51a39678bbb2a8b90c25776f6fb9ba2a484b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTypeAnnotations (cyclomatic 22, cognitive 34): extractTypeAnnotations has cyclomatic complexity 22 and cognitive complexity 34; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8412}}}],"partialFingerprints":{"codehealthFindingId/v1":"160f45d822d8db8bb82aeba15ea3bc4c9b3e665e901d31b86448dcd06f24934e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readString (cyclomatic 22, cognitive 32): readString has cyclomatic complexity 22 and cognitive complexity 32; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b88de81c42fc0d4e8fba05d71dad502b62deda3eaff7b545e5bfdbb430e92a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinChainDeclaredType (cyclomatic 22, cognitive 32): kotlinChainDeclaredType has cyclomatic complexity 22 and cognitive complexity 32; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22144}}}],"partialFingerprints":{"codehealthFindingId/v1":"307cd00814128de3d582a59c2bd9beb3b1375d5ad4dbd907abd9aa12e660242a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flush (cyclomatic 22, cognitive 32): flush has cyclomatic complexity 22 and cognitive complexity 32; 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":"src/sync/watcher.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc2fabd0d88318f4d34acd2651ad77dcac72a8b6f63ab849b4d304eaaab50d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveErlangGenServerTarget (cyclomatic 22, cognitive 31): resolveErlangGenServerTarget has cyclomatic complexity 22 and cognitive complexity 31; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7d0e5e234fc9d63bcec8bfa32f2fae60e60ca5e55754bac63ae78f4bade0f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchDottedCallChain (cyclomatic 22, cognitive 31): matchDottedCallChain has cyclomatic complexity 22 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20797}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c2a1519a7005adcbd6045a2dffbbdebf50cfecc33c561d3158099a99e8c763"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toWireFlow (cyclomatic 22, cognitive 31): toWireFlow has cyclomatic complexity 22 and cognitive complexity 31; 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":"src/ui-server/api/flow.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d55b056b970a1a0d223fa2f7705e431274deb341131bb8c523a3d0be90de3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 22, cognitive 29): detect has cyclomatic complexity 22 and cognitive complexity 29; 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"108f1f1ea9600260bb3c91cdd183bbb6a85884f89702c4f5babf49580693288d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinHierarchyAt (cyclomatic 22, cognitive 29): kotlinHierarchyAt has cyclomatic complexity 22 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7094}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caecca60766780ff83a75de905e549d5ffce38f6dcfa939e4553a7e35856b2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 29): (anonymous) has cyclomatic complexity 22 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9853}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bd4de5b99b06d5c4d86474164f9efdd69e494c08d819788bb9b4da7f01fcdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchByQualifiedName (cyclomatic 22, cognitive 29): matchByQualifiedName has cyclomatic complexity 22 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15058}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bebafdf5315c1837082a411293092ad16338056ca5dfb89db25c0c750c8848"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goSignature (cyclomatic 22, cognitive 28): goSignature has cyclomatic complexity 22 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e203c95318d20188d94ef593865aa32fda6851a9bcaa329cc3059ac2614a4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildScreensModel (cyclomatic 22, cognitive 28): buildScreensModel has cyclomatic complexity 22 and cognitive complexity 28; 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cfaa051d4b536906c5c8cd16fe14a5d7939ad6e832c5eb8a46d90a40ef4db7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blockValue (cyclomatic 22, cognitive 26): blockValue has cyclomatic complexity 22 and cognitive complexity 26; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1532967fa869efcfbb99c8d0f3ecff5d1a2c169ddf20e043abc04e28de88700c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 22, cognitive 25): resolve has cyclomatic complexity 22 and cognitive complexity 25; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"de199373a90c5bd2478b52dc5f3f03dc510810b5a5b93fe686936060a6383e73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStepsModel (cyclomatic 22, cognitive 24): buildStepsModel has cyclomatic complexity 22 and cognitive complexity 24; 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6288fff2b199aab4b9e338466aab0dffb7d1f87ee4116e57edf3781d96b1269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function destructuredParameterBody (cyclomatic 22, cognitive 23): destructuredParameterBody has cyclomatic complexity 22 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23938}}}],"partialFingerprints":{"codehealthFindingId/v1":"717f9cc11f027bd6656a9e981c1f82ffd8c7cecde552d40351bd6feff3b45c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function breakdown (cyclomatic 22, cognitive 22): breakdown has cyclomatic complexity 22 and cognitive complexity 22; 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea8572e86a902e11e71d57465d573ba0a11efc7ea41f9178e9320d282d988f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followsDeclaredName (cyclomatic 22, cognitive 21): followsDeclaredName has cyclomatic complexity 22 and cognitive complexity 21; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"b629175dc9fe48208dbdca6893d01358d1ed6d91c1b2b44c4f9031317a10571b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppRangeElementOf (cyclomatic 22, cognitive 21): cppRangeElementOf has cyclomatic complexity 22 and cognitive complexity 21; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b9169ba42a5ae2e947297cf1a7ba090bfc6d63945194de3c222e84e6a2fa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelIndex (cyclomatic 22, cognitive 18): topLevelIndex has cyclomatic complexity 22 and cognitive complexity 18; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/override-parameters.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"56705c3708c73a852279f70d03f0687aa0bfd4a6720aaf65194bc380316d8106"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectLanguage (cyclomatic 22, cognitive 16): detectLanguage has cyclomatic complexity 22 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/grammars.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c794a690eb3ba7b49f4b8c908c89e523815fcb140d24fd6bfc35f3e96eb7e9ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 21, cognitive 46): walk has cyclomatic complexity 21 and cognitive complexity 46; 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":"src/extraction/index.ts"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d48fc64a0db704eb46d46102d72127b9411e8f1ba5bafb3c0f9352af29a84a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableRoutes (cyclomatic 21, cognitive 41): tableRoutes has cyclomatic complexity 21 and cognitive complexity 41; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b016f5a319e7748f8946828179a503392b41c719a7496b56c8c001d226c0d5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotatedMethodName (cyclomatic 21, cognitive 40): annotatedMethodName has cyclomatic complexity 21 and cognitive complexity 40; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c51a1602e6c7282e27c4897bc42a70ad84010a6c9b01b1def8e15baaad21e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpAncestorNames (cyclomatic 21, cognitive 40): csharpAncestorNames has cyclomatic complexity 21 and cognitive complexity 40; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57c181679b66ea85fc25e5d61603fa7d5ba115d7a607e822a178859e265071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCsharpTrivia (cyclomatic 21, cognitive 40): blankCsharpTrivia has cyclomatic complexity 21 and cognitive complexity 40; 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":"src/resolution/override-parameters.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"031755b6ff95cda4ec1df652a52b7154e4b7639dd7351e7813966c2ff8b80929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppDefinitionHeads (cyclomatic 21, cognitive 38): cppDefinitionHeads has cyclomatic complexity 21 and cognitive complexity 38; 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a907366ac1c8cc7ddc6cb3d976941fbe950f7b5e48cf1a1e209d64eed951b8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function afterCalledName (cyclomatic 21, cognitive 36): afterCalledName has cyclomatic complexity 21 and cognitive complexity 36; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"629a43d90634680b32fa4106b34c87e1c2146e32c022282fb48743db646b93a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDestructuredBindings (cyclomatic 21, cognitive 35): readDestructuredBindings has cyclomatic complexity 21 and cognitive complexity 35; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99cd059035087fd78126dc42e4189e701486fe563d046d833e2958730006ab4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaredTypeParameters (cyclomatic 21, cognitive 35): declaredTypeParameters has cyclomatic complexity 21 and cognitive complexity 35; 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":"src/resolution/type-parameters.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b0386139e545d8c9caa1bf1b49b1e099e105eb559d8c2f317db641f69e0405"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeValue (cyclomatic 21, cognitive 34): normalizeValue has cyclomatic complexity 21 and cognitive complexity 34; 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":"src/extraction/function-ref.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d20057102c7453203248f1d1d94aea352183dce3dd5ee8ad1922e123d2c7c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRtkEndpointsObject (cyclomatic 21, cognitive 33): findRtkEndpointsObject has cyclomatic complexity 21 and cognitive complexity 33; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a15bf043353977ab529f13da7d193893cac4f842dad5bf54c96b68abcecbdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTanstackRoutes (cyclomatic 21, cognitive 33): parseTanstackRoutes has cyclomatic complexity 21 and cognitive complexity 33; 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c9411799fbb4116ee3c65ba2a7a12d8d7e18f2eadb7f637994b37e85313b2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 32): (anonymous) has cyclomatic complexity 21 and cognitive complexity 32; 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eda61187cd2b5747bf088c604cbcc592d3654a97f8e7e71ae4fc191b6b84e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fabricNativeImplEdges (cyclomatic 21, cognitive 32): fabricNativeImplEdges has cyclomatic complexity 21 and cognitive complexity 32; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21f4e2f419ca7f346e17824c4063e41c23efc7eaf02fc14b1e5fbe8f58037c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveScopedModuleRef (cyclomatic 21, cognitive 32): resolveScopedModuleRef has cyclomatic complexity 21 and cognitive complexity 32; 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":"src/resolution/frameworks/terraform.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"da134842a9ed60352dd95bee900f27252bd7af62715f1b92531924db5c2c7bb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferEsmAwaitedCallType (cyclomatic 21, cognitive 31): inferEsmAwaitedCallType has cyclomatic complexity 21 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee5e566f23286ae249dea40f6a8c1bbd22e7478f0ae7209dca064e26e5aa645"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeBinding (cyclomatic 21, cognitive 30): nativeBinding has cyclomatic complexity 21 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":"src/resolution/frameworks/expo-modules.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0022569e3544765cf49918b1e85b9a777937f82e030b8c1dbe629f5e12d94404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declarationFor (cyclomatic 21, cognitive 30): declarationFor has cyclomatic complexity 21 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae83ebc50c081a278adab32a0c36f2af827ba95ec5620e45ffe3520b3767452d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripWrapping (cyclomatic 21, cognitive 30): stripWrapping has cyclomatic complexity 21 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":"src/search/query-paths.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e403cbdeb5cad844753e91f8990c02fde200c676d8e648376519e436e74dd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 21, cognitive 29): enclosing has cyclomatic complexity 21 and cognitive complexity 29; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a8085faf733e3967ec4ccbd22fb02b14f6af9a42bd30e9433d77e493f15ef2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function allocateExploreBudget (cyclomatic 21, cognitive 28): allocateExploreBudget has cyclomatic complexity 21 and cognitive complexity 28; 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":"src/mcp/tools.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f08761a3758b1551b2626d8267ff321991ba1ecac7e6e7825fd65d4bfd769fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSpringConfig (cyclomatic 21, cognitive 28): extractSpringConfig has cyclomatic complexity 21 and cognitive complexity 28; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed971d9fc708ffc30d0ee054174ed1f042d501547b54ef7a55be1de5f6928f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaSupertypesOf (cyclomatic 21, cognitive 28): scalaSupertypesOf has cyclomatic complexity 21 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8087d8822db52d739df1c7333c698169d16c26aa69d4c92bcd5291f607c2a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustWrittenCallReceiver (cyclomatic 21, cognitive 28): rustWrittenCallReceiver has cyclomatic complexity 21 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29614}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cebb19a751a05515ff66fb8b42205ee73f116be1653d064e2f118895fc056f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operandEnd (cyclomatic 21, cognitive 28): operandEnd has cyclomatic complexity 21 and cognitive complexity 28; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb68d20df064a17bb8cface58a2b2bb02c1c65a150e3d9ef11e2c030d4ccbf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCppTopLevel (cyclomatic 21, cognitive 27): splitCppTopLevel has cyclomatic complexity 21 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32853}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d24018ae91d31877bed80a40880741603f4d5a2e60a0426b271d8b9cfa4595"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonFixtureReturnType (cyclomatic 21, cognitive 26): pythonFixtureReturnType has cyclomatic complexity 21 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"194e7bf87319b6f92b20e577e4612b9b1481e26948f563f4536e2e73b53525db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractMethod (cyclomatic 21, cognitive 25): extractMethod has cyclomatic complexity 21 and cognitive complexity 25; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"24367d30990e56043fa57bb17213df3eef2c3ea49546e0d7294404bd10096e00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startDaemonProcess (cyclomatic 21, cognitive 25): startDaemonProcess has cyclomatic complexity 21 and cognitive complexity 25; 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":"src/mcp/index.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bff2ad54d5c5a90489afaf48e856cd7e887496cf1d8833c0bf3e02ad728fc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartInitializerType (cyclomatic 21, cognitive 24): dartInitializerType has cyclomatic complexity 21 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6081}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21923ad039bbeded2ceb166d57c70c8171a8695d35e115cc7a33371b1b4d382"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppArgumentType (cyclomatic 21, cognitive 22): cppArgumentType has cyclomatic complexity 21 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e3df1084a8f58c248b5f87a1a4e5e50c8ce8245d55888bf4a4d326e51e48f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function storeExtractionResult (cyclomatic 21, cognitive 21): storeExtractionResult has cyclomatic complexity 21 and cognitive complexity 21; 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":"src/extraction/index.ts"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d10f31e27658b35e0167b7f9a1ace341d3398fc5719ff7503554767ae00ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conditionalBranches (cyclomatic 21, cognitive 21): conditionalBranches has cyclomatic complexity 21 and cognitive complexity 21; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc1e905f549c2e6a1965e1067c7d5eaba1c8f388401dd5d2badc43c3062ceb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isKotlinMemberReachable (cyclomatic 21, cognitive 20): isKotlinMemberReachable has cyclomatic complexity 21 and cognitive complexity 20; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7262}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c0f869601504b5a48c82c1a28273a1865174ee0191634bbc2ce456026fec2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppDeclaredTypeCall (cyclomatic 21, cognitive 19): matchCppDeclaredTypeCall has cyclomatic complexity 21 and cognitive complexity 19; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff31052480d152b9bc53cc217409cc58f020b172e651c8769d54ad43c7bb310"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withinCppTranslationUnit (cyclomatic 21, cognitive 17): withinCppTranslationUnit has cyclomatic complexity 21 and cognitive complexity 17; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a249fdf6a33d600489c3ffb6963179e9f6f837d2bd232e1bf928af98e8fa4c9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goGrpcStubImplEdges (cyclomatic 20, cognitive 52): goGrpcStubImplEdges has cyclomatic complexity 20 and cognitive complexity 52; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"864363f08fa0116983c6967316848ef1d4d3548e9dc27f3d238af876bee63325"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 50): (anonymous) has cyclomatic complexity 20 and cognitive complexity 50; 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":"ui/src/lib/program-model.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aea3f55ba6d36b24979211c47f9f7efa78aebccb57c8c030063345f6e8ab86d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppLiteralsBlanked (cyclomatic 20, cognitive 41): cppLiteralsBlanked has cyclomatic complexity 20 and cognitive complexity 41; 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":"src/resolution/cpp-raw-strings.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b99c1927d49819df500ecfc13876824cd077aadb774be0ee20ebb3c84be9be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reopenReferencesThroughBarrels (cyclomatic 20, cognitive 41): reopenReferencesThroughBarrels has cyclomatic complexity 20 and cognitive complexity 41; 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":"src/resolution/module-importers.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269c68b7ea716b344571bff26738f91a683f650b10798d2f9ca40cde825ec06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPascalDefProc (cyclomatic 20, cognitive 40): extractPascalDefProc has cyclomatic complexity 20 and cognitive complexity 40; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9040}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa030cd44be579adbfa8b979d895cec94c6021abbf29f81715ba7bdabc76757d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activate (cyclomatic 20, cognitive 40): activate has cyclomatic complexity 20 and cognitive complexity 40; 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":"src/mcp/project-lifecycle.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7faec5461cdddb70050f7a0c52556e37b67326174ba708243c5ba00773ae0af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 20, cognitive 35): visitNode has cyclomatic complexity 20 and cognitive complexity 35; 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":"src/extraction/languages/dart.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddce90c92970017bc77a6cc47fdb7a5dd628078016fb1626a47b3744544085b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 20, cognitive 33): visitNode has cyclomatic complexity 20 and cognitive complexity 33; 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":"src/extraction/languages/ruby.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac485aabeb38d1bf699718e26dab68536e1af47a70aad15c31a0c285b530ebf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectQueue (cyclomatic 20, cognitive 33): collectQueue has cyclomatic complexity 20 and cognitive complexity 33; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"043c14492476b2ce3b16de3a7544d83f44a1b576aa1e3bccd0dfa81e4c47b57a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordEnd (cyclomatic 20, cognitive 32): recordEnd has cyclomatic complexity 20 and cognitive complexity 32; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85d6dba0a63fd6678c4db6db4d30f30ecbe97645a2f016e7e813a13fb2c3098"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tag (cyclomatic 20, cognitive 32): tag has cyclomatic complexity 20 and cognitive complexity 32; 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":"src/resolution/jsx-code.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4142ebf777c8866b0e0594af614301dedd8498187ae37b224942675b677a8776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseQuery (cyclomatic 20, cognitive 32): parseQuery has cyclomatic complexity 20 and cognitive complexity 32; 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":"src/search/query-parser.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8c8b735c96cc0b3d69b7981824077245e63f3441a54cfa44584463ab6b78e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constAliasEdges (cyclomatic 20, cognitive 31): constAliasEdges has cyclomatic complexity 20 and cognitive complexity 31; 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79e545c118549139be62f27b92defbedeace9da84bcde64f2da13c6508abb8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpProjectUsings (cyclomatic 20, cognitive 31): csharpProjectUsings has cyclomatic complexity 20 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8066}}}],"partialFingerprints":{"codehealthFindingId/v1":"555baedbab710a286d54746678681a207a8469fbfc6d1ea995b19b1ac89b370f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeGraphRelevance (cyclomatic 20, cognitive 30): computeGraphRelevance has cyclomatic complexity 20 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":"src/mcp/tools.ts"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6a108f5d689f7b2390f054b66dc53afd5cebbae81dd0e8d281d61503c40550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppNamespaceMacros (cyclomatic 20, cognitive 30): cppNamespaceMacros has cyclomatic complexity 20 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":"src/resolution/cpp-namespaces.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab1571b0f534f19ce42a1381bd39b7980b446f57e1b6f795e423e07b7b9df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppMethodOf (cyclomatic 20, cognitive 30): cppMethodOf has cyclomatic complexity 20 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbc0d7bf2b47c83f4d5f19e1ea48f0a4661e127266ac01765353ec436512762"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapAlternativeStatements (cyclomatic 20, cognitive 29): wrapAlternativeStatements has cyclomatic complexity 20 and cognitive complexity 29; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f165059c86487c47e76bfa9d58ebd3344397c61d55348e0d55be375b087bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDynamicBoundaries (cyclomatic 20, cognitive 29): findDynamicBoundaries has cyclomatic complexity 20 and cognitive complexity 29; 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":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc33c7633037df9d99b59712a4909fa2d773073fd78f9efec06e54959ad973d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 29): (anonymous) has cyclomatic complexity 20 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2ef59a0dac9ff3f7ecdf62b7132848f46b872a7b9d8c7809040a3987dd5ae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonFieldType (cyclomatic 20, cognitive 29): pythonFieldType has cyclomatic complexity 20 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"055de9b354b1224fda6ea46532967e3707b860b746889d1c74bc3b33f7aa898f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonBaseList (cyclomatic 20, cognitive 28): pythonBaseList has cyclomatic complexity 20 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fb69aabd061b74b30bbe66a1e8258185b318bc83cd5f01471cfac2e6e9f373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindsAtSites (cyclomatic 20, cognitive 28): bindsAtSites has cyclomatic complexity 20 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13979}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13dfb9f17289b7e2c72bc5ac2b88ca36f5bbff297f2fed1257cf6e0262b5b9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crossTierEdges (cyclomatic 20, cognitive 28): crossTierEdges has cyclomatic complexity 20 and cognitive complexity 28; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"060111774b096d11df20e76a21b254ac5e9f10a1bf78f52feb8368b7e1a56b04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 20, cognitive 27): enclosing has cyclomatic complexity 20 and cognitive complexity 27; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfd4bc5bea3811d5429cbb97d7ed4dd34139c192ac5747d3092286ec114202b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchDartAnnotation (cyclomatic 20, cognitive 27): matchDartAnnotation has cyclomatic complexity 20 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6413}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a5c33de08132ddce15bad6a47ab94c67dc256e331eccf5ea75d8f8e0272095"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTraitImplemented (cyclomatic 20, cognitive 27): rustTraitImplemented has cyclomatic complexity 20 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13094}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad9db68de021693fa0c9b4988cf0d528e18f67b08e030c0ad754276b5fa505"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonDefStatements (cyclomatic 20, cognitive 27): pythonDefStatements has cyclomatic complexity 20 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27962}}}],"partialFingerprints":{"codehealthFindingId/v1":"f583900f7ff25c6e62bff1ba1b469e3dfc7cb85f013d400d126c3a60cd5ff1a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 20, cognitive 26): enclosing has cyclomatic complexity 20 and cognitive complexity 26; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"575e49ab27edd99a7de4798dcaa51f4a9085ecb063c1c921c21fa20d68247696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelArgs (cyclomatic 20, cognitive 25): topLevelArgs has cyclomatic complexity 20 and cognitive complexity 25; 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"01db45b50bc0510e1d9bd298a5e86e2d85280de6defacbde9029e4efc474ad29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankLoneMacroLines (cyclomatic 20, cognitive 24): blankLoneMacroLines has cyclomatic complexity 20 and cognitive complexity 24; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac748f8532a34181e7d4fe9068afc8cd084837141b6cae66006d4b06d6889ca0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectLiteralProperty (cyclomatic 20, cognitive 24): objectLiteralProperty has cyclomatic complexity 20 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98316d59171733e8c38e8d9ade98dd1e12aa90e873be303638186368fd839b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 24): (anonymous) has cyclomatic complexity 20 and cognitive complexity 24; 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":"src/resolution/resolver-worker.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b4d701b694f50444e48735bceb264956bf0884b42acd6dab00ffa7c01187ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 20, cognitive 23): judge has cyclomatic complexity 20 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":"scripts/add-lang/check-grammar.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff97d859a353853d2651d78f0329b2ea95c055ba7fb935b42293e1c1e79b9b1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractVbMemberRead (cyclomatic 20, cognitive 23): extractVbMemberRead has cyclomatic complexity 20 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6926}}}],"partialFingerprints":{"codehealthFindingId/v1":"e293a23329e25667706ef67afc8d18bf12be6144558af953e561c829d2aa4851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustCrateRootModule (cyclomatic 20, cognitive 22): rustCrateRootModule has cyclomatic complexity 20 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df569973646340d29d01185de5064a77dc50ae39ca6b1f2020f09fd386eead5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaMemberInScope (cyclomatic 20, cognitive 22): scalaMemberInScope has cyclomatic complexity 20 and cognitive complexity 22; 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":"src/resolution/type-parameters.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0db387c7a61e1828866faa21aae5f91a70a06b950ff95efd8edf143a7b401a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowSvg (cyclomatic 20, cognitive 22): flowSvg has cyclomatic complexity 20 and cognitive complexity 22; 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ea071b75aea479b43a3f6350e40507fd71ce47b27ef9e9ba22d1b28b03b5dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasSynthesisPattern (cyclomatic 20, cognitive 20): hasSynthesisPattern has cyclomatic complexity 20 and cognitive complexity 20; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f059849ad80c3f018d6e3e2567a2a9d493b6aae0c64059ce0d4b60c4e96cc6b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindingElementAt (cyclomatic 20, cognitive 19): bindingElementAt has cyclomatic complexity 20 and cognitive complexity 19; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e2b6f8c490c1cafbf4ee676cb12d8ccd0bc021df8e40e02721019be94105b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writtenBase (cyclomatic 20, cognitive 19): writtenBase has cyclomatic complexity 20 and cognitive complexity 19; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"0231f9df266e5a05a92e06c514a4f75bd68815160ba3e83210a5fd0f7f8e36b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function daemonStopFailureMessage (cyclomatic 20, cognitive 18): daemonStopFailureMessage has cyclomatic complexity 20 and cognitive complexity 18; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e56200af28010bc1c1c132af7e1ca08d31d0de07bf4ba21292b4939fc7373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function meta (cyclomatic 20, cognitive 18): meta has cyclomatic complexity 20 and cognitive complexity 18; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1bfb8dda347c427699f4e0cb7a07b03dd51d7f4a5377151f8756494609b3a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headMemberOf (cyclomatic 20, cognitive 16): headMemberOf has cyclomatic complexity 20 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcc853829241921027a65b79b6e7a6a0bd6e235a7b0a5a1d4d4f18802fcd644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onkeydown (cyclomatic 20, cognitive 15): onkeydown has cyclomatic complexity 20 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/views/SymbolView.svelte"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"740d212d2f9ef10ddc3cf202130db05e879ff76c03cbc5225c88569c6e4ebcc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kindRank (cyclomatic 20, cognitive 14): kindRank has cyclomatic complexity 20 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08c23ea2d33876af37e82552c81568a71ee696f997327469a4096184554789a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rtkEndpointHandler (cyclomatic 19, cognitive 41): rtkEndpointHandler has cyclomatic complexity 19 and cognitive complexity 41; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"937657916bc9dce6d0552de1d9d95cac5a4fc5f1774fc41f6d0e87d37d41a725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileMatcher (cyclomatic 19, cognitive 37): compileMatcher has cyclomatic complexity 19 and cognitive complexity 37; 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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c049dd77dc685970f4f84c76e6d4118ab395a2dd78e35cf5279f313abb4c5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFlaskUrlRules (cyclomatic 19, cognitive 37): extractFlaskUrlRules has cyclomatic complexity 19 and cognitive complexity 37; 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"620089a99c4f2991efbfe5a9c2f55d7f517aa8b779cb994d3d949b1f17253744"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namesToReview (cyclomatic 19, cognitive 37): namesToReview has cyclomatic complexity 19 and cognitive complexity 37; 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f10f06528bf45606164d903183007b43c2ad0e4714e3db93cc618680c0526bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hideState (cyclomatic 19, cognitive 35): hideState has cyclomatic complexity 19 and cognitive complexity 35; 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":"__tests__/child-process-windows-hide.test.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9ccbc6ef54e5a8adcc4c5c28d2f4e4627c56d87bf1143492ead6892b81f935"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function traverseBFS (cyclomatic 19, cognitive 34): traverseBFS has cyclomatic complexity 19 and cognitive complexity 34; 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":"src/graph/traversal.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc89b7eb9f58862667acd5d2867fb3e3724d702c119f33dfa88e52bd0accf1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeRun (cyclomatic 19, cognitive 33): analyzeRun has cyclomatic complexity 19 and cognitive complexity 33; 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":"scripts/agent-eval/offload-eval-cost.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f23d528ca07cffa70234276ee539992da081d2b3de17be3c8ab41d288035b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankDuplicateBegins (cyclomatic 19, cognitive 33): blankDuplicateBegins has cyclomatic complexity 19 and cognitive complexity 33; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c538b7df588ffedc7682e721e338e5dae7f08d59f0477579978d2a032c9897f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppConstructor (cyclomatic 19, cognitive 33): matchCppConstructor has cyclomatic complexity 19 and cognitive complexity 33; 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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ed39e8dcaf8a79927d32b89057ca6de370aa12c536f829b72c24546e6235a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinBraceFrames (cyclomatic 19, cognitive 33): kotlinBraceFrames has cyclomatic complexity 19 and cognitive complexity 33; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcfc168c48dfa6d4f477fbf6a78c453dff5d79f2744582585e2741675df9b33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchBrace (cyclomatic 19, cognitive 32): matchBrace has cyclomatic complexity 19 and cognitive complexity 32; 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d516c4b41872b30541992050e15e2b215c43ce1ef7da81c90862e2ae31c181"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanDynamicDispatch (cyclomatic 19, cognitive 32): scanDynamicDispatch has cyclomatic complexity 19 and cognitive complexity 32; 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f8e6b3faab0270bb8803cddc28068d7bda560daad3576762ca12da6809ae5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeFileMounts (cyclomatic 19, cognitive 32): routeFileMounts has cyclomatic complexity 19 and cognitive complexity 32; 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e1b6579a4be6f4ff8dc924b3514d1ade0d0217a363be6543b30e5085d598c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchNodesFuzzy (cyclomatic 19, cognitive 31): searchNodesFuzzy has cyclomatic complexity 19 and cognitive complexity 31; 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":"src/db/queries.ts"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"593de953246fa28a9ee041a776191bd35e9e94155b407d2c365c50628c988509"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mentionsOf (cyclomatic 19, cognitive 31): mentionsOf has cyclomatic complexity 19 and cognitive complexity 31; 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":"src/ui-server/api/screens.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de0c98a19160be18e28f0a15f57d36a544f71a6c24b555e07407263c7315544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mybatisJavaXmlEdges (cyclomatic 19, cognitive 30): mybatisJavaXmlEdges has cyclomatic complexity 19 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbfc8861bfc55ea0c91efb9e2f98bfd3069cea9a6c394dd4ed3941ada4d008d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportedTable (cyclomatic 19, cognitive 30): exportedTable has cyclomatic complexity 19 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e051feb1bc73db562b3007cd041853c37ff1eef2c0aa7487c811d378af242f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changedDefaultExports (cyclomatic 19, cognitive 30): changedDefaultExports has cyclomatic complexity 19 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":"src/resolution/index.ts"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bfbe99bff7253dff92948fb1bdb1dfc314a7a3ed34ae25d583a9ffe51fd2e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guardsInTree (cyclomatic 19, cognitive 29): guardsInTree has cyclomatic complexity 19 and cognitive complexity 29; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89f7ee5c6f8c9ea7b765897d3e0ce561a62cf42f3dce4562d833e4adf5f56cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustPlacedByName (cyclomatic 19, cognitive 28): rustPlacedByName has cyclomatic complexity 19 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94fd31f912627101e32bf7dcdcdfc846fd2708555c2b7214539aa978bae19b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCallPathsSection (cyclomatic 19, cognitive 27): buildCallPathsSection has cyclomatic complexity 19 and cognitive complexity 27; 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":"src/context/index.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9643c6119bd6eec44395af2d9a347b562b411510be194f65283183a1dab3c48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synthesizeRecordComponents (cyclomatic 19, cognitive 27): synthesizeRecordComponents has cyclomatic complexity 19 and cognitive complexity 27; 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":"src/extraction/languages/java.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f4ec93da3c2f0c2a29d0c85273be08f66bfa6f8d59b3faee7d72e03b21ec83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchClose (cyclomatic 19, cognitive 27): matchClose has cyclomatic complexity 19 and cognitive complexity 27; 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"52efcfda8f155de9be5b0741553584f3baae1cd3f252a4b7f17749af91bc724f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objcMemberReceiverType (cyclomatic 19, cognitive 27): objcMemberReceiverType has cyclomatic complexity 19 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8614}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d424830c81129ad0fc32fc99d49544ddea7ad5fc24be21b995679eceac4077"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPrecedingDocstring (cyclomatic 19, cognitive 26): getPrecedingDocstring has cyclomatic complexity 19 and cognitive complexity 26; 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":"src/extraction/tree-sitter-helpers.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a8725076fde11458aab84baa2d54cc2fb2e6044c903b2bb57f2a649347c993"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findVueStoreCollectionObjects (cyclomatic 19, cognitive 26): findVueStoreCollectionObjects has cyclomatic complexity 19 and cognitive complexity 26; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3863}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe088a6029f5c12e6eebc183fec847e0e5715a6b2bb767c1d6f7c8de76ca6bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinLambdaReceiver (cyclomatic 19, cognitive 26): kotlinLambdaReceiver has cyclomatic complexity 19 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b08ce5dced09e6fad389fb018bdca321a18e4b6936ff593075e4835afdfac9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 26): (anonymous) has cyclomatic complexity 19 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9787}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89146917846daf650c232fb8fdec04f11f86673e218cfdebbb358722a11078b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructorShape (cyclomatic 19, cognitive 25): constructorShape has cyclomatic complexity 19 and cognitive complexity 25; 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":"src/resolution/cpp-constructor.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8632c20800931a2b068853f61bb69408f011f45bcfacfa7859457de25d9c6f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function anonymousRecordDeclStart (cyclomatic 19, cognitive 24): anonymousRecordDeclStart has cyclomatic complexity 19 and cognitive complexity 24; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcc861ae2d451ce6a92f952bb5989599b7489cfbf741c80f8823b5e85d6ef28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synthesizeCallbackEdges (cyclomatic 19, cognitive 24): synthesizeCallbackEdges has cyclomatic complexity 19 and cognitive complexity 24; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":5471}}}],"partialFingerprints":{"codehealthFindingId/v1":"490fd5b6d624451cbd5f55e40844aa4045714aee284906f70baafc4622ddde01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexAtDepth0 (cyclomatic 19, cognitive 24): indexAtDepth0 has cyclomatic complexity 19 and cognitive complexity 24; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e1c2e28661144e2f99d99b78a952242fe79cbe0a8377d4eade4e573107da5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevelObjects (cyclomatic 19, cognitive 24): splitTopLevelObjects has cyclomatic complexity 19 and cognitive complexity 24; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f2c5c6af5e9eee61c5056bacc590e0952f88cbd0ff2435caadd616988288e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function luaLocalDecl (cyclomatic 19, cognitive 24): luaLocalDecl has cyclomatic complexity 19 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d008d2901cfb9595897fc41960cd5fcb56c478e5387fd3908215dddd1f4a67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppOverloadFit (cyclomatic 19, cognitive 24): cppOverloadFit has cyclomatic complexity 19 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":33048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3421cf12f609e71b79081892662879398ac62a432978cbe58839f324b256ed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractInstantiation (cyclomatic 19, cognitive 23): extractInstantiation has cyclomatic complexity 19 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2ab09b547d5d3436334a2122cf2aff9351069f3c4e1ef8a861bc3c7a5c4f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function screensInBody (cyclomatic 19, cognitive 23): screensInBody has cyclomatic complexity 19 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":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d119e58a5a9c6d1fb16aa85ec40d812603e03e44884dfa5ec8d472c9a8f309a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFunDecl (cyclomatic 19, cognitive 22): handleFunDecl has cyclomatic complexity 19 and cognitive complexity 22; 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":"src/extraction/languages/erlang.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71fcb6d4985c953bed3b5f89f33641884e75a9d58aa2b5de8f18844749cdc29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drain (cyclomatic 19, cognitive 22): drain has cyclomatic complexity 19 and cognitive complexity 22; 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":"src/extraction/parse-pool.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb55b38052604f451c5d018ed005c30a77567104e410932fb1315288ad6bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBridgeEvidence (cyclomatic 19, cognitive 22): hasBridgeEvidence has cyclomatic complexity 19 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b396ef81a5bbed6147412254239f6fc143701c6baae88dbc8e79fd9ba0828302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 19, cognitive 21): enclosing has cyclomatic complexity 19 and cognitive complexity 21; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff03641bcdc67b89f39268b9429d951e094c186a3dad93058f1617ae716a3a67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typesNamedAt (cyclomatic 19, cognitive 21): typesNamedAt has cyclomatic complexity 19 and cognitive complexity 21; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f12e1be350648750a11f0e3fcf818a936d5260f5910b75d09e8f2b93d2a1a76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goRefQualification (cyclomatic 19, cognitive 20): goRefQualification has cyclomatic complexity 19 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa87d6df0b9ac7cc07cc3a8d11702914142130b9975dc5c66405881187d3ad89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchDartChainLink (cyclomatic 19, cognitive 19): matchDartChainLink has cyclomatic complexity 19 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5381}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f0ec2d43d1a5e0455a5475b4b9d374e3dd6bf4c21d8374cca465a8d5f3ba38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reactHookBoundName (cyclomatic 19, cognitive 17): reactHookBoundName has cyclomatic complexity 19 and cognitive complexity 17; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8706372a2678a979e761c3a48cddf5ad0cf7f507c2df0e5a0b4e2224b5494b1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonCaseCaptures (cyclomatic 19, cognitive 17): pythonCaseCaptures has cyclomatic complexity 19 and cognitive complexity 17; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"38879b8d789cea037a27860e5752859a8067523ad2f4a13394239b39219c9516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchGoChainedCall (cyclomatic 19, cognitive 17): matchGoChainedCall has cyclomatic complexity 19 and cognitive complexity 17; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26773}}}],"partialFingerprints":{"codehealthFindingId/v1":"694f4d794488a145cca41ce5d26990f64c937ee024b349159175fdd0cb1c44dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustNameRead (cyclomatic 19, cognitive 16): rustNameRead has cyclomatic complexity 19 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10935}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa152d60a88401a7a1625ff0432a2281ef96f79e1121d860dea0ab2d321e706"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isImportShadowedByJsBinding (cyclomatic 19, cognitive 13): isImportShadowedByJsBinding has cyclomatic complexity 19 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ce6289cb58679fa578b64275a16fe268d66dc7ef973dfe160a9921277f2235"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureValueRefScope (cyclomatic 19, cognitive 11): captureValueRefScope has cyclomatic complexity 19 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff133650a39477b5c605ca634c79284c921f2fa0e6a5102e72116f4ec7ebb725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onkeydown (cyclomatic 19, cognitive 10): onkeydown has cyclomatic complexity 19 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/views/FileView.svelte"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb8e08ea91c11d041619427790600a468c4b8aa6eb64c23c85f1ae20c1268c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMethodMatches (cyclomatic 18, cognitive 44): getMethodMatches has cyclomatic complexity 18 and cognitive complexity 44; 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":"src/resolution/index.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8803f561699f9ed98ce0365dc1012e7cb530e0d456e8b24c0ac2df9b70c56ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 41): (anonymous) has cyclomatic complexity 18 and cognitive complexity 41; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1ec936fdfba31da07e777782dde1c82a1a07bb3e4da50033022cba3865f6b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeFilesLoadedBy (cyclomatic 18, cognitive 38): routeFilesLoadedBy has cyclomatic complexity 18 and cognitive complexity 38; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b2fb33b8fca797ca2bca2679013952a56922064407bec9aebf84d99b37bd9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goFieldTypeOf (cyclomatic 18, cognitive 36): goFieldTypeOf has cyclomatic complexity 18 and cognitive complexity 36; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28da9ea5103eaf277c67eacff2833e4e4e2d4eb561cf07817328f2684c617c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPascalTextRoutines (cyclomatic 18, cognitive 35): readPascalTextRoutines has cyclomatic complexity 18 and cognitive complexity 35; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9779}}}],"partialFingerprints":{"codehealthFindingId/v1":"150b861e1e63a5e3fcc8cd519ef58c15d685be4178674a58d475e18bb1e3303a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elementTags (cyclomatic 18, cognitive 35): elementTags has cyclomatic complexity 18 and cognitive complexity 35; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a046a8dfb2f4de1a1e9363bacdc3e49b0ac5a139f0202be6504a55c85b2c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsFieldDeclaration (cyclomatic 18, cognitive 35): tsFieldDeclaration has cyclomatic complexity 18 and cognitive complexity 35; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3682e283b75f22fed7832a43d34ae569e216f624f4c92368e7ea1b09351d9d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectGitFiles (cyclomatic 18, cognitive 32): collectGitFiles has cyclomatic complexity 18 and cognitive complexity 32; 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":"src/extraction/index.ts"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a1bf20b24ccd7adba4f7b547638ad937a01614ac8203fd117512f709e70c0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlPathDependencies (cyclomatic 18, cognitive 32): yamlPathDependencies has cyclomatic complexity 18 and cognitive complexity 32; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"df04e02c82d4382eac4ada9ea68e55ec19eff3efb46947e1b5e239880c4ced88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qualifiedCallableAt (cyclomatic 18, cognitive 31): qualifiedCallableAt has cyclomatic complexity 18 and cognitive complexity 31; 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2322f9fa3419f0654b7076b5f43b01cd374e0a4e6d384e58a68ee0e2d0ef218f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBlastRadiusSection (cyclomatic 18, cognitive 31): buildBlastRadiusSection has cyclomatic complexity 18 and cognitive complexity 31; 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":"src/mcp/tools.ts"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"64da9a864cba9381d7f50c337e341c199e3f7e1d5f16af9b5d2ec01b18fab285"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pkg (cyclomatic 18, cognitive 30): pkg has cyclomatic complexity 18 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":"scripts/gen-go-stdlib-methods.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ec7b39d78ff85402828b1fd9cb6637d5a9d753d5f62ecde5324dc8db7611c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankRazor (cyclomatic 18, cognitive 30): blankRazor has cyclomatic complexity 18 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":"src/extraction/razor-script.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd928335c5bd0ed34a8e8eb01916c6e296c6e516550727972a2c1e9fd2f22e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evalConditionals (cyclomatic 18, cognitive 30): evalConditionals has cyclomatic complexity 18 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"962416c2249334cb0ae564311ef745c7ee8507c0b0b31d6b5623a0da9c9c7478"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNodesByExactName (cyclomatic 18, cognitive 29): findNodesByExactName has cyclomatic complexity 18 and cognitive complexity 29; 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":"src/db/queries.ts"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f601ed06d3d736ce89988bb927b0d0f021dac06e04cd1503cfc9e244a3994b1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppMacroInvocations (cyclomatic 18, cognitive 28): cppMacroInvocations has cyclomatic complexity 18 and cognitive complexity 28; 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1526781dc40760f7a37cf9ef266b26a710ef11c98e620c9e5fa70131fdcffbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCompileDbIncludeDirs (cyclomatic 18, cognitive 28): readCompileDbIncludeDirs has cyclomatic complexity 18 and cognitive complexity 28; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9158ee6cad9f32995ba769ce75a8115a1b8896e0fa21c183ab5973955959e26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinQualifiedCallResultType (cyclomatic 18, cognitive 28): kotlinQualifiedCallResultType has cyclomatic complexity 18 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21949}}}],"partialFingerprints":{"codehealthFindingId/v1":"01263403c886c548061614a4bf8512b7d2d9aa068a15603f0c40d98f98ffaca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJsComments (cyclomatic 18, cognitive 27): stripJsComments has cyclomatic complexity 18 and cognitive complexity 27; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ee8efe00c7bd29ec050bffce8f280ce1597b6305e77d06e3ebdd4702b458ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduxThunkEdges (cyclomatic 18, cognitive 26): reduxThunkEdges has cyclomatic complexity 18 and cognitive complexity 26; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"2747537afbdfefd61f83eb792771259bc9237890168c032599f8b7d8e5317b69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flow (cyclomatic 18, cognitive 26): flow has cyclomatic complexity 18 and cognitive complexity 26; 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"14477dd6c316ce20aba47382ea740e33ac7b11938b54c611a029c8bbccefa636"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loopsInTree (cyclomatic 18, cognitive 25): loopsInTree has cyclomatic complexity 18 and cognitive complexity 25; 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":"src/graph/branch-guards.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5860bdc64b9696003ac16a939a601a569faa7dfa9f08aac35f4a85f65202980d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitParameters (cyclomatic 18, cognitive 25): splitParameters has cyclomatic complexity 18 and cognitive complexity 25; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df2508431b1ab8266a31a129d4341fb6319416ecb4b099a081bcbd051053565"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 24): (anonymous) has cyclomatic complexity 18 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25084}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9545efd38addeea4adaa6468a9995f653ce770f3545942b030cb8e15030240"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonAssignTargets (cyclomatic 18, cognitive 24): pythonAssignTargets has cyclomatic complexity 18 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27930}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5edc3a8fdc3bc02cb21a004608b9812a68d80e17cee8bf5d315f7842b38701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindingOn (cyclomatic 18, cognitive 24): bindingOn has cyclomatic complexity 18 and cognitive complexity 24; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc89f4c0552bc5f9a19c1b7113d7724c037bd7f0559b2b8adc18a4f13f987407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRustSelfCall (cyclomatic 18, cognitive 23): matchRustSelfCall has cyclomatic complexity 18 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29182}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c9c39a24fd6b1c080c79fd77beda17f75bab4be6bd22ab862780ed884b9cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 18, cognitive 22): enclosing has cyclomatic complexity 18 and cognitive complexity 22; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f22a251870238638d25f264fb5710ae838b8813d77a1cdd699f35c6bad98ef6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandsHref (cyclomatic 18, cognitive 22): commandsHref has cyclomatic complexity 18 and cognitive complexity 22; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e539af89aee8900fea27964a80c686bb36ba8128bcd68041af64e640822c67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchingClose (cyclomatic 18, cognitive 22): matchingClose has cyclomatic complexity 18 and cognitive complexity 22; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbb35bf40b29b08421ef8edd48f6b4dfce9e6bfe6eb352bf2bbf97925f4148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaBlockOf (cyclomatic 18, cognitive 22): scalaBlockOf has cyclomatic complexity 18 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3cd8eee749d8cbb013d9ffec4fe62eca31d15a32fd1891e6041735cc05f3aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNode (cyclomatic 18, cognitive 22): buildNode has cyclomatic complexity 18 and cognitive complexity 22; 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":"src/ui-server/api/node.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cfcef9bba4528c3f8f6721e63aa82dbad79abd72ac1da80597afb82282b734"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeToD1 (cyclomatic 18, cognitive 22): writeToD1 has cyclomatic complexity 18 and cognitive complexity 22; 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":"telemetry-worker/src/index.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9fede0f5e841123d733c8c9dc10121f5e91bb33986393a5e76c3af5b4aebaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitTag (cyclomatic 18, cognitive 21): visitTag has cyclomatic complexity 18 and cognitive complexity 21; 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db000fd6973ab3277fecc41e141e9cb66d84e44f0405fa9a7e16a0191ae60b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectRefs (cyclomatic 18, cognitive 21): collectRefs has cyclomatic complexity 18 and cognitive complexity 21; 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c4293815b3afe2dd41ef8eb55b16fdfda929644664fdfb424b83c7f520c5ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBodyDocstring (cyclomatic 18, cognitive 21): getBodyDocstring has cyclomatic complexity 18 and cognitive complexity 21; 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":"src/extraction/languages/python.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"64da1b9b270560b44c3fdf4eec6fe604327e76849abd7c6dbda11d975840ef4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importedTypeMember (cyclomatic 18, cognitive 21): importedTypeMember has cyclomatic complexity 18 and cognitive complexity 21; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb06f2da3c8e6dcf9dedd23f60258c950993571fd3fe8d0221c5705bfe27b665"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandRustUse (cyclomatic 18, cognitive 21): expandRustUse has cyclomatic complexity 18 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12088}}}],"partialFingerprints":{"codehealthFindingId/v1":"57189b72ac1e250f6322e353875d1ce315f756c1cf3b2034de9c7bb93b033c3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRustAsMutChainCall (cyclomatic 18, cognitive 21): matchRustAsMutChainCall has cyclomatic complexity 18 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7fc84b9bcfff6ec73bbb341e1056fd76b3517d91d7512a34019b549b5efeaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFrontload (cyclomatic 18, cognitive 20): planFrontload has cyclomatic complexity 18 and cognitive complexity 20; 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":"src/directory.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"2376c1206a6450ff42a3287979334b8e175d431d0479d22f31629248b1269bee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 18, cognitive 20): extract has cyclomatic complexity 18 and cognitive complexity 20; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e083eccb29e036f25cefe3dfe0add0449e82dc00519b8a5f8ad7e777e05bbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configHrefExpression (cyclomatic 18, cognitive 20): configHrefExpression has cyclomatic complexity 18 and cognitive complexity 20; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d999333a2ea71e106e7badba1413953d75ace32afdc1694c8d9f514220d1f271"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swiftOverloadForClosure (cyclomatic 18, cognitive 20): swiftOverloadForClosure has cyclomatic complexity 18 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32310}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc070a86452a7092d76f0c7def14087396f10d12e1fb260c90c10b4f46c5a58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 20): (anonymous) has cyclomatic complexity 18 and cognitive complexity 20; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c779958ce3177e50157b8cfb2136a08b30615b64e11a6297abfa3a5df659104a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSaveRequest (cyclomatic 18, cognitive 20): parseSaveRequest has cyclomatic complexity 18 and cognitive complexity 20; 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":"src/ui-server/api/trails.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab367fa392cd377a0a5168ed10be3f199040b921d227eba74cf79e9d1afe699e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 18, cognitive 19): resolve has cyclomatic complexity 18 and cognitive complexity 19; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"1542fc8ca44d41f654718f06c2604d0d3a942e8af8bb79b2c82533411045432d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usesNameOnlyAsReceiver (cyclomatic 18, cognitive 19): usesNameOnlyAsReceiver has cyclomatic complexity 18 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4386}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ed375b883ddb252d2537ee737835318f239a19494118cf6bd288588e910146"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaTypeRef (cyclomatic 18, cognitive 19): javaTypeRef has cyclomatic complexity 18 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0a01f93897e59203c14b9f4714b005c47e05dba03616c6bac17e1e1006ccfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFlows (cyclomatic 18, cognitive 19): planFlows has cyclomatic complexity 18 and cognitive complexity 19; 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e95f4b088ed194a3f03e8fb67888cbc90889af073e1043058c8e1c1246e376"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitPatternDefaults (cyclomatic 18, cognitive 18): visitPatternDefaults has cyclomatic complexity 18 and cognitive complexity 18; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd62618e71b70b8fb01f2638d7605fc16252b33a2edb408c7646209c661fcce3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 18, cognitive 18): resolve has cyclomatic complexity 18 and cognitive complexity 18; 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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19b0c893c9a1f4a5747aa07cefad6f5a2c9ca1baa46b92fee0bab8f41c13144"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRustWrittenReceiverCall (cyclomatic 18, cognitive 18): matchRustWrittenReceiverCall has cyclomatic complexity 18 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29444}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf28e1f8250e186a293bbdf2193f8b4048b2a704a313a78af2f156c58c9a617"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsClassTypeParameter (cyclomatic 18, cognitive 18): tsClassTypeParameter has cyclomatic complexity 18 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0485ed8aae98a1db337849420ff43dc18678b16d25bd2054cbc2197014b02fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expressionEnd (cyclomatic 18, cognitive 17): expressionEnd has cyclomatic complexity 18 and cognitive complexity 17; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"631ae3793bcf43755a1ca043e6eff35ce56b079a70341b7b8f736cc93c077f1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 18, cognitive 17): resolve has cyclomatic complexity 18 and cognitive complexity 17; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbd8b8e68a8bfd491613ef46dea5addac9f7ed67c56c413ecc51469fe961fc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinPropertyKind (cyclomatic 18, cognitive 15): kotlinPropertyKind has cyclomatic complexity 18 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbbf1a2052220739ac990335955b3536e10981261f062e7d2feb28b83cf2c27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchGoIndexedCall (cyclomatic 18, cognitive 14): matchGoIndexedCall has cyclomatic complexity 18 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4710b9bec487ce28d6f26ff8aaf248b343e8f56db41d5adff5404b73f7a75a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tarjan (cyclomatic 17, cognitive 40): tarjan has cyclomatic complexity 17 and cognitive complexity 40; 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":"src/graph/file-cycles.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfeb8f1e13e796fbde38e2cb59afd87b1b90548536114c74303c24c959df886"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStringAt (cyclomatic 17, cognitive 38): readStringAt has cyclomatic complexity 17 and cognitive complexity 38; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6524d93e81eb18b45073b4be4c26d56cd1f144b340ea65c5a5ab2f9c04d569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairEvents (cyclomatic 17, cognitive 38): pairEvents has cyclomatic complexity 17 and cognitive complexity 38; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c1805a6e2c0168f36b83427a5b8a542f980f85a2231726f62b7f16a2819f62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trackedCurves (cyclomatic 17, cognitive 38): trackedCurves has cyclomatic complexity 17 and cognitive complexity 38; 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b912eb52b5d53c87b7d16b64ff6cb938d99a875e79946d924d2a1ffcba498a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanParameterList (cyclomatic 17, cognitive 37): scanParameterList has cyclomatic complexity 17 and cognitive complexity 37; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f68cdf68a4073a241b1dfd32adbed5a37a13acdedc1679192ebf89485e91289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supertypesOf (cyclomatic 17, cognitive 36): supertypesOf has cyclomatic complexity 17 and cognitive complexity 36; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"77326ff595e5f25a9d69a3f06b089e35cc807f703ea9b8068c4f5a8398927862"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCppInlineAnnotationMacros (cyclomatic 17, cognitive 35): blankCppInlineAnnotationMacros has cyclomatic complexity 17 and cognitive complexity 35; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d872d5f904cbb4bd3c071fb826b51468a9a58e5c9367d7eacdb3d3e965ba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function componentsIn (cyclomatic 17, cognitive 35): componentsIn has cyclomatic complexity 17 and cognitive complexity 35; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d1947d746f1d2c61b8a1f9e1ef8c5180e5a512271cc392c5f5f52bf3ebf00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function directiveLines (cyclomatic 17, cognitive 35): directiveLines has cyclomatic complexity 17 and cognitive complexity 35; 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d11f662e585a17aa99f25e038954547e8d0ef66c6cfd62f081ce0cbd60de372"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustGoReceiverName (cyclomatic 17, cognitive 35): rustGoReceiverName has cyclomatic complexity 17 and cognitive complexity 35; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"99565c1cf67739151dc92a5d562be69b6f386897bc99aa3e82c45e700d67a295"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importedFilters (cyclomatic 17, cognitive 33): importedFilters has cyclomatic complexity 17 and cognitive complexity 33; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a03d5bdf2a638601007080473a22c001ed295cc61f63e2b2c1c04c96df5e94a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractClassMembers (cyclomatic 17, cognitive 32): extractClassMembers has cyclomatic complexity 17 and cognitive complexity 32; 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":"src/extraction/languages/r.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabf21b60d1fa2d2449b3d7af638f47e28a49efb5a7735bfcaf78410f821549a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitPascalBlock (cyclomatic 17, cognitive 32): visitPascalBlock has cyclomatic complexity 17 and cognitive complexity 32; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9529}}}],"partialFingerprints":{"codehealthFindingId/v1":"953c464fdf7bb52b9ec3937fc6d13cdd7e390feba982531ffe54dc2558ae48a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractDrupalServices (cyclomatic 17, cognitive 31): extractDrupalServices has cyclomatic complexity 17 and cognitive complexity 31; 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd9491eaee698c432446679004e41afc61e2858cc80149e025590160f59f218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownReturns (cyclomatic 17, cognitive 31): ownReturns has cyclomatic complexity 17 and cognitive complexity 31; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e2d462dd0ec2515d9a903704e0755cf315dfae6880f59419249d79c8415e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateWhen (cyclomatic 17, cognitive 31): annotateWhen has cyclomatic complexity 17 and cognitive complexity 31; 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":"src/ui-server/api/when.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7b7526ad1f4c62df27a8e0ca1c6129a83b2d232586a02cd50330172afc1b28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSegmentMatches (cyclomatic 17, cognitive 30): getSegmentMatches has cyclomatic complexity 17 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":"src/index.ts"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c0a7a6416dcf9c4914a5959c565a15da86cd986c96c20d94d93640162a8aba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function staticString (cyclomatic 17, cognitive 30): staticString has cyclomatic complexity 17 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ef651002ddc1dbdef51f913316c5ee2655807e495a6372c828d5d02999ef9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinReceiverTypes (cyclomatic 17, cognitive 30): kotlinReceiverTypes has cyclomatic complexity 17 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7032}}}],"partialFingerprints":{"codehealthFindingId/v1":"af32bf2f1c54afb86ab966693afd19d4e10c722809b2bc259d265162594ded7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 30): (anonymous) has cyclomatic complexity 17 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5374b1a3f65dd392adf8b5c807597675c5cb132a0e818ecbdf0d2e84954461b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extensionFor (cyclomatic 17, cognitive 30): extensionFor has cyclomatic complexity 17 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"40badc515adf8dc36bb5d63f7a39df0e032b0dbd824a1b54c4d2c13c480f0a59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonStarExports (cyclomatic 17, cognitive 29): pythonStarExports has cyclomatic complexity 17 and cognitive complexity 29; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb01ff694f4e57b1ed19ba4f6af46db44cc466b08243612b17c74d61531e751"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextProxyEdges (cyclomatic 17, cognitive 29): nextProxyEdges has cyclomatic complexity 17 and cognitive complexity 29; 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"437bd6a036f699a62d7371abbb78048d71171d8eb07bb98da3de7fa4deb3a87f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dynamicImportScan (cyclomatic 17, cognitive 28): dynamicImportScan has cyclomatic complexity 17 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25526}}}],"partialFingerprints":{"codehealthFindingId/v1":"28077a25f2e9dd13140ea4ed78ff7d92a08ce89d7b5446b392f3a3ce825da714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oldExtractSymbolsFromQuery (cyclomatic 17, cognitive 27): oldExtractSymbolsFromQuery has cyclomatic complexity 17 and cognitive complexity 27; 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":"__tests__/cjk-query-tokens.test.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0600a7f2b9871edba3792fe4ef1a5fb8e378252cfad217d18f6508470fbc4951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpProjectStaticUsings (cyclomatic 17, cognitive 27): csharpProjectStaticUsings has cyclomatic complexity 17 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7992}}}],"partialFingerprints":{"codehealthFindingId/v1":"383bee0a90c58a6b7869e7986b048a2d7423924a350953d18e98cc4533a1ebcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 17, cognitive 27): run has cyclomatic complexity 17 and cognitive complexity 27; 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f73983de996c2f963146e68d5bde6b5b35b547d19a5d75b190f2af15a39b4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memberAtPath (cyclomatic 17, cognitive 27): memberAtPath has cyclomatic complexity 17 and cognitive complexity 27; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e084461efa646e0a1d9eb61d4276b617d56084119aced36b1612018ddc62d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clientPath (cyclomatic 17, cognitive 27): clientPath has cyclomatic complexity 17 and cognitive complexity 27; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c226f83b77db000a770f7609eb60de1c2c96d482acb2b6d20087f049fe23aa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipTrivia (cyclomatic 17, cognitive 26): skipTrivia has cyclomatic complexity 17 and cognitive complexity 26; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de2714afee646452f8386f2a78d6a87d2609f86448a3f199a59b59eb5c19e67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonConditionalArms (cyclomatic 17, cognitive 26): pythonConditionalArms has cyclomatic complexity 17 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27808}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7f3ab4e861916cad7da07f918f58400aa17c1c3a3de3f34c18b2ba28484e83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleAppResourceTuple (cyclomatic 17, cognitive 25): handleAppResourceTuple has cyclomatic complexity 17 and cognitive complexity 25; 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":"src/extraction/languages/erlang.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"165e581faf744f37f1bd9382702f814c31100fe3d1989311d8dda02ede05fbf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 25): (anonymous) has cyclomatic complexity 17 and cognitive complexity 25; 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":"src/extraction/parse-worker.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fc857df200b12ce5bb108886939492df95c457c9ff5eafbd46e8eda0305cb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 17, cognitive 25): extract has cyclomatic complexity 17 and cognitive complexity 25; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a287bfcf59c93084071ab50ae1710451fb0a4fc6ecc848778a2beaa60d392eab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goPackageValueType (cyclomatic 17, cognitive 24): goPackageValueType has cyclomatic complexity 17 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15bfcef130fccf38e4e197c2aeba26bc1e1686cd2b3238ca10aaf88adc93158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonValueEvidence (cyclomatic 17, cognitive 24): pythonValueEvidence has cyclomatic complexity 17 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27839}}}],"partialFingerprints":{"codehealthFindingId/v1":"538b1af1f67d1b03b5a5c29b55854c65ba8a1f10098e2c95ad825854e48e50b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadProjectAliases (cyclomatic 17, cognitive 24): loadProjectAliases has cyclomatic complexity 17 and cognitive complexity 24; 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":"src/resolution/path-aliases.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b628a1f7d3c19b9aefed3e3d6e2ed6e203067bd1a2df745300a0aa6ea6d703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectEvents (cyclomatic 17, cognitive 24): collectEvents has cyclomatic complexity 17 and cognitive complexity 24; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"189683444b211bc21e6b63af1fa9fd0d322dce6739635a80ba9e55d4c1ff6410"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRequestHelper (cyclomatic 17, cognitive 24): isRequestHelper has cyclomatic complexity 17 and cognitive complexity 24; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e6031c6b4546d84df974562d9bcb98d9abc7973bc9207f6a8e767dbee32b42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function delegateScriptTag (cyclomatic 17, cognitive 23): delegateScriptTag 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5021cda91bf3bd62bdb7af22af3a1c98a8731606b4ba72bf6c15a67ef17870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pastExpression (cyclomatic 17, cognitive 23): pastExpression 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":"src/extraction/razor-script.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfbfedc31964252b6ea1a8284db3fd01cd2181d0ccea1d52ff65bcc6c310c7f"}},{"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":"src/installer/targets/toml.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"806e2837a96b4650f9a1191094a664636503623bd3d79e278a5f748cb51467db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsxChild (cyclomatic 17, cognitive 23): jsxChild 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"983ec684be512bf65eed8780a2bdab2a00da81a70d9fca8dddf82158349dc8bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endpointGroupRoutes (cyclomatic 17, cognitive 23): endpointGroupRoutes 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9e3199cdca3985c9d649e97c722a110f6c496f5b3624e0376e0b13b6b03b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jvmImportedMember (cyclomatic 17, cognitive 23): jvmImportedMember 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4640b9ba587734a0e55bf0dec3d7ca1b1f3cd53df6a22499773fdafcb61a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonBoundBelow (cyclomatic 17, cognitive 23): pythonBoundBelow 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfdebb22ffda348655902949f18c29c28fe2abb0c1dac9704b282c75794a11a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchPythonAttrCall (cyclomatic 17, cognitive 23): matchPythonAttrCall 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28615}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2d71758cffb51a9b87d16361e9bf6682ded428fd4d2d12ba0b9363b28ccf86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 22): (anonymous) has cyclomatic complexity 17 and cognitive complexity 22; 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":"__tests__/daemon-silent-holder.test.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ce32bff9d5ee8addaa8e082f6253d6a6741ed7206bb06ff848cfbfab9a990d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 17, cognitive 22): resolve has cyclomatic complexity 17 and cognitive complexity 22; 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":"src/resolution/frameworks/play.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57f375ea3919beb00384440c820695011d24f242e6afe95eca61eb69e6e7609"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeRender (cyclomatic 17, cognitive 22): routeRender has cyclomatic complexity 17 and cognitive complexity 22; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d72c65dc202e5ecb43785ce71741c8ae662ab02234773b42e6bee883b27110"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonStatementStarts (cyclomatic 17, cognitive 22): pythonStatementStarts has cyclomatic complexity 17 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa7494f1c01ba89f4a1cff0b5c232fd5f3909285655c9ab7b567dd067f06e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function luaMemberIn (cyclomatic 17, cognitive 22): luaMemberIn has cyclomatic complexity 17 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9fe30666187ad932528d69f2314cc71a587de3b2a9b8050a3246ba841de59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function argumentsAt (cyclomatic 17, cognitive 22): argumentsAt has cyclomatic complexity 17 and cognitive complexity 22; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8b7ae04fbaa0771e16aedb5aecee0b5082aa7eb84956b035dc5f21dd266ed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 22): fetch has cyclomatic complexity 17 and cognitive complexity 22; 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":"telemetry-dashboard/src/index.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fea74dc9b7a36ea76b3159d88f67213a9cd999f822da39f23af7a259dea3ddf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitArgs (cyclomatic 17, cognitive 21): splitArgs has cyclomatic complexity 17 and cognitive complexity 21; 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97a4dba3cecc6defcad70067711228aada2c91712925db3da29f681e8245ffc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeDartHead (cyclomatic 17, cognitive 21): typeDartHead has cyclomatic complexity 17 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dce8b9792a0db56b73ab8902564c524f5adebb9b162e60858c09af347288a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsNamedType (cyclomatic 17, cognitive 21): tsNamedType has cyclomatic complexity 17 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61d16569b9da15ef8a971ee375e768c2b5cbd557914d0c1a426157d3634bc9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runNightly (cyclomatic 17, cognitive 21): runNightly has cyclomatic complexity 17 and cognitive complexity 21; 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":"telemetry-worker/src/rollup.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"53062c46799131aaf720578c5196a944fa6b14b752135aa7f4e66dc7df0cfb40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializerAt (cyclomatic 17, cognitive 20): initializerAt has cyclomatic complexity 17 and cognitive complexity 20; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd275fe751ab8a297b710e1e2f8d63254461e7a779f07d3f6025628bb083b694"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpSupertypesOf (cyclomatic 17, cognitive 20): csharpSupertypesOf has cyclomatic complexity 17 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b19e13e6e1d820b83413676b6a2ec8004f0dec7280e47a1715d23ef3843bcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevel (cyclomatic 17, cognitive 20): splitTopLevel has cyclomatic complexity 17 and cognitive complexity 20; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"85667e3827d921911c5b7ab7cefc89fd35543391a66bc719f87312fce6f8181d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 20): (anonymous) has cyclomatic complexity 17 and cognitive complexity 20; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07a547739b10938ef9aee2ac8b2243e5b438ce27e15967e8201e499a4c739e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hopLabel (cyclomatic 17, cognitive 20): hopLabel has cyclomatic complexity 17 and cognitive complexity 20; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"008dedd801ef2894c93ceb4bf383fc5fd959e37e47835e1378f4002a74f5aa24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cfmlCreatedComponent (cyclomatic 17, cognitive 19): cfmlCreatedComponent has cyclomatic complexity 17 and cognitive complexity 19; 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":"src/extraction/languages/cfscript.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"638c600653d560c4551d02289692017317ff64d4c09cb55a5cb015663e79a938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertCodeGraphServer (cyclomatic 17, cognitive 19): upsertCodeGraphServer has cyclomatic complexity 17 and cognitive complexity 19; 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":"src/installer/targets/hermes.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ec6f63dea0fee363d1396546eb455528ca15304964a38b37a035dbf698bafb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRustImplHeader (cyclomatic 17, cognitive 19): parseRustImplHeader has cyclomatic complexity 17 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02a415865a31a2aaec8e077ba5c5dc2b59e2ce1794f99e45ffb0a5ac82d5c23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustAssociatedReturn (cyclomatic 17, cognitive 19): rustAssociatedReturn has cyclomatic complexity 17 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab57cae71c3d39d192d25c2c4adfdcf920b1e83ded966fac99244c78aa08c66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppReturnTypeWritten (cyclomatic 17, cognitive 19): cppReturnTypeWritten has cyclomatic complexity 17 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17069}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd37abbfe0d6fedf4be103b660875680867d548c46eed0c44837e9a9ea964e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 17, cognitive 18): resolve has cyclomatic complexity 17 and cognitive complexity 18; 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":"src/resolution/frameworks/go.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76970cebadc9e23f8a20ef8b1b109119f896f1b0ff406c845821c008813292c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosing (cyclomatic 17, cognitive 17): enclosing has cyclomatic complexity 17 and cognitive complexity 17; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c818cab7ac915821bd7b76d3f0d35e4f0658999bdc4b35c444937b9c138dd95c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 17, cognitive 17): handleMessage has cyclomatic complexity 17 and cognitive complexity 17; 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":"src/mcp/session.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"921affa4757fa853a84d609d97d62b55e1a2843441f655983d692e8bab4e949d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 17, cognitive 17): detect has cyclomatic complexity 17 and cognitive complexity 17; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af98c46c8d85235ab67b23fb99731129040780aa601fc7089b6d302bbf6db29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRustMethodReturn (cyclomatic 17, cognitive 17): readRustMethodReturn has cyclomatic complexity 17 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12574}}}],"partialFingerprints":{"codehealthFindingId/v1":"d417aa7d3f5294002d13cc6ba92f31061660e2d0150cf32104f6e28b68e935f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleAdminRollup (cyclomatic 17, cognitive 17): handleAdminRollup has cyclomatic complexity 17 and cognitive complexity 17; 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":"telemetry-worker/src/rollup.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"703fe56cda329c137e3a97c7149da56bd44b76965b7756e67a32988493e4813d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasTopLevelOr (cyclomatic 17, cognitive 16): hasTopLevelOr has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/graph/branch-guards.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f088dd10fbc4fb89f92f43598309f6e8c1c64fc429c4bbe7d2605f544a466c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 17, cognitive 16): resolve has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/sveltekit-router.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"92775b995cf4f9482e916ac569ee17b9db9db9a22c16f894edddbe24d80a4e0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchPythonFactoryChain (cyclomatic 17, cognitive 16): matchPythonFactoryChain has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28969}}}],"partialFingerprints":{"codehealthFindingId/v1":"6674938a214e62f4341b7f41c87b03276d7e5d07cefd3f9ee832edd86ac41f26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commonJsExportName (cyclomatic 17, cognitive 15): commonJsExportName has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34b74134ab6ee436fd58e0dbcce7b70bf1d5c9b9d8f75b1c675db67df41ff55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isReceiverLessCall (cyclomatic 17, cognitive 15): isReceiverLessCall has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f52a2e4ed85281e612e32013cf2bd4470b5ef804aad1ccf21a563c2ef9d17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartPrefixedCallSite (cyclomatic 17, cognitive 15): dartPrefixedCallSite has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2026d089049eae7344473ed39b319b2c7ae96950bf998702007cdb772d1349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpWrittenArity (cyclomatic 17, cognitive 15): csharpWrittenArity has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8208}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e3726809cf2dc222256c11a721f090274a96e2cc6ea5912e0eec3fdfe06750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppUnqualifiedTypeFit (cyclomatic 17, cognitive 15): cppUnqualifiedTypeFit has cyclomatic complexity 17 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b36a21cc8ad679cabff938b5eaca22fe53214deaf8c4a8536559c05b0277e5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDotNetTypeRef (cyclomatic 17, cognitive 14): isDotNetTypeRef has cyclomatic complexity 17 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4593}}}],"partialFingerprints":{"codehealthFindingId/v1":"3859b8fb62d83cac96b9e3882d1c537b5101c95764dc6b62631d51eeb0f66428"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopeStartLine (cyclomatic 17, cognitive 11): scopeStartLine has cyclomatic complexity 17 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cce53d38a0fd267ee200d6c731f66e6aa55478a42f5584ae09ba4ce291627a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPascalDeclType (cyclomatic 16, cognitive 44): extractPascalDeclType has cyclomatic complexity 16 and cognitive complexity 44; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8902}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfefd8b8ee06a84c8a572703444530e80a19708a4759397b1317a7dac291c3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCFileScopePrefixedDeclMacros (cyclomatic 16, cognitive 33): blankCFileScopePrefixedDeclMacros has cyclomatic complexity 16 and cognitive complexity 33; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abb5a26429d8a7aae6ebd7e7d937335da56e081bc0b7a0add25d730c045247e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nixLeadingPlainSegments (cyclomatic 16, cognitive 33): nixLeadingPlainSegments has cyclomatic complexity 16 and cognitive complexity 33; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4837}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea61d65553e531180c54ad0e95ac9775263e09409cfe406bf93b2a056680684"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJSImports (cyclomatic 16, cognitive 32): extractJSImports has cyclomatic complexity 16 and cognitive complexity 32; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e80da1373e060d6fbcaab54a190d2c16b423ff04a2bc36c2d7e5e79a7ad968"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkCalls (cyclomatic 16, cognitive 31): walkCalls has cyclomatic complexity 16 and cognitive complexity 31; 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a72193c23801d29b2231c74d92aeeb63806a76b6ab17059cf3f8b295808666b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustFieldDeclaration (cyclomatic 16, cognitive 31): rustFieldDeclaration has cyclomatic complexity 16 and cognitive complexity 31; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29787}}}],"partialFingerprints":{"codehealthFindingId/v1":"762cb9979fbf2a7676fae2287b4933dbcf7a433dd63874758910f28efcafb00c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferPhpAssignedPropertyType (cyclomatic 16, cognitive 30): inferPhpAssignedPropertyType 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09bc7c69c84c42371d06f354b0a680c57cceb2410991ac645d8556c71b6570a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsCallEndsStatement (cyclomatic 16, cognitive 30): tsCallEndsStatement 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30254}}}],"partialFingerprints":{"codehealthFindingId/v1":"44df3de0ed0040563a948b47c6ba484bf0c93f9b7f873ba0e2b5a648294df8a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reactRenderEdges (cyclomatic 16, cognitive 29): reactRenderEdges has cyclomatic complexity 16 and cognitive complexity 29; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8587535f2e1530b9957b4fa93eff3f23b6bd73c57390b8c12e483e77149a1ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeAllocation (cyclomatic 16, cognitive 28): computeAllocation has cyclomatic complexity 16 and cognitive complexity 28; 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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa8009357bc6f0af54b58df455dbdf0a381a63d11f114207018791ba3bf7a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartMemberOf (cyclomatic 16, cognitive 28): dartMemberOf has cyclomatic complexity 16 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59869d0b4ab1de5eb9709e8cd9fc7be4fe8d33fe5f30fcf282dbc59e92c4b0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustWalkModules (cyclomatic 16, cognitive 28): rustWalkModules has cyclomatic complexity 16 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01b71721c9d5e145815c4e96043e6a4aeff18e8df66ba7691b7c4325f883474"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMessage (cyclomatic 16, cognitive 27): onMessage has cyclomatic complexity 16 and cognitive complexity 27; 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":"src/extraction/parse-pool.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b5293183ab40f43103c6528eba551d8a387ab9c01c455ff2eacc6b68d9d217"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 27): (anonymous) has cyclomatic complexity 16 and cognitive complexity 27; 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":"src/mcp/proxy.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"770747192df85ecf8185c8a7cc39e3386a72f1e2555c8372fd1aaef3fdc9c696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 16, cognitive 27): resolve has cyclomatic complexity 16 and cognitive complexity 27; 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":"src/resolution/frameworks/svelte.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"150f1bd4e08ad243bf18a67326f40ca94755e81b4baa86b230e9606849e8cf6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateLanguageMatch (cyclomatic 16, cognitive 27): gateLanguageMatch has cyclomatic complexity 16 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c87e4d7505faed60f38f082f234109f2d348182b1d7c4e995d7c2af362894d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oldExtractSearchTerms (cyclomatic 16, cognitive 26): oldExtractSearchTerms has cyclomatic complexity 16 and cognitive complexity 26; 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":"__tests__/cjk-query-tokens.test.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9ec52bca3d0316eb0b50c1e1adf2db4891a5f007cc6564869121054f840abd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addPythonImporters (cyclomatic 16, cognitive 26): addPythonImporters has cyclomatic complexity 16 and cognitive complexity 26; 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":"src/resolution/module-importers.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"02142ded4630cc056b978eeafce7064a00ebb1d35dd8898f61f94676d08f88a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJsonc (cyclomatic 16, cognitive 26): stripJsonc has cyclomatic complexity 16 and cognitive complexity 26; 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":"src/resolution/path-aliases.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9167d7bd31a1ca191d4ef79205840b22396802ef666444748c2270e2ff3d0af3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSearchTerms (cyclomatic 16, cognitive 26): extractSearchTerms has cyclomatic complexity 16 and cognitive complexity 26; 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":"src/search/query-utils.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8d92a2dfa6c552c180b85d5a6785de5a807b25ab55b242141e295604b6502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatNodeTree (cyclomatic 16, cognitive 25): formatNodeTree has cyclomatic complexity 16 and cognitive complexity 25; 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":"src/context/formatter.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f361ec939b2f532cf33a937e43b571eac7e80ddd17dd06c0bdb7dcb0989757f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nestedRoutineInScope (cyclomatic 16, cognitive 25): nestedRoutineInScope has cyclomatic complexity 16 and cognitive complexity 25; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a4cc65af032591e9c901ff981e82ce02fab96d71e0353493dce95916aa45d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capRows (cyclomatic 16, cognitive 25): capRows has cyclomatic complexity 16 and cognitive complexity 25; 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db53499b8eb0311b6f64809dd14b66f225a7d3a06e0605b9b5bcad344cc4f82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanTomlLine (cyclomatic 16, cognitive 24): scanTomlLine has cyclomatic complexity 16 and cognitive complexity 24; 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":"src/installer/targets/toml.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa228dd2ddeaf579095e7c46f9fa6b50469e1dd18972b402838b184cf5b71eb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseClassesOf (cyclomatic 16, cognitive 24): baseClassesOf has cyclomatic complexity 16 and cognitive complexity 24; 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8b5d27c7978d7fe4fa99e6ed3fddd3e83d1272cd236fda571d48f85017390"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 24): (anonymous) has cyclomatic complexity 16 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23455}}}],"partialFingerprints":{"codehealthFindingId/v1":"927c25350911a3f31159989c49b8949092de2c0246c9c0b2b6794392dd949199"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractBareCall (cyclomatic 16, cognitive 23): extractBareCall has cyclomatic complexity 16 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":"src/extraction/languages/dart.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"2137803800ad73fe374bfd656192c538d74a3e55a364c5256a4567cf97810146"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeHookCommandsMatching (cyclomatic 16, cognitive 23): removeHookCommandsMatching has cyclomatic complexity 16 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":"src/installer/targets/claude.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4704d4cf967d9571b0b74dd50f58a6cb70e18336c7cbe0e4f7844c32b6e926f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsFieldCall (cyclomatic 16, cognitive 22): tsFieldCall has cyclomatic complexity 16 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30827}}}],"partialFingerprints":{"codehealthFindingId/v1":"a130ddc656661ee89dce0de1e79f49c86639254b49230703c78ef43a59ae82d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 16, cognitive 21): resolve has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/frameworks/vue.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5458555a1c5f48dc603aebf52acb22f3e67d490fc60a60db2ef8e04c36bf8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustSubmodule (cyclomatic 16, cognitive 21): rustSubmodule has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10375}}}],"partialFingerprints":{"codehealthFindingId/v1":"300e99c0f58c272088b649b32238901109f70a94c262510d32351f4251f19d25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppDeclaratorType (cyclomatic 16, cognitive 21): cppDeclaratorType has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a993001f204d3b217d6ff8d3afda085640c6bc632bda4166e812dd1f18ea5251"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCppLocalName (cyclomatic 16, cognitive 21): isCppLocalName has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5755be90b5b58a5a1fb6c04aaecd02089491f9463dfefa5467e86cfafc4d775"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchKotlinCallResultCall (cyclomatic 16, cognitive 21): matchKotlinCallResultCall has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21056}}}],"partialFingerprints":{"codehealthFindingId/v1":"4185d006519c0507f7f7c5176827e4e5bb7ccb0fc091a2d3a749cfd4d4d68dc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goElementOf (cyclomatic 16, cognitive 21): goElementOf has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f179598de69c5f8d9dacbde0b8553b0ae47b4b936b7ebea25bf8cf118152bcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function soliditySupertypesOf (cyclomatic 16, cognitive 21): soliditySupertypesOf has cyclomatic complexity 16 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32736}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac494686466051866691730d7cf0ff344b1a957358c11f8ea63478ab8943aa01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goDeclaredValueType (cyclomatic 16, cognitive 20): goDeclaredValueType has cyclomatic complexity 16 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deadfbe3d519f4ffb441c995c217008053487dadda81b3dffc5c94eaec3e76a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadEffectiveOptions (cyclomatic 16, cognitive 20): loadEffectiveOptions has cyclomatic complexity 16 and cognitive complexity 20; 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":"src/resolution/path-aliases.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e646fc849daa61a730b13f4bb6778577b0e95f1c6a0a22c0620e02059b39d5bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopDaemonAt (cyclomatic 16, cognitive 19): stopDaemonAt has cyclomatic complexity 16 and cognitive complexity 19; 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66d5574f39efbd5f44dd26c268660da1764aca2aa41455cc6b4f7011e881e8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRuntimeImportArgument (cyclomatic 16, cognitive 19): isRuntimeImportArgument has cyclomatic complexity 16 and cognitive complexity 19; 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f400676a865d93c85dc629311314d3142aaecd74e3b85888436a82b5a38cc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCppTypeName (cyclomatic 16, cognitive 19): readCppTypeName has cyclomatic complexity 16 and cognitive complexity 19; 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3cfdb2e51ecbe98ec6cf19bc5bb1d544134101c51594a631d3d62cbd4609d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevel (cyclomatic 16, cognitive 19): splitTopLevel has cyclomatic complexity 16 and cognitive complexity 19; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"9374e87ee69ace3766f1840249542bcfd929bfecdff7ad8d9a92847b9404bab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustGoCallShape (cyclomatic 16, cognitive 19): rustGoCallShape has cyclomatic complexity 16 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb72e4d79d0569eb50652258927a58200c06efdcf59cd3200ee91e3b7f72edd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectInstallMethod (cyclomatic 16, cognitive 19): detectInstallMethod has cyclomatic complexity 16 and cognitive complexity 19; 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":"src/upgrade/index.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"880f4394e3a38732b3371a3c0477f57f5af852551d3918fa01988d599f33d755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTop (cyclomatic 16, cognitive 19): splitTop has cyclomatic complexity 16 and cognitive complexity 19; 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":"ui/src/lib/conditions.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5de5e69273c698474ff5f7ce3200ac9f546070ed5f4ce8abf24351775005f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kindWords (cyclomatic 16, cognitive 19): kindWords has cyclomatic complexity 16 and cognitive complexity 19; 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"012a7fc1e6d3ee6907edb152a8508e3a480eb847a7cd21d2ee3760c84151adb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goParamNames (cyclomatic 16, cognitive 18): goParamNames has cyclomatic complexity 16 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f436818b99db916c8def77094bd9dad5512a3b32f6a9136e5fb9dc70ce56830"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPage (cyclomatic 16, cognitive 18): loadPage has cyclomatic complexity 16 and cognitive complexity 18; 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":"ui/src/views/FileCodeView.svelte"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"93716af7091462686dc4f5b1533d5774aad7aa12fa58be9c85b0bcd34a0f8473"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fieldValue (cyclomatic 16, cognitive 17): fieldValue has cyclomatic complexity 16 and cognitive complexity 17; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bcf07334e29aa95e9042611ff0f3b4490946a8d2f999343a4cd764a29fe853"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiverAt (cyclomatic 16, cognitive 17): receiverAt has cyclomatic complexity 16 and cognitive complexity 17; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee30244c77010261d1b6ec95939521610db79b82fb95824721b890e524cc12f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 16, cognitive 16): collect has cyclomatic complexity 16 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":"scripts/kernel-parity.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"357c5cba5f7315601a2ba58ccbcdedd4ca6cc384413cedc5078a74c71504d37a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractClass (cyclomatic 16, cognitive 16): extractClass has cyclomatic complexity 16 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc6303ab212f155f79407e9cb41f37fc1a50cb586b6ba743be347cb9198bf9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindsPattern (cyclomatic 16, cognitive 16): bindsPattern has cyclomatic complexity 16 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bbe4a0a49c33c625d0c1779b2eaf840e57a4080210fac38a673a59b08e0c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function children (cyclomatic 16, cognitive 16): children has cyclomatic complexity 16 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":"src/resolution/jsx-code.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"536128acc9df2a0856f9f3ced0733600b44746fd62062b161a745de61c7dc92c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTypeMember (cyclomatic 16, cognitive 16): rustTypeMember has cyclomatic complexity 16 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c216b2743d99badf857e600a282288ec1b99083f911ad2b1b98eea702e690ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustSelfParamBounds (cyclomatic 16, cognitive 16): rustSelfParamBounds has cyclomatic complexity 16 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12720}}}],"partialFingerprints":{"codehealthFindingId/v1":"9957da78ffb4938fd83140c602a7ed38b3e337b556226b2272d5c65d20ef70a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppSpecializationOwnerArguments (cyclomatic 16, cognitive 16): cppSpecializationOwnerArguments has cyclomatic complexity 16 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19195}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a518557c8538bfcdee43c0dc2a7106b6b20f0b9417fa8844c762a9f225c2f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsDeclarationReading (cyclomatic 16, cognitive 16): jsDeclarationReading has cyclomatic complexity 16 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":"src/resolution/name-matcher.ts"},"region":{"startLine":24025}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a40b454a5cbc1d2251d757342c795fd381d0a139f3bf249a03f30f2451defc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsAliasValueName (cyclomatic 16, cognitive 16): tsAliasValueName has cyclomatic complexity 16 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12c870824f14a74f9c60e0f5340a151c9859cf6997c212e67c71ab93c72a85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkTop (cyclomatic 16, cognitive 16): walkTop has cyclomatic complexity 16 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19ef45f37df169e55237db4822dfdd6f4b1627375299c3bfa020fa8ca1a3c47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 16, cognitive 15): resolve has cyclomatic complexity 16 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac3d9183979f093335d70239bd95f1a138d1c464ce86687cf47ed725627e98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownerOf (cyclomatic 16, cognitive 15): ownerOf has cyclomatic complexity 16 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3b00e25bcb67cd23517b2f35d1fec13b8bde78c150bcdfbcd38e1458fe48e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusPropertyIn (cyclomatic 16, cognitive 14): statusPropertyIn has cyclomatic complexity 16 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/graph/branch-guards.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8004bb31e9b95d6ce024073df6c7acf9194f375a6037dee634e31e26bbee67b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleChange (cyclomatic 16, cognitive 14): handleChange has cyclomatic complexity 16 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/sync/watcher.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2e6de09ba4596f9c578a77bf559332447eb3f164e216c65163e87251269fbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPhpReturnType (cyclomatic 16, cognitive 13): extractPhpReturnType has cyclomatic complexity 16 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/php.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae50772374110ba9a9881a14870c630e01ed36d6eb023938d21274ff036ddc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppWrittenTypeFit (cyclomatic 16, cognitive 13): cppWrittenTypeFit has cyclomatic complexity 16 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19471}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1671b692dbc4603de93623bb4466014c384088a7a3786866f7bb367e62277b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractImportMappings (cyclomatic 16, cognitive 11): extractImportMappings has cyclomatic complexity 16 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"3264752c938ebeca8b86021800427e640dc5fac8031ad3c8abdc5966395f9be4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 36): (anonymous) has cyclomatic complexity 15 and cognitive complexity 36; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdfba0e3ec79094d5aad238916b2ab55f537343be0c02326b05b22f27cff86e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rnCrossPlatformEdges (cyclomatic 15, cognitive 36): rnCrossPlatformEdges has cyclomatic complexity 15 and cognitive complexity 36; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e05f9572dd324fb947d1ef1e9e482f6092228cc08f567d88f19945e568d4faa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 35): (anonymous) has cyclomatic complexity 15 and cognitive complexity 35; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde2e6cef8a5c648823863d5c9f922c2db9aaf0d43c3c819611a99633b7e93fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairEvents (cyclomatic 15, cognitive 35): pairEvents has cyclomatic complexity 15 and cognitive complexity 35; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe761b4c72bbf65391c1a5fe7947427de10cc57b1d5560355deda2fa63f6f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBootstrap (cyclomatic 15, cognitive 33): readBootstrap has cyclomatic complexity 15 and cognitive complexity 33; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c6866e5e2c4b629361f832347a8b281f6e18dfeef0152909f83a02aa88c737"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustManifestDependencies (cyclomatic 15, cognitive 32): rustManifestDependencies has cyclomatic complexity 15 and cognitive complexity 32; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9537}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc0d45c3856e90030bac3edd9d410b821d3f41ecf7331c9f3aee32827a46450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function thisRootedCalls (cyclomatic 15, cognitive 32): thisRootedCalls has cyclomatic complexity 15 and cognitive complexity 32; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0447f7c466258dfb2519f1646ea04473550ac7d047986127210f57afe4f695"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTsTypeAliasMembers (cyclomatic 15, cognitive 31): extractTsTypeAliasMembers has cyclomatic complexity 15 and cognitive complexity 31; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8805b65fc72adf35702c9ff6e0e107a7b35fd487c1201f894f996161b8d005f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonPackageImporters (cyclomatic 15, cognitive 30): pythonPackageImporters has cyclomatic complexity 15 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c273320d5b0efe809ad5486ed814b5e6bdadfc971a7aecf46b6a2092620d35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isFunInterfaceNode (cyclomatic 15, cognitive 29): isFunInterfaceNode has cyclomatic complexity 15 and cognitive complexity 29; 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a42c0891948a8599b1f69dd665279e3b51f90a58af8e87049d175cf6f6787a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inCfgTestModule (cyclomatic 15, cognitive 29): inCfgTestModule has cyclomatic complexity 15 and cognitive complexity 29; 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":"src/graph/test-code.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffef73552b2290913ccffb80fdab20756286e0ee357e9cd7aad567ce9ee42f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 28): (anonymous) has cyclomatic complexity 15 and cognitive complexity 28; 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da252ca2d3aaabc2755e15c6a0d012370d06c8540d7739791713577372554e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shlexSplit (cyclomatic 15, cognitive 28): shlexSplit has cyclomatic complexity 15 and cognitive complexity 28; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cd11a9919f46be7af2f095dab429be1a1b6b08e4e1d7a6d54f4042c1fdddab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memberTypeThroughHierarchy (cyclomatic 15, cognitive 28): memberTypeThroughHierarchy has cyclomatic complexity 15 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22875}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5ec476676abbdb0fde63a869b47a9b9b6f87f2d11a746fd75c0a612901955c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripErlang (cyclomatic 15, cognitive 28): stripErlang has cyclomatic complexity 15 and cognitive complexity 28; 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":"src/resolution/strip-comments.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e2eff4c2d04d20ad2952f8f947a651c9aead8389aa50ba4cb8b8093541f580"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callAt (cyclomatic 15, cognitive 27): callAt has cyclomatic complexity 15 and cognitive complexity 27; 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":"src/graph/branch-guards.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d07834a308bfb033075d9223db50e377d0434a477a5bc796a2bcdbd04251766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFileExportIndex (cyclomatic 15, cognitive 27): getFileExportIndex has cyclomatic complexity 15 and cognitive complexity 27; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81f8f3d5e09b43eef646a9af30461e8a44ff387f96fa5eae784688213961520"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveModuleImportToFile (cyclomatic 15, cognitive 27): resolveModuleImportToFile has cyclomatic complexity 15 and cognitive complexity 27; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3916}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a7d8826bfa60b5ade2dab58a7b504a2db432388d39d864668a4d739d374836"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonClassNamed (cyclomatic 15, cognitive 27): pythonClassNamed has cyclomatic complexity 15 and cognitive complexity 27; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28217}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b92b5eec93010dfd401f9e5b22b3a6a96883f7e6261b05dd3ab765a8dc3276"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constantEventName (cyclomatic 15, cognitive 26): constantEventName has cyclomatic complexity 15 and cognitive complexity 26; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f34ee36ca41b45ac770f2178a24dd298d591c128981cf9e4100b13edb593123"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchBrackets (cyclomatic 15, cognitive 26): matchBrackets has cyclomatic complexity 15 and cognitive complexity 26; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0116f0c81a3f23898f8999aecbad42773ec4714a12efd5728f6969533770569d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 25): (anonymous) has cyclomatic complexity 15 and cognitive complexity 25; 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":"src/extraction/index.ts"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"063b26523acde75f3347c1cee9563c8b5e873dd611d8f80872a89314c885f297"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkDataEntries (cyclomatic 15, cognitive 25): walkDataEntries has cyclomatic complexity 15 and cognitive complexity 25; 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b660f2c9f4f3d3e0f53836db224362afed4a2fedb197ee245bf62098244510d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractKotlinReturnType (cyclomatic 15, cognitive 25): extractKotlinReturnType has cyclomatic complexity 15 and cognitive complexity 25; 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"db22f8daa02f6f55a823113f0f14e49c4cda7e097b4476b8a5d85e78a9bab08b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vuexDispatchEdges (cyclomatic 15, cognitive 25): vuexDispatchEdges has cyclomatic complexity 15 and cognitive complexity 25; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f6e5b7216d3e005560c8bb30756bf0a8e3de92f7db2144b2fa23009b9f305a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeDartLink (cyclomatic 15, cognitive 25): typeDartLink has cyclomatic complexity 15 and cognitive complexity 25; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5797}}}],"partialFingerprints":{"codehealthFindingId/v1":"383bf46748a0669469c0dc3e434ee7f8bd910d2446abbca54561d14302888afe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppParametersGivingDefaults (cyclomatic 15, cognitive 25): cppParametersGivingDefaults has cyclomatic complexity 15 and cognitive complexity 25; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a2486cb1e1e00a4e496ed12ed78af89ff558488a9b2d319bceb0a46139b9ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getContext (cyclomatic 15, cognitive 24): getContext has cyclomatic complexity 15 and cognitive complexity 24; 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":"src/graph/queries.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"034f36417bfb9ea6251bce58c0bdf70a33cb77e5203b3facc470fae4574d287e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAnswerFiles (cyclomatic 15, cognitive 24): validateAnswerFiles has cyclomatic complexity 15 and cognitive complexity 24; 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":"src/mcp/answer-freshness.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d13f4a37a425a6552248ea3f3e8de3058a0fe3ecbc65e5450a7352510bf46b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expoRouterReturnEdges (cyclomatic 15, cognitive 24): expoRouterReturnEdges has cyclomatic complexity 15 and cognitive complexity 24; 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":"src/resolution/expo-router-synthesizer.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df566b8aa78ed9c467f86a0fd555cc756ba3b44cb060193f2bb4f329ccff026"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppWithoutComments (cyclomatic 15, cognitive 24): cppWithoutComments has cyclomatic complexity 15 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32945}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c789b05bee65dfe77fcbc6c51337df0a857fbe6873d69828a9741605ab8369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tauriEdges (cyclomatic 15, cognitive 24): tauriEdges has cyclomatic complexity 15 and cognitive complexity 24; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d62768aca4b2f0f187c3a596462a71ee6c2323d0edda07db15cd21906c5c3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function methodsOf (cyclomatic 15, cognitive 23): methodsOf has cyclomatic complexity 15 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":"scripts/gen-go-stdlib-methods.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e28d555f3f8bbd7d1aac0f3b6ae661047559c5f4f67c0b0bd631d1be7c132d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processScriptBlocks (cyclomatic 15, cognitive 23): processScriptBlocks has cyclomatic complexity 15 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82ecd9a5064258f2d385b61d28689288b0a602be82c1e341613d5b2167b6f2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPascalParenlessCall (cyclomatic 15, cognitive 23): extractPascalParenlessCall has cyclomatic complexity 15 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4241b417f5c3c205396251d2569941f86acc9c5af537714b9985d8c4e2b96851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cMacroRename (cyclomatic 15, cognitive 23): cMacroRename has cyclomatic complexity 15 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":"src/resolution/c-macro-renames.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c071381b126eab2cf6e196a67d96cbc668620bdba131b72fcc31df3308bf01c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveGoMethodInPackage (cyclomatic 15, cognitive 23): resolveGoMethodInPackage has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25731}}}],"partialFingerprints":{"codehealthFindingId/v1":"997360fbf26b248a6f4543f601cf4cfcc2f7e3611b33b894a2d7d546236cb325"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/extraction/store-worker.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b091d4ff769db0d5d3d3a4b3b93d686a81dc03bbcab23dbfea892a59f971c37f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function offerWatchFallback (cyclomatic 15, cognitive 22): offerWatchFallback has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/installer/index.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5fc10917bf77f1a40fd1fe278eb04fa30c8c74ef6bf3dc0ea7b77719c7fb1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 15, cognitive 22): start has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/mcp/daemon.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"57109219527a5733606afbaf975bac2bed5fd02cc5d83a70095d572bb9d66e53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLine (cyclomatic 15, cognitive 22): handleLine has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/mcp/transport.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86990a06fbe26a92bb229eee539eeaea86b25b382fad89d2c63e3a8aa7919e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getArrayValue (cyclomatic 15, cognitive 22): getArrayValue has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/resolution/frameworks/cargo-workspace.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"af22fcce6ddf6e2909d0bd971215e2479b4c2d1e7edffa76a31148e33aac3cbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractDecoratorRoutes (cyclomatic 15, cognitive 22): extractDecoratorRoutes has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03cea6115dfa43d89b8860ade110c0b65154d74ebf698a98a903e30629d4a1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function functionBody (cyclomatic 15, cognitive 22): functionBody has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ab99c9efe23d792075005b29be8be4051fb142a7f1403fd644d56f1389d2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCobolCopybook (cyclomatic 15, cognitive 22): resolveCobolCopybook has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ba8229c192b5b6a8cf9b73c025630cc8a489c2938a50ff5a49e90979339aa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonDynamicGlobalWrite (cyclomatic 15, cognitive 22): pythonDynamicGlobalWrite has cyclomatic complexity 15 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3587f47e6e0f0fefb37c79e26c3b8abfba926e10d1e62ea9ede4c60f5933cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGrammar (cyclomatic 15, cognitive 21): runGrammar has cyclomatic complexity 15 and cognitive complexity 21; 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":"scripts/add-lang/check-grammar.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bab811d908bbf11acaeffd602858580c670d000ff467f07ff24cfc70d260f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaImportsOf (cyclomatic 15, cognitive 21): scalaImportsOf has cyclomatic complexity 15 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7886}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ea26d6e08ac2ae5179ebac9c6685d13bfda97814c1fb7740f4142568926ebb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classMemberLines (cyclomatic 15, cognitive 21): classMemberLines has cyclomatic complexity 15 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23145}}}],"partialFingerprints":{"codehealthFindingId/v1":"007df9379669939d6428e8c3e5d771c5413fcb229562b8a30280029f60ba9e56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planBinaryRemoval (cyclomatic 15, cognitive 21): planBinaryRemoval has cyclomatic complexity 15 and cognitive complexity 21; 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":"src/upgrade/remove-binary.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eed6eb60d159f61cb22f0af482266d34cd39d2b51755d1e736157cbd29f0c77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ignores (cyclomatic 15, cognitive 20): ignores has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/extraction/index.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c14c67ef604d06ef88424b25810236f0c1a93cd6b253c7cc73c558ff9b561c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conditionalGroups (cyclomatic 15, cognitive 20): conditionalGroups has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a1ba4258404981b660873103b5ebc073663d16c2220c52a1480486595b6bed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCallers (cyclomatic 15, cognitive 20): handleCallers has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/mcp/tools.ts"},"region":{"startLine":3407}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4caa9018e8c2558f8c757d5f5593c8b7902be4c80e769bb931679e74447c98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCallees (cyclomatic 15, cognitive 20): handleCallees has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/mcp/tools.ts"},"region":{"startLine":3496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902356f83d5c76920a13a0e876f436cd6e52ba28bb92961cc3af9757967122b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function functionParts (cyclomatic 15, cognitive 20): functionParts has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0671c223777c5e510f1aae9a3f4c3508780658ac05be6222561344582bd38d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 15, cognitive 20): resolve has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/resolution/frameworks/rust.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a005fa7a87f8278fa1262781f3278e33a95e0c4dbdfd620458dcadea9a35dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headerClassAt (cyclomatic 15, cognitive 20): headerClassAt has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd8562924a8a51e76139f96350e58b00ee861e329bb920c646522d2f035126e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function siteText (cyclomatic 15, cognitive 20): siteText has cyclomatic complexity 15 and cognitive complexity 20; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bb0d3c7714ca496d00d23448c2dbe449c0af766e42b7be0ea00445af9abb82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 15, cognitive 20): load has cyclomatic complexity 15 and cognitive complexity 20; 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":"ui/src/views/SymbolView.svelte"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d7066bdde3e75f189a26bc4b5366daf0c4ab5198bb2f3d97533ab6cc219947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; 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":"src/extraction/index.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ee49f7f765b4e89723e62e5f5f6994eddba86284a3f076bc55ae7408c789ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isReturnedAttrsetMember (cyclomatic 15, cognitive 19): isReturnedAttrsetMember has cyclomatic complexity 15 and cognitive complexity 19; 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":"src/extraction/languages/nix.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"58856b4bfd3801df6fe43ff0ba3d9a9a09a42bdf111784a7f00bc07b38737d0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeQualifier (cyclomatic 15, cognitive 19): typeQualifier has cyclomatic complexity 15 and cognitive complexity 19; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb821189bec98e3fa08cb9e010af8bbca635bdf3a710f6fd1f9cab1912f5ada3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goSlicedType (cyclomatic 15, cognitive 19): goSlicedType has cyclomatic complexity 15 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f845eaaef7c3e8c1f80bf6eebd862d3a45e78273de7b36809a4a391bfeb677fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppMacroNamespaced (cyclomatic 15, cognitive 19): matchCppMacroNamespaced has cyclomatic complexity 15 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32817}}}],"partialFingerprints":{"codehealthFindingId/v1":"417b07364c564d043031181fdf60f989f35630ad4290445e164f632b9fcf2ebf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ea11dd71b0b53bc7c0b74b099c994a103d1362c21dd6f7e5f4178c36ff14ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapSvg (cyclomatic 15, cognitive 19): mapSvg has cyclomatic complexity 15 and cognitive complexity 19; 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15bf48a053dd6d37b51b831c6f3ac9a630729bd5c7b258dfc457634ce381bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cbddd9d29b7f6abad254432fbc1b2924bb348f2b9da30d3195c241366e543c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bdcc70102d119478bdefc7ac416be9ef35b6536de8585009d35af45aeb9b31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectKeys (cyclomatic 15, cognitive 18): objectKeys has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/graph/branch-guards.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c382c6781492b73e608d0e23741c031a241c3372d06a155482ccb5e998bc1aa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writePromptHookEntry (cyclomatic 15, cognitive 18): writePromptHookEntry has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/installer/targets/claude.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d015216a928dc0f163a5206c7bd700a0c879971b63d9424786f47f905a2d41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/mcp/tools.ts"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"83612f4a06c4e328b4cda6d39de71591bf70ef43131872f71ff8f0e9aba94a57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function balancedArgs (cyclomatic 15, cognitive 18): balancedArgs has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2333c782ca28b04932ba3d3943a2147f6bb5c26672e462c42582d5414c75a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppConstruction (cyclomatic 15, cognitive 18): matchCppConstruction has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20578}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6fc1fad0d757ce081801957f88113906d841b69178faa52d37d527579cd6cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preferGoBuildTwin (cyclomatic 15, cognitive 18): preferGoBuildTwin has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccce05fa1d94452095e401d7301a152fe561a91da88212e396d8af6e64c22bb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goCalledType (cyclomatic 15, cognitive 18): goCalledType has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27073}}}],"partialFingerprints":{"codehealthFindingId/v1":"106bbf66e68e83919ba7f72d3ee1dd9ff38772ec7841ad5d1f391ef8f878422b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goTypeTextEnd (cyclomatic 15, cognitive 18): goTypeTextEnd has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc06ac984a39ae51b3f854c8becf3c060fddc8f4f1f93c80925776cd1ff16b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateSwiftTypeTarget (cyclomatic 15, cognitive 18): gateSwiftTypeTarget has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a707ae18540e05bd9b4a7ffe77776a085f2f8b55f71cb613856625c93df8d21f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readExtension (cyclomatic 15, cognitive 18): readExtension has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6630a029c1a4a5c5cb5bb30074e798cb92bb4d6726c1391ad65ba322de17fb14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPackageEntries (cyclomatic 15, cognitive 18): readPackageEntries has cyclomatic complexity 15 and cognitive complexity 18; 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f40c26f9902c3089a67249bf4648817a656c666286d68c7081b37ea0047700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isMinifiedContent (cyclomatic 15, cognitive 17): isMinifiedContent has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/extraction/generated-detection.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3e25f87ad2b0c6a41448139ff2f0e9c074d1c56cc4a3301e2e4d1cfcf3d002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statementEnd (cyclomatic 15, cognitive 17): statementEnd has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719f68c165335cbf552b7c04a1a5a9f79dd8361015ca415d019ee2feef1b4ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaLocalBinder (cyclomatic 15, cognitive 17): scalaLocalBinder has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7777}}}],"partialFingerprints":{"codehealthFindingId/v1":"16493b36fed86671849b0c2a78900aaad175112f7a3871b0b1838d101d12d3cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rubyMixinsOf (cyclomatic 15, cognitive 17): rubyMixinsOf has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8905}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74c0d1ace3ba7868fe097f52c743d8dc90d135113ffb7d17c0df4b408a63d5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goAliasTarget (cyclomatic 15, cognitive 17): goAliasTarget has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25790}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdda383d1ca67861ed1dfc6fe67f4f388d4c49b2e61f8944b9765eca46d56a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiverType (cyclomatic 15, cognitive 17): receiverType has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f638fd53d0adcaa1c2a0e04dba06bae2b12f424b1b99b9537061b2ef896687ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 15, cognitive 17): start has cyclomatic complexity 15 and cognitive complexity 17; 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":"src/sync/watcher.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63aac2a5eac37e4f75c46af30477cc219fbeaf40391ab3ff1376c18932bde2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractKotlinObjectLiteral (cyclomatic 15, cognitive 16): extractKotlinObjectLiteral has cyclomatic complexity 15 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7126}}}],"partialFingerprints":{"codehealthFindingId/v1":"42207aee170f3ae66fecfec6f47b87e1da835ca47a2ee33c6ca1bb90b8142bed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function phpSupertypeQns (cyclomatic 15, cognitive 16): phpSupertypeQns has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9302}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c46b2bcad30c7a0ee36a79250bceb5c2837d8689e80aef2e86670f691c993"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsNameSites (cyclomatic 15, cognitive 16): jsNameSites has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13602}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cdcc072a5224e3f622e4df577facf9956c361379a4aefbf916349341122179"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCollapsedObjectCall (cyclomatic 15, cognitive 16): matchCollapsedObjectCall has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16026}}}],"partialFingerprints":{"codehealthFindingId/v1":"5190754976ef10a3bd4b7d4dbf2a9ef67f78b25e5f6f9bb74f923c688eb7877f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaReceiverDeclaredType (cyclomatic 15, cognitive 16): javaReceiverDeclaredType has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21628}}}],"partialFingerprints":{"codehealthFindingId/v1":"495689c29bd81e350a8a94037a97c23d003ab20ca1ea3339cfb49ad361d14d9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsFieldMatch (cyclomatic 15, cognitive 16): tsFieldMatch has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29979}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6007308224605bb8cc74f458fa7448bd4f5a1aa9c73612c55e4f4e0cd9c91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 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":"src/resolution/resolver-pool.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ed3ca0a51088ffb1128b7957d2c6ae78406c7c981e525a77a6a6bf88a10d7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeBlock (cyclomatic 15, cognitive 15): describeBlock has cyclomatic complexity 15 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2d4bd723826fb789859065207e55db566eecd8c557ac00d6354e6df2c63574"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractAnonymousClass (cyclomatic 15, cognitive 15): extractAnonymousClass has cyclomatic complexity 15 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7066}}}],"partialFingerprints":{"codehealthFindingId/v1":"de728a9a1682f1278a6ca6a35f9e567c85379a6326cd2e76339d5e64828b9d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustFieldValue (cyclomatic 15, cognitive 15): rustFieldValue has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0834473daab168c2c553e570284f938bb8ec7958ef93c70f827a0668651f11e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppSubscriptElement (cyclomatic 15, cognitive 15): cppSubscriptElement has cyclomatic complexity 15 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17019}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b12ca50ff7b2bcc5214516b3fbdeb04bb254c50b5b08eeb36657292b3efa4e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepSub (cyclomatic 15, cognitive 15): stepSub has cyclomatic complexity 15 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"550bb72b063e6b8a7cc1a58c5097bf85d52b3ba1deb031ecd3a5e975a149a55b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelItems (cyclomatic 15, cognitive 14): topLevelItems has cyclomatic complexity 15 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fe179722b3077e5026c6ec6e8b56767906c22fc85dc555e9381c2ec62b7f6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonGlobalReceiverTarget (cyclomatic 15, cognitive 14): pythonGlobalReceiverTarget has cyclomatic complexity 15 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b4afb80b23bad3b2355ec0bde44725b23cf52b1cef90357d4f20a52a48f852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTypeTextAt (cyclomatic 15, cognitive 14): rustTypeTextAt has cyclomatic complexity 15 and cognitive complexity 14; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca64d33b34598bc0612720e60ed34f3372b2d434b0649f236886e33a72bf2ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractProperty (cyclomatic 15, cognitive 13): extractProperty has cyclomatic complexity 15 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da2d2a775fd77bf573b4a5d4e4952e81d978b25e4e5882be18897bc008d816c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decoratorsInTree (cyclomatic 15, cognitive 13): decoratorsInTree has cyclomatic complexity 15 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/graph/branch-guards.ts"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8cc1270c52e76fe5bf3a1283e16574437de11bcb0599b68f186f0f08615e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBarePhpCall (cyclomatic 15, cognitive 13): isBarePhpCall has cyclomatic complexity 15 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4521}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f1d0e1f81d8f8220712c2684b286321d59041ce472141cb0394476656820b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustSelfType (cyclomatic 15, cognitive 13): rustSelfType has cyclomatic complexity 15 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2adf9863ff2755915e2f81459776d7cf31904c232be5d24c9a5677103e20261"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanFnRefSubtree (cyclomatic 15, cognitive 12): scanFnRefSubtree has cyclomatic complexity 15 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f7873df5073153b5fac20fbe68c444f405f9be64e508621977a81db22059de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 15, cognitive 12): detect has cyclomatic complexity 15 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb72c56844632f601e06d6d545482c492579e696c6f0166e0bbd728528f151d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSfcPrivate (cyclomatic 15, cognitive 12): isSfcPrivate has cyclomatic complexity 15 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"4439d72a151a0ece35b758c5ca8fd5c4b08c961a27865ef51cae8821c8b24dad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signal (cyclomatic 15, cognitive 12): signal has cyclomatic complexity 15 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/lib/live.svelte.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb067ee6e3e72aa5c306276474cfe7c56a35af741d0da812d24e42ee1c33aa5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moduleExports (cyclomatic 14, cognitive 33): moduleExports has cyclomatic complexity 14 and cognitive complexity 33; 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":"src/extraction/languages/erlang.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b96517f88735a37075df5bbb6925b8fcf5f6e6abbc144bd65640b63cb16168f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 32): (anonymous) has cyclomatic complexity 14 and cognitive complexity 32; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"725b4da3191b517d17771fac438dbcd106361a8088ac71c3ec76dbf815554979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandWorkspaceGlob (cyclomatic 14, cognitive 32): expandWorkspaceGlob has cyclomatic complexity 14 and cognitive complexity 32; 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efd8688ce4e00f5eff98c75bde9d52b6fecd5b62b852b06711edff50b821e92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartCallee (cyclomatic 14, cognitive 30): dartCallee has cyclomatic complexity 14 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":"src/extraction/languages/dart.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a868a2e58e3479231685d0a86e1763c7e9401d67fd0b196ffdfd8ea640dbf7dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indirectTestNote (cyclomatic 14, cognitive 29): indirectTestNote has cyclomatic complexity 14 and cognitive complexity 29; 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":"src/mcp/tools.ts"},"region":{"startLine":4289}}}],"partialFingerprints":{"codehealthFindingId/v1":"db35c07fd176b8e126109423bedaa685c6b0bc390cf41e769953ffd22a915e3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustCodeBraces (cyclomatic 14, cognitive 29): rustCodeBraces has cyclomatic complexity 14 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9901}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21f841252eeaac1087b125a08267073ac1584ef3533b55e0da724de8186360e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ancestorsOf (cyclomatic 14, cognitive 28): ancestorsOf has cyclomatic complexity 14 and cognitive complexity 28; 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":"src/graph/dead-code.ts"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"921b170875c65fb1a264399082e3b91508ab64eb14b740d3617835f3f5bf2c06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMicrosyntax (cyclomatic 14, cognitive 28): readMicrosyntax has cyclomatic complexity 14 and cognitive complexity 28; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2af04ca36fdbbb6ba1c42e7bc77330a4cca93f01351621adfdfccfa5646f24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasGeneratedHeader (cyclomatic 14, cognitive 27): hasGeneratedHeader has cyclomatic complexity 14 and cognitive complexity 27; 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":"src/extraction/generated-detection.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ccb7f8eff8146602e7497ebdd007336bfe0d044abd51a2ee8953b24d5a9752"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppOverrideEdges (cyclomatic 14, cognitive 27): cppOverrideEdges has cyclomatic complexity 14 and cognitive complexity 27; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e04283081ce598f909822e6a35dd4fbc4b077b6ac54d59c37e65377cbcfaa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppMacroMethods (cyclomatic 14, cognitive 26): cppMacroMethods has cyclomatic complexity 14 and cognitive complexity 26; 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2408d2f194ecb2e172ef19a67506912a6d6a846ff9d606ce5c2dbfa46c2fef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathDependencies (cyclomatic 14, cognitive 26): pathDependencies has cyclomatic complexity 14 and cognitive complexity 26; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27940616953737af29d1a753885300417c3f40c2c6cdabceb93786b16c13850"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustReceiverChain (cyclomatic 14, cognitive 25): rustReceiverChain has cyclomatic complexity 14 and cognitive complexity 25; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc548d6998150b9ab092f1a9f52ed68be4cad8684c7bc14cc4baeb85d305a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCopybookSection (cyclomatic 14, cognitive 25): buildCopybookSection has cyclomatic complexity 14 and cognitive complexity 25; 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":"src/mcp/tools.ts"},"region":{"startLine":4250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5337a26a75f79e022e2da96e3f630f6cedc76fc47cf9e8653006d1b4f47af2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustFunctionReturn (cyclomatic 14, cognitive 25): rustFunctionReturn has cyclomatic complexity 14 and cognitive complexity 25; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12512}}}],"partialFingerprints":{"codehealthFindingId/v1":"98401fc136e4e1dcff6a459145f9a995281996ca108aba4f50452fd36df79fa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 24): main has cyclomatic complexity 14 and cognitive complexity 24; 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":"scripts/agent-eval/probe-allocation.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8521ca0a8505c41c6bede913333338d5e3d49674ca14c3221fdae4d4b5ec201e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractCodeBlocks (cyclomatic 14, cognitive 24): extractCodeBlocks has cyclomatic complexity 14 and cognitive complexity 24; 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":"src/context/index.ts"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd550e06328248373fbdc7ebfc78c3e09ef1d89477b8e80148778c4966f59ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commentOrStringEnd (cyclomatic 14, cognitive 24): commentOrStringEnd has cyclomatic complexity 14 and cognitive complexity 24; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0241a5c088a11eea0f75cc3e72466127ce5e655e1cbc4ac2ab99e6ae5e92f4d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractObjectLiteralFunctions (cyclomatic 14, cognitive 24): extractObjectLiteralFunctions has cyclomatic complexity 14 and cognitive complexity 24; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa2743ecf7983fb818774036bbfb327c3628f0514df4afd607acace72f4a703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decoratorChainStart (cyclomatic 14, cognitive 24): decoratorChainStart has cyclomatic complexity 14 and cognitive complexity 24; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d6007c162a1091f0fb367ef4d4f591d4cee40220c32af814b58b85b417d7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsScopeFile (cyclomatic 14, cognitive 24): jsScopeFile has cyclomatic complexity 14 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23785}}}],"partialFingerprints":{"codehealthFindingId/v1":"2763902db7106bdc2c225b47e7d66b9da5cb3639683dbaca79d18f312e062a5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goTypeParamsAt (cyclomatic 14, cognitive 24): goTypeParamsAt has cyclomatic complexity 14 and cognitive complexity 24; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27544}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec380e67455b783c6bea3947c66ede32bc4262aee6b51d9ad39c80143b6e3c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeArgumentsEnd (cyclomatic 14, cognitive 23): typeArgumentsEnd has cyclomatic complexity 14 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a737c781e6ef982bd34df9168acdc1a56cd37597c1751b418b53085cdc5fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resurrectPythonPackageImporters (cyclomatic 14, cognitive 22): resurrectPythonPackageImporters has cyclomatic complexity 14 and cognitive complexity 22; 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":"src/extraction/index.ts"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f20dca598c7b20f712b294cf24536915708aa426c2683fa5c278a4b6484002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractLocalExportAliases (cyclomatic 14, cognitive 22): extractLocalExportAliases has cyclomatic complexity 14 and cognitive complexity 22; 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":"src/resolution/alias-binding.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3de6fa7b79368d45670002ad1ac9e7ffab37f6930074e10d46bb92a5520995c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function angularMounts (cyclomatic 14, cognitive 22): angularMounts has cyclomatic complexity 14 and cognitive complexity 22; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6956f7dd7359d88d80d9b5e8958d3253aeb9db31176aee35c6454ec739387f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsBindingEnclosesReference (cyclomatic 14, cognitive 22): jsBindingEnclosesReference has cyclomatic complexity 14 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13650}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6d5d3c28b4a062d732f444a2d6e0a712308186605452a3dce7ed07bdd0b4c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continuationsFrom (cyclomatic 14, cognitive 21): continuationsFrom has cyclomatic complexity 14 and cognitive complexity 21; 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":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be79ead79be6aceceb4165102656ab4c8864c99ed6bd7419e01f790a06f2752"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reopenReferencesThroughDeclaredPackages (cyclomatic 14, cognitive 21): reopenReferencesThroughDeclaredPackages has cyclomatic complexity 14 and cognitive complexity 21; 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":"src/resolution/module-importers.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf53b9611e016fa20181392b6b03be726daa266338820ac89a0fa151be6a36ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustDeclaredItems (cyclomatic 14, cognitive 21): rustDeclaredItems has cyclomatic complexity 14 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10466}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65bdf3484580c8c63ff623eb99e58b04342cc70f68d5aee258e5b28cf657458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jvmSupertypeChains (cyclomatic 14, cognitive 21): jvmSupertypeChains has cyclomatic complexity 14 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16118}}}],"partialFingerprints":{"codehealthFindingId/v1":"991570ea0a10e4fe7dddcc926b33ac1db0160bf8eca87c4924813e088b8267e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goStructMembers (cyclomatic 14, cognitive 21): goStructMembers has cyclomatic complexity 14 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27510}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f201d508baab8266a80d911e5b35e82a2f55cb9e6f76d97fedf4684febb2ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 and cognitive complexity 21; 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":"src/resolution/override-parameters.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"75793c9ebd204ca4de2e3e8fea314fa2917e5630971e0c153ecc62eb7c04dafa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectGitStatus (cyclomatic 14, cognitive 20): collectGitStatus has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/extraction/index.ts"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"7069fef16ee41a5fd0928997e54f6ef186680c3c77614f325d4f856d174375bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSwiftReturnType (cyclomatic 14, cognitive 20): extractSwiftReturnType has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/extraction/languages/swift.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3973d3bfba78e5b815367e810525e989abe90bcb952b0e91b55ac5b7a56eac6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pastBracket (cyclomatic 14, cognitive 20): pastBracket has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/extraction/razor-script.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac83ade98f15bf257329278dee2cded2c265741b17c0b9936f9f90f7034563e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endOfConstructor (cyclomatic 14, cognitive 20): endOfConstructor has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a083d83d967e93a148e9666878a421d92eb3f2170af37ed3da12b31de2a1287b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankTypeArguments (cyclomatic 14, cognitive 20): blankTypeArguments has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e91b2a58bc3ac078646f51f9db518a83f6ab849a9112373ce83f767a5af1b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePhpQualifiedClassRef (cyclomatic 14, cognitive 20): resolvePhpQualifiedClassRef has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0d4eb146a4f8213f13a8488e09509334df0b1f5438cd6ca10aa29882e8e10d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classExpressions (cyclomatic 14, cognitive 20): classExpressions has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/index.ts"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b822f1a608ee4fab3c45f525d61561f27965e98ba13d6b7d7cd3b1f909f1244"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppScopeMethod (cyclomatic 14, cognitive 20): cppScopeMethod has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18955}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe942a1c24b35fb09a45a4cdd8a46c1d7a59936a2d41d8a7a9eda3d18276c0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goEmbeddedTypes (cyclomatic 14, cognitive 20): goEmbeddedTypes has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25835}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02989e9d4af9ae4b0aad186cd17c8871865974fcc1d77c408efd4741782d9d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueBinding (cyclomatic 14, cognitive 20): valueBinding has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"881993f4d506d1819a228d652b09e9e25d17398d55b80739c37b0f9740b1ca39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePathWithinRoot (cyclomatic 14, cognitive 20): validatePathWithinRoot has cyclomatic complexity 14 and cognitive complexity 20; 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":"src/utils.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa119fad2b0cde7e7116b1408ad4f929dd996aa1ec8e4fc3601bf939c1fb6e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) has cyclomatic complexity 14 and cognitive complexity 20; 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":"ui/src/lib/map-model.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0446cd319a3159146573f164dfdf712a7cdd0d9331005a37d1cfc71dfaf613d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchNameSubstring (cyclomatic 14, cognitive 19): searchNameSubstring has cyclomatic complexity 14 and cognitive complexity 19; 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":"src/db/name-substring-index.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8f10beaf1110dab559c3df4f663fd25360b5fd7fe35e2b17abab03b49e2d23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namespaceHead (cyclomatic 14, cognitive 19): namespaceHead has cyclomatic complexity 14 and cognitive complexity 19; 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad721ac111838a20bee5cb8a77821f152a0104335b490a6998cf6ceb0c31c91d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeBasicString (cyclomatic 14, cognitive 19): decodeBasicString has cyclomatic complexity 14 and cognitive complexity 19; 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":"src/installer/targets/toml.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ba2d08b2af1158d33ca03ea45549a0e07bc181fb66fd9484873beeb30027bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDartUri (cyclomatic 14, cognitive 19): resolveDartUri has cyclomatic complexity 14 and cognitive complexity 19; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27a4ff8fe8a23fd04b1fcb2a721c3c9c6255fe106d68d320d809ce36c35c500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinLocalCallResultType (cyclomatic 14, cognitive 19): kotlinLocalCallResultType has cyclomatic complexity 14 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6609d7233a99a789f537bad56fbe192b8798a582738928b1c84f753059dd02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveStoreAction (cyclomatic 14, cognitive 19): resolveStoreAction has cyclomatic complexity 14 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31091}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf1b80258f7213b43dc72382bdde5fd6625458e4eaa4f4c7bb7b7b3c9bae3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vueOptionsMembers (cyclomatic 14, cognitive 18): vueOptionsMembers has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"678e46e93f38a68596016b4ff63ccb9fa2277ef5abc950cb0540684e972d2f5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trimProjects (cyclomatic 14, cognitive 18): trimProjects has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/mcp/tools.ts"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2799da30afd29d03e265b852aed3d89f55466e009719b7697e42e8bfdfc8c9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryAcquireWriterLock (cyclomatic 14, cognitive 18): tryAcquireWriterLock has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/mcp/writer-lock.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdc604122b489b24e0176e3534ccd0107ba505485e7e52be9238734d1cb07cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function propertyInitializer (cyclomatic 14, cognitive 18): propertyInitializer has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c2f0756706945dd3f6df195e51acb68e28a8662f397a0922e4866b3be05bda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 14, cognitive 18): resolve has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c36cd6fe74e5003d9d6c815f94a00c174629d2f1633c53c0c686ce38b82fcfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonAttrClassWalk (cyclomatic 14, cognitive 18): pythonAttrClassWalk has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28545}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeee1e827506efc6a682016c18e05a64a880908023e2ee2220f1144c6aff4b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ivarClassFromInitialize (cyclomatic 14, cognitive 18): ivarClassFromInitialize has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0124c092da8a72a2cfa76baaead3df94673b45da86045a5ea86fe5064e46247"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 14, cognitive 18): collect has cyclomatic complexity 14 and cognitive complexity 18; 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":"src/resolution/type-parameters.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6a1a779d00fbec89217b1ac476450a41d4030b224fe188f356375606a590e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function referenceNameTail (cyclomatic 14, cognitive 17): referenceNameTail has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/db/reference-tail.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9c41e666137955a869ff481ee5507429343bbf012eaff65de2b51af43547e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qualifyReference (cyclomatic 14, cognitive 17): qualifyReference has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce389d43a83ce31e3cf037f039c4f9d364f271774208000d1f2d7d030be2908c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryInitializeSync (cyclomatic 14, cognitive 17): retryInitializeSync has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/mcp/engine.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3255ae9c8a77e23ef15cf1aa10c01174b815a4955d9f952ae9537c2bed88731e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveImportedInstanceMember (cyclomatic 14, cognitive 17): resolveImportedInstanceMember has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":4466}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb74d847e0f49437940b05dba8a772689bceec348e05418b82391e7e0069f41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function luaAliasExpr (cyclomatic 14, cognitive 17): luaAliasExpr has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea44d40a48549ac3eeee665a740a67dd7eefb670aea8ab53552aedcac219c393"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goTypePositionTarget (cyclomatic 14, cognitive 17): goTypePositionTarget has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b91950cfa284fd2bd2d0f489153212acf552ad94ded304c1669ad0ce9e7d7b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustAssocBinding (cyclomatic 14, cognitive 17): isRustAssocBinding has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11776}}}],"partialFingerprints":{"codehealthFindingId/v1":"13942422908d6054957b4e3bc7f27f8c354f4f8c4f0d30b9db21faba213796e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppArgumentListFollows (cyclomatic 14, cognitive 17): cppArgumentListFollows has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1756e98c0d219943c8cbf20c6a1dbebeaeab5d3346ed747fd1b6f5ca43ef7c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; 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":"src/ui-server/api/steps.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"300cee213a7621172b23cf022e27562a25ec11baf35074587b7d11773f1abe96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reference (cyclomatic 14, cognitive 16): reference has cyclomatic complexity 14 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":"__tests__/explore-long-query.test.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd297d2a6b06d4820394b917e699eea77c71c00f7552688c032f580477ea918"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printReport (cyclomatic 14, cognitive 16): printReport has cyclomatic complexity 14 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":"scripts/agent-eval/probe-allocation.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd39ceb131e342af4c3c363fc80cb98ebf5205e47d9be21e8e411f335c44fdf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipCppAngleArgs (cyclomatic 14, cognitive 16): skipCppAngleArgs has cyclomatic complexity 14 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1d0db087e2265c1cfb80db41979057c4a59293cf3147cbc5987cd1816250c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppFunctionOverload (cyclomatic 14, cognitive 16): cppFunctionOverload has cyclomatic complexity 14 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5461e3eb6c559332be530132c475651928f36c27a095e67fa78b3d6ead95ce7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowCardSvg (cyclomatic 14, cognitive 16): flowCardSvg has cyclomatic complexity 14 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37196c6998ddbb5ae65cd1a6352dc522f23eb8d6c41696b44e6280811a02957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNodesByNameSubstring (cyclomatic 14, cognitive 15): findNodesByNameSubstring has cyclomatic complexity 14 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":"src/db/queries.ts"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8c6b82f5e82cd6919a1a5e9cfd58dc829e255f3f4b46cbdd851f8311a855e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requireModule (cyclomatic 14, cognitive 15): requireModule has cyclomatic complexity 14 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":"src/extraction/languages/lua.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8481b81236dd24dba86fee76ed42e2cfd3c06cdc6014adbd80303dfe838d2dfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateHeaderEnd (cyclomatic 14, cognitive 15): templateHeaderEnd has cyclomatic complexity 14 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4698784175f071bf49876e788cbabdb5ec62731422b73751ef2d012c58f53c92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 14, cognitive 15): resolve has cyclomatic complexity 14 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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61705387970dcf7dd6cd97fb62de431cecaf7c02ecf9904028e1ef461adc44f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractReExports (cyclomatic 14, cognitive 15): extractReExports has cyclomatic complexity 14 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2b7878595fc233a749ec24fabb99da55a4c60327c99ca0d9af820a21e3bda5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustReturnInstance (cyclomatic 14, cognitive 15): rustReturnInstance has cyclomatic complexity 14 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12610}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c7c45e40e5cbf808e2206c5e1ac06cb88fa9560ea659036d530a96ea2481fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function holderScopeAt (cyclomatic 14, cognitive 15): holderScopeAt has cyclomatic complexity 14 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4348d42bbbb942ca77079778ed26f3c1621956f30a26c0700145efc019eb915b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppHeldTypeCall (cyclomatic 14, cognitive 15): matchCppHeldTypeCall has cyclomatic complexity 14 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18222}}}],"partialFingerprints":{"codehealthFindingId/v1":"596b4cee660739d9a75d2205b0cd00ce55a679a16b92d8faed79ca3800baa7d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppMemberChainCall (cyclomatic 14, cognitive 15): matchCppMemberChainCall has cyclomatic complexity 14 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18760}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cefe67b40e990b16ba0f37a2702d6a505b6e4a3100de7de5e597878e145ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDirEvent (cyclomatic 14, cognitive 15): handleDirEvent has cyclomatic complexity 14 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":"src/sync/watcher.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"9873679cc6d6da4144be607378fd8553e89d6ef8432b37de66129f426be9ab1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSource (cyclomatic 14, cognitive 15): buildSource has cyclomatic complexity 14 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":"src/ui-server/api/source.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"625d651a221ce503c071c30ac63520e24e4fe79150fea3bc0d21cec3bef781f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareVersions (cyclomatic 14, cognitive 15): compareVersions has cyclomatic complexity 14 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":"src/upgrade/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"59947af3152b5ce3e76d5a969162365097cbedaf90e4ca4d5e92fab7dac18991"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelParts (cyclomatic 14, cognitive 14): topLevelParts has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b325dde88414d1a1b7fc62ab98cd00b93621f23e6646727e2a769dd341264c55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3206383d3a6d1a5f7981e4ad6c475c81377a65b9972a4d5fcdc1091a283754f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56c1d1dc4d89f6b2e4508ceb65365740c86330ca9d2447471b0edad76563fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickJvmDeclaration (cyclomatic 14, cognitive 14): pickJvmDeclaration has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c936054f3751f91489938543151dea414b5419146fd66cdc66523d7cb620ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonOwnLines (cyclomatic 14, cognitive 14): pythonOwnLines has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d59efe6d6c12c90c3a2ac160ba85b5e0890940611335c3e5524b0fff12fdaa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isGoBareName (cyclomatic 14, cognitive 14): isGoBareName has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce980fe248428c75af503d83041f73ac51f8e88005a3df5763090d59bd17e7d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustQualifiedSelf (cyclomatic 14, cognitive 14): rustQualifiedSelf has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11801}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5046b295b1cc453413e1b49c2efb78e74b34c8a78ea32e975501da53bf0f8d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCppCallersDeclaration (cyclomatic 14, cognitive 14): isCppCallersDeclaration has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1118c3ad730992438ff1dd7c00f8c9e2a74998a0751ade41b7b687239d69952"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blockFor (cyclomatic 14, cognitive 14): blockFor has cyclomatic complexity 14 and cognitive complexity 14; 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":"src/ui-server/api/program.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfc2d6a37d2e9b2d6ff28cbef5ad446303eb0fffda09c5bd9b965b6fe6aa1e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 14): main has cyclomatic complexity 14 and cognitive complexity 14; 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":"telemetry-dashboard/scripts/render-check.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f245d7a07a246acedacf9a2413cb15cace0ce7a31bf6b3ffd18b1f73df9f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitRefFromVariableExpr (cyclomatic 14, cognitive 13): emitRefFromVariableExpr has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38aaf85eae0be68f722514925e982106bd82d40c4fdc0d8966f0ea35ef2e830"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractAssignedObjectOwner (cyclomatic 14, cognitive 13): extractAssignedObjectOwner has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd06b8469fa41f0ca15ea5a076690709a25503bd4467bc93d2a67df6ff99d56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pascalDataNames (cyclomatic 14, cognitive 13): pascalDataNames has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5079bb620aad7921828959e143217fb06738c1240f221677b590590ee9039640"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bareCallReceiver (cyclomatic 14, cognitive 13): bareCallReceiver has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4324}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe150841a12cacfe06b97e2fca5f5ddac801487c161d21882c2c5c23604fa859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTupleReceiver (cyclomatic 14, cognitive 13): isTupleReceiver has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6601}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d20deaa0ca305aeff0bf7b0283dfa05a92ff19a5c62197829bbf1f1c8f544c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustPathCallReachable (cyclomatic 14, cognitive 13): isRustPathCallReachable has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11542}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b7c8f7a2de548579ee225902c2ebef5a56614d54b897ed65bab515dd9bdc73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classMemberType (cyclomatic 14, cognitive 13): classMemberType has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18e7c42e41dafa8255a5390e20d8ae7949ad15b20e72192e80e93d85eca24e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accessorClassOf (cyclomatic 14, cognitive 13): accessorClassOf has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b487c19eb684646f326adcafbdaba5b2a3af2cc90d110e26be6e5dc6054d8b05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasValidSession (cyclomatic 14, cognitive 13): hasValidSession has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"telemetry-dashboard/src/auth.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f9df7f72a142e7de0f62f8b3ca591504be11641299f166a6865b0b0aab881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hoverPill (cyclomatic 14, cognitive 13): hoverPill has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf71151af7bcb392db9d35b9d5ec47c31713e8488fb9ee7f92915ef78d7cf7f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packStubs (cyclomatic 14, cognitive 13): packStubs has cyclomatic complexity 14 and cognitive complexity 13; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4412e602c1f85e5690e4f5015404adf7903c692d0b62d7e6350ef6d50617b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordCppFnPtrBinding (cyclomatic 14, cognitive 12): recordCppFnPtrBinding has cyclomatic complexity 14 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f24c78e64422d2af5d9379db5779824e015f8554185fa9231b13d2adbe4a766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFallbackEngine (cyclomatic 14, cognitive 12): makeFallbackEngine has cyclomatic complexity 14 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/mcp/index.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a84ea2f00faef7b72cf9843ac68b1095eb1b7e76d1384c33b9f001065223a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registryEntryNames (cyclomatic 14, cognitive 12): registryEntryNames has cyclomatic complexity 14 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"850395afde7dc1de5714c6708d5ae48bf85768ecd1a8538e4860417bad20b4bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triggerWords (cyclomatic 14, cognitive 12): triggerWords has cyclomatic complexity 14 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138d0c34848999fe197487d771f2417836e342eab552c671f7939256174d097"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitRustTopLevel (cyclomatic 14, cognitive 9): splitRustTopLevel has cyclomatic complexity 14 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0156c79611b531cc3f067f75bc12c6b6ce7002c830c0d251080751ffb11a1aca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaAncestorNames (cyclomatic 13, cognitive 42): javaAncestorNames has cyclomatic complexity 13 and cognitive complexity 42; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5622d05e934de20818fd56454e8178b6447b9f5944e09ba14d9512c497899d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportsOf (cyclomatic 13, cognitive 35): exportsOf has cyclomatic complexity 13 and cognitive complexity 35; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28815cac28dc18d0e0601bc4584e6b9028210225f768d18c2ae683a2a707c1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rubyClassMethodOf (cyclomatic 13, cognitive 34): rubyClassMethodOf has cyclomatic complexity 13 and cognitive complexity 34; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9034}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd461b7010c3595939b0dc1baf4424e6f276cb91253ea3dc71a18cbda141687"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankGoCode (cyclomatic 13, cognitive 33): blankGoCode has cyclomatic complexity 13 and cognitive complexity 33; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e4e51f6021c682d68acfd53e3e48ac5d47d817e2bb58a3976bff857b734aae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shape (cyclomatic 13, cognitive 31): shape has cyclomatic complexity 13 and cognitive complexity 31; 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":"__tests__/ui-steps-program.test.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd4c77946149b92f87b1b3176ed2a74f5517925f5d016693090c142735bcc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importersOf (cyclomatic 13, cognitive 31): importersOf has cyclomatic complexity 13 and cognitive complexity 31; 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":"src/resolution/module-importers.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab3ca51efff441499ba114de955fee4b5948309fb0707769d52fc712ea88c3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanTomlStatements (cyclomatic 13, cognitive 30): scanTomlStatements has cyclomatic complexity 13 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":"src/installer/targets/toml.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"018459c2d35d090015ea811ae00056c59f44bf68c81f6858d4c969ed884266b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arkuiRouterEdges (cyclomatic 13, cognitive 29): arkuiRouterEdges has cyclomatic complexity 13 and cognitive complexity 29; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"635f6eb560430b0efd569816398ecf88f77262ff6e32967ac5bcc3547a0b0355"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartFieldType (cyclomatic 13, cognitive 29): dartFieldType has cyclomatic complexity 13 and cognitive complexity 29; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea93b13198523ac04118fef21e25b55dd787c44f7edc027784b1f8eae3cd2107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaredValueParameters (cyclomatic 13, cognitive 29): declaredValueParameters has cyclomatic complexity 13 and cognitive complexity 29; 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":"src/resolution/type-parameters.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f290726233781d83f0c7d70836d4575e69ced2cf61381f58fd982f6cf8e129c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTsTupleContractNames (cyclomatic 13, cognitive 28): extractTsTupleContractNames has cyclomatic complexity 13 and cognitive complexity 28; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c26c2a13d39519f6e17c5e960a27f874d4f3d0ef2df40cfdb3ca6d71d112eaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expoCrossPlatformEdges (cyclomatic 13, cognitive 27): expoCrossPlatformEdges has cyclomatic complexity 13 and cognitive complexity 27; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f92f19c96cb90152f72db2bb8b58f16c02f78bf02e04c50cc0bfc2e4e084df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractEnum (cyclomatic 13, cognitive 26): extractEnum has cyclomatic complexity 13 and cognitive complexity 26; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"822277ad314728424a2f2877fed2541d9504ddd79d01178d1b7ed660c4d9ec10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 26): (anonymous) has cyclomatic complexity 13 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23497}}}],"partialFingerprints":{"codehealthFindingId/v1":"08004bd06b0703a7190172154ce4609f0ee4139dd8d2b62b2e28b604414513e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeTestCallers (cyclomatic 13, cognitive 26): summarizeTestCallers has cyclomatic complexity 13 and cognitive complexity 26; 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":"src/ui-server/api/node.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d781ad42dfdb3c5c2c8f28c080ec9a8213d749a411dee9e75e7b0bcc58613e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providerSelectionFromExpr (cyclomatic 13, cognitive 25): providerSelectionFromExpr has cyclomatic complexity 13 and cognitive complexity 25; 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da09bb937db392f217305a4ca6b3b69dfedeadc372540c195164264c5f756c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairQueue (cyclomatic 13, cognitive 25): pairQueue has cyclomatic complexity 13 and cognitive complexity 25; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686d7f0ad7d27a8e41640915ee3327c363bdd9a1d12ade8321bb2d5789ceb13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyTsClassMember (cyclomatic 13, cognitive 24): classifyTsClassMember has cyclomatic complexity 13 and cognitive complexity 24; 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":"src/extraction/languages/typescript.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0450e2cc47cdef5a9232db88c7499afab4940e09affece8d504d0470e6a74d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arkuiStateBuildEdges (cyclomatic 13, cognitive 24): arkuiStateBuildEdges has cyclomatic complexity 13 and cognitive complexity 24; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"49576caa13ce4488b3e80edfbd112b91e40ed1902ff3211ab441098fd56b3193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function childProcessBindings (cyclomatic 13, cognitive 23): childProcessBindings has cyclomatic complexity 13 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":"__tests__/child-process-windows-hide.test.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c6c04d0ef753ae83affdf754b73d5d76f278f05b2a6b45b8a91126fde768b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDecoratorNames (cyclomatic 13, cognitive 23): collectDecoratorNames has cyclomatic complexity 13 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":"src/extraction/languages/arkts.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cebc5451717a1f3172b3372f433b09c3c82d0c9f78df57d4285c1b2855ad05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vueRouteTable (cyclomatic 13, cognitive 23): vueRouteTable has cyclomatic complexity 13 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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"846e6d0d3f9cbc64ef6233cd15f835d8afb32c7593f1eda2b11d8e240d2258a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swiftPreviewSpans (cyclomatic 13, cognitive 23): swiftPreviewSpans has cyclomatic complexity 13 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":"src/ui-server/api/entrypoints.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b195b7948efd927248e1110b1fb1542c5c159ba1ecf752aeba4a7fb47082e006"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupRelations (cyclomatic 13, cognitive 23): groupRelations has cyclomatic complexity 13 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":"src/ui-server/api/wire.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bcd349dd0317173d4daf28a2d97879ba12a1802279b0cbd07d0f23faa143ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tagAttrValueNode (cyclomatic 13, cognitive 22): tagAttrValueNode has cyclomatic complexity 13 and cognitive complexity 22; 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b68d32d6eb86a6e074e8d4494f228cf0ce310019b618125dca603b60ff51c67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routineNameEnd (cyclomatic 13, cognitive 22): routineNameEnd has cyclomatic complexity 13 and cognitive complexity 22; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c915ab88725ad01c0c6cf5c7431088f56ed03f1b20198b3a0e6fc659f67c95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDaemonPicker (cyclomatic 13, cognitive 22): runDaemonPicker has cyclomatic complexity 13 and cognitive complexity 22; 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":"src/mcp/daemon-manager.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5e3667390224eda59948fde95c40022021d3f8933723fed13ab4a3855bd27e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function svelteKitLoadEdges (cyclomatic 13, cognitive 22): svelteKitLoadEdges has cyclomatic complexity 13 and cognitive complexity 22; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4d4db8fa2d5a614a0fe313afdb231398d3c60d5e7c013c88fd3a65847c0af2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function celeryDispatchEdges (cyclomatic 13, cognitive 22): celeryDispatchEdges has cyclomatic complexity 13 and cognitive complexity 22; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76767ad6870d2d75822a7ee9cb7b34a1b425b85b8ce3e5f82573db286e5758e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCDesignatedMacroArgs (cyclomatic 13, cognitive 21): blankCDesignatedMacroArgs has cyclomatic complexity 13 and cognitive complexity 21; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"94935d3db3f2cc58706fb194ab76715708415368a495a4e28961834931eb4305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goScopesOf (cyclomatic 13, cognitive 21): goScopesOf has cyclomatic complexity 13 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66410de0b857ac1db9dc2ed6863c8ba20c55bf2aeaca4f9b840fc9edbe0cad9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowCapSvg (cyclomatic 13, cognitive 21): flowCapSvg has cyclomatic complexity 13 and cognitive complexity 21; 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f3176b931b6ffd341f888e94b78ffac4ce4d94e3e6a007c47abe529b1e2d74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFrameworkChangesSinceIndex (cyclomatic 13, cognitive 20): getFrameworkChangesSinceIndex has cyclomatic complexity 13 and cognitive complexity 20; 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":"src/index.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc6cd14a5ce91f22691fc52f604188e67a8abdd84f777a30580d48cdd23732f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usingsIn (cyclomatic 13, cognitive 20): usingsIn has cyclomatic complexity 13 and cognitive complexity 20; 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac94529530ed99abea5f44509a48cc5173f2c6e89eaa41c33b8664b87d56d8ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closingParenthesis (cyclomatic 13, cognitive 20): closingParenthesis has cyclomatic complexity 13 and cognitive complexity 20; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b08bef21b78e001edfefbbea9cfd0a723b6e03bd7e1f5528f27a00643245a4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSignature (cyclomatic 13, cognitive 20): readSignature has cyclomatic complexity 13 and cognitive complexity 20; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"28295666a60179fd3c93450ed91845fa66c10efdaa41f88ce4f4ef00560287ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callResultType (cyclomatic 13, cognitive 20): callResultType has cyclomatic complexity 13 and cognitive complexity 20; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c94325f9eba4bfaea430c19fb70bedd57920b080cbf0aa1b00ceeb25dd51fec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function backfillFully (cyclomatic 13, cognitive 19): backfillFully has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/db/wal-valve.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d846b9073016c7e4776bd3c181bd2dc215a0ed69c098ea3f599e3238adea38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memberShape (cyclomatic 13, cognitive 19): memberShape has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1733b6c45d34239d6c0b9a9325625c7cac34b1eb3c8248294fd0e032043d33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDirectiveTokens (cyclomatic 13, cognitive 19): readDirectiveTokens has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3219e6eab2b838830a4cc9a2b653d468cee8af2c60c8c1e69a962ddd112c8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathSegments (cyclomatic 13, cognitive 19): pathSegments has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa6ea616edf46240807c99b338ebe073339ab6234fffab200abc1348e40c8ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 13, cognitive 19): detect has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec946dd3aad6f17f59b622446d6c559dddd07a4616c7e48870760a98e66bf60f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonAttrRetryCandidates (cyclomatic 13, cognitive 19): pythonAttrRetryCandidates has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/resolution/index.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e44d18c86886ce6555590b0cb58ae56895a23d38b8375be812173fd336480e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustAttributesBefore (cyclomatic 13, cognitive 19): rustAttributesBefore has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10242}}}],"partialFingerprints":{"codehealthFindingId/v1":"151ed94ddad5230c1e70b9bb0156cb15befca7f416e6a504dc898c24d73ad881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickDefaultDepth (cyclomatic 13, cognitive 19): pickDefaultDepth has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/ui-server/api/map.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d739d213e2ce6cedb63cf0f685aaab6d13ae4fb7cfe3e2741e7201825eba9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function itemFor (cyclomatic 13, cognitive 19): itemFor has cyclomatic complexity 13 and cognitive complexity 19; 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":"src/ui-server/api/program.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcb0a9e08def9b792eefd640530a24c217daa35f5c7d18df7a3844ad3cd8551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkPascalRoutine (cyclomatic 13, cognitive 18): walkPascalRoutine has cyclomatic complexity 13 and cognitive complexity 18; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9127}}}],"partialFingerprints":{"codehealthFindingId/v1":"613d56dc9664a89f267eb6c3d17bfde57a7f51766307ef7fa145b0abf057a2ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exploreCompletenessNotes (cyclomatic 13, cognitive 18): exploreCompletenessNotes has cyclomatic complexity 13 and cognitive complexity 18; 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":"src/mcp/tools.ts"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"182e5e3eca54f530ba722532e585a73f6709c3c1b13f7108de3fa1101bdb12b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getCodeGraph (cyclomatic 13, cognitive 18): getCodeGraph has cyclomatic complexity 13 and cognitive complexity 18; 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":"src/mcp/tools.ts"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"174e12abbc39dc74873681f8eda8539d907475752ab35903ef69702d646c8352"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dropGluedTemplateHoles (cyclomatic 13, cognitive 18): dropGluedTemplateHoles has cyclomatic complexity 13 and cognitive complexity 18; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c429a1cb329a136fda13751a0a78ecc45662ace717c8a8d515aad4e5c5ecd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSearch (cyclomatic 13, cognitive 18): buildSearch has cyclomatic complexity 13 and cognitive complexity 18; 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":"src/ui-server/api/search.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1316e152925bd187f61f2432cbd6acd17418a3ea920ecceec47b651e7298720"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fencedLines (cyclomatic 13, cognitive 17): fencedLines has cyclomatic complexity 13 and cognitive complexity 17; 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":"__tests__/explore-cross-call-dedup.test.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d154bed7ca0a411832c8a5c3da8716bfff94bb4718ffdd92462f41589ad7d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitPyFromImportRefs (cyclomatic 13, cognitive 17): emitPyFromImportRefs has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f96d6e33e654662e95821c520bd321f3b89d8d26782bcbba473f6bebe666158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guardsForFileSync (cyclomatic 13, cognitive 17): guardsForFileSync has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/graph/branch-guards.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbb4f94ad44fb18504f919a1f029b34757d39d3b5b3f9ba829791e16482dbc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function childrenOf (cyclomatic 13, cognitive 17): childrenOf has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/installer/targets/hermes.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a23cf594b64613e7bced1ad4453820d810b0030e6b89d2a0196d864da89c82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aliasTarget (cyclomatic 13, cognitive 17): aliasTarget has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9eb037e05a8b7cd720e9c795bd8bd7b62e419e9b57ec6240597be4929d2d78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProxyMatcher (cyclomatic 13, cognitive 17): readProxyMatcher has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d76c508cae37d970455fe0801f19b48683e549f91366ff0f71f0229dd64be46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileCrossFileNodes (cyclomatic 13, cognitive 17): reconcileCrossFileNodes has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/index.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c22ae08efc5b24e88ffe9b13db2e94030dd2329810158c90e4afea67ea47297"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartAnnotationAt (cyclomatic 13, cognitive 17): dartAnnotationAt has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e607efc2b3b5643d770dcad16b316853754c6292bf01e6b2c41c7ba66741c115"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppMemberMacroArguments (cyclomatic 13, cognitive 17): cppMemberMacroArguments has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9d6e278e4e1b3685d6ba8c7e313188a387cc33a0de507fe121105bef887c98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinReceiverDeclaredType (cyclomatic 13, cognitive 17): kotlinReceiverDeclaredType has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":22002}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf80b49c302ac2a39c08229240b8199a08907f04edd0792c5ff6c69cc433c2a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchHttp (cyclomatic 13, cognitive 17): matchHttp has cyclomatic complexity 13 and cognitive complexity 17; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abfb86c3dae222f67a06d75b0f6f7abb06c181c65fe121bfcb3e50d53c6220e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatAllocation (cyclomatic 13, cognitive 16): formatAllocation has cyclomatic complexity 13 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":"scripts/agent-eval/parse-run.mjs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a417b131f595b049795e4b065b753ce32cb86c181c6daac05cfb7c458417ff0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkCsharpTypePosition (cyclomatic 13, cognitive 16): walkCsharpTypePosition has cyclomatic complexity 13 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8591}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fd5f3dd8ef37f5bd4cb967071235b64c35bf3c8d9fe50ad0bfc0a46bf2b9c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 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":"src/mcp/tools.ts"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6542b122e54fe9fe9943b7aef66ffe9d6b4e56e57586f0c21aa1ddf4210033f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustModuleWithin (cyclomatic 13, cognitive 16): rustModuleWithin has cyclomatic complexity 13 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10576}}}],"partialFingerprints":{"codehealthFindingId/v1":"521f2ee8f6cb853604e804a62ab10ed572a532f34a8810d529161f09746d70a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosingOpenParen (cyclomatic 13, cognitive 16): enclosingOpenParen has cyclomatic complexity 13 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13959}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e117816435b9588154d794d045a368e5c3b929f46407d28cce7475f2e1ba800"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function edgeBetween (cyclomatic 13, cognitive 16): edgeBetween has cyclomatic complexity 13 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":"src/ui-server/api/flow.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfff95be3d55c0b17cb67922eed6e6ef10e627cbd68149b96b76eb1d621fa5ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBareScriptCfml (cyclomatic 13, cognitive 15): isBareScriptCfml 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a48c4b64b3f9e005f23e6cf3974cf2f98e9a580b50f717b9ce3bbc8f75795e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leafClass (cyclomatic 13, cognitive 15): leafClass 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":"src/extraction/syntax-tokens.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f3c775259b002a1d8a1630e73e3bce43d54ea0c989560c5aa9c7c16cc9923"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dfsRecursive (cyclomatic 13, cognitive 15): dfsRecursive 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":"src/graph/traversal.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"759d2df6dafcad3f1ff71b62a05ed28d0cb108e5b734faf6a680b6bb2c8d98be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeHandlerAt (cyclomatic 13, cognitive 15): routeHandlerAt 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3cd25c9347c7f5d202e915057626b789d46ec4a273babb4d22fea077e4546d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchBracket (cyclomatic 13, cognitive 15): matchBracket 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":"src/resolution/frameworks/object-literal.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8790e9f6750920b444c1515ebc78a5f457e39123786706c2532c5310bde48af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lazyModules (cyclomatic 13, cognitive 15): lazyModules 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d25bf011b351f9b7e216b4900a3e2ed8b3659d6e308e4ab2eb2fd911b6cc5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJavaOutsideImport (cyclomatic 13, cognitive 15): isJavaOutsideImport 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23b57fbc170063bee879e2218437928e51648ad160b101b1bcd25e1dd9a9377"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaLocalDeclaredType (cyclomatic 13, cognitive 15): javaLocalDeclaredType 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14755}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d53e8d5044e497a7c4ca0c15278a33eea4ca4a3594f39ebaa1ff5d53fe7198"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustLentCall (cyclomatic 13, cognitive 15): rustLentCall 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29732}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06adb21c195f2283924bb459d532f2ffc21d90d033262c155c42f74f21ab455"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHierarchyModel (cyclomatic 13, cognitive 15): buildHierarchyModel 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":"ui/src/lib/hierarchy-model.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2824b437fd7b0f66dcab9b11e5eab15b45ca4eb512320acde980b11b2a0c0d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCReturnTypeMacro (cyclomatic 13, cognitive 14): isCReturnTypeMacro has cyclomatic complexity 13 and cognitive complexity 14; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d56ecf800234b5501c86950b2daaee059be04d2aada5eb5a8c0b5a841450d71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callSiteInTree (cyclomatic 13, cognitive 14): callSiteInTree has cyclomatic complexity 13 and cognitive complexity 14; 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":"src/graph/branch-guards.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40d68bbe84bb655e40954368b207420c205fdd9f6133555edc98c15ebb3012b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swiftCallShape (cyclomatic 13, cognitive 14): swiftCallShape has cyclomatic complexity 13 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2c8ee358d83daff92092170cb412a59a83997ed44ad1e11464ca71e43fa28d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callReceiverKind (cyclomatic 13, cognitive 14): callReceiverKind has cyclomatic complexity 13 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14051}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8b7f1f2440e1c1a111e17162ad90cd8a50cb16b9f640f5b434d195e3bc5055"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goBareTypeDir (cyclomatic 13, cognitive 14): goBareTypeDir has cyclomatic complexity 13 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26611}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da04b8c308a4fecf8e1a5a3789dec493f9ee63c988fc8595f12105a4cf9f6fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":32343}}}],"partialFingerprints":{"codehealthFindingId/v1":"460902da333bc436eeb6a2cf261dca1ed01aeb586eded9818d17d02573a2f021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverCppMacroDefinedName (cyclomatic 13, cognitive 13): recoverCppMacroDefinedName has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2119cf55ec3844a823cf4b8efd886addd75cbb85617ef1be9a3070a8e426b1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closesParameterList (cyclomatic 13, cognitive 13): closesParameterList has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7ff71c60d3bda6af6a66e82214c9b5c689c4394ec27e9f76317a2a77d5e471"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function learnPascalVariable (cyclomatic 13, cognitive 13): learnPascalVariable has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9683}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2ccb33492ad836a6cecc8dc1b818dab5a04acd7a9215dc60468516c8f4cf31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/mcp/tools.ts"},"region":{"startLine":5519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d828e965fd3bb4b6e5b6011fa865e1b62fc96f9e5cb53f11e79ca72a4f3cd379"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDecoratedFixture (cyclomatic 13, cognitive 13): isDecoratedFixture has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc8387147208b3d90f4bd3d24586fd5048b4d61f911dec0ef3aed1f04a1d9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objcSupertypesOf (cyclomatic 13, cognitive 13): objcSupertypesOf has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f31ae45dfe169437e19a13f6bf4d0d1892b816efe59ee63b82cdb52a657d3e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustModuleItems (cyclomatic 13, cognitive 13): rustModuleItems has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":10493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c15ee291f45557811e50330a3cac7711f76f40a5997fb8824dd729ed310d5c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveObjectLiteralBinding (cyclomatic 13, cognitive 13): resolveObjectLiteralBinding has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15412}}}],"partialFingerprints":{"codehealthFindingId/v1":"995ba46ef83dd437aa63070bd88cf2a6809d1c1a1fceec84e8c18798db262637"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppUnspelledReceiverCall (cyclomatic 13, cognitive 13): matchCppUnspelledReceiverCall has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18793}}}],"partialFingerprints":{"codehealthFindingId/v1":"985feac501839a0dd845f1cb02a823993cacf85fb4b57cd3d2c57b0e7a069c26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppTypeCategory (cyclomatic 13, cognitive 13): cppTypeCategory has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1016c6e239824d24a6fdc86784855c1954a52b69f97a2600b31f9b6fa5d538a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpParameterList (cyclomatic 13, cognitive 13): csharpParameterList has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/override-parameters.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f4b2a452eac591cbcbe26d0d8c1f4fd7417b710135a3d551dca3fa1c21279"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatePascalDataCall (cyclomatic 13, cognitive 13): gatePascalDataCall has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d996bd1bf3319851a85f95af25c205c916624a76faac87ca4dfdd3582da600b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0312c4d98c0336443071eb994b2ce3a6b6ca646323bd33a6bac5c13f561ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsStringAt (cyclomatic 13, cognitive 13): jsStringAt has cyclomatic complexity 13 and cognitive complexity 13; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"324ff4a426ee6bf14bf728f48c0b3adcbcb5c3e098b0873214c6cc6eef1c2c55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classHeadSupertypes (cyclomatic 13, cognitive 12): classHeadSupertypes has cyclomatic complexity 13 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23087}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0d43fdbb0fea92fea483841bccbf47d869d58c3dd628ecf93cb00a6c23d872"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsAliasedType (cyclomatic 13, cognitive 12): tsAliasedType has cyclomatic complexity 13 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30499}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7e6ccb9fa9e0c5b5effe5a245daba1df64c85a8f47ca0a42d84bf7d51f58b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2238095a58832f7296b6268d8f8d3618465e6554d41f15db6fb7c49ea9f79469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declarePascalInline (cyclomatic 13, cognitive 11): declarePascalInline has cyclomatic complexity 13 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8985572ae3d4bbcfb1927fb47536161aee28e885dafeba6f5f3bd0e52ff80c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextProxyFor (cyclomatic 13, cognitive 11): nextProxyFor has cyclomatic complexity 13 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/next-proxy.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"392e40d2d2fdbd2cf31ededbb8c3c44bd46b7497e284925d2f256be387687698"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppWrittenTypeIsLibrary (cyclomatic 13, cognitive 11): cppWrittenTypeIsLibrary has cyclomatic complexity 13 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18041}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fddc8b8904a2da0dab7d296d910358bd49ae735771bc157798e297bbf05ec1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustGoCallTarget (cyclomatic 13, cognitive 10): isRustGoCallTarget has cyclomatic complexity 13 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6660}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ef84cf3244d019f1fa7be0b6d25dc983a80d592f1b38582924bd153d0f55eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppParameterType (cyclomatic 13, cognitive 10): cppParameterType has cyclomatic complexity 13 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19530}}}],"partialFingerprints":{"codehealthFindingId/v1":"283d593275bce038425e42ca0c67f5ebc21a7fcdf80c910c64977b1cdaf04eae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accessorClass (cyclomatic 13, cognitive 9): accessorClass has cyclomatic complexity 13 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/ruby-constant-paths.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e24812e46c2fb1738c588f8f7899671a7a7d8686ee83033957aca4b7be74b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaStaticField (cyclomatic 12, cognitive 32): javaStaticField has cyclomatic complexity 12 and cognitive complexity 32; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21510}}}],"partialFingerprints":{"codehealthFindingId/v1":"47178396796c38794e714adb44fd3de3ad03c8fb5ee0973d3712c78c41c92dfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBody (cyclomatic 12, cognitive 30): resolveBody has cyclomatic complexity 12 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":"src/extraction/languages/javascript.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bcd5b07202bc9c2892cd6288afb46fd08a0c6b0c72c6ac0efd82a3a4776981"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBody (cyclomatic 12, cognitive 30): resolveBody has cyclomatic complexity 12 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":"src/extraction/languages/typescript.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"38314989144dbb45c272cdf84d8fb7300d9da8cbd46efd03372c464a57023bcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankStrings (cyclomatic 12, cognitive 29): blankStrings has cyclomatic complexity 12 and cognitive complexity 29; 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d775ee9df35b526e54f8960830c5f9772216f98c73987df06082737105f236"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findInheritedClassMethod (cyclomatic 12, cognitive 28): findInheritedClassMethod has cyclomatic complexity 12 and cognitive complexity 28; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23063}}}],"partialFingerprints":{"codehealthFindingId/v1":"adad90c0f8fbe16f6e6f54689b7d0f776406e8c4c916c9a51040dfde56dec8a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitModuleProvidersRefs (cyclomatic 12, cognitive 27): emitModuleProvidersRefs has cyclomatic complexity 12 and cognitive complexity 27; 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d6d48cb02ad51399b54997a1ff4416e93f014365969e2e991bd9d37936c601"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeGroups (cyclomatic 12, cognitive 27): routeGroups has cyclomatic complexity 12 and cognitive complexity 27; 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"950205b30c4a1ee22b3f00ebe414fe117f4810380e729f5fedca14d9b84ed0c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 26): (anonymous) has cyclomatic complexity 12 and cognitive complexity 26; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14164}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ac78ea5478319ed795ee182d4d777e05a5dda827db09e40aaab235efb29410"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTagOccurrences (cyclomatic 12, cognitive 24): findTagOccurrences has cyclomatic complexity 12 and cognitive complexity 24; 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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"054b1eaf7d70b2794c8f3a9778d28c441cc846867880b72078d27d038d2f9e18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 and cognitive complexity 24; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e22f7ed62b24d411c127cdc945d6e695f5745062b0cbe7ed62219dde2cb547"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinExpectActualEdges (cyclomatic 12, cognitive 24): kotlinExpectActualEdges has cyclomatic complexity 12 and cognitive complexity 24; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"608ba9fd61f320e8b93d255676f128d8cea1de767e63afd4a844a287daa854fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNestedGitRepos (cyclomatic 12, cognitive 23): findNestedGitRepos has cyclomatic complexity 12 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":"src/extraction/index.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e06468d6a464241276cbe025c38d662f44cb3575a0ee0ca994240c0c43f0556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFileRefs (cyclomatic 12, cognitive 23): buildFileRefs has cyclomatic complexity 12 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":"ui/src/lib/filecode-model.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da78025d4111b15a1b64ebc50aad39f709df68970e9e713c0669f5f5ea019bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPath (cyclomatic 12, cognitive 22): findPath has cyclomatic complexity 12 and cognitive complexity 22; 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":"src/graph/traversal.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc05ab900ce11bcd435cff7ed5f07fc29448c50e341012fb2ff30ab605ce7bfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flutterBuildEdges (cyclomatic 12, cognitive 22): flutterBuildEdges has cyclomatic complexity 12 and cognitive complexity 22; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b331d3b4ed7236a155c1c300f7851d40e2cdf923f72e0f7954a72b41f0437d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluginDefinitions (cyclomatic 12, cognitive 22): pluginDefinitions has cyclomatic complexity 12 and cognitive complexity 22; 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d219c480ebddc9b1d73dc18c757f7849dea17b06db7fc94ae371adc34e3c2630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statedDefaultExport (cyclomatic 12, cognitive 22): statedDefaultExport has cyclomatic complexity 12 and cognitive complexity 22; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73cd85ea2790f0bf353f61c31a97315323fa6727bd325845e5446ffe4bd383e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanned (cyclomatic 12, cognitive 21): scanned has cyclomatic complexity 12 and cognitive complexity 21; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd0d2b68e3dead1bdff12b24493eae95786443f85245a461f622aed63a9803"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sidekiqDispatchEdges (cyclomatic 12, cognitive 21): sidekiqDispatchEdges has cyclomatic complexity 12 and cognitive complexity 21; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4665}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48007310fdf3a2454cca25804241352297c2921cf88ae19ee0b64b0025a0874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHrefExpression (cyclomatic 12, cognitive 21): parseHrefExpression has cyclomatic complexity 12 and cognitive complexity 21; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c027031471cad19b3aac60b939efb4f92ce56cb8ed9af8272ae9cb162f7d3efb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFabricNodes (cyclomatic 12, cognitive 21): extractFabricNodes has cyclomatic complexity 12 and cognitive complexity 21; 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":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8c043ff2b397799cfb8dd5dd7f9fbb9888782e5431bb1945c11bb9b101724b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function includesOf (cyclomatic 12, cognitive 21): includesOf has cyclomatic complexity 12 and cognitive complexity 21; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b166d8e520b843bec6a3e46f54a41e0c1c8424fdc48f187d1e614bd914b4a3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"8606125758051bd58f921fd3c6aed908cf74dbf6ded08e0e183227e73fd0f811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupSegments (cyclomatic 12, cognitive 20): lookupSegments has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5860a80e164e4bc3e25b03ed9b0b0bc6e5260c13a2e34019ee99f092d09b8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function angularAppRoot (cyclomatic 12, cognitive 20): angularAppRoot has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a60f0daa441dbb68f32fd13d5ce2aa40a5de5cd9cfe823ff9c74ff888bfaf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fastEndpointConstantRoutes (cyclomatic 12, cognitive 20): fastEndpointConstantRoutes has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/frameworks/csharp.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3917799e56dea0c5decb060fc6d517c5258875f899b357aa543b920b989730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppClassParenDepths (cyclomatic 12, cognitive 20): cppClassParenDepths has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc3f4a349c2745c09c888ab259995c5e21bae3eddf390aa8e7885b4509ca277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppProjectScopeNames (cyclomatic 12, cognitive 20): cppProjectScopeNames has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18447}}}],"partialFingerprints":{"codehealthFindingId/v1":"64948cc51548178bc7932da2e756f1ad54e089594bc46cb23a05211b9c7d26bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppStructuredBindingType (cyclomatic 12, cognitive 20): cppStructuredBindingType has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ecc2057c538b54d4279ff1ce17c3071739c30f73b2ece365ef17525b42e058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppTypeWrittenAt (cyclomatic 12, cognitive 20): cppTypeWrittenAt has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20654}}}],"partialFingerprints":{"codehealthFindingId/v1":"365cd67ae5484d9b4cb6dec75737028fbdda42a4464cae8cfed6b3c225cbdbf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonBoundInDef (cyclomatic 12, cognitive 20): pythonBoundInDef has cyclomatic complexity 12 and cognitive complexity 20; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9eff99a669494ac413faa4781b8e8d549e44ce983d711b1b5bc62355e97013a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatContextAsMarkdown (cyclomatic 12, cognitive 19): formatContextAsMarkdown has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/context/formatter.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"953daef6c17bd5f0706f7264d2ef34a4767eab1de252775b868d30888f947594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goScopedFnRefScopes (cyclomatic 12, cognitive 19): goScopedFnRefScopes has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/extraction/function-ref.ts"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9358389fcca5b726114828f5dd7ff2d6b16bca17f18480328ef4091a3785c168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanPythonGetattr (cyclomatic 12, cognitive 19): scanPythonGetattr has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/mcp/dynamic-boundaries.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4880481b951ae29e52ab4b85d2c2918c67c6566ca232073eb239b5b1eb32be22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateParametersAround (cyclomatic 12, cognitive 19): templateParametersAround has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"017cdc37d8f64c2c7c48ed801ffae5b4e5f3a22b7cd0ffd77b04276a2eb73e9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readArgs (cyclomatic 12, cognitive 19): readArgs has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9d229748b9e21babc38a64d765170bb6cd4f3241d00f6ed4fc38ffcc3ddfd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declare (cyclomatic 12, cognitive 19): declare has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a6057abb905b57cf27a33aba559d068c2bb57ada9a23d303d3e83e213c11ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDefaultExport (cyclomatic 12, cognitive 19): readDefaultExport has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"efed3aa0a5c56b6694f3ef767f42a955a3f5901f6b62a6637a704e376edce16c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonImportBinds (cyclomatic 12, cognitive 19): pythonImportBinds has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4905671564f28cf61be07f6f90a506c08e9b667bdda58b58b73d15e5ff6ed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluggedFixtureModules (cyclomatic 12, cognitive 19): pluggedFixtureModules has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4713}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dabc645cdaf3bb832ec041fe37442ad313cf8f0dba9f10f903feb6e9a2f987c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustUseScopes (cyclomatic 12, cognitive 19): rustUseScopes has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9975}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf25e6d45b5e44ee767235e64749035ad5169f28817b81b5f3b9604b9c726e00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppInheritedDataMember (cyclomatic 12, cognitive 19): cppInheritedDataMember has cyclomatic complexity 12 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":17395}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fb11296c88dfc3e6f74a92a5a8e76e3482b2bab0bdde55025146631ff9b200"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractImport (cyclomatic 12, cognitive 18): extractImport has cyclomatic complexity 12 and cognitive complexity 18; 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":"src/extraction/languages/cfscript.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"391d48f4d200ea384ba4773df7915e3c33c1738922fe3c16bbbaa09b9d44dcd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractRtkEndpoints (cyclomatic 12, cognitive 18): extractRtkEndpoints has cyclomatic complexity 12 and cognitive complexity 18; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3726}}}],"partialFingerprints":{"codehealthFindingId/v1":"6793da65356d536b376118602a770c467c57e4417fbc534cabe01ce06e918598"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rootTemplate (cyclomatic 12, cognitive 18): rootTemplate has cyclomatic complexity 12 and cognitive complexity 18; 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe7b3b6ca6eae63e31db049d72ff733aa283dbebc4f294176b4198a99f97a5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextRouteForFile (cyclomatic 12, cognitive 18): nextRouteForFile has cyclomatic complexity 12 and cognitive complexity 18; 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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"521c5c9264daea752ecc4892b7b5ab586c4c05be2495d81c0338c1aa691bcc3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppBasesKnown (cyclomatic 12, cognitive 18): cppBasesKnown has cyclomatic complexity 12 and cognitive complexity 18; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18483}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fce23bb606ed42b9d0abdeeb8653100ca37d944f3fd7192e89a8c325f8230a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldModuleRows (cyclomatic 12, cognitive 17): foldModuleRows has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/db/queries.ts"},"region":{"startLine":5915}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd66f0eee2a1aaaaa3edfd292158015eb692e4eb9213702e09bfb73667f91127"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTagExpressions (cyclomatic 12, cognitive 17): extractTagExpressions has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"186097faa7d34f21497d055fb979b57fe509f23649775e5fedb9601a48f61404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinSwiftCompositionContinuations (cyclomatic 12, cognitive 17): joinSwiftCompositionContinuations has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/extraction/languages/swift.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd13cdc7bfda768516acee35162d23215edd6d88d1b2309aedb7a8ac0bd4530"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKeyPart (cyclomatic 12, cognitive 17): parseKeyPart has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/installer/targets/toml.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"651725a56eb209ff3cfca422a1e5738b820d5ecfd606ef5afead7eb2a0099828"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mentionsPath (cyclomatic 12, cognitive 17): mentionsPath has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/mcp/tools.ts"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaaccf6e1b7bb81df44ce59d53d1d757f399d1e7bb2a03a1a4c40989e975b24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveInclude (cyclomatic 12, cognitive 17): resolveInclude has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a49fe89b8c9fd059ea906e3772aff3cadc93216121bf7e0730a3629ec6eb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endOfStatement (cyclomatic 12, cognitive 17): endOfStatement has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fe048877676d68395326f8f00a88d758350e22bf49d9e76bc4178b0547ea33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCfmlIncludePath (cyclomatic 12, cognitive 17): resolveCfmlIncludePath has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/index.ts"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c3075ad3a2d0314a5c63f73222a91cae9099246d6cebc7dd60dd1e1863664f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartReturnType (cyclomatic 12, cognitive 17): dartReturnType has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5849}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea88ae9c9546bd1bb03b50d0076ad3d8a7b1d50c1d98578cb9ef7c6e553fe11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goResultText (cyclomatic 12, cognitive 17): goResultText has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9a764665058c56bee86be0ce4919b394fed217be572ccf0f1b3603a0b3d504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRustSelfFieldCall (cyclomatic 12, cognitive 17): matchRustSelfFieldCall has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29834}}}],"partialFingerprints":{"codehealthFindingId/v1":"4599ecd8f99076fab50d5c08466e742bd1e8ddbe50910d61390a40256dfd5027"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchDestructuredStoreCall (cyclomatic 12, cognitive 17): matchDestructuredStoreCall has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be50c794f696b42231b1d43160ede02e24259f4eddd9d53e56e6a17263a2ffd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function linkWrappers (cyclomatic 12, cognitive 17): linkWrappers has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/resolution/react-router-synthesizer.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a671ecee3b1378c98ea37db3ecdb4b1e50a508986070fff0fbbc3326514fa209"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collapseSharedChrome (cyclomatic 12, cognitive 17): collapseSharedChrome has cyclomatic complexity 12 and cognitive complexity 17; 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":"src/ui-server/api/screens.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5dba26cf2a56c2895abc21ce75071cdb6fc83e505cd0773dc29cf2cfc79ef6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTemplateCalls (cyclomatic 12, cognitive 16): extractTemplateCalls 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":"src/extraction/vue-extractor.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf805febd5b81c9eda6298c28c5e77c33d50b989ebb5ad326bf3f40b90b85d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 16): resolve 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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef35a8e0d2bb53e37831ff5717245dbe109c0df4a5e39dfcc95a2764019e72a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goHeaderBlocks (cyclomatic 12, cognitive 16): goHeaderBlocks 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a38be7783135065f8c37888e5bf8a52077014649a8e178e8f8ced3a5db15b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isObjectMemberReachableByName (cyclomatic 12, cognitive 16): isObjectMemberReachableByName 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2967236be8e09fd0a24a2341d5c69376327b8a75dc80cadb5e6789d3456e60c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasParameterBinding (cyclomatic 12, cognitive 16): hasParameterBinding 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31555}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b21c3887c94de288e5de5347c6a610d7280c23b072f9473699733713b07286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function globStep (cyclomatic 12, cognitive 16): globStep 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"80287c28c3724216094f280cf77b899515b90e81b582e46cad18c52c303beec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushNow (cyclomatic 12, cognitive 16): flushNow 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":"src/telemetry/index.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"071b46969fa0bfa2a2b5f6e385e2e14396f44d12cd988f322bfa27f06de1682c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeRoots (cyclomatic 12, cognitive 16): routeRoots 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":"src/ui-server/api/route-roots.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3f2c19676407ccc136eba8e6b4f55ec07d7881d47ba7e8bc707ac253182806"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleExec (cyclomatic 12, cognitive 15): handleExec has cyclomatic complexity 12 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f40e1d74ad57bf89827f6959c0dc084c973a8d16a652eded21e2517ec65140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSignature (cyclomatic 12, cognitive 15): getSignature has cyclomatic complexity 12 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e55c3a4e17a72eb323e0ea5ac215a7eaf906e155787f437b4ec5159c2bfb769"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractRustRouteMacro (cyclomatic 12, cognitive 15): extractRustRouteMacro has cyclomatic complexity 12 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7369}}}],"partialFingerprints":{"codehealthFindingId/v1":"1940e3701303e538fe7a8a83b154ad708d9398c520c369484e3e2f537c101789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertCodegraphServer (cyclomatic 12, cognitive 15): upsertCodegraphServer has cyclomatic complexity 12 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":"src/installer/targets/json-config.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"78804939f658799b725728b5cb05ed19cee913248e2f4119d8d01d4b7a175e84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeWindowsProcess (cyclomatic 12, cognitive 15): describeWindowsProcess has cyclomatic complexity 12 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":"src/mcp/process-identity.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"413e1b020533de526866afaa5fc6005fd150131f4c25c1413c48bcbf554ae947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 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":"src/mcp/proxy.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8337332bf9e8803b8d1d84cf8a65616f3edbc2bb6e4e6c4cad1f37282f485f35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reactRouterTable (cyclomatic 12, cognitive 15): reactRouterTable has cyclomatic complexity 12 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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8af5b132bd82a5d5760f040c5554308456491bd6befafedb0dd14cf0d5dd231"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 12, cognitive 15): extract has cyclomatic complexity 12 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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d1abbf69b2756009b15d152be8211fa3b68cc2b79ec4e88596449eedb8b06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 15): resolve has cyclomatic complexity 12 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7c74cebba9dd40cce206b0eb99b2ce1c1e8146460608a7211197a421546836"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustWrittenQualifier (cyclomatic 12, cognitive 15): rustWrittenQualifier has cyclomatic complexity 12 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11057}}}],"partialFingerprints":{"codehealthFindingId/v1":"d380841aa5cb1e7063c123c2f2789b449ec8a099805c3a2c7229e21ae9c89715"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppPastTemplateArguments (cyclomatic 12, cognitive 15): cppPastTemplateArguments has cyclomatic complexity 12 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16721}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d55b476751af44745b8339a3259bd0168761091ecfd5ce90029a16e4aeade3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryKernelExtractRaw (cyclomatic 12, cognitive 14): tryKernelExtractRaw has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/extraction/kernel/index.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f00c777e461bdd59d7dae101d2930d12b7e131d6928bc53fbdbdb729da880a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCppDeclaratorAttributeMacros (cyclomatic 12, cognitive 14): blankCppDeclaratorAttributeMacros has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a5fe39b5f2ce857783d6b9f85cb46b12151e4df5ca4bdfa25cd2327fa95f5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addOptionsMembers (cyclomatic 12, cognitive 14): addOptionsMembers has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/extraction/vue-extractor.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a3768d7a2bdc49592fda0608f93a23b3d6311692d41b27f4235a4150b24ba0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function returnsInTree (cyclomatic 12, cognitive 14): returnsInTree has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/graph/branch-guards.ts"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac92e46439fcd4991833154d2a22468c8387b004298ba2cbfab2b218138933b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMessage (cyclomatic 12, cognitive 14): onMessage has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/mcp/query-pool.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ba1c820c585641f22cdacf31b6b6764dfef4404582ca846af15b562afdc5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStaleNodeSection (cyclomatic 12, cognitive 14): renderStaleNodeSection has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/mcp/tools.ts"},"region":{"startLine":8471}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba107b770c131696ecaabd3fcddaf2415b13ae5c1be1acdced55f41bfa94a78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipGroup (cyclomatic 12, cognitive 14): skipGroup has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ae1810c063b7ffaf717a80e28b92fb90344c1c36f0450dfe0acea2f9db2660"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arrowAt (cyclomatic 12, cognitive 14): arrowAt has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda953e4783f12cd6cfac52c41aa27d749e93d60dd94d0640916529cbd068765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaSupertypesOf (cyclomatic 12, cognitive 14): javaSupertypesOf has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5021}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a8aa407885136a556412b16b36293d3674c4f91915ef8dc45d8e9a3388fb25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function phpFileScope (cyclomatic 12, cognitive 14): phpFileScope has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":9261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38ed31b32bbdf1270cb7f7655e74eb329ba213086b31e85c3c8f6bc6510e82a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTraitImplHeader (cyclomatic 12, cognitive 14): rustTraitImplHeader has cyclomatic complexity 12 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4467cad13c78dca87e66232f2482df05f38b75a4a7a3ba8bcef856df8da58af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSignature (cyclomatic 12, cognitive 13): getSignature has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/extraction/languages/solidity.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6746c66e1ce9f92a4b39386c6d7d10b40146fa14062370eab1da3d2778572e71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 12, cognitive 13): visit has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/extraction/syntax-tokens.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e5539e51d302b100e477098e4eef67c91f816bb25209bd7cb59c4d26485900"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createNode (cyclomatic 12, cognitive 13): createNode has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1873dbefcc4cffe2c0ea27b2690e2c935e04500e90f3dcef7a97c10eb915a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractAggregate (cyclomatic 12, cognitive 13): extractAggregate has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec2ef39ac137cd8a1883dd8a9f0049058d9af1b33421030aad9ac71631751b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stop (cyclomatic 12, cognitive 13): stop has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/mcp/daemon.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d1e58e0831eb7651bc8221d074d7d1d3136024a69f741b70ec9407a8340d72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drain (cyclomatic 12, cognitive 13): drain has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/mcp/query-pool.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f5c01361a6470ebe44f516254df9dcad33ecb5a2dba78d0aceaab37f9d1ea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathsIn (cyclomatic 12, cognitive 13): pathsIn has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d6b099c43a6701c16d11853099ddd96f1bee5815bbe29d2b26c99a3f587ca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrappedName (cyclomatic 12, cognitive 13): wrappedName has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7766ea8708731708f2f74a1288f208834e24c4c0a13126607ba2cdad066505a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTsQualifiedTypeRef (cyclomatic 12, cognitive 13): resolveTsQualifiedTypeRef has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"d648b71e5014f2410cefcbc19e5b255b5043c850809ffb56ac10d6e95313e8fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartHeadOf (cyclomatic 12, cognitive 13): dartHeadOf has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90e1e8f4097f872ce707bd7fe5459f03413498c82c0732474d8caf30ed3654e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiverNamesOwner (cyclomatic 12, cognitive 13): receiverNamesOwner has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6876}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58dde1a355973403b4364e560d8d621f65844390e89ce36a5654285bdfebdef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swiftHeadOf (cyclomatic 12, cognitive 13): swiftHeadOf has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d3efad53174a7cc9a1f14b55fd5a3d651e14026936b7800a3a37638d3b7462"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goDotImports (cyclomatic 12, cognitive 13): goDotImports has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26579}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f23120d9d177e024458ecd871c5d129eb871fcad1c87468f6395b8af29dda1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsFieldRead (cyclomatic 12, cognitive 13): tsFieldRead has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30205}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef0da49ecc082d2ca71f25e997f3cee49e8ad12e976215bf1f6577cf7c1e942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44c7026b1f3408e7d4f8e0f1832b82b519319504463cf5e832439cce4068a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watchDirectory (cyclomatic 12, cognitive 13): watchDirectory has cyclomatic complexity 12 and cognitive complexity 13; 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":"src/sync/watcher.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e821d5a38225e00a8b036353d84e7734f4b7a63022af686e2eb8ebd5a66db2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeEvent (cyclomatic 12, cognitive 13): sanitizeEvent has cyclomatic complexity 12 and cognitive complexity 13; 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":"telemetry-worker/src/index.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b4bacc78ed87979ed1b47d5c2d89e5b6ae8bf55691a299aceeffb98ede4313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonDeepEqual (cyclomatic 12, cognitive 12): jsonDeepEqual has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/installer/targets/shared.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65d05f0286b71e0427bf38626a1195d794b8b88ffc621bc67720d37ba0ba65d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAliasBinding (cyclomatic 12, cognitive 12): resolveAliasBinding has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/alias-binding.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6eb2ea948854d0d2c1f0daee7e28ca37f0f4b8d76013aad82d112030d3ced5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isVisibleCppMacro (cyclomatic 12, cognitive 12): isVisibleCppMacro has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9695f723fc0cd6d06e189aef5bbe4da7ac3ddf1a3425e57c32ed88cac14070e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 12): resolve has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/frameworks/astro.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dab7510fe0f88dc2cda9d045b544cb3a9321690da588c5231a72384a098da4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function balanced (cyclomatic 12, cognitive 12): balanced has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cdd67a58f1e3a395c819bf87f5b5f9165eb5c9d5e893897b35a0fb6d6c4eea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constantPathValue (cyclomatic 12, cognitive 12): constantPathValue has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd1755a981e5a8b9d55845757dfd476a68156821dfc0cf3af79dfa292866ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutComponent (cyclomatic 12, cognitive 12): layoutComponent has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3f996a7785c4beda738a0677e9c38ce6f40ef2b2112139dd19dc3ef597bd89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"584b085266ff115861b920dd5c4196b6d359105acefc4f2fd1797ec4fee5c21b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goStatementEnd (cyclomatic 12, cognitive 12): goStatementEnd has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c84fdf1f218d9b81bc0d0bb162bfb013f701b7283b5a30e402facaf545e0776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinHeadNames (cyclomatic 12, cognitive 12): kotlinHeadNames has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908b783ed4b02902bea18425934b5d240b3764b16771ef411b19683dc57ca74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaFunctionFit (cyclomatic 12, cognitive 12): javaFunctionFit has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14901}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3925c1f9667c7ba5d4c1a714534ac51fcbd8946b3b28e3949e5e079fc850cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppPastInitializer (cyclomatic 12, cognitive 12): cppPastInitializer has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16707}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d10603bf470dc54dcaed215b0fed7df800df631d357d82bfba851457f5adb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustCallOnType (cyclomatic 12, cognitive 12): rustCallOnType has cyclomatic complexity 12 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29752}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f8cbf0adf1cc7e2356b7ece1c2eb682cc248a68abfd7bb018fd9777aac0f24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relayout (cyclomatic 12, cognitive 12): relayout has cyclomatic complexity 12 and cognitive complexity 12; 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":"ui/src/views/SymbolView.svelte"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e85db6e47f12ea0b73b497db5ee3cb5d191a74407c1e5039e8d9678b7a766f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commonJsRequireRefs (cyclomatic 12, cognitive 11): commonJsRequireRefs has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/commonjs-requires.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8518208a3a8004236c438e72164aec2a457111dd28cd55d8abf1ec1c58d9d051"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classFound (cyclomatic 12, cognitive 11): classFound has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"f174289b2436fbc493c2bb8cdd61e1bb4ec2bf426e48b26718117fff03050351"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routePathForFile (cyclomatic 12, cognitive 11): routePathForFile has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"acec1d7f2a33982d9f9c7553092e25f23e6d9e0550ec0d748b369f49217c7da3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractLegacyViewManagerNodes (cyclomatic 12, cognitive 11): extractLegacyViewManagerNodes has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12d9af8ce8d695ab5038a3c458c38cd506ee55d8b8bc5cb8a43774fac019084"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseObjcRNExterns (cyclomatic 12, cognitive 11): parseObjcRNExterns has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c2e37c58c360cdac397befb6473832dcb66b88952fb2a6e212d1340730bf87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateRustScope (cyclomatic 12, cognitive 11): gateRustScope has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/index.ts"},"region":{"startLine":4419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c19ca890f30a3482a47382ddc4605dd63b802ce444cb95703ce35b2a5520cdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaCalledType (cyclomatic 12, cognitive 11): javaCalledType has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":14832}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd47280152c42a42155cf66855a9f5ea4a2571ab72a04bcd5a4389cc8dfda6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppWrittenFindsOnlyNamesakes (cyclomatic 12, cognitive 11): cppWrittenFindsOnlyNamesakes has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea12b5ab7a38badc6073d0780d725a00a419772786903e225bdd2bd16cd11630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCppChainOnWrittenType (cyclomatic 12, cognitive 11): matchCppChainOnWrittenType has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab364ebe24479ea4e6980db690fd2ae2a0a8ab37182968e9ba3841709c16c93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppChainInnerType (cyclomatic 12, cognitive 11): cppChainInnerType has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20731}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab6241ea361470f9c12029aa1e5a4ed61e45818ddee3dd7dec0c4c8a9250d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kotlinCallResultType (cyclomatic 12, cognitive 11): kotlinCallResultType has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20965}}}],"partialFingerprints":{"codehealthFindingId/v1":"787e1e3a4ad0b048abf611e479e5bb31782532f8a9b5c8c4a0d2ecfa1e468661"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStatus (cyclomatic 12, cognitive 11): getStatus has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/telemetry/index.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9de67e77a381d26f9b7fccc68ece994d985a67488e211025bb38894ad4ed31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/ui-server/api/steps.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aefcc098b6499869a8a1fd5fd5199fb3483a89bba83dee03e4725a1721103c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ansiColorsEnabled (cyclomatic 12, cognitive 11): ansiColorsEnabled has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/ui/color.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5d40b771a5469c78b4891579decccdcc4863bf176f1b4c4e455e79f00e1be5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/lib/map-model.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19c6dfb77802cbb2676065b0c25f3713745206320a01b3b8b490c3c582600fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/views/ScreensView.svelte"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc8896e3162fe097207f818d3148386b6b77ef6b16a23d11154d57f9acc1d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ui/src/views/StepsView.svelte"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff7728a72fe626779a74dafebd7eef28f4f8a496a2408649dfc6e084634bf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanAnonymousRecord (cyclomatic 12, cognitive 10): scanAnonymousRecord has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e34394a48cf86cd2de6d9588b5099bcd89e4c828f73cf8aadec2150efd8e6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaratorBoundFunction (cyclomatic 12, cognitive 10): declaratorBoundFunction has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":7455}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffb8a25904e47e587b9a3a45dec286bc28a79d22512a0b84446c134c784ad45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushPascalChainCall (cyclomatic 12, cognitive 10): pushPascalChainCall has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9479}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c848b825745cb512c384c4dcb087d35e55c4e3e1a8c16d08a909d9ac88da6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppAliasedTypeWritten (cyclomatic 12, cognitive 10): cppAliasedTypeWritten has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"41571614947f7bcbcfed12e905b6ee8952cdd7b8466c76193e9112a1d4a82783"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustForeignImplCallable (cyclomatic 12, cognitive 10): isRustForeignImplCallable has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11515}}}],"partialFingerprints":{"codehealthFindingId/v1":"859c027e556d9e07d43a8a9d3d634c07f742717551e36c5f229d87b7f20bbe8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTypeParameter (cyclomatic 12, cognitive 10): resolveTypeParameter has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a01dab6425976153e591e8827e75a9f2bf3644dc230967ae6d6e6bc6567f50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDeclaredOutsidePackage (cyclomatic 12, cognitive 9): isDeclaredOutsidePackage has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/index.ts"},"region":{"startLine":4674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f308f56747a0020121abd68b06497fd23c91f3afb23f68e8b04e8c0c04cfd975"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCrossFileReachable (cyclomatic 12, cognitive 9): isCrossFileReachable has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f03b0eed0f182c42c677120f827d4782170ee52660230962b9ef85e0f8d9c77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCppNameAloneTarget (cyclomatic 12, cognitive 9): isCppNameAloneTarget has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4162e7978adf5266867350872fcf7c80a53905ea140a84c2cad68de8618e3dcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppOperatorTarget (cyclomatic 12, cognitive 9): cppOperatorTarget has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18140}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f6b421204143e5e5e534291f6104b166dc59d5203ea5d8b9754b7ee55357bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goAssertedLocalType (cyclomatic 12, cognitive 9): goAssertedLocalType has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25981}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8df3892e6dc2311b25e433815149ac2d5dbe12f5e359304c795989824ba179"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goAssertedType (cyclomatic 12, cognitive 9): goAssertedType has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb13e0af41c0f11c9c8586b0d0e13b71341913f5b8f9da2a2bada9115a58dc06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function destructuredKeyTarget (cyclomatic 12, cognitive 9): destructuredKeyTarget has cyclomatic complexity 12 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31443}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f177a42bc90560564cdf7a9230fb784c82abac7ae3df21cc47f470c3066e57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openBlocks (cyclomatic 11, cognitive 29): openBlocks has cyclomatic complexity 11 and cognitive complexity 29; 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"61953fac7d6bffc1aff10daef88a5e4cafa17bb8a3f4905b9e49354acc628df4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSupertypes (cyclomatic 11, cognitive 26): getSupertypes has cyclomatic complexity 11 and cognitive complexity 26; 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":"src/resolution/index.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b635cd7230ffedc5258b3b786cdf33f87c1d32c0d8a2152e4e3b95de726a2755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRetryableFailedImports (cyclomatic 11, cognitive 24): getRetryableFailedImports has cyclomatic complexity 11 and cognitive complexity 24; 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":"src/db/queries.ts"},"region":{"startLine":4978}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e0a1e1d9cb586b02579a4faa124203263ff5fb9dd6fcb4237d9a05b534c1bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outrankedImports (cyclomatic 11, cognitive 24): outrankedImports has cyclomatic complexity 11 and cognitive complexity 24; 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":"src/resolution/module-importers.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c7d0777e3c1b24581f990fc9a618f572554617382a1abba283710586fa7bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 11, cognitive 23): read has cyclomatic complexity 11 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":"src/resolution/jsx-code.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"33223a36b891ecb09491cf03a8a7323409a5fe39363342af99d3e937695cbf2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inheritedTypeNames (cyclomatic 11, cognitive 23): inheritedTypeNames has cyclomatic complexity 11 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c274cff6476ff43ee5a01d01f3b3338ee5f27c10946a9563c098b6755fba6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipTemplate (cyclomatic 11, cognitive 22): skipTemplate has cyclomatic complexity 11 and cognitive complexity 22; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d64a84f7d1c18433853de07d5805cf6c384958106575dd1fcec5431a946d0c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaAnonymousBases (cyclomatic 11, cognitive 22): scalaAnonymousBases has cyclomatic complexity 11 and cognitive complexity 22; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7720}}}],"partialFingerprints":{"codehealthFindingId/v1":"63689e52a58e37a279537ddb2edebaee47bd9713c7cfa5e0f1ce531d64cc2aec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateEnd (cyclomatic 11, cognitive 22): templateEnd has cyclomatic complexity 11 and cognitive complexity 22; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9455258753ddede6a9a7bc343ddf775ae6bd1c35130c1fc3e7c2f7ced1df3cf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spanTags (cyclomatic 11, cognitive 21): spanTags has cyclomatic complexity 11 and cognitive complexity 21; 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fce59543e34d94e676139c071236117ee60468a97cc85fb1c5cfc5b78235ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scalaReceiverName (cyclomatic 11, cognitive 21): scalaReceiverName has cyclomatic complexity 11 and cognitive complexity 21; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7744}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff8d432dd41de951802a1b21d99f3ec49180b871db2a8b44c4f654384662807"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function written (cyclomatic 11, cognitive 21): written has cyclomatic complexity 11 and cognitive complexity 21; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feb69f696d1fc61258175ea265b52990b19a7c8a3bf9bcfbd3a3802d212b263"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installGitSyncHook (cyclomatic 11, cognitive 21): installGitSyncHook has cyclomatic complexity 11 and cognitive complexity 21; 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":"src/sync/git-hooks.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81c6dbb8039e493d0cbae76b11804a7a2a4729e8ed4888f22a0ee5b2753aa67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 11, cognitive 20): restore has cyclomatic complexity 11 and cognitive complexity 20; 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":"__tests__/installer-targets.test.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4bad90947b9df623232a83f49ace16313639ef22145a23e3ba42dcac05759f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 and cognitive complexity 20; 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":"__tests__/ui-steps-api-servers.test.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183ea2d47055ea13725ca83f4c500e02d920915c3a77363643e5f8a5da729c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitModuleWiring (cyclomatic 11, cognitive 20): emitModuleWiring has cyclomatic complexity 11 and cognitive complexity 20; 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"415828a28a100066665adea26c317eb8b223494e38dce8f5e6d07070c21f6da1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPiniaSetupBody (cyclomatic 11, cognitive 20): extractPiniaSetupBody has cyclomatic complexity 11 and cognitive complexity 20; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":3933}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda12e99b091949a439041052362ae912f55caba2421227818b9fde0a2d9332e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstall (cyclomatic 11, cognitive 20): uninstall has cyclomatic complexity 11 and cognitive complexity 20; 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":"src/installer/targets/claude.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6b8fd5bced42690944fbfd4d612234c0499eb3eac24bd5de535dc9dfcf536f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchParen (cyclomatic 11, cognitive 20): matchParen has cyclomatic complexity 11 and cognitive complexity 20; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f5395655c14676d6024ea995e4cff8f20d466ad5d684e5871a800405c7716"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyAliases (cyclomatic 11, cognitive 20): applyAliases has cyclomatic complexity 11 and cognitive complexity 20; 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":"src/resolution/path-aliases.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8eefd18e832f1a97bead347ed413c0c0c42b7c730eea46142d24e2e0381d41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeParen (cyclomatic 11, cognitive 20): closeParen has cyclomatic complexity 11 and cognitive complexity 20; 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c6ded8c4a2d3e1c8629430fbf2ac6536090d2b409be4419fc263283be9ead6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getVisibility (cyclomatic 11, cognitive 19): getVisibility has cyclomatic complexity 11 and cognitive complexity 19; 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":"src/extraction/languages/csharp.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"804eec4f03064a7c2522950df0eb85f8669a6c48fe73971ec8c3aa3a08c922b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findAmbientModuleExport (cyclomatic 11, cognitive 19): findAmbientModuleExport has cyclomatic complexity 11 and cognitive complexity 19; 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"980d252deb7cd378ade6e96714a7e8283249d858208bde722a31a8cf5d2b4f18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPostExtract (cyclomatic 11, cognitive 19): runPostExtract has cyclomatic complexity 11 and cognitive complexity 19; 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":"src/resolution/index.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea742f596c5b479078038e0947bdf4a361aba216e95ad095ece0dd6adbd82ab9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function javaFileAncestors (cyclomatic 11, cognitive 19): javaFileAncestors has cyclomatic complexity 11 and cognitive complexity 19; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21388}}}],"partialFingerprints":{"codehealthFindingId/v1":"591a56f931083a5cf062da2a4084e67b1bb69fd738898c7e24a3c7d17373e243"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vbCode (cyclomatic 11, cognitive 19): vbCode has cyclomatic complexity 11 and cognitive complexity 19; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a7bd4b4d325bd3755c5a86bacc3b11075f79f543c011d416eb56e78776a52f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectMemberTypeNames (cyclomatic 11, cognitive 18): collectMemberTypeNames has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59ac17cb9045c4e5e787da187cf9dd1e677639c7eb3fe164b64ac6ba82b7357"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCCplusplusGuardBodies (cyclomatic 11, cognitive 18): blankCCplusplusGuardBodies has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d76c400fbdc015d4c0fce9fec124578944b6fd3027e91d3cb851ccb955ec7ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitReferencesInBody (cyclomatic 11, cognitive 18): emitReferencesInBody has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd06ddfc378d0aa73f44730628d142f9ff4de7b38109b1af20f22a81146aa9b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchDelim (cyclomatic 11, cognitive 18): matchDelim has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4795c6ce2bc4069e9af35c8535c68621e03e6ccd4d3ba8e5012859f56eb80be2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 11, cognitive 18): extract has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d860ed0f901bbdc9ade4633f494d08799a02090c0be67a150393aec5fa8dcb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loaderOf (cyclomatic 11, cognitive 18): loaderOf has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"731b3fbde52bec79e9e49f1e4e3c2bca298468623fd24e6d385afcba2f03ca19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chainAfter (cyclomatic 11, cognitive 18): chainAfter has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a931d707ab5c69cbbcaff1ff3f3b68cba5fa0302b7cf0d4ddbcbff739ce42c93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustBoundsOf (cyclomatic 11, cognitive 18): rustBoundsOf has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ef7f76dff348f2a24ef4d5476e3d4bbad2be5432f3e73e1c1ff2b2e343e5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ancestry (cyclomatic 11, cognitive 18): ancestry has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"80244cf8cc54989289a5c3e2f88ef32bbb67ad0f7e414acb5e93b9019de431ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toWireLines (cyclomatic 11, cognitive 18): toWireLines has cyclomatic complexity 11 and cognitive complexity 18; 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":"src/ui-server/highlight/index.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e1e36597840436c02c30ae8e28e59f6ced5e0ce1209df094c1582f67575ec6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractDrupalRoutes (cyclomatic 11, cognitive 17): extractDrupalRoutes has cyclomatic complexity 11 and cognitive complexity 17; 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f358ae4a6f22c9c21307eb4678dce5c1dde1f8e83b0b22e20c5f7d09dca5366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c3f5b04823a3afb1b4b1cae913fe6473d9906b3bfcb318701113b870e2124"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppClassScopesAround (cyclomatic 11, cognitive 17): cppClassScopesAround has cyclomatic complexity 11 and cognitive complexity 17; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":18910}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a3dde46de158da0341436df9ff52dbe9654f487bb97234d5ecd667b266b9af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCalls (cyclomatic 11, cognitive 17): buildCalls has cyclomatic complexity 11 and cognitive complexity 17; 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":"src/ui-server/api/filecode.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"399fd5d743175fffb847cbcfd628d6ff0b5bb054788eca2849eec917f5d054d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listenWithFallback (cyclomatic 11, cognitive 17): listenWithFallback has cyclomatic complexity 11 and cognitive complexity 17; 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":"src/ui-server/index.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"286c6d551e7527777fc42c0fd47dc34bc8c7b08fec1021078b5aa0d68b9afbd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenEndBefore (cyclomatic 11, cognitive 16): tokenEndBefore has cyclomatic complexity 11 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7f7b4199cf64f2fea31fa478c51039741b069c53316ba58b348a635e482c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitImportBindingRefs (cyclomatic 11, cognitive 16): emitImportBindingRefs has cyclomatic complexity 11 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5039}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ded05219e3b4ddc27132cda2c9d6b7537dd5c41a72088157652fb8e6fc00b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppSameStemHeaders (cyclomatic 11, cognitive 16): cppSameStemHeaders has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8482a4bedac60e490ef3c6193eaa12f30f3857a3f4971c0f978c4b6890b387ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustUseBindings (cyclomatic 11, cognitive 16): rustUseBindings has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52783086d9172ac2507d82fb98dfa86690b53252ba873158a229cd41573d91d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goTypeSpec (cyclomatic 11, cognitive 16): goTypeSpec has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27471}}}],"partialFingerprints":{"codehealthFindingId/v1":"668ffcf5a38f03abff06176a598d27d52e5c59841eaa8cf349d439ab774f9f47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchDestructuredCallInLiteral (cyclomatic 11, cognitive 16): matchDestructuredCallInLiteral has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92c5d988ec3c198a4aa8cbff89d412d58c12ac956bd8a8359418ebd59c31c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNpmPathDeps (cyclomatic 11, cognitive 16): readNpmPathDeps has cyclomatic complexity 11 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e933c2b6302875f26de294ad0a38240222ef5727f32a304e05406b615170de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedEditDistance (cyclomatic 11, cognitive 16): boundedEditDistance has cyclomatic complexity 11 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":"src/search/query-parser.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566381819a983aedcde78a39953b893bda918064e889bcd7c51297a76a94dda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 15): walk has cyclomatic complexity 11 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":"src/extraction/index.ts"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"2630d04575deebedd874ce3288afaf0c8a591f083e2ef1d00dbcfa298e23eee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitParams (cyclomatic 11, cognitive 15): visitParams has cyclomatic complexity 11 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":"src/graph/branch-guards.ts"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86555bc471b8c23264105071b2e3fdd92b530e47611112770872d592731c68f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 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":"src/mcp/proxy.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aa6ec17ace1f56313a60b19107738bb012ea0dc26a65dc64af9985f36a3223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swapWriterLock (cyclomatic 11, cognitive 15): swapWriterLock has cyclomatic complexity 11 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":"src/mcp/writer-lock.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab3ccfcb0d7a9bdf274b177f475824e218f8d55c3fb0e07099d660db380399"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDartDirectives (cyclomatic 11, cognitive 15): readDartDirectives has cyclomatic complexity 11 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e34ecb81a2cb787cb40af8e94b39526f787856d51fb798ff1daede02f354c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lazyComponent (cyclomatic 11, cognitive 15): lazyComponent has cyclomatic complexity 11 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f938ec9d2c6818b3d95e387a6dabe44e06c2b0592499f8a3499456f45988869e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlerCallNames (cyclomatic 11, cognitive 15): handlerCallNames has cyclomatic complexity 11 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1832edf33071e3930039d2d5e43c098dc325a7e733f154ae4076bcbe95b6a3b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartGroupOpen (cyclomatic 11, cognitive 15): dartGroupOpen has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6038}}}],"partialFingerprints":{"codehealthFindingId/v1":"140e864a8c74cd54977e06da43af22cfdb69f0473776f12a21dfc7cdcaf88be5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustOutsideTypeCall (cyclomatic 11, cognitive 15): rustOutsideTypeCall has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":13281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb01a7bd5616362e58d05353d38a885c4a912c69cf1d2b50b9f6c11a8d578013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonAttrCallOn (cyclomatic 11, cognitive 15): pythonAttrCallOn has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28680}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc03c5279ec28cfe6dbe496b93b5ba3d88f5e5923c8f9ad499464cff177558"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustChainedReceiver (cyclomatic 11, cognitive 15): rustChainedReceiver has cyclomatic complexity 11 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":"src/resolution/name-matcher.ts"},"region":{"startLine":29690}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dd9c02329fac5bd0836e55fe22d98bc36784f596186fcb2442f97bdcd77763"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 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":"src/search/query-paths.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b101e01db4e6ac8ff360f5ee12e8ab2e0d8f0bbc202a122ea05874e4cdf2a6c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 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":"src/sync/watcher.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec132e1336d6ca35252f616ea9bbb7f8308932625716e2d26ffcb301f25a2a43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closesAtEnd (cyclomatic 11, cognitive 15): closesAtEnd has cyclomatic complexity 11 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":"ui/src/lib/conditions.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f97df6944f31cd3437af441490068e2845164827388c38bd07284b3913d2708"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSubgraphTree (cyclomatic 11, cognitive 14): formatSubgraphTree has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/context/formatter.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81b22cfee961cf9af2453a4ff17cfc3f0b0ceeac04bd5143c576a3a04c17b83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchNodesLike (cyclomatic 11, cognitive 14): searchNodesLike has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/db/queries.ts"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a461b99819ad2b58c54a00216581631cb6bfa4d38e2ab91d71c635e5c8e028ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankCppExportMacros (cyclomatic 11, cognitive 14): blankCppExportMacros has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ca894d3b8a439f6448cad9d2f8f7962d013fa338153fc782472179d99e1fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pascalAssignmentTarget (cyclomatic 11, cognitive 14): pascalAssignmentTarget has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":9911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9467300000f843a894401340293d9363d74fe3108360ebd3ee389b630186ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innermostAt (cyclomatic 11, cognitive 14): innermostAt has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/graph/branch-guards.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"685d594fe5462cfbccf9f4361829d83caf7a597e0c35c6c713cc37715d7c8c88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchOverrides (cyclomatic 11, cognitive 14): matchOverrides has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/graph/type-hierarchy.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6149e32c863af33a91c8ec3ad91071264a42507f476c2792b66d8f15d8b6d717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listDaemons (cyclomatic 11, cognitive 14): listDaemons has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9cc91cf4944b7d92aaafde74e5267e13dfe83aca5b3c2ebcae83c7aa026812"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryInitIfNeeded (cyclomatic 11, cognitive 14): retryInitIfNeeded has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/mcp/session.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8b87db0731e5d99fc87188f575e470ec7d7ef7bd28fcb17fce8d82cb41ee09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 11, cognitive 14): extract has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31e0e755eba11568d117fd9a5d4481d36ec615a40b1359cba9ad2ee4405f9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 11, cognitive 14): resolve has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"15468d37d1802101877781d68840d241f125da738a16983b83b304a7f1ea8fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 11, cognitive 14): resolve has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5053c4d1611155a2df695a082bcefc516d8f063c5b910d5e9a2db5fc09976e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractGoImports (cyclomatic 11, cognitive 14): extractGoImports has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e48361144ec923eedb4811bb88820a8b3a4b43129864896b8ead5738da3b85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regexEnd (cyclomatic 11, cognitive 14): regexEnd has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/jsx-code.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9a54c85990846d46b4c5888393cf96fa092974d0db9cd424f5bfcc06b51901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openElement (cyclomatic 11, cognitive 14): openElement has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/jsx-code.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d6e7391ff805163c66a6775e6fadb7f6bbe545c3f7d96a62abdf895155b4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fitsPythonCallShape (cyclomatic 11, cognitive 14): fitsPythonCallShape has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4660}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0db977b4a397c86a3fef7c28bc03b3c07145d9201c09a0569cfa54e7dcae9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustTrailingCall (cyclomatic 11, cognitive 14): rustTrailingCall has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11994}}}],"partialFingerprints":{"codehealthFindingId/v1":"0959e4e366e619bb670e2ddd6f113e61d07697d0efb2aa8cd68ccdbaf0900ea6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveObjectPathMember (cyclomatic 11, cognitive 14): resolveObjectPathMember has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":15940}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf0e68b97e2231ed7e40891f8023c014c4ce8f2d0b5e7894bd19d3090f5a6ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppPastBrackets (cyclomatic 11, cognitive 14): cppPastBrackets has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16685}}}],"partialFingerprints":{"codehealthFindingId/v1":"9727c974c0cc051a357c22422091ebe28c52bad7fd47f0e555e876bf82e2cf1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppNamesBroughtIn (cyclomatic 11, cognitive 14): cppNamesBroughtIn has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20035}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a2df2fd860c02bdf1effc2ec22da8e2299f225f6433897d47cee624d18416"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goPackageClause (cyclomatic 11, cognitive 14): goPackageClause has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":26202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1146273509b1d955c6026606df91b1e998b4db3de5f0415189927baa0cf465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonTargetBinds (cyclomatic 11, cognitive 14): pythonTargetBinds has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28011}}}],"partialFingerprints":{"codehealthFindingId/v1":"568385b24d571e2334d1f3a11e7aa9a00dc81a6b011084c9955fe24b2d5ba955"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsFieldOnLine (cyclomatic 11, cognitive 14): tsFieldOnLine has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edd0f5b588f151bf56c38767eaeb22046bdde38080841f12af94925803dccc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsMethodUpChain (cyclomatic 11, cognitive 14): tsMethodUpChain has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":30434}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ffe1bcbe9a3a0e80c7459ec22f0f04e4bb6fb5e485933f21f3e485347ff157"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unitFilesOf (cyclomatic 11, cognitive 14): unitFilesOf has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090532524611e04dca42cd3781d97c5c0947f1fbfe726c2f9ce44d6fbd4a9c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHead (cyclomatic 11, cognitive 14): readHead has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6335b82e8c1b3972621289ed66224bbf0be464e310cdcd7c9b948e2b8453415b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb8ff9cf94dce31ad378c83a9cc91a29aa74e413de9d2a2f051607d67bd4a12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeBindFailure (cyclomatic 11, cognitive 14): describeBindFailure has cyclomatic complexity 11 and cognitive complexity 14; 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":"src/ui-server/index.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ed100b8dbd8cb3d9bf2db6e4e5e04c059f4f37d8b60468b36e86ced3f127b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layPill (cyclomatic 11, cognitive 14): layPill has cyclomatic complexity 11 and cognitive complexity 14; 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"158b3aa7250012cd8b1f14b466f4d02bdb1b09c44a0394feb5a178fe8d8c5d60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reactComponentHoc (cyclomatic 11, cognitive 13): reactComponentHoc has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48cd730d57301b6fd3f178944e4883a30606c721a46f1b223e7c2d17a63e178"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitRubyRequireRefs (cyclomatic 11, cognitive 13): emitRubyRequireRefs has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":5193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e87d45025a1f1fba1ec1eb191f7e4c40099b2e129ce990672bbdfd36b18cf7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkPhpTypePosition (cyclomatic 11, cognitive 13): walkPhpTypePosition has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":8676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b86abd7cfa0a9588c2c6df5c78df4012b14e58da1e373b49a347e82f7df6351"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortlistBoundaryCandidates (cyclomatic 11, cognitive 13): shortlistBoundaryCandidates has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737c9804142fbc7c978ca397a888bf07f37e8be3871d1aa9c04fba7436cda27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitPlus (cyclomatic 11, cognitive 13): splitPlus has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ce2760e1043e9eddb2bb22c78e8e281cc0ebae542c8ee9001233dab8d3dc6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMappingPaths (cyclomatic 11, cognitive 13): parseMappingPaths has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a96a1b09a080b2634e920ac3d87262fe24e99cbdd9c73cb7d1680a9702da960"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectEntries (cyclomatic 11, cognitive 13): objectEntries has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c9c2e367680d94e3eb5882b7f85334346220c58a91104d52a2c217125d62f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namespaceDeclaringFile (cyclomatic 11, cognitive 13): namespaceDeclaringFile has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb65c20495ac1ef442f458d114e5b683098880956f414a2188e8f84621d391d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 13): (top-level) has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/lru-cache.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e35856045d99478505d8f02baee95387555bb9ef71f538034ae922b130901c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeDartPrefixedHead (cyclomatic 11, cognitive 13): typeDartPrefixedHead has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":5778}}}],"partialFingerprints":{"codehealthFindingId/v1":"848230f160d5d2980fc87713dadb3c664f538d67df3b97b18951f9b93ea95ea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustNameFromStd (cyclomatic 11, cognitive 13): isRustNameFromStd has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11234}}}],"partialFingerprints":{"codehealthFindingId/v1":"975488d15064321ca46c5ce3dc95a5997087ebc043d02d760056b1a90cb5d91f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustFutureOutput (cyclomatic 11, cognitive 13): rustFutureOutput has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":12659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c3d7d479aa48bb7871a6ae5db3136081de134818e187868ac374267cc4eb65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tsImportedTypeFile (cyclomatic 11, cognitive 13): tsImportedTypeFile has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21141}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e2b1d9cc605d678df866357ae364dce7cbb8a1c0410ca246659ca0baf1096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsBindingAt (cyclomatic 11, cognitive 13): jsBindingAt has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23975}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4fe69dca17b2ff19e2f348188c0b782cb49c1d65e6ed52f8773d713a8c04e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchSelectedStoreCall (cyclomatic 11, cognitive 13): matchSelectedStoreCall has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ade9ee6823e133a30711b8e74c606015d2a12ac94be25d5bc85c379366e66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathRelevanceQuery (cyclomatic 11, cognitive 13): pathRelevanceQuery has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/search/query-utils.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"924044eaa8c80b4b32dcc4955372d1a0a0999ed1492ee026b861e634c38993a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFlowQuery (cyclomatic 11, cognitive 13): parseFlowQuery has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/ui-server/api/flow.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"12622cb124b5d9876ac5f0180397fd67f935eae4e88f2ce0a6871f4ae6671d43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickDefaultRoot (cyclomatic 11, cognitive 13): pickDefaultRoot has cyclomatic complexity 11 and cognitive complexity 13; 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":"src/ui-server/api/map.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2b33f24edbfc185751ebd55ff5cffcafe5bea0396aea2ad84c5a5a1a694e8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPanel (cyclomatic 11, cognitive 13): drawPanel has cyclomatic complexity 11 and cognitive complexity 13; 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":"telemetry-dashboard/public/app.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0840c0c467d530273bb58c2fa3b161faa8b1979a7b1de3c72b28256aec2cd6fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessage (cyclomatic 11, cognitive 12): postMessage has cyclomatic complexity 11 and cognitive complexity 12; 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":"__tests__/query-pool.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acd5fd4e008c310cd6ab36216007c9d57355c9cc43363a435582c015b16056d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callOn (cyclomatic 11, cognitive 12): callOn has cyclomatic complexity 11 and cognitive complexity 12; 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":"__tests__/ui-trails.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d130caa5c4042ce6ac7308f2862cc2595351cf4b0746b96431aa5321dae31a2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffSets (cyclomatic 11, cognitive 12): diffSets has cyclomatic complexity 11 and cognitive complexity 12; 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":"scripts/kernel-parity.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecba0d78f2fad7c5f47e6c6485cd520e8108d7a80251eb139cca1f731be30053"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopOlderDaemon (cyclomatic 11, cognitive 12): stopOlderDaemon has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d738bf4ba049546b0b2c5bb863f61661597a1db5810f46bf71e8f94f5cdd15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearStaleDaemonLock (cyclomatic 11, cognitive 12): clearStaleDaemonLock has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/mcp/daemon.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"9858de38c082465fda9597376f04a01408effc6354b7a897a772a2b543c5c9c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleImpact (cyclomatic 11, cognitive 12): handleImpact has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/mcp/tools.ts"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"62664c69a8361e45fe0680d4e828344125eb1c96e680a4309115b5d353638f05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/mcp/tools.ts"},"region":{"startLine":7299}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa900896474e487916beda69ed96e9597fcc57f7b7cae2aacfd04dabaa5d2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localAliasedType (cyclomatic 11, cognitive 12): localAliasedType has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cf1f24ba656a54b8d0af6721c960b78d17600e960c4abd4c798e76ce0e067b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAnnotation (cyclomatic 11, cognitive 12): readAnnotation has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"52867477c0a1d6e357d1c04052d040336480b13434c23f06d8318bf41b16a258"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blockEnd (cyclomatic 11, cognitive 12): blockEnd has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6914c2493aefdff010cec1e6b9155325364d156e4d4f1e3f7a2a1b3e176f48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 11, cognitive 12): resolve has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c2c507df6e392e419b2ed8085a266c833c2ae90c2a9d478f11945f4cce641a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveJvmImport (cyclomatic 11, cognitive 12): resolveJvmImport has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f58b482fcce1bafc8b6d3c78866eea8199bd9759d9666640538749849f82c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonGlobalClasses (cyclomatic 11, cognitive 12): pythonGlobalClasses has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd585c70f0e4aed6a18ca17184ae18a9589613c93aeac7846ee75fb6485d2d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"feac18e760f3acaf07f153c112019ec2b7c139b2d95dc8eb6191dd6fe93b709e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goHeaderValueEnd (cyclomatic 11, cognitive 12): goHeaderValueEnd has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":27662}}}],"partialFingerprints":{"codehealthFindingId/v1":"564f5083bce404a40d8efd3c8ee94db5b6bd03c59cb5066ee5feb21e8c6fcf68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDecisiveSameFileMatch (cyclomatic 11, cognitive 12): isDecisiveSameFileMatch has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":31725}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8817d47658d98b1b5b33345fe8848361c57a1af5121b662691c906be08d194"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportedTargets (cyclomatic 11, cognitive 12): exportedTargets has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0ceb9d28e513fcd1d906aee4d1bd679453636e93a3a95c40c4941881b41abb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 11, cognitive 12): send has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/telemetry/index.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c1010f722eba446b57cbcd5edf17a104fb1fcfc8691a20f37ee654c7461729"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFile (cyclomatic 11, cognitive 12): buildFile has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/ui-server/api/file.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb6caae60c5a1c8a9c4503ae37b60dd3d99ec2f49d1d55cbaa82e3ec3442c46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryAcquire (cyclomatic 11, cognitive 12): tryAcquire has cyclomatic complexity 11 and cognitive complexity 12; 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":"src/utils.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a731a3d08b986ed8f6bd21368daf743aade926c3cf1c58489a26c335e940ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfHealBundle (cyclomatic 11, cognitive 11): selfHealBundle has cyclomatic complexity 11 and cognitive complexity 11; 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":"scripts/npm-shim.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e886097726ec6af589e56bdec94999850488d7b47d0e394112cc4a7e1546030"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preloadLanguagesForFiles (cyclomatic 11, cognitive 11): preloadLanguagesForFiles has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/extraction/index.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2739b635f94155f258d9387893659b5b55746ac80fae277b4906588a2bec4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshFrameworkDetection (cyclomatic 11, cognitive 11): refreshFrameworkDetection has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/extraction/index.ts"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c401d7c21553dea3e272dd5648291ffce291238e15ac71f667006e632069f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syntaxRegionsFor (cyclomatic 11, cognitive 11): syntaxRegionsFor has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/extraction/syntax-tokens.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"891713a98197d9dc181c2588ab8dd294433551daf0dcea16396b8dbe13ccf186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeStartPool (cyclomatic 11, cognitive 11): maybeStartPool has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/mcp/engine.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f460c0e508fe980376289c3f8f92a7aab9a9f078acd9ee242e2bd765443f8eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/mcp/tools.ts"},"region":{"startLine":6099}}}],"partialFingerprints":{"codehealthFindingId/v1":"a323deff8d8ac31051ae949f22e92311ab5e100e00dd47229d35aa741c9cd075"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/c-feature-variants.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d5a0c9adf0cf4e2bc20712601b549be1f23bab28543d9b4b677fb870793e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isConstructorHead (cyclomatic 11, cognitive 11): isConstructorHead has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96eef91760490993af401a5bb95dac55c48e2ec6da23c59b6ea958b999525c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nthArgumentText (cyclomatic 11, cognitive 11): nthArgumentText has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4c0951cb200822052661e50b1d7070dcb40f3bcaf6b50576bdca1d9002514a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJvmViewManagerNodes (cyclomatic 11, cognitive 11): extractJvmViewManagerNodes has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/frameworks/fabric.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"48291957ce3b64d09908ab1801c7767929680633d562fcf5940427356845830a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonGlobalMembers (cyclomatic 11, cognitive 11): pythonGlobalMembers has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f6b985bed75d97220bc57278de7f1859e57b79ec6a982b1350e75983bd91da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartTypeArgumentsEnd (cyclomatic 11, cognitive 11): dartTypeArgumentsEnd has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":6026}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9752cf1e39b64d75737aa8ae406bfef72e5b508ce478d3785365289ac38c418"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isKotlinPreconditionCall (cyclomatic 11, cognitive 11): isKotlinPreconditionCall has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7003}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bdc1eae61c9c8fb1759c73ad733e2b9e6fbd2e50bc5b3bd21bc5ba228c77c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csharpGlobalUsings (cyclomatic 11, cognitive 11): csharpGlobalUsings has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9513738f11567f1e796cf2cffc705d81f3c9c2f4c9adb8476659487d5fee6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCppCallResultType (cyclomatic 11, cognitive 11): resolveCppCallResultType has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":20347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aefe8997237577edc4ee14cab155c42eb9fd3d29c5a9908bed2b68bafbe8ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pascalNestedRoutineLines (cyclomatic 11, cognitive 11): pascalNestedRoutineLines has cyclomatic complexity 11 and cognitive complexity 11; 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":"src/resolution/name-matcher.ts"},"region":{"startLine":23275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1464c0776d3c8e094a4d68a8079807e25c98714a3cebbf45686620b070e7d21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isLanguageSupported (cyclomatic 11, cognitive 10): isLanguageSupported has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/grammars.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5b5dd47b1d7f25a2b7d080159e841a0308e8814ceea8367d499b46d242381d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectCTypeNames (cyclomatic 11, cognitive 10): collectCTypeNames has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89263144050aad409c35fa257b6a13c09a5ba3c3136d1e0afa7d2f181c42361"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function luaAssignmentTarget (cyclomatic 11, cognitive 10): luaAssignmentTarget has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":4411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30870521b7a7946e43aa75880fb8933bb7134d3006eace84cb0b737dc289c96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeMcpEntryAt (cyclomatic 11, cognitive 10): removeMcpEntryAt has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/installer/targets/opencode.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4134be5f37fabee207f86f884ba71e3413d82423f638938dc326e8eca3e0d433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markerOnOwnLine (cyclomatic 11, cognitive 10): markerOnOwnLine has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/installer/targets/shared.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc8845847f5bd00ec050b8a4c4fe9c5f9e359e6bdf82d055e5fad42e4240df6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isFileStaleOnDisk (cyclomatic 11, cognitive 10): isFileStaleOnDisk has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/mcp/tools.ts"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"68019164b14f82fdad08d22acc1df693851793ebb55cca72ce054c41d079ee75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goSplitArgs (cyclomatic 11, cognitive 10): goSplitArgs has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3576}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe612f796bff8eff261910fedcf834c6a86fa893a304614650d1ace4f5850884"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonCallShape (cyclomatic 11, cognitive 10): pythonCallShape has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":4643}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb69da3b7a3054434c969f3e8cb4026a2c1e537b7659eac5e1951c0ade3cffb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":7198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1dd480403bc1432dfba5dbbfc81f7d28b901c576ce4d8ce3d8cf1e4326b568"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJavaTypeNameable (cyclomatic 11, cognitive 10): isJavaTypeNameable has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":21368}}}],"partialFingerprints":{"codehealthFindingId/v1":"522a4e288b1336cec3168cdfd484879506e894ed1569a919326ccf8f247dee38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchPascalNestedCall (cyclomatic 11, cognitive 10): matchPascalNestedCall has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2998f2db81d41c456ea55166b853e1fa37985cebe68ebb75c626103399f6f6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expressionEnd (cyclomatic 11, cognitive 10): expressionEnd has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"575e6289d6bd58d747c5d80973383c00be78b50878ea75bf806b284cc4b7d329"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitArgs (cyclomatic 11, cognitive 10): splitArgs has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/ui-server/api/effects.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b46a43b126b16ad8ff401d2dbaef2028490853559384dae36237aaf417e8ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toWireEdge (cyclomatic 11, cognitive 10): toWireEdge has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/ui-server/api/wire.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07381870c3d12d9c82c5885a2bf42bdfd61cf5529fc83e99a447300f2b36ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timeseries (cyclomatic 11, cognitive 10): timeseries has cyclomatic complexity 11 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"708253971270ca6e29d4e4a9795793f8865030cdbde02feceac2a90fbc442829"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCallArguments (cyclomatic 11, cognitive 9): isCallArguments has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"75361f455a18194c29ef79844aff43712cd524c4ae3b414f44a808a312d51ced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commonJsDefaultExport (cyclomatic 11, cognitive 9): commonJsDefaultExport has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4c8e3fc332a9a1e787e88cddf27c00dc2148e257460317fae3afdce50f5afd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRustOutsideCrate (cyclomatic 11, cognitive 9): isRustOutsideCrate has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":11583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b22739b38cc6575a4bb0b4df54016e1e98292f3d38c444d8cfd9bb10cb6cbc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cppSpecializationArguments (cyclomatic 11, cognitive 9): cppSpecializationArguments has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":19241}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d96493ac5a9262982a247b2bf7f65c2a9d985eb57fee48bb2cbbd550894448"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPythonFromImportModule (cyclomatic 11, cognitive 9): isPythonFromImportModule has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":25869}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eb7b7ae839e5777b3cc3303c482a82cf6efabb28b0040d3c49cf808fe4cad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchPythonTypedLocalCall (cyclomatic 11, cognitive 9): matchPythonTypedLocalCall has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":28726}}}],"partialFingerprints":{"codehealthFindingId/v1":"327809f287063bdaf53dc29831f2b78ee5d607828988fd9a4bb7deb5bbfeb785"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closingBracket (cyclomatic 11, cognitive 9): closingBracket has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/resolution/override-parameters.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ad4ab40fd2bdeac2d44dd7f55cc5d3648eb3d4e01fb9e0bd090c04a5998c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nestedRepositoryBelow (cyclomatic 11, cognitive 9): nestedRepositoryBelow has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/sync/worktree.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dfebb3c208627d7a06c4e5e0e0d464f298f7390eff9964aff1a4ef05615471"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportResolvedVersion (cyclomatic 11, cognitive 9): reportResolvedVersion has cyclomatic complexity 11 and cognitive complexity 9; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"src/upgrade/index.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"916b3b4eca21ebb4afd20a82810f6efd31fadda329a88577ccee7004efdadbd6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/tree-sitter.ts: 9575 lines of code: src/extraction/tree-sitter.ts has 9575 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d9a0c684419ef941f4b19462e363a31062bc87f45e3055f83937abd2e2f1e5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/tools.ts: 8758 lines of code: src/mcp/tools.ts has 8758 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":"src/mcp/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"042777aafb0308f0460531c59184811d2482db1223be6fa1c4080231c3caade1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/db/queries.ts: 5637 lines of code: src/db/queries.ts has 5637 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":"src/db/queries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1ccead0d83c9c40847309d54e1c2a44e1e0bae41bea70e30d46ba195040692"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/callback-synthesizer.ts: 5472 lines of code: src/resolution/callback-synthesizer.ts has 5472 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f7abd19f093723ed895e52d92f59e021d3b9f01ccdd0338fa9abeee5c54cf7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/import-resolver.ts: 4527 lines of code: src/resolution/import-resolver.ts has 4527 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":"src/resolution/import-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadf43591713869bce50f1a59fa78ea206dca0a23a1de452d158d3cb5ecf729f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/index.ts: 4501 lines of code: src/resolution/index.ts has 4501 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":"src/resolution/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fc22533d87d457ec1c2e3392eee76c7cf451e85d42d99f930eff3523550616"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/index.ts: 4028 lines of code: src/extraction/index.ts has 4028 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":"src/extraction/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"000893e5890e875a53f084e7e8a2b81fc9616c19f7a03c97f7a89b213242132d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/index.ts: 3073 lines of code: src/index.ts has 3073 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":"src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"036dd5697645f94a8c88b75ea60b91ae2628ff31031652403ab9204073837eab"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/c-cpp.ts: 2989 lines of code: src/extraction/languages/c-cpp.ts has 2989 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d88079511c5e588bca2c6503d49294b4f677d7ee370715a5556e183ced6d2f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/react.ts: 2376 lines of code: src/resolution/frameworks/react.ts has 2376 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":"src/resolution/frameworks/react.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cde6ed7f8315b97104ae3f679531702c1ad3c9c6be6fb61983939d539274ab"}},{"ruleId":"R3","level":"warning","message":{"text":"src/graph/branch-guards.ts: 2242 lines of code: src/graph/branch-guards.ts has 2242 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":"src/graph/branch-guards.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9503cc5f5483605089aa90a2692311253527865c8ac1abca8f690753ea0aca48"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/vbnet-receivers.ts: 1772 lines of code: src/resolution/vbnet-receivers.ts has 1772 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":"src/resolution/vbnet-receivers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ac43c606085ddc5a99af246a2dd58a9acb47565562df3be11719060fcaa9a9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/steps.ts: 1670 lines of code: src/ui-server/api/steps.ts has 1670 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":"src/ui-server/api/steps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09afc05b241cc5bd6f51c0cafa0269a2e66701da9eb056a9cb6f98807a57624"}},{"ruleId":"R3","level":"warning","message":{"text":"src/context/index.ts: 1505 lines of code: src/context/index.ts has 1505 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":"src/context/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbce778836ac1840f97a0cbe323f611a5e71f35dca75a8382ed695c626db67a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/c-fnptr-synthesizer.ts: 1386 lines of code: src/resolution/c-fnptr-synthesizer.ts has 1386 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":"src/resolution/c-fnptr-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6341222d1a960b904fd5369144594ef5d943ad1b822552315d029b6c38d2b297"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/tier-synthesizer.ts: 1213 lines of code: src/resolution/tier-synthesizer.ts has 1213 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":"src/resolution/tier-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe6343143fca5bdc6f950717d369df5ea9d73d111dea119d0ea458ef2c7c1e1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/pascal-scope.ts: 1173 lines of code: src/resolution/pascal-scope.ts has 1173 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":"src/resolution/pascal-scope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa177bde0edbc1c773b6c57ebac58dcfbf7e4546e7c6a99c22c0f7b31e78ac15"}},{"ruleId":"R3","level":"warning","message":{"text":"src/sync/watcher.ts: 1167 lines of code: src/sync/watcher.ts has 1167 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":"src/sync/watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc363b75fb2da2f67461a5be360eec9e3610e90f0c9ba942f7824811a9a1b451"}},{"ruleId":"R3","level":"warning","message":{"text":"src/directory.ts: 1148 lines of code: src/directory.ts has 1148 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":"src/directory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba0451bf44ad64ccfdd441de51b378b05ad580e5e9465cc7f2017256167c089"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/steps-model.ts: 1142 lines of code: ui/src/lib/steps-model.ts has 1142 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":"ui/src/lib/steps-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0648d7395fa679633afea5107cd80054d02b513eef47b7f3e6458fc452e087"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/views/StepsView.svelte: 1138 lines of code: ui/src/views/StepsView.svelte has 1138 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":"ui/src/views/StepsView.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17cf76b48c9b42e158bee05509c6c343be68125c35b80c3659e2541f53d5e19"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/tauri-synthesizer.ts: 1136 lines of code: src/resolution/tauri-synthesizer.ts has 1136 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":"src/resolution/tauri-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ea5fbae058d6373a1765aad0f190387911bf848bed45687e5a0ba4bbf7f230"}},{"ruleId":"R3","level":"warning","message":{"text":"src/graph/dead-code.ts: 1050 lines of code: src/graph/dead-code.ts has 1050 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":"src/graph/dead-code.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bf2a0e3a193d9e56fe93c93d9b1bbc2a4c6b04c5852e16707199ef2127f0cc"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/angular-router.ts: 1048 lines of code: src/resolution/frameworks/angular-router.ts has 1048 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"474da26dd799435e6109ee7e561e5250199bd740c168d91f3aaa57e2261c61f5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/pascal-preparse.ts: 1044 lines of code: src/extraction/languages/pascal-preparse.ts has 1044 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":"src/extraction/languages/pascal-preparse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8750cbea6629799eab824def3e1b147540ee88628f40ae5a7f5a6a9c9ec8ed9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/daemon.ts: 990 lines of code: src/mcp/daemon.ts has 990 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":"src/mcp/daemon.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7d75f144de0f0b29c0626abd57dbd7a7188bef76933b47ca974b48f65e840b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/function-ref.ts: 977 lines of code: src/extraction/function-ref.ts has 977 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":"src/extraction/function-ref.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efab267147b7c57a06431a1337df3bfeebde4fa9af6aebc6644683aa3d97c014"}},{"ruleId":"R3","level":"warning","message":{"text":"src/db/index.ts: 976 lines of code: src/db/index.ts has 976 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":"src/db/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3640bf26f53133b6b626661065925a213f878db0811d606de3fb6e03eb489dab"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/export-svg.ts: 915 lines of code: ui/src/lib/export-svg.ts has 915 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":"ui/src/lib/export-svg.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a0c61522cd48fb70bba4fa6b29f186fc71270bb857e7b2944a9188b09c2b3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/nestjs.ts: 910 lines of code: src/resolution/frameworks/nestjs.ts has 910 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf0238cdbb12707f0a0569a6acdab92e10dc5cacda58868545d98e27eefa43"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/grammars.ts: 906 lines of code: src/extraction/grammars.ts has 906 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":"src/extraction/grammars.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5902858308266e8b83db309e837bcb2233918330342d98415e0e71f63599aec"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/ambient-modules.ts: 900 lines of code: src/resolution/ambient-modules.ts has 900 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":"src/resolution/ambient-modules.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ec7465ceaa1d3e7cd23cd7d7401aa6c4482017900503b8e89e88b3b7f6d374"}},{"ruleId":"R3","level":"warning","message":{"text":"src/upgrade/index.ts: 897 lines of code: src/upgrade/index.ts has 897 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":"src/upgrade/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd04cc9ea106ca47a75d90f5f06a37b194578a97108d39229ac9c9c6e0f8644"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/flow.ts: 843 lines of code: src/ui-server/api/flow.ts has 843 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":"src/ui-server/api/flow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c62ea0d55870faf503f187611cdaa02dd7d245109bcc4057cbcdc3bd24b0d14"}},{"ruleId":"R3","level":"warning","message":{"text":"telemetry-dashboard/src/api.ts: 835 lines of code: telemetry-dashboard/src/api.ts has 835 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":"telemetry-dashboard/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa280c06e5fdf6f9adfc25500c8d4c07d7a40e23b9d2c1db812b743bcbeea0f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/utils.ts: 834 lines of code: src/utils.ts has 834 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":"src/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d70595ae5e53d2f84b52d68b2793a4bd9f8f0f4beeaa5accaef47f92b00407"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/expo-router.ts: 827 lines of code: src/resolution/frameworks/expo-router.ts has 827 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00bf2875cfc4a9eb1002d8799367dcf448f8d5762be06bdc0de8421cb8161e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/cpp-type-aliases.ts: 820 lines of code: src/resolution/cpp-type-aliases.ts has 820 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":"src/resolution/cpp-type-aliases.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49058f1b0c9ff1e7c6f2ca14111b35f9b127e958149cd447dee377faf77e6f1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/module-importers.ts: 802 lines of code: src/resolution/module-importers.ts has 802 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":"src/resolution/module-importers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"563061e4e7e249cf0a5c85beb6b7873fc034dff4ce4720d7a4e623d305a302e8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/map.ts: 802 lines of code: src/ui-server/api/map.ts has 802 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":"src/ui-server/api/map.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"052d0dd4c56e6334fb94591b47e0043539288f4982f783019635adbb1d8d06e3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/dart.ts: 794 lines of code: src/extraction/languages/dart.ts has 794 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":"src/extraction/languages/dart.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c7d2e8540c294ad127411c5e16eda1b9546c187987c83c5588d7bf1eb747fe"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/angular-template-synthesizer.ts: 790 lines of code: src/resolution/angular-template-synthesizer.ts has 790 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":"src/resolution/angular-template-synthesizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdfd13162aed6648c29e28778d97f048c37222fc8d5795539f69339bb84c3ef"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/cfml-extractor.ts: 788 lines of code: src/extraction/cfml-extractor.ts has 788 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":"src/extraction/cfml-extractor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11e260f0e83d1791335e9539e476d7da1aeb281ef86662a9473203f551a835b"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/screens-model.ts: 786 lines of code: ui/src/lib/screens-model.ts has 786 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":"ui/src/lib/screens-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa98f3cf935ff59ced878973df32bfcc34db123ac506bccc44aeabcbc527b0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/index.ts: 779 lines of code: src/mcp/index.ts has 779 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":"src/mcp/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda911daacff73c3d7acffafb746fdfc062dcd7691f107714d17137353228d31"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/proxy.ts: 775 lines of code: src/mcp/proxy.ts has 775 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":"src/mcp/proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1347f210c2bb25304c708438c8be63337d77cfa8146edbd1d60417c96aa7e7ed"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/explore-diagnostics.ts: 773 lines of code: src/mcp/explore-diagnostics.ts has 773 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":"src/mcp/explore-diagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0503b036118b313b064f8d87080c68388912ab7bd2609bbd7abaea8dcc0bd8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/drupal.ts: 770 lines of code: src/resolution/frameworks/drupal.ts has 770 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a2714938fbe165adc0b4f0c65d68dd7dc2dc7e1cc4d9e5c79e0172c4ef7e2c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/dart-libraries.ts: 766 lines of code: src/resolution/dart-libraries.ts has 766 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":"src/resolution/dart-libraries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1ec26c187ad3a27e69f35948a4424e664f096e52429e13ba957e19ee36bb1e"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/views/ScreensView.svelte: 760 lines of code: ui/src/views/ScreensView.svelte has 760 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":"ui/src/views/ScreensView.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e995c1210f1f518af8b01021d4b6664c0af7ac1b28e8f56d1f145d740e04ba8a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/rust-scopes.ts: 753 lines of code: src/resolution/rust-scopes.ts has 753 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":"src/resolution/rust-scopes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab216bd81a3ec9871c9a734769af791b2375309b5695ac93b19f9958b6638487"}},{"ruleId":"R3","level":"warning","message":{"text":"src/graph/traversal.ts: 750 lines of code: src/graph/traversal.ts has 750 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":"src/graph/traversal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c63425671caff0c4e66239152aacb9e53e64fb545130f9db798d6258a1da5d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/workspace-packages.ts: 734 lines of code: src/resolution/workspace-packages.ts has 734 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":"src/resolution/workspace-packages.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc556e512ca935dc00d3b052f05b27ad76c430d14fedb5eb742eeddcba6fe877"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/ruby-parameter-flow.ts: 721 lines of code: src/resolution/ruby-parameter-flow.ts has 721 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":"src/resolution/ruby-parameter-flow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0878826fd89aca9b19bf445f1f42f3618976210853dd6f4d91589fe3bc690453"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/java.ts: 715 lines of code: src/resolution/frameworks/java.ts has 715 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cec1d4b8c421f7095ce9a6cb9b99aa0f60c7632dee1fcd57463bd62d21e72b9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/express.ts: 701 lines of code: src/resolution/frameworks/express.ts has 701 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7d0751e312734314400dee4db202145835b720b9f4d6ab8b2d50b4bd7a6a1c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/installer/index.ts: 692 lines of code: src/installer/index.ts has 692 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":"src/installer/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aecdd0ed0930a749a2a16a68d779b2bbe0691f4ef4ee229b2c44a8783b33bfb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/graph/named-symbol-flow.ts: 679 lines of code: src/graph/named-symbol-flow.ts has 679 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":"src/graph/named-symbol-flow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d234b1195383304d261cadab084b493a5e858022e8ca612446b9cda878124229"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/parameter-flow.ts: 673 lines of code: src/resolution/parameter-flow.ts has 673 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":"src/resolution/parameter-flow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c914d4827fa1fec340997bed414636f73ce12c2f8dc40832f1ef3a9e26af2d"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/map-model.ts: 661 lines of code: ui/src/lib/map-model.ts has 661 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":"ui/src/lib/map-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b964ad896d9aec683506d351043f1f427847d557aebe0c773554acd508e78"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/screens.ts: 637 lines of code: src/ui-server/api/screens.ts has 637 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":"src/ui-server/api/screens.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbc8dcab03d607e7800dd03d482516ff42bde636c53a716d653b1b6153f553a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/dart-local-scope.ts: 635 lines of code: src/resolution/dart-local-scope.ts has 635 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1125f5ed5e641c098b2a2e457c61cc4d9f55d2833063f7e87958a6613603ea75"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/terraform.ts: 632 lines of code: src/extraction/languages/terraform.ts has 632 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958f53ac5dd8aa08c9dc350f6e106cc6130d4f6d4694b785d2b9266ec4644891"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/views/FileCodeView.svelte: 632 lines of code: ui/src/views/FileCodeView.svelte has 632 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":"ui/src/views/FileCodeView.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3071b5bf8bd89480257268f0b15d39da2e4694a0a29013de623a1ab6222bf0f9"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/views/SymbolView.svelte: 628 lines of code: ui/src/views/SymbolView.svelte has 628 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":"ui/src/views/SymbolView.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a54ba0dd5242f33f9c8056185a8aab8c56a1b9f83c32d7a0324b6c50fde220"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/strip-comments.ts: 626 lines of code: src/resolution/strip-comments.ts has 626 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":"src/resolution/strip-comments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab54066ced9a597fb30245c6c0d5b848b03db90971b86bca80b164678c2953b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/python.ts: 612 lines of code: src/resolution/frameworks/python.ts has 612 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":"src/resolution/frameworks/python.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"226dfb462b1301c6a64c5bd6c4529fde134f27d486f5fca090530b05951763c3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/types.ts: 607 lines of code: src/types.ts has 607 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":"src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9112a4a2bfa67b263e83e582b65ea340ee5da4928b6bd788d73cf53f8b79c6c7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/react-native.ts: 598 lines of code: src/resolution/frameworks/react-native.ts has 598 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":"src/resolution/frameworks/react-native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e200555fa9d94cf42cbf1ee9da69b278257e5ff2435ba805f2412fd6e3cca2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/search/query-utils.ts: 586 lines of code: src/search/query-utils.ts has 586 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":"src/search/query-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa32f6eed11071d0843d3e79d5441776c1f97266904257c0f92e2b73b629966a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/telemetry/index.ts: 579 lines of code: src/telemetry/index.ts has 579 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":"src/telemetry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c3179203fc21627222f76ce0aed842ae0f98180e4a8213c4139d0f7076dc2d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/laravel.ts: 576 lines of code: src/resolution/frameworks/laravel.ts has 576 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":"src/resolution/frameworks/laravel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e28beabdfe98ba7b5d83b08895378aa63d19c2b67d297ca8d451e84dad694"}},{"ruleId":"R3","level":"warning","message":{"text":"telemetry-worker/src/rollup.ts: 571 lines of code: telemetry-worker/src/rollup.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":"telemetry-worker/src/rollup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f93cc2421bf5e1def980cadd0b1455e44581a50a2fe79c074a2d1c316633530"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/flow-model.ts: 563 lines of code: ui/src/lib/flow-model.ts has 563 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":"ui/src/lib/flow-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3135f8010edc629b2cfcf77b84c948a52637c5b9c56492f9af781a1852ac821f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/types.ts: 554 lines of code: src/resolution/types.ts has 554 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":"src/resolution/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4df37c69aa55e067be902f110b9d877f88d7f14ee357833996dd041f8b4632"}},{"ruleId":"R3","level":"warning","message":{"text":"src/installer/targets/toml.ts: 551 lines of code: src/installer/targets/toml.ts has 551 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":"src/installer/targets/toml.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfd255c3b747941d5c3cdbdac64d334dda1051453f80bc2c7afc6b52fc128e8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/parse-pool.ts: 549 lines of code: src/extraction/parse-pool.ts has 549 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":"src/extraction/parse-pool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c584f68b996c082bccdfa30568d3c81ba74968da23ecdf421f9b372806108"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/cpp-macro-methods.ts: 545 lines of code: src/extraction/languages/cpp-macro-methods.ts has 545 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70bb530bafbe6d4950995ba19f84970fa05c881e5374e7fe8c61c7932dd26e2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/kotlin.ts: 545 lines of code: src/extraction/languages/kotlin.ts has 545 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":"src/extraction/languages/kotlin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f97e350b0db1c05b6c78cb30a048e5595a0855f8fa803e114d0ae3e62b3335"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/vue-template-calls.ts: 535 lines of code: src/extraction/vue-template-calls.ts has 535 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":"src/extraction/vue-template-calls.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6277fa7a5196851ee7dbe3c16ad9329a930d14b62c808053bb80b79d9a1f4a7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/daemon-registry.ts: 520 lines of code: src/mcp/daemon-registry.ts has 520 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af9a1a556d7bcb3d7d33d4a8b62a2b52e7e27a2504d74fdc18e016669ad7b23"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/swift.ts: 517 lines of code: src/resolution/frameworks/swift.ts has 517 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fde35ac4f70c7959c67ff73886365e032d0999dfda27bfb5244ef4b4378284"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/effects.ts: 517 lines of code: src/ui-server/api/effects.ts has 517 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":"src/ui-server/api/effects.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f912bf84cf8ce1065434cc4a8844812090090e9c57224be2491ac021c00ddcbc"}},{"ruleId":"R3","level":"warning","message":{"text":"telemetry-dashboard/public/panels.js: 513 lines of code: telemetry-dashboard/public/panels.js has 513 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":"telemetry-dashboard/public/panels.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e550e228f5d94dc9ce293b74c7aac40c93ead91d294a57471c370736e05f19fe"}},{"ruleId":"R3","level":"warning","message":{"text":"src/search/query-paths.ts: 508 lines of code: src/search/query-paths.ts has 508 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":"src/search/query-paths.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"116e2e1d954b9678cf92bdd1cc5e94465f4c4804c067874456b3e840f08761c1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/vue-router.ts: 506 lines of code: src/resolution/frameworks/vue-router.ts has 506 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":"src/resolution/frameworks/vue-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08946997220f00ee43129cbea35b74ae7d88d1e2d927137a8b8322f147cf073"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/index.ts: 497 lines of code: src/ui-server/index.ts has 497 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":"src/ui-server/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5700b6d5ffda413f948aa3a0b3f1ae0f904c5e42163106f38f227b3f15056c59"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/languages/cobol.ts: 496 lines of code: src/extraction/languages/cobol.ts has 496 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":"src/extraction/languages/cobol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6016edfb2afc2f879ab10c7c2afcd82d3316b194636a030aaa0a69e72e8698"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/jsx-code.ts: 494 lines of code: src/resolution/jsx-code.ts has 494 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":"src/resolution/jsx-code.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c90c19bdb1da3a371404b4b2d7b9cf7116bdaeef8367d818460c54bc605015"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/query-pool.ts: 489 lines of code: src/mcp/query-pool.ts has 489 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":"src/mcp/query-pool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a83abe55c7fb1ccac778d4e769e2810caf15679248451c9b076485c91f16cd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/engine.ts: 488 lines of code: src/mcp/engine.ts has 488 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":"src/mcp/engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27cbe133439b355aacaaced256c526817cb73c36b09e6901a4ae1e373a463cd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/liquid-extractor.ts: 486 lines of code: src/extraction/liquid-extractor.ts has 486 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":"src/extraction/liquid-extractor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd5c9d8127527abc1ab3c54141c5c0d88a626311c817e2e6c7c39373df889a0"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/symbol-model.ts: 484 lines of code: ui/src/lib/symbol-model.ts has 484 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":"ui/src/lib/symbol-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45b160c03eb5c706ccc83c822bbae1aeb480493381015aea92071abc3b3f673"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/cpp-supertypes.ts: 480 lines of code: src/resolution/cpp-supertypes.ts has 480 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12aed292bd83b66876d0a9b358d8503833f4d9f0b107fb9b672a3ebf0bfd34b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/installer/targets/shared.ts: 472 lines of code: src/installer/targets/shared.ts has 472 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":"src/installer/targets/shared.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e45b583364254f877c49f2240e5215f04df50b3d1d0bff4748959e0a1ccf299"}},{"ruleId":"R3","level":"warning","message":{"text":"src/installer/targets/claude.ts: 468 lines of code: src/installer/targets/claude.ts has 468 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":"src/installer/targets/claude.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a041ee4f672d156c3412c6551fbac2dd71b851fdf304290902eafac1cb2f4d0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/node.ts: 463 lines of code: src/ui-server/api/node.ts has 463 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":"src/ui-server/api/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40bac465b27b5b6019f9a267990aa2c6d2f320814a46a55e75cfa4817ca38c0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/ruby.ts: 459 lines of code: src/resolution/frameworks/ruby.ts has 459 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":"src/resolution/frameworks/ruby.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4ba1236e8b406e8b96309e6a3457da106319cb2d01e025f3bf67a8573f0171"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/program-model.ts: 456 lines of code: ui/src/lib/program-model.ts has 456 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":"ui/src/lib/program-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe8b5e8ba410f11b31c97bf20ccd497864bbf7a24e143863601fb1f35224f5c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/source.ts: 449 lines of code: src/ui-server/api/source.ts has 449 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":"src/ui-server/api/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92656f52e92c7c779e0fc0f4d45029c9f8cbf2a0b06587d139cc39704314520c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/trails.ts: 447 lines of code: src/ui-server/api/trails.ts has 447 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":"src/ui-server/api/trails.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d1dc3c5a44a60a87d1c6a14372b2b82eb4b4ac705374957a89de9adc770b2a"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/adapter.ts: 444 lines of code: ui/src/lib/adapter.ts has 444 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":"ui/src/lib/adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c2f21cdbc8820febad06e1511ccc287183e4e710d53a4bac9703c12597799f"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/components/map/MapSidePanel.svelte: 443 lines of code: ui/src/components/map/MapSidePanel.svelte has 443 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":"ui/src/components/map/MapSidePanel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"437f935b8a765b48b5a248a9d924eb1d7c041b5ffb733a0ee55a060b9cf9323e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/frameworks/tanstack-router.ts: 441 lines of code: src/resolution/frameworks/tanstack-router.ts has 441 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":"src/resolution/frameworks/tanstack-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c10d73d191c44df896b647639923a21a8df059d12a2d1795eac6590662a0c6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/graph/type-hierarchy.ts: 440 lines of code: src/graph/type-hierarchy.ts has 440 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":"src/graph/type-hierarchy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509155a0c407288723894851eaee1010bf78ccbc8033e8cbca20745b567ad630"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/lib/filecode-model.ts: 438 lines of code: ui/src/lib/filecode-model.ts has 438 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":"ui/src/lib/filecode-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefb2c6283782664e0377e71229d59cc21c35782dc6146e6e4c77bf5c1b4a75c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/events.ts: 437 lines of code: src/ui-server/api/events.ts has 437 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":"src/ui-server/api/events.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5f8a5bf198aff1cddfd320cae482b37c75af60eaa15513b18c13ec40f9334b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/swift-type-visibility.ts: 432 lines of code: src/resolution/swift-type-visibility.ts has 432 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":"src/resolution/swift-type-visibility.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"239b49c922d6f000b0317f4dcc0353eff1280ae751629a4a3b3ffc480ab08eb0"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/views/FlowView.svelte: 432 lines of code: ui/src/views/FlowView.svelte has 432 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":"ui/src/views/FlowView.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1967ebff43786b4a224c0a266105312888ed492834984cca10129c1b340379"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/views/MapView.svelte: 431 lines of code: ui/src/views/MapView.svelte has 431 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":"ui/src/views/MapView.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"014287d70daa8ac5b77b17ba5de250f5ff12bd200597a265e208acffa1b4ab8b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/syntax-tokens.ts: 428 lines of code: src/extraction/syntax-tokens.ts has 428 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":"src/extraction/syntax-tokens.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f134275f3c88cd04e06b8f72d33b7f8328f03ee691257920e4c2f1b9891e5cfd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/resolver-pool.ts: 419 lines of code: src/resolution/resolver-pool.ts has 419 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":"src/resolution/resolver-pool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e9a4a85659f5d967bf564b5702e914c2c9f59c78bacf68d0b5dbdffc3e513a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/project-config.ts: 416 lines of code: src/project-config.ts has 416 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":"src/project-config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"779b8f201d311705cd51c5876d419d96880d53e72bbedc0e6984cf7b9c7d22d2"}},{"ruleId":"R3","level":"warning","message":{"text":"telemetry-dashboard/public/app.js: 415 lines of code: telemetry-dashboard/public/app.js has 415 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":"telemetry-dashboard/public/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1370ea62c9bc5dc97293862eeec63badded6f29283a74bf2da98f5a2fa6a60"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ui-server/api/index.ts: 402 lines of code: src/ui-server/api/index.ts has 402 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":"src/ui-server/api/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bf84425e8030c5a99767fde877836e3e4bee1844ecdac3daa21760677cf792"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: __tests__/fixtures/kernel-parity/torture.tsx:5 imports \u0027./namespace-module\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (6 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/fixtures/kernel-parity/torture.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"162bc1cc01112a35d2b98e55830defdafd846490c48cd472a20c953bbf7e3cab"}},{"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":"telemetry-dashboard/public/panels.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb2ef33f8f6bf21c9d35450efdc18b19861c3a5654caf3d5d533e8e4a2fe26f"}},{"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":"telemetry-dashboard/public/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ba0428b99c562e57a181d348312589d5bcd4eb523fdf5cb3e599fcc9f8d25d"}},{"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":"telemetry-dashboard/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"087fcbc91065c10f455785bee9e039711396333fe8c519bdb074ac57c75add4f"}},{"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":"telemetry-dashboard/public/theme.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cceaae5664db06953e0f43bcf83fe373b2663f2e0cdaa2135d09d6a5b9661f"}},{"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":"src/extraction/parse-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0199e8714db76cdd0db3663fed63a565ce620913c0756e3372c48a100524c9"}},{"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":"src/ui/shimmer-progress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b013cb977c6d7fad65a3272e4fcaee468f67389b231b95d0befb02c9d96f4910"}},{"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":"src/resolution/resolver-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd47514f7b7ca13026b382a80cd1003a52ff259faf5e0aa230619323ac6150d3"}},{"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":"src/ui/shimmer-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61be5fbcdefb0c0f83687ac31dd66220b7283d66ac5273f2d09ff05607e4b15"}},{"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":"telemetry-dashboard/src/login-page.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295446609e62d692d75bea75997ffdb0f84cb639022a44ae68963eef1d74be18"}},{"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":"telemetry-dashboard/scripts/vendor-assets.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47addf15280c98f65ef18352102bd696a6badaaaac951fedb34e62ee60fc6e4c"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but __tests__/fixtures/kernel-parity/torture.tsx cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/fixtures/kernel-parity/torture.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"966149b7bb71f3b509c130f45bbeffd4c5db5ec75db1d5c2eb17d600ab0ad330"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~150 LoC): no import path from any entry point (233 application, 55 tooling, 958 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":"src/extraction/store-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cecd3a0562b97b7c9a3ab0802b84c284875aa2555d9fcceb9cf349e1db722f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~146 LoC): no import path from any entry point (233 application, 55 tooling, 958 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":"src/resolution/resolver-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5320e2d1326abecb08a953d4b0c990afed211a0b243de8465e396316432257"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (233 application, 55 tooling, 958 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":"src/ui-server/highlight/tokenize-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ba23b98bc95a00c3c266bf3c0a227bac7ec45e559efc8f25d74f67b7cc3382"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027writePermissions\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/installer/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/installer/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/config-writer.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"999786a7e4d6784f44d0f9a90d2539aba93eaefd71e9d9e5cb86ba5770dd2a22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasMcpConfig\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/installer/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/installer/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/config-writer.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce276fdfc17cb9de8a62a1833e582209638ae60235563f23fafb16d5d7ad4298"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasPermissions\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/installer/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/installer/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/config-writer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e0f58e76d72ea481b0dc73d78d406894816858445e4925d16df9194a4ee27d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runInstaller\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec38ca4d5593e4f1c586f5b993707d9e48acd223422ee03b199e7eda094fec1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runUninstaller\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ba013ee96a5bd7a78f592c894f648c991cf6ab8ef76c5bcf8f700bffd60b23"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027offerWatchFallback\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f4a6ea796902c3d825245c3d0a6aeb5ece039a5d9d0ec0308f479d2ac8fb38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027pageForHref\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/nextjs.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e0533362c03a2b413e01787e6324dac52dac892c54a8d13803e116b0986989"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recordIndexEvent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2120704b9c40f6b29eabee6767cdb3edcde40ba40739ebd8dbf0f32b31d2db9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EFFECT_RULES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/effects.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef38bee5bada86f75fbdd27ca9c8355f0f9cc8845c9f482b2467d1fe41216e80"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027categoryWord\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/effects.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"38efde1525d422676bb320138761fed493d2adc674905ad0cc71b31f70a3bcae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_HIGHLIGHT_LINES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/highlight/index.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e910389030df93e83d7cf0017a03053cab4965aa88fe52c549f8eaf8a224e29c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SLICE_CACHE_LIMIT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/highlight/index.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81cc94b48eb4d3159dc01afb2f59de88c754394af2f18e0a3157787894ea992"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027openBrowser\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/ui-server/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/ui-server/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/open-browser.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dd2e8d8ca23655bcabc2402a1406b4e0e1ca0c0e1b1e4ab7f8e41126cfe9a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027defaultRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/upgrade/index.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"047b897a3813fc76e6c8b8a99c5cb6afec8bc671758b5bdf512c28ed7900721d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027defaultCapture\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/upgrade/index.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e5e2d49d3b6534bf3cf92cc6af81eeb84d32409a71e5b63c26a1cc062aa9fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_MANUAL_DAYS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-worker/src/rollup.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26b5ce760f120745a4ffb93d8c0602eba1e4f89217d6e1051883dffc2d60260"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ViewName\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib/router.svelte.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7be8f500782aa7f6206914c8c9d4e66793602e05c07293b23eb2f67cd41975"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MAIN_TIER\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/offload-eval-cost.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7cde83b8efbd255eb090cad16444fc73418340e249f1fdea24d3eca092c705"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027d2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/offload-eval-summarize.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"73558f8c53abde5a9e915bb49f32cca8476e68217d226893fd9351ec6acd82f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027d4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/agent-eval/offload-eval-summarize.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44c9d0b450f46df9a8da15cf5faaf9285d2a91cf64b5cda885998c3dca41161"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027svelte\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/ui-package.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc739863086a9e0f747082685e42575c83c3cf740083021e66ec1a30749f56f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027fast-string-width\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a8d7baa1033df760163f781447e019d415ec0d15820337e76c2f1d4ac99e1e71"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027fast-wrap-ansi\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f6cd1c57cd0467d1f3836ff452b51e055e870a089a8f92210d23b81a44bf9cab"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027sisteransi\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"144d63f108483f7059244caf26746174fae76f1b767c2f8b98899f5dd242ae32"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027@clack/prompts\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/beta-signup.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb6f31c9e0b0d2cd994100fc25c285145fde768e5cb9082fe9d917c2193470c"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/extraction/astro-extractor.ts \u2192 src/extraction/tree-sitter.ts \u2192 src/extraction/astro-extractor.ts (one verified cycle inside a mutually-dependent group of 6 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/astro-extractor.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae137ed7b920dcf2eb57c9cf0dd630c1519cb02b783bebcad9404b1df52c24d"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (5 files): src/index.ts \u2192 src/lazy-engine.ts \u2192 src/mcp/index.ts \u2192 src/mcp/daemon.ts \u2192 src/mcp/engine.ts \u2192 src/index.ts (one verified cycle inside a mutually-dependent group of 9 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed30030389ebbb5779095cac8c1b1f59714fe3bfe938e7fed3f3753d5fe08483"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (5 files): src/resolution/alias-binding.ts \u2192 src/resolution/name-matcher.ts \u2192 src/resolution/c-feature-variants.ts \u2192 src/resolution/cpp-macro-visibility.ts \u2192 src/resolution/import-resolver.ts \u2192 src/resolution/alias-binding.ts (one verified cycle inside a mutually-dependent group of 7 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/alias-binding.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fcc95e8d0943050775bddbea9b0956bc6fd3d6eda31852048f88f94536002f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(value.hops) || value.hops.length === 0\u0060 appears character-identically in 2 files \u2014 src/ui-server/api/trail-store.ts, src/ui-server/api/trails.ts. 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":"src/ui-server/api/trail-store.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2204a07341f33d5cf6c8f3a773817fa6b009f9856787afcb6267d623a8b60e19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!JSX_FILE.test(file) || isTestPath(file)\u0060 appears character-identically in 3 files \u2014 src/resolution/next-router-synthesizer.ts, src/resolution/react-router-synthesizer.ts, src/resolution/tanstack-router-synthesizer.ts. 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":"src/resolution/next-router-synthesizer.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7899a81b39b7e60b1770343e22872666d8380832bc229a20afe1fb44a06e30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(parsed) || parsed \u003C= 1\u0060 appears character-identically in 2 files \u2014 src/mcp/ppid-watchdog.ts, src/mcp/proxy.ts. 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":"src/mcp/ppid-watchdog.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2972aff73541e0b0b8ab50cce592ee55ee8487305cff2fe60010b005897ce236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!inner || n.startLine \u003E= inner.startLine\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/angular-router.ts, src/resolution/frameworks/swift.ts. 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c38d81eb4f734f7f7661b4a345f5fb9482cc29b3f5f155d84e7c520423ef09e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.destroyed \u0026\u0026 this.totalCrashes \u003C CRASH_BUDGET\u0060 appears character-identically in 2 files \u2014 src/extraction/parse-pool.ts, src/mcp/query-pool.ts. 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":"src/extraction/parse-pool.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c579f8a30cc487301e8ea042a01e76317b2b1ff88ee815e8c3e85871fdea982f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!typeNode || typeNode.type === \u0027predefined_type\u0027 || typeNode.type === \u0027array_type\u0027\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/vbnet.ts, src/extraction/tree-sitter.ts. 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":"src/extraction/languages/vbnet.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee202a33cabf0fa4ef49943cd220cfc43bd3da435ee03bd42de497f79bb8e871"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(c === \u0027\\n\u0027 || c === \u0027;\u0027) \u0026\u0026 depth === 0\u0060 appears character-identically in 2 files \u2014 src/resolution/go-func-field-synthesizer.ts, src/resolution/name-matcher.ts. 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":"src/resolution/go-func-field-synthesizer.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c192b9ccdba48f9a7b7461df5d8960d97e12c1b50823a4c963c3cf72ab2c4b5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/\\\\\\s*$/.test(lines[j]!) \u0026\u0026 j \u002B 1 \u003C lines.length\u0060 appears character-identically in 2 files \u2014 src/resolution/c-feature-variants.ts, src/resolution/cpp-macro-visibility.ts. 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":"src/resolution/c-feature-variants.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8704b068ecfb77009230aaa2d6e84367d96aff7caff1a6fff3c6fec27c6d5a1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(r.start) \u0026\u0026 Number.isFinite(r.end) \u0026\u0026 r.end \u003E= r.start \u0026\u0026 r.start \u003E= 1\u0060 appears character-identically in 2 files \u2014 src/mcp/explore-dedup.ts, src/mcp/explore-session-state.ts. 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":"src/mcp/explore-dedup.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb43921755c74235215122a31f3221a4f1704cdca81fc6af53505c8f952bbce8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060SWIFT_TYPE_KINDS.has(n.kind) \u0026\u0026 n.startLine \u003C= ref.line \u0026\u0026 n.endLine \u003E= ref.line\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/swift.ts, src/resolution/name-matcher.ts. 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":"src/resolution/frameworks/swift.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5bb7ab81913fce523f728e28e4f487d277cb6a44b760c84da2b34b53e82466"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.other - b.other || a.id.localeCompare(b.id)\u0060 appears character-identically in 2 files \u2014 ui/src/lib/map-model.ts, ui/src/lib/steps-model.ts. 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":"ui/src/lib/map-model.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc67d2aafce10eea142f76c0a1f82255928a47a1497a253392f40a8170d8cd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startLine - b.startLine || a.name.localeCompare(b.name)\u0060 appears character-identically in 2 files \u2014 src/graph/dead-code.ts, src/ui-server/api/file.ts. 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":"src/graph/dead-code.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2244ab0dbb08e573ea89b294c078e21f9d2e2d0b21385c2ccf30699ebbfbbff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startLine - b.startLine || a.startColumn - b.startColumn\u0060 appears character-identically in 6 files \u2014 src/extraction/index.ts, src/resolution/ambient-modules.ts, src/resolution/import-resolver.ts, src/resolution/js-super-calls.ts. 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":"src/extraction/index.ts"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d023a685dccfd4c474572d02ea472d8a39a2167950471cf69a6cf012bbb737b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startLine - b.startLine || b.endLine - a.endLine\u0060 appears character-identically in 2 files \u2014 src/resolution/callback-synthesizer.ts, src/resolution/name-matcher.ts. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":4920}}}],"partialFingerprints":{"codehealthFindingId/v1":"000db047989f0a84681b5929dc24cec27b0eac1a4a5c99761f656fe75d8f6986"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060afterParsed.servers \u0026\u0026 typeof afterParsed.servers === \u0027object\u0027 \u0026\u0026 Object.keys(afterParsed.servers).length === 0\u0060 appears character-identically in 2 files \u2014 src/installer/targets/copilot-jetbrains.ts, src/installer/targets/copilot-vscode.ts. 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":"src/installer/targets/copilot-jetbrains.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c569a149068f44852dde83d88d9da8b6a4baa3f0de1b6b1ad20de205f9c16c51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg \u0026\u0026 (arg.type === \u0027arrow_function\u0027 || arg.type === \u0027function_expression\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/javascript.ts, src/extraction/languages/typescript.ts. 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":"src/extraction/languages/javascript.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b126202ab80817c3f8658967e1d021d36857fef1d9516687142933a599e075f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === \u0027,\u0027 || c === \u0027;\u0027 || c === \u0027)\u0027 || c === \u0027]\u0027 || c === \u0027}\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/name-matcher.ts, src/resolution/rust-scopes.ts. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":16710}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd73f8903566a6689501586fb87fee3e5036308b2b9dd55753af4a9c71b5056"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === \u0027/\u0027 \u0026\u0026 (text[i \u002B 1] === \u0027/\u0027 || text[i \u002B 1] === \u0027*\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/callback-synthesizer.ts, src/resolution/override-parameters.ts. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d9b09c4d5abb21adececc95a06e804a1406844882a15e59f5a74940ee6a0e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === 47 \u0026\u0026 source.charCodeAt(i \u002B 1) === 42\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/cpp-brace-scopes.ts, src/extraction/languages/cpp-macro-methods.ts. 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5be9609bd2f97d1cfb54906276608b0f4d13b938c6a6db5f8bfb53a2e174a3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === 47 \u0026\u0026 source.charCodeAt(i \u002B 1) === 47\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/cpp-brace-scopes.ts, src/extraction/languages/cpp-macro-methods.ts. 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88c1215c2e7e63756044a95bcd0594c73c97e6f2b4916b7dcf0bcb0eb40ea23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type === \u0027arrow_function\u0027 || child.type === \u0027function_expression\u0027\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/javascript.ts, src/extraction/languages/typescript.ts. 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":"src/extraction/languages/javascript.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9d91535cac266f8ada672d720e3d899c7dc3ce8fc8a2f5e445fd50f7960bfc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type === \u0027enum_specifier\u0027 \u0026\u0026 getChildByField(child, \u0027body\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/c-cpp.ts, src/extraction/languages/objc.ts. 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e47f9cd4127c15b4a14bae056316fe3105a140295e5dbeb9336883d212ede6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type === \u0027struct_specifier\u0027 \u0026\u0026 getChildByField(child, \u0027body\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/c-cpp.ts, src/extraction/languages/objc.ts. 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc46b73feabdf8de6d121f4d9302f1abac11a51e8348e5fb9cc44522e0a81ad2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type === \u0027union_specifier\u0027 \u0026\u0026 getChildByField(child, \u0027body\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/c-cpp.ts, src/extraction/languages/objc.ts. 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":"src/extraction/languages/c-cpp.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ab95a878c79a8c47ccf394b1a2faf86ea73f48f6240d040a0bf402213b758d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child?.type === \u0027modifiers\u0027 \u0026\u0026 child.text.includes(\u0027static\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/java.ts, src/extraction/languages/scala.ts. 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":"src/extraction/languages/java.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3321623bab9c812d31478e17abd60d25c4930bcc86eff42ae19bbeaeed9aa1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060confidence !== null \u0026\u0026 confidence \u003C UNCERTAIN_BELOW\u0060 appears character-identically in 3 files \u2014 src/graph/dynamic-boundary-report.ts, src/ui-server/api/flow.ts, src/ui-server/api/wire.ts. 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":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63d5c0de86f5dd5a4f87134e6b466a68c84877329611ee9f29013ccabfb214d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060container.kind !== \u0027constant\u0027 \u0026\u0026 container.kind !== \u0027variable\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/import-resolver.ts, src/resolution/name-matcher.ts. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be8c845167114b957a587164bb0812b84a51bddc855adfcf47629dcbebb0c76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060d === 47 \u0026\u0026 source.charCodeAt(j \u002B 1) === 42\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/cpp-brace-scopes.ts, src/extraction/languages/cpp-macro-methods.ts. 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":"src/extraction/languages/cpp-brace-scopes.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd6d99bc0a72ab2436863f5f89d853dfb20c6a443fff476bf127bee54d30a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.kind === \u0027calls\u0027 || e.kind === \u0027instantiates\u0027\u0060 appears character-identically in 2 files \u2014 src/ui-server/api/entrypoints.ts, src/ui-server/api/route-roots.ts. 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":"src/ui-server/api/entrypoints.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8377860f15a7cac6e1c35540301ce11281399aaf09483d931547e3649c8b2ea9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060enclosing \u0026\u0026 enclosing.filePath === ref.filePath\u0060 appears character-identically in 6 files \u2014 src/resolution/frameworks/expo-router.ts, src/resolution/frameworks/nextjs.ts, src/resolution/frameworks/react-router.ts, src/resolution/frameworks/sveltekit-router.ts. 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b879ad88edc37c51cc580c2fda0b81249f9c8b2db062c7ea93192389da826c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entries.routes.routed \u0026\u0026 entries.routes.items.items.length \u003E 0\u0060 appears character-identically in 2 files \u2014 ui/src/lib/entry-model.ts, ui/src/lib/search-model.ts. 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":"ui/src/lib/entry-model.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf101046596a11403b1b5f4f5d3e4ce4e1fab463f880bc84d672bdfd25f00c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ev.type === \u0027system\u0027 \u0026\u0026 ev.subtype === \u0027init\u0027\u0060 appears character-identically in 3 files \u2014 scripts/agent-eval/parse-arms.mjs, scripts/agent-eval/parse-run.mjs, scripts/agent-eval/seq-matrix.mjs. 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":"scripts/agent-eval/parse-arms.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb9ee86dc11013672a6fb4da2350f4d82a3b1f9ed73d432ecd62347def363f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.start \u003C= n.startLine \u0026\u0026 f.end \u003E= n.startLine\u0060 appears character-identically in 2 files \u2014 src/resolution/cpp-supertypes.ts, src/resolution/name-matcher.ts. 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff5daf13ffd33b2de4f2f55c523c8ff855ddfb54a02e2f02a3d619a14246094"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.endsWith(\u0027.java\u0027) || file.endsWith(\u0027.kt\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/callback-synthesizer.ts, src/resolution/frameworks/react-native.ts. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"079133cc17caedf2d8b19d5c05918304c176a9fb5c5712f7b2e907ed306bb6e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.endsWith(\u0027.m\u0027) || file.endsWith(\u0027.mm\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/callback-synthesizer.ts, src/resolution/frameworks/react-native.ts. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2a91717c9e84e3ff9572fb4ac91eb09cad732e9e27024a2b2bf5a2dd285df4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filePath.endsWith(\u0027.ts\u0027) || filePath.endsWith(\u0027.tsx\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/express.ts, src/resolution/frameworks/nestjs.ts. 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":"src/resolution/frameworks/express.ts"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfce0b20f2b87848f7651122b34187069bb6e8191ef8f79c3581e91ca1323f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frameworkNames \u0026\u0026 frameworkNames.length \u003E 0\u0060 appears character-identically in 2 files \u2014 src/extraction/parse-worker.ts, src/extraction/tree-sitter.ts. 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":"src/extraction/parse-worker.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"861e679b4e8f32f1651ea000bdcbcbaf16bde6e0995e48514c4fddffd06dfb9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(configDir(\u0027global\u0027)) || fs.existsSync(file)\u0060 appears character-identically in 2 files \u2014 src/installer/targets/gemini.ts, src/installer/targets/kiro.ts. 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":"src/installer/targets/gemini.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0986e2700e0ea8583041681be1fb020a3a038986abb4063ebe362f1fa68c0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(file) || fs.existsSync(configDir(\u0027local\u0027))\u0060 appears character-identically in 2 files \u2014 src/installer/targets/gemini.ts, src/installer/targets/kiro.ts. 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":"src/installer/targets/gemini.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"60871fdbbb73a27ed5303a33c23f50091e0d9a38ff54fccd967df0e5cccc76d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C content.length \u0026\u0026 content[i] !== \u0027\\n\u0027\u0060 appears character-identically in 2 files \u2014 src/installer/targets/shared.ts, src/resolution/import-resolver.ts. 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":"src/installer/targets/shared.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc73648183c7fa8ce323c704cea63bd6f2d126d4bfd4474423d150680fd843d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C src.length \u0026\u0026 !(src[i] === \u0027*\u0027 \u0026\u0026 src[i \u002B 1] === \u0027/\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/razor-extractor.ts, src/resolution/path-aliases.ts. 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":"src/extraction/razor-extractor.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceae7da8b0d0ba04e715fcf792c146e5281e28eba810d589888ed17525476a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E= 0 \u0026\u0026 (line[i] === \u0027 \u0027 || line[i] === \u0027\\t\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/import-resolver.ts, src/resolution/name-matcher.ts. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"4159e34fa4d2bda1e4c54aad87759403743454455db2bcef4a9376c51d010360"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060insertedIds.has(e.source) \u0026\u0026 insertedIds.has(e.target)\u0060 appears character-identically in 2 files \u2014 src/extraction/index.ts, src/extraction/store-writer.ts. 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":"src/extraction/index.ts"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3940c2f4f7f99609bf5d3d60e50e6de24f526066037c2d0271ec79019294e0ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isPascalCase(ref.referenceName) \u0026\u0026 ref.referenceKind === \u0027calls\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/svelte.ts, src/resolution/frameworks/vue.ts. 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":"src/resolution/frameworks/svelte.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"76306eedc88ca6a10656fc5d50760757155c6be5c7f2e67e0bb2cb699f46e3e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003C n \u0026\u0026 isWordChar(source.charCodeAt(j))\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/cpp-macro-methods.ts, src/resolution/ambient-modules.ts. 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":"src/extraction/languages/cpp-macro-methods.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2b1b486adeffbdffdb0ada1dfe083cec17d7bf2c36bb0a542ee93a4ed9b27c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060modifier.exec(safe) \u0026\u0026 modifier.lastIndex \u003E i\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/nestjs.ts, src/resolution/tier-synthesizer.ts. 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":"src/resolution/frameworks/nestjs.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9138b302ea574eb089c0a5bffbd68a695d46954e00258ca30ebf869c700c0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.filePath.startsWith(dir) \u0026\u0026 !n.filePath.slice(dir.length).includes(\u0027/\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/go.ts, src/resolution/frameworks/name-heuristic.ts. 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":"src/resolution/frameworks/go.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ae5e5eef191a681f4d9d01d2c0421761b5cf0081e3eab5b2b7f051755afd7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.id \u0026\u0026 n.kind \u0026\u0026 n.name \u0026\u0026 n.filePath \u0026\u0026 n.language\u0060 appears character-identically in 2 files \u2014 src/extraction/index.ts, src/extraction/store-writer.ts. 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":"src/extraction/index.ts"},"region":{"startLine":3400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e99235a584fbdb8842a1813c4871e8c18e5dcdafd54239dda3dbf9aa50e9ad0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind !== \u0027constant\u0027 \u0026\u0026 n.kind !== \u0027variable\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/callback-synthesizer.ts, src/resolution/synth-utils.ts. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9afee709c6f102bb371f747c08d3ce4e966e7ff2daeabace49f1cee4ff8a48d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind !== \u0027file\u0027 \u0026\u0026 n.kind !== \u0027import\u0027\u0060 appears character-identically in 2 files \u2014 src/index.ts, src/ui-server/api/file.ts. 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":"src/index.ts"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"51abeddf885f299ca5d9fc47dfc108fba16d50c4e8460cc65baaa2977932e53c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind !== \u0027method\u0027 || n.language !== \u0027ruby\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/name-matcher.ts, src/resolution/ruby-parameter-flow.ts. 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":"src/resolution/name-matcher.ts"},"region":{"startLine":8995}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59491e19272a0ea44950372daee1cd74d8588bd15bc700327a8d5cfc9f3ebe1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027class\u0027 \u0026\u0026 n.name === className\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/drupal.ts, src/resolution/frameworks/laravel.ts. 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ddfcfb76bd28d4fceb0bb7767cb12f7ae155eacdc2d443378d7bbe095e1b63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027class\u0027 \u0026\u0026 n.startLine \u003C= ref.line \u0026\u0026 n.endLine \u003E= ref.line\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/angular-router.ts, src/resolution/name-matcher.ts. 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":"src/resolution/frameworks/angular-router.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f18d38818ed92740fd858d8f8d439c1e6cc04b89e1d5f23a21940320a98690"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027constant\u0027 || n.kind === \u0027variable\u0027\u0060 appears character-identically in 3 files \u2014 src/resolution/const-alias-synthesizer.ts, src/resolution/name-matcher.ts, src/ui-server/api/screens.ts. 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":"src/resolution/const-alias-synthesizer.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6bf75b096114a45a8f56c2aced570e1a9acc642d08b05b003f20c7786d5f9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027function\u0027 || n.kind === \u0027method\u0027\u0060 appears character-identically in 6 files \u2014 src/extraction/tree-sitter.ts, src/resolution/callback-synthesizer.ts, src/resolution/import-resolver.ts, src/resolution/name-matcher.ts. 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":"src/extraction/tree-sitter.ts"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf66e21c4d398ebd298f66eeb53b7529d6db643363eb8ff805e5fa5bb85e3d92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027method\u0027 \u0026\u0026 n.name === method\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/codeigniter.ts, src/resolution/frameworks/laravel.ts. 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":"src/resolution/frameworks/codeigniter.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dc859a994f9736f4450470fa29058a938b484c7db0b8ed7469b4e13bdd11cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027method\u0027 \u0026\u0026 n.name === methodName\u0060 appears character-identically in 3 files \u2014 src/resolution/frameworks/drupal.ts, src/resolution/frameworks/laravel.ts, src/resolution/name-matcher.ts. 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":"src/resolution/frameworks/drupal.ts"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f16b6f0190f2257d40e892e08e409bd6958bd7134fe923ddff865e8d0db80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027method\u0027 || n.kind === \u0027function\u0027\u0060 appears character-identically in 4 files \u2014 src/extraction/languages/java.ts, src/extraction/tree-sitter.ts, src/resolution/callback-synthesizer.ts, src/resolution/import-resolver.ts. 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":"src/extraction/languages/java.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e953403f8ff139fa1d611f0b6b3cc4b1076ea77729e5aed8484ff1d123871f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027variable\u0027 || n.kind === \u0027constant\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/svelte.ts, src/resolution/name-matcher.ts. 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":"src/resolution/frameworks/svelte.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6bd6446521d2b7ca70ae2127b434a9459190bfdf0588e60adc62118efca1f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.language === \u0027cpp\u0027 || n.language === \u0027c\u0027\u0060 appears character-identically in 3 files \u2014 src/resolution/cpp-supertypes.ts, src/resolution/cpp-type-aliases.ts, src/resolution/name-matcher.ts. 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":"src/resolution/cpp-supertypes.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6499ed4bd691d8c505e3c39a7feb3cf706d4b1e973ed3c4121d9379386f6aaba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.startLine \u003C= line \u0026\u0026 n.endLine \u003E= line\u0060 appears character-identically in 2 files \u2014 src/resolution/callback-synthesizer.ts, src/resolution/vbnet-receivers.ts. 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":"src/resolution/callback-synthesizer.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"67059e216a14c5a4fae7186d59bfda5ae74573cf2d8b1b722a00f3698229950a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060open \u003C text.length \u0026\u0026 /\\s/.test(text[open]!)\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/expo-router.ts, src/resolution/override-parameters.ts. 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":"src/resolution/frameworks/expo-router.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c96a3cd4c001e8cc3c3f0ac4e7c68b6d79fc32695b35266de409e2e25e4ac4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.APPDATA \u0026\u0026 process.env.APPDATA.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 src/installer/targets/copilot-jetbrains.ts, src/installer/targets/copilot-vscode.ts. 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":"src/installer/targets/copilot-jetbrains.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f6564d5b8d55fce384270e672c95b7918c7551207c547b62ff7c46ef89b828"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CG_ENGINE || resolve(HERE, \u0027..\u0027, \u0027..\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/agent-eval/offload-eval-effort.mjs, scripts/agent-eval/offload-eval-hook.mjs. 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":"scripts/agent-eval/offload-eval-effort.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef632b7acfb42837e2c0aae9df000da74daeeb03b3f1ae0319bb29e47f72376e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CODEGRAPH_INSTALL_DIR || path.join(os.homedir(), \u0027.codegraph\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/npm-sdk.js, scripts/npm-shim.js. 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":"scripts/npm-sdk.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab9b95040c2c9c412df16218d419cea31791bd4f11e0c8e9e8447d899d24634"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.XDG_CONFIG_HOME \u0026\u0026 process.env.XDG_CONFIG_HOME.trim().length \u003E 0\u0060 appears character-identically in 3 files \u2014 src/installer/targets/copilot-jetbrains.ts, src/installer/targets/copilot-vscode.ts, src/installer/targets/opencode.ts. 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":"src/installer/targets/copilot-jetbrains.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb412b413a3998c7eccdd596d6b43003c9902c648dc51017f4b68a7ed80b684"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027win32\u0027 || process.platform === \u0027darwin\u0027\u0060 appears character-identically in 2 files \u2014 src/mcp/explore-session-state.ts, src/utils.ts. 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":"src/mcp/explore-session-state.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a3794176d1d981480aac9d89911c786bfb239aeb3404852964b9c199ad5cd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060queryLower.includes(\u0027test\u0027) || queryLower.includes(\u0027spec\u0027)\u0060 appears character-identically in 2 files \u2014 src/context/index.ts, src/search/query-utils.ts. 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":"src/context/index.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99b7c81beb1634b7df75150b70205190a3835d9c4b669a1848194719053281f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quote === \u0027\u0060\u0027 \u0026\u0026 ch === \u0027$\u0027 \u0026\u0026 s[i \u002B 1] === \u0027{\u0027\u0060 appears character-identically in 2 files \u2014 src/extraction/vue-options-api.ts, src/resolution/frameworks/object-literal.ts. 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":"src/extraction/vue-options-api.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c317f3ed295b36daf7ddc356f11d4263d01e39c29d2900b58ae883fdd1add"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.language !== \u0027c\u0027 \u0026\u0026 ref.language !== \u0027cpp\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/cpp-macro-visibility.ts, src/resolution/name-matcher.ts. 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":"src/resolution/cpp-macro-visibility.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1c40ed5c0bc0cabaa452796d4d9c6311436fb175c0a82d6cecf5028c1ff32b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.language !== \u0027java\u0027 \u0026\u0026 ref.language !== \u0027kotlin\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/java.ts, src/resolution/import-resolver.ts. 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":"src/resolution/frameworks/java.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a29af9f38d70ed0c83505867f83ef04604297ceaac9be0652e39461fa6895f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.language !== \u0027php\u0027 || ref.referenceKind !== \u0027calls\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/import-resolver.ts, src/resolution/name-matcher.ts. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaf61ed31a025aaad2ddd92e1977b52b945f13850d6137c0beed8cf3972af73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.language === \u0027java\u0027 || ref.language === \u0027kotlin\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/import-resolver.ts, src/resolution/name-matcher.ts. 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":"src/resolution/import-resolver.ts"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d97e77bffc342383c7047169b53ddbe1ac99e51368a936410e5b746329a6e91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.referenceKind === \u0027extends\u0027 || ref.referenceKind === \u0027implements\u0027\u0060 appears character-identically in 4 files \u2014 src/resolution/frameworks/go.ts, src/resolution/frameworks/java.ts, src/resolution/frameworks/name-heuristic.ts, src/resolution/types.ts. 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":"src/resolution/frameworks/go.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"71890069649a0297e2b45e9c6d38407bba32994871ddaafb9d5e262605e6544b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result == null || typeof result !== \u0027object\u0027 || Array.isArray(result)\u0060 appears character-identically in 3 files \u2014 src/installer/targets/copilot-jetbrains.ts, src/installer/targets/copilot-vscode.ts, src/installer/targets/opencode.ts. 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":"src/installer/targets/copilot-jetbrains.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f13c3d3b5c7fdc08a7b3f6513aaca85fd60201402d2e716f9fd580844d5039"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.outcome === \u0027term\u0027 || result.outcome === \u0027kill\u0027\u0060 appears character-identically in 2 files \u2014 src/mcp/daemon-registry.ts, src/mcp/index.ts. 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":"src/mcp/daemon-registry.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebf03e634717afc884f727b6c20e9596d2269625b89baf26fc6c9f3232dbcec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seg.startsWith(\u0027:\u0027) \u0026\u0026 seg.endsWith(\u0027?\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/react-router.ts, src/resolution/frameworks/sveltekit-router.ts. 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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbec9f8356c4ddb4e3b940d4e575d993e4852b759997b6a3c6f6d58ecdba17f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segs.length \u003E 1 \u0026\u0026 isOptionalParam(segs[segs.length - 1]!)\u0060 appears character-identically in 2 files \u2014 src/resolution/frameworks/react-router.ts, src/resolution/frameworks/sveltekit-router.ts. 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":"src/resolution/frameworks/react-router.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"703e6bfd50f42329c88118f6ba5f68a6773b585ca19acce2fe00d6ac68d661bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.startsWith(\u0027./\u0027) || source.startsWith(\u0027../\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/languages/terraform.ts, src/resolution/frameworks/terraform.ts. 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":"src/extraction/languages/terraform.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e04c9392837c56cbfe679a276470ea3e4ac1f8b69d8e14a9c23afc8e593813"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source[j] === \u0027*\u0027 \u0026\u0026 source[j \u002B 1] === \u0027/\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/dart-local-scope.ts, src/resolution/name-matcher.ts. 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a3d083b4160960377eb1cc507e20a58584c1da7cfd53897f442e996b4477e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source[j] === \u0027/\u0027 \u0026\u0026 source[j \u002B 1] === \u0027*\u0027\u0060 appears character-identically in 2 files \u2014 src/resolution/dart-local-scope.ts, src/resolution/name-matcher.ts. 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":"src/resolution/dart-local-scope.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e18abb99c74348ece36857ac46cef30c0a03d62f42ef902f3adaba7781e5908"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.filePath.split(\u0027/\u0027).pop() || this.filePath\u0060 appears character-identically in 3 files \u2014 src/extraction/dfm-extractor.ts, src/extraction/liquid-extractor.ts, src/extraction/mybatis-extractor.ts. 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":"src/extraction/dfm-extractor.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b529b0b821840c7f7c921cb376035c0320edc91775ef8b23468446f5b96d44bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.filePath.split(/[/\\\\]/).pop() || this.filePath\u0060 appears character-identically in 5 files \u2014 src/extraction/astro-extractor.ts, src/extraction/cfml-extractor.ts, src/extraction/razor-extractor.ts, src/extraction/svelte-extractor.ts. 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":"src/extraction/astro-extractor.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae17547bed959cc73c5ddac4ac92ba1a0faca73adf80c9d6393f42f51a0a4c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.queue.length \u0026\u0026 (job = this.queue.shift()) \u0026\u0026 job.settled\u0060 appears character-identically in 2 files \u2014 src/extraction/parse-pool.ts, src/mcp/query-pool.ts. 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":"src/extraction/parse-pool.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc462ecf732414d2db220ab10da3e7024527f6a60628bc947eb18394dcac0843"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof CodeGraph?.openSync !== \u0027function\u0027 || typeof ToolHandler !== \u0027function\u0027\u0060 appears character-identically in 5 files \u2014 scripts/agent-eval/offload-eval-effort.mjs, scripts/agent-eval/offload-eval-hook.mjs, scripts/agent-eval/probe-allocation.mjs, scripts/agent-eval/probe-file-spend.mjs. 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":"scripts/agent-eval/offload-eval-effort.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb1735abad50c79df1ef84d601a6e3e85fdec3d917bedb4a16c9a26a6fbf557"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof edge.line === \u0027number\u0027 \u0026\u0026 edge.line \u003E 0\u0060 appears character-identically in 2 files \u2014 src/graph/call-sites.ts, ui/src/lib/flow-model.ts. 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":"src/graph/call-sites.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80aa0a207439c9569d6e1d481e24065843157fd0c6ffd0a7aa6309bc586b823"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry !== \u0027object\u0027 || entry === null\u0060 appears character-identically in 2 files \u2014 src/ui-server/api/trail-store.ts, src/ui-server/api/trails.ts. 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":"src/ui-server/api/trail-store.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9647a8cae913733f3c67b00b3addd26c54abd771916bac1c892f73d9e6023088"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.pathname === \u0027/api\u0027 || url.pathname.startsWith(\u0027/api/\u0027)\u0060 appears character-identically in 2 files \u2014 src/ui-server/index.ts, telemetry-dashboard/src/index.ts. 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":"src/ui-server/index.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9721f825ba3d537ab1f6ad9bd2ee8f778bcaec7eafbcd60535deae445a718c54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!c.name.starts_with(\u0022this.\u0022) \u0026\u0026 !c.name.contains(\u0022::\u0022)\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/php.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcecdffed4aa75511be7361388147db5c2151903fee4f42507c483f09939362"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name.is_empty() \u0026\u0026 !is_builtin_type(name)\u0060 appears character-identically in 3 files \u2014 codegraph-kernel/src/csharp.rs, codegraph-kernel/src/dart.rs, codegraph-kernel/src/scala.rs. 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dd76902b7d5110635ad1d57b682672a4f60cfb45bb4e8b2fb84430be3fe098"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(kind == \u0022constant\u0022 || kind == \u0022variable\u0022) \u0026\u0026 util::utf16_len(name) \u003E= 3 \u0026\u0026 util::has_upper_or_underscore().is_match(name)\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/dart.rs, codegraph-kernel/src/scala.rs. 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdac1ecf38c2b7e624c446c434c432785968cbeb26edfaab51e365ebc0e56af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0027_\u0027 || c.is_ascii_alphabetic() || (i \u003E 0 \u0026\u0026 c.is_ascii_digit())\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/go.rs, codegraph-kernel/src/python.rs. 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":"codegraph-kernel/src/go.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8f41602e8c6b0d21962c7dc30c107775a020a95e2cb532fa2731461f51bd20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cands.is_empty() || util::is_generated_file(self.file_path)\u0060 appears character-identically in 14 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/csharp.rs, codegraph-kernel/src/dart.rs, codegraph-kernel/src/go.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"872b246f514c9b4d978d76433e27f59a6317e747c18b894ad805f7ccf7dc9ff4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060class_name.starts_with(\u0027:\u0027) || class_name.starts_with(\u0027.\u0027)\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/tsjs/extractors.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"446d6109c02a052285cbc14692812c7d102173c5788eb50a22d6a2ab3bdffd48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022constant\u0022 || kind == \u0022variable\u0022\u0060 appears character-identically in 11 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/csharp.rs, codegraph-kernel/src/go.rs, codegraph-kernel/src/java.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4ec3e5fa6153e2e079617c42daea1e8d6c414c2af133d685024480ee8f1473"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022property_declaration\u0022 \u0026\u0026 self.inside_class_like()\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/csharp.rs, codegraph-kernel/src/php.rs. 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe0b010e2c0095b7db4f2b8554df701914b82e25dc322a28ea1799903130965"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060last.is_empty() || !simple_type_name_re().is_match(last)\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/dart.rs, codegraph-kernel/src/scala.rs. 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":"codegraph-kernel/src/dart.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6167a87f181ae281624e61c3163ed352235c66f6c63af62cdbbf9844a7679bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_last.is_some() \u0026\u0026 lhs_last == Some(rhs_text)\u0060 appears character-identically in 4 files \u2014 codegraph-kernel/src/csharp.rs, codegraph-kernel/src/kotlin.rs, codegraph-kernel/src/swift.rs, codegraph-kernel/src/tsjs/fnref.rs. 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77f3401373ce7718214b16e08094cd899bcc9ae2e2cec7203fb368cd20d4937"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_last.is_some() \u0026\u0026 lhs_last == Some(self.text(rhs).trim())\u0060 appears character-identically in 8 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/dart.rs, codegraph-kernel/src/go.rs, codegraph-kernel/src/java.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"185d6e1c00a888f27fbeb5a0528025a09ef41f18fa7500ea16a1699640ee71f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.is_empty() || name == \u0022\u003Canonymous\u003E\u0022\u0060 appears character-identically in 2 files \u2014 codegraph-kernel/src/csharp.rs, codegraph-kernel/src/java.rs. 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"0373e7942d5c2833adf8556cf4d42d5db1da58a653862b3128a021c85db70794"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.starts_with(\u0027:\u0027) || name.starts_with(\u0027.\u0027)\u0060 appears character-identically in 7 files \u2014 codegraph-kernel/src/csharp.rs, codegraph-kernel/src/java.rs, codegraph-kernel/src/kotlin.rs, codegraph-kernel/src/php.rs. 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":"codegraph-kernel/src/csharp.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9063f5ab0e0fcfeaff9cc712250f5f66bfac8cf18571faa09b602e7e1f89e87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_kind_ok \u0026\u0026 util::utf16_len(name) \u003E= 3 \u0026\u0026 util::has_upper_or_underscore().is_match(name)\u0060 appears character-identically in 10 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/csharp.rs, codegraph-kernel/src/go.rs, codegraph-kernel/src/java.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34a304a630028aed9025b5259250d48e42decf918445e437eeab18973adfaa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060targets.is_empty() || scopes.is_empty() || util::is_generated_file(self.file_path)\u0060 appears character-identically in 13 files \u2014 codegraph-kernel/src/ccpp/mod.rs, codegraph-kernel/src/csharp.rs, codegraph-kernel/src/dart.rs, codegraph-kernel/src/go.rs. 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":"codegraph-kernel/src/ccpp/mod.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cd5e521ed8cbaa85f02583a3d62841a54219475e164974e73eee9a9314a614"}},{"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 in catch: \u0060describeFatal\u0060 swallows every exception into \u0060return \u0027\u003Cunstringifiable value\u003E\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/fatal-handler.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dc4b2b1087138642c257e68851a4ddc73f3bdb01545b517d010a35cf5c925e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listDaemons\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/daemon-registry.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce199d0547d9f0ec43b7472a8d0690adc1868ab06d67e43598e7a3537a7a17"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060packageVersion\u0060 swallows every exception into \u0060return \u00270.0.0\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f9d2d4f725fced47c40313992d569cac45d2d61b6dc276506f4111ddf614b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getCurrentVersion\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/migrations.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdde300e1ced8bdc183b0a6fbcc8ef6cf7697670bc63b221f82986a2dea4f21"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getWalSizeBytes\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/index.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5af779eb8f0eea2a9107dc901963e45f6723c3fe231c907cc88d0ff8dccf9d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getDbFileSizeBytes\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/index.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"127fac4ba44b9055571cd8d27463d296976639c6a46cf251ee155476b332a283"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readNpmPathDeps\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/workspace-packages.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f6f2efd92652f0bfe2a903af40eb5717f9ebd793ad895361c43cdfd7dcc35"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectFrameworks\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/frameworks/index.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ddf4a855f3e074d9fe1fca53f026753bd809483bf943941414519944ca306c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scopedSyncMatcher\u0060 swallows every exception into \u0060return \u0027-\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f04893a34fd4da8e60e2cd1c50c34b56530e79d90a8e154485989f93d0684b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listDirectories\u0060 (in \u0060buildDetectionContext\u0060) swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8c928beedd4e0fc095c06b3d1993b0c1022109e493caf5af05ac849e44dc3b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060diskSignature\u0060 swallows every exception into \u0060return \u0027-\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"16faed161946841b0a0ac230464a879121f9216027c4c9f5a68b90247eaf9887"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readGitignorePatterns\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe201a2d4d53dcc5445429d95652e20cab85d89641d904c8a7fd0d490a1ac9d6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060sparseCheckoutStamp\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9091466f1408cd78f1b0062ecb278ce20e388423dd365a7bb59dafd18045767"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listGitIgnoredDirectories\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa527392523b5a6c36a84c69ea696ea5899cb17f69cbdbf28781fe5c591a90c4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listIgnoredDirs\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eba0fb21d2f48328766dec15f97cf4b1f985836c69f36ad6ae7e64f7cf195f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060discoverEmbeddedRepoRoots\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3278ba29c04900389a70c4bec11e433da67de9b059498395d63ecd9b50badfdc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060findUnindexedIgnoredRepos\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/index.ts"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b05d591129d166d84279e0f4d4e907b8d35d1ffb48e9b67357e473f4a9d87b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readInactiveFile\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/memory-budget.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fafe03321cb09b53937489518156f2782c7de56c3bef61b558656d1c0de5717"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseModuleConfigSnapshot\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8209429d272076137130c3f31a5f62994fce52bc359308e6e4fc434866b8d20"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cargoManifestDigestText\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"787fbc014fdc20febfaac7b47b672ca739b15d6c5ead651bb2c1886f138d1f81"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060findDynamicBoundaries\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/dynamic-boundary-report.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0b79886129201a02db38625f31822040c4a684918c7b0c58e6d16e5bc6176"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060hierarchyEdges\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/type-hierarchy.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c19284af0f00e6223e3071053fcfa8d0ae973a8ae5eb26fe9e39fb9875dcb1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060membersOf\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/type-hierarchy.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"93940edc329bb859a92938cc1a4f7bc4299bb48ac0173c7c80f2ee6180ae633e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060countImplementers\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/type-hierarchy.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3939fcd26ea06b379ccf4b6071583c83205bd0c98598065c9f81e9e9361a7911"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060whenLabel\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68b1c6d27520972d19e390435f40e299402d071b992805a1eb7a1fd17e74df4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060callerCount\u0060 (in \u0060handleExplore\u0060) swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"362d53a8b5af50510be10294b61f5129a5fd73f1803d10fc68c27f6d8e36cfc9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060filesDefiningSymbol\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9050b0bedc12457d2a2dd9e56d2b1f5bb0144e19dd32d389d8d5a21b9615d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060snapshot\u0060 (in \u0060wireLayers\u0060) swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f67a07d08a129d6210ad0952af8e63365b8c9ee852f67d243a650e022295403"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060unresolvedImportsOf\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui-server/api/file.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"40948d79c7086b0f7b2a9b2c2a21d822a3c39c5e5cf79c5ba09f98022337704f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readText\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/hermes.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"902e9527599963e8230df0fab9dc54188632f99ea82af0897d05f843d5518f71"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060profilePatchPaths\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/targets/dsh.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5266036cb3fc1061c6fe8b38e3828ed383f6b9e276252cfd5e059298c65108c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getVersion\u0060 swallows every exception into \u0060return \u00270.0.0\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/installer/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f6c9dece74e0da0b7eb86d5d3771c1697b3c74ffc7fd62a1c994e13775ca17"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060class_anns.contains(\u0022SuperBuilder\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060class_anns.contains(\u0022SuperBuilder\u0022)\u0060 also satisfies \u0060class_anns.contains(\u0022Builder\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":"codegraph-kernel/src/java.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"67276d46c543186e939bd2acb9edf4616436ec481a3750c620307db6f01b1eaf"}}],"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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.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-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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"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-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":135,"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."]}]}