{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"extension.activate (cyclomatic 85): extension.activate has cyclomatic complexity 85 (threshold 15). Most of this is not in the body itself: 8 of the 85 points are its own statements and the rest belongs to 36 function items inside it that branch (a function literal at line 1101, a function literal at line 372, a function literal at line 939, \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":"editors/vscode/src/extension.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5917ef61a41ab06bd2e84da4f1fc1352cdfa69d69aef92a3d5860934a84e07a5"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_types::workspace::render_message (cyclomatic 65): fallow_types::workspace::render_message has cyclomatic complexity 65 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/workspace.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"874b30946ede8d3228e7a578b4ed5c2c617ab4d49472891b80d3c58d07b6593b"}},{"ruleId":"D1","level":"warning","message":{"text":"annotations.drawClusterLabels (cyclomatic 61): annotations.drawClusterLabels has cyclomatic complexity 61 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 7 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4618fde17f5c77cdd0338ac7622340180be877ae1660cc6ec17ab9cabf0283"}},{"ruleId":"D1","level":"warning","message":{"text":"DeadCodeAuditLedger::annotate_results (cyclomatic 51): DeadCodeAuditLedger::annotate_results has cyclomatic complexity 51 (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":"crates/api/src/audit_keys.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9239f05df8ae391ffc98b5ff99d77d28306a555e5852beed736f17ca3b7cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"DeadCodeTreeProvider.getChildren (cyclomatic 43): DeadCodeTreeProvider.getChildren has cyclomatic complexity 43 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 5 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":"editors/vscode/src/treeView.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e2e84a14057c24450ec806f5d8eba7b586810ec09c780b98c24e2c9572917"}},{"ruleId":"D1","level":"warning","message":{"text":"chrome.buildChrome (cyclomatic 36): chrome.buildChrome has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 8 of the 36 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 275, a function literal at line 307, refreshLensOverflow, \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":"viz-frontend/src/chrome.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c01f81b11b524a64c6137d8d2d285784be1e6f410fd9862d6f6f59d709a5366"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.rankRowsForLens (cyclomatic 36): panel.rankRowsForLens has cyclomatic complexity 36 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 16 belong to 6 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":"viz-frontend/src/panel.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf802b63254d76b1f911766348ee99846e0738a28463d4c201d1749a34d1d87"}},{"ruleId":"D1","level":"warning","message":{"text":"coverage-producer-refresh.main (cyclomatic 35): coverage-producer-refresh.main has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0e7fb5094bebd083e21fae35ba02bd76fca474c225cbd34d64a9cfdd2a3aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.renderLensPanel (cyclomatic 35): panel.renderLensPanel has cyclomatic complexity 35 (threshold 15). Of this number, 28 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":"viz-frontend/src/panel.ts"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c44b0110d9786bc92f2b33d40601ff48a81c9bdbd8c9d9f6da8947295ef689"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance (cyclomatic 34): fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance has cyclomatic complexity 34 (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":"crates/cli/src/similar_code_help.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb209acec92ec79ad880e0031ffecd6a355209c0a910766b246a2af69bdc5bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"render.drawNodes (cyclomatic 34): render.drawNodes 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1ce0d8604abba40f8b8ae552e1c111e8338cc27efa5c7c539c07f7daa839f3"}},{"ruleId":"D1","level":"warning","message":{"text":"check-miri-cfg.scanFile (cyclomatic 32): check-miri-cfg.scanFile has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 124, insideGated, a function literal at line 108). 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":"scripts/check-miri-cfg.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d72696946d598567590288285fa28d1c16a85ff9db5e6459a2c04745d9a432"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.securityCandidateEl (cyclomatic 32): panel.securityCandidateEl has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/panel.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e8da9772cc3077dfbc8088f3da85ae552c165020b97be2615698ab3ffc807a"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementBoundary::push (cyclomatic 31): StatementBoundary::push 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":"crates/extract/src/mdx.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef83e4447b1af5efdb8972166d5f5995715265b807c7b2bd7c707d72b2539ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"vsix-inventory.validateEntry (cyclomatic 29): vsix-inventory.validateEntry has cyclomatic complexity 29 (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":"editors/vscode/scripts/vsix-inventory.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9b4be290e315bd0f85b8310b7443c296c43afc6b067a21f6c6cc4f36c36579"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-wait-checks.supersededCancellations (cyclomatic 29): ship-wait-checks.supersededCancellations 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30df9ce86753b17e97c302e2c3071ea0a3c53190bc2c6b53001b582213e0349"}},{"ruleId":"D1","level":"warning","message":{"text":"chrome.updateChrome (cyclomatic 29): chrome.updateChrome 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":"viz-frontend/src/chrome.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"135073c18c512f471977d8a4b5a82edd7b7adb476a6fb4025d40670fbfdc4cff"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::audit_cache_prune::entry_row (cyclomatic 27): fallow_cli::audit_cache_prune::entry_row has cyclomatic complexity 27 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit_cache_prune.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"478b4206619b58ea613637661e485b5f5b5040d845bac6c7de073a3cf594d828"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::cli_startup::validate_input_flags (cyclomatic 27): fallow_cli::cli_startup::validate_input_flags 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 is NOT this file\u0027s highest cyclomatic complexity: fallow_cli::cli_startup::command_without_global_baseline (cyclomatic 37) 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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/cli_startup.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc12164a4a88d0dd5275debc583e3e64b8a936372733f6c9585950c69dc6ad"}},{"ruleId":"D1","level":"warning","message":{"text":"TsconfigOutputMap::resolve_source_for_entry (cyclomatic 27): TsconfigOutputMap::resolve_source_for_entry 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":"crates/config/src/workspace/tsconfig.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f636f42ad95fc20cb35c2cb15df1f517f98ec3420557dd395df083031e99a6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_factory_return_function (cyclomatic 27): ModuleInfoExtractor::record_factory_return_function 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3db8b7c0642dea8ee1929f5d48d891f77672d6a675f51d63134c6e4573c3ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"download.downloadBinary (cyclomatic 27): download.downloadBinary has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1122, 1136). 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":"editors/vscode/src/download.ts"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be62b465964e4aec03bc9ef94900c29a5201c9509e35d8f8242ad60322db6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::report::sarif::native_rule_id (cyclomatic 26): fallow_cli::report::sarif::native_rule_id 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":"crates/cli/src/report/sarif.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4f3b7aeb946049999ef4500b0d2c7f05c587a35dafdd6acc779364b2ed5919"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::template_complexity::engine::find_top_level_ternary (cyclomatic 26): fallow_extract::template_complexity::engine::find_top_level_ternary has cyclomatic complexity 26 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec21eb38965a4fdfe7cdf541a80156fe7b463ff4cbba524b4a95f6f2e28feb"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_mutation::logging_only::is_pure (cyclomatic 26): fallow_mutation::logging_only::is_pure has cyclomatic complexity 26 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mutation/src/logging_only.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"240dd4668d78e8deb9115e6c69a8d8014e22b809ef98c60deeea583e25f27078"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_template::component_contracts::collect (cyclomatic 25): fallow_extract::sfc_template::component_contracts::collect 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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d5d1ad73032cdab7fadf1335a896958843bfbafc06d87e81c1fe8a3c5f1bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"ego.buildColumn (cyclomatic 25): ego.buildColumn has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 142, a function literal at line 128, isViolation, \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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b82dec6549da868a4db1a94cd608d1e88caeabbc932d1aa497829f3dd385daf"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateComplexity::scan_expression_without_ternary (cyclomatic 24): TemplateComplexity::scan_expression_without_ternary has cyclomatic complexity 24 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16197540f75d946314893c91bcf4ccdd1bcea2faf3e45994f70d61d722926f6"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic-clone-conformance.validateFallowReport (cyclomatic 24): semantic-clone-conformance.validateFallowReport 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"742e4653670f1c816553d6951946c706229c52104df1c1b8e683d8759a1c8e75"}},{"ruleId":"D1","level":"warning","message":{"text":"render.drawRoads (cyclomatic 24): render.drawRoads 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebdf7ed5c655779fc6d39d9e3bf209df065d7c8781fe7665d4dea2ea8bc46fa"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::similar_code::transport::validate_embed_response (cyclomatic 23): fallow_api::similar_code::transport::validate_embed_response 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/similar_code/transport.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c816ca69e77227f0edd8d0884b16b7ec4ace15d9c6078f0047485db0263d2e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::absent_component_prop::find_absent_component_props (cyclomatic 23): fallow_core::analyze::absent_component_prop::find_absent_component_props 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":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8eed885502da9e939c6e653637f4715890dd39a0d3c0547d275e23620d0282"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::visit_assignment_expression (cyclomatic 23): ModuleInfoExtractor::visit_assignment_expression 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a4563542fd82fbf5779a5bc6e78d4769407c828a5632caf3ba70d990e850c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_template::component_contracts::named_attribute_supply (cyclomatic 23): fallow_extract::sfc_template::component_contracts::named_attribute_supply 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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a528909e3c62181e4b7b9b34084bc47d94d6bdc0fbc1720f3f2fe9f3a02df3"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::template_complexity::svelte::split_await_shorthand (cyclomatic 23): fallow_extract::template_complexity::svelte::split_await_shorthand has cyclomatic complexity 23 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_complexity/svelte.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"595f570304a506bdafc072f81af77bd5759805889ed35790678bab4022be9c91"}},{"ruleId":"D1","level":"warning","message":{"text":"build.directoryCluster (cyclomatic 23): build.directoryCluster has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (split, emit, a function literal at line 122, \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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ffc9084703250d453009fcd7f8111e477e5637d7a505311c5b379e3a10584f"}},{"ruleId":"D1","level":"warning","message":{"text":"treemap.renderTreemap (cyclomatic 23): treemap.renderTreemap 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83396d7ac96970cb9c13eede4e26ed8ab186c4fd74279b7190a680b41c9df97"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractCollector::collect_declarations (cyclomatic 22): ContractCollector::collect_declarations 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93c2bfdeac1b511282df7e42873d45eeb16252b4c8f1d30a8723c7c93279c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::template_complexity::svelte::find_matching_curly (cyclomatic 22): fallow_extract::template_complexity::svelte::find_matching_curly has cyclomatic complexity 22 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_complexity/svelte.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c178f2ce96274ac801af3114f6562edc1628fc3c9fd2a52f8d08254a48d50d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_chain_names::static_member_object_name (cyclomatic 22): fallow_extract::visitor::visit_impl_chain_names::static_member_object_name has cyclomatic complexity 22 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_chain_names.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca56dc11f09bd161e9973308fd717a63671a047953d2798abb666a4d37ada46"}},{"ruleId":"D1","level":"warning","message":{"text":"select-miri-runner.parseAllocation (cyclomatic 22): select-miri-runner.parseAllocation 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":"scripts/select-miri-runner.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2874dfac39617d8a70f3c34fcf9fb1ba35f4ff06877953963c799ea26f42ef"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic-clone-conformance.loadCandidateEvidence (cyclomatic 22): semantic-clone-conformance.loadCandidateEvidence has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 56, 105). 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed897760ca8d395a2b78cd49f9c628e6b54fb89805f2eba15884cbe3072209f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-wait-checks.currentRollupChecks (cyclomatic 22): ship-wait-checks.currentRollupChecks 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaa666c757bc9b79d0ee0f94733e923a0d585154dd2cf8355814ea9a6d3cff6"}},{"ruleId":"D1","level":"warning","message":{"text":"sync-emitted-versions.scanJsonExample (cyclomatic 22): sync-emitted-versions.scanJsonExample has cyclomatic complexity 22 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync-emitted-versions.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"abca36bd81001c9a3352e4f486d01ecb92483f1ebc99a9e781579f9136d14a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"build.louvainCluster (cyclomatic 22): build.louvainCluster has cyclomatic complexity 22 (threshold 15). Of this number, 11 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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0ea66cb7f82dbf88638f91e11258d7f6a8da2176f6ed208254369790751d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"interact.graphHoverTarget (cyclomatic 22): interact.graphHoverTarget 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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a381aacdf825640aa565ef9dc4bcc5b9304f082df2eb912bd1678ef18b96f2e2"}},{"ruleId":"D1","level":"warning","message":{"text":"interact.graphHandleClick (cyclomatic 22): interact.graphHandleClick 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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4140284be49dfcb476956cfe8a51e6963d0b2d70ad3b1c0ee2ca12f2b5bbd85b"}},{"ruleId":"D1","level":"warning","message":{"text":"treemap.renderFileCell (cyclomatic 22): treemap.renderFileCell 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fec95b4da32b0f298a45925ef3ad1fb68c9f981ac0b44862b1ae513695ea21"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.complexitySection (cyclomatic 22): panel.complexitySection 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":"viz-frontend/src/panel.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e02d7cfe533f37c1fdae10e6a6d005989df0589055c92a55b916d5444ab029"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::agent_install::mcp::merge_codex (cyclomatic 21): fallow_cli::agent_install::mcp::merge_codex 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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b72bf8211c376c454f24164f3aca9112283b2ea8df7aad024b8afd9160e1770"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::unused_overrides::collect_lockfile_packages (cyclomatic 21): fallow_core::analyze::unused_overrides::collect_lockfile_packages 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":"crates/core/src/analyze/unused_overrides.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd73503f55083e5fa803908e1e5587cf5862ad2784a1fe8c1aa41af15f008fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::config_parser::find_config_object (cyclomatic 21): fallow_core::plugins::config_parser::find_config_object 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22c363b1ed6c2202237acd27ea460fdd7f4dab1c6fad29ef0b8b6fb43a67b41"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::scripts::shell::advance_past_package_manager (cyclomatic 21): fallow_core::scripts::shell::advance_past_package_manager 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2560219ebb11fb9a8e747d07da50b7256ebaad069aa44e2cc408cf418a1f94"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractCollector::collect_callers (cyclomatic 21): ContractCollector::collect_callers 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58e8f7b588a46456a21f43bdc75d696343364894f2f53d725b234f3d0ecebbb"}},{"ruleId":"D1","level":"warning","message":{"text":"public-config-corpus.strip_jsonc_comments (cyclomatic 21): public-config-corpus.strip_jsonc_comments 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":"scripts/public-config-corpus.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ffb04a7b62dd970120dd75199298b504657ba348c1711b71ca0ce9bd2cf8a4"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic-clone-candle-conformance.validateBaselineShape (cyclomatic 21): semantic-clone-candle-conformance.validateBaselineShape 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, 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":"scripts/semantic-clone-candle-conformance.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aff166a44b8b77aed4d881f4e31ee732df0acdc25f699c35e6d82238dd41e85"}},{"ruleId":"D1","level":"warning","message":{"text":"backend.withLinearSnapshots (cyclomatic 21): backend.withLinearSnapshots has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (handle, updateSnapshot, disposeWhenUnused, \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":"tools/type-aware-sidecar/src/backend.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"578149f4cceeb9fd59c60c872cc6ea395076ca26b9990d2d4e54f2c8f86e7f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::attempt (cyclomatic 20): Worker::attempt 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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad887fcccac3c90ad3237cc46b5b5ea44606d916460a800e4f3ac8b8afafce"}},{"ruleId":"D1","level":"warning","message":{"text":"IssueFilters::apply_component_filters (cyclomatic 20): IssueFilters::apply_component_filters 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: IssueFilters::enable_cli_filter_flag (cyclomatic 37) 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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"17da3062d9ada3b81d1a6ce39add287158be112b728a553c86b0c94a2012cdac"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandCollector::collect_segment (cyclomatic 20): CommandCollector::collect_segment 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":"crates/core/src/plugins/mise.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2721ee9024d915e6881016ccfb63040198ff66766ab9174a52485e49f61378"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::effect::find_unused_layers (cyclomatic 20): fallow_core::analyze::effect::find_unused_layers 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":"crates/core/src/analyze/effect.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b88325fb62a75a25de6d10c64295890f5fc5b794c0675fe0d3990a021a30365"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::scripts::ci_references::matrix_values (cyclomatic 20): fallow_core::scripts::ci_references::matrix_values 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":"crates/core/src/scripts/ci_references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac796332b63073f3fc71c20144ccd77176aecc32ae4b2ad544338568b13772b6"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::scripts::ci_references::github_script_bodies (cyclomatic 20): fallow_core::scripts::ci_references::github_script_bodies 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":"crates/core/src/scripts/ci_references.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dfe53578c32eb2a9f9acd21da51b81505d9471ed30c905b515b7d186b48e44"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_declarator_instance_bindings (cyclomatic 20): ModuleInfoExtractor::record_declarator_instance_bindings has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"203bd7fbf1548e2feaaf795f888cba8efa4a796d5a8cc2c6dfd038129ed78e9c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::css::mask_css_module_global_scopes (cyclomatic 20): fallow_extract::css::mask_css_module_global_scopes 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":"crates/extract/src/css.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ad01760f2c87b3212c6a1c7840ac4ac36ab5273e30982ce61173daea477453"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::css_metrics::walk_rules (cyclomatic 20): fallow_extract::css_metrics::walk_rules has cyclomatic complexity 20 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_metrics.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f44df45c5b7dfe3926ac3cb221ca269185d1a3956a20c0e92c00bab4cbaa7b"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_template::recovery::section_ends (cyclomatic 20): fallow_extract::sfc_template::recovery::section_ends 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":"crates/extract/src/sfc_template/recovery.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"913ba72d6af2395100f879539cc25e204d207536327dd2637b9d695d516d9374"}},{"ruleId":"D1","level":"warning","message":{"text":"check-miri-cfg.stripLiterals (cyclomatic 20): check-miri-cfg.stripLiterals 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":"scripts/check-miri-cfg.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5806f3f26dec5322125fbca115dd9249685afdeeed529e054896ba99872602"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-agent-docs.parseArgs (cyclomatic 20): generate-agent-docs.parseArgs 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, 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":"scripts/generate-agent-docs.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f460775d05733e5a59c1a2d9039035ac8f94666967ce095f46e7cccffe380"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::unsupported_security_global (cyclomatic 19): fallow_cli::unsupported_security_global has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1884fad4fa20b532ef858aa059e2453c45bb1cf7658c6ccfa24809477410099"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::audit_brief::decision_surface_lines (cyclomatic 19): fallow_cli::audit_brief::decision_surface_lines 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":"crates/cli/src/audit_brief.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"321772789eaf015d9c7648d4f059617cd9e7321b69b6811db7eacab10112aa54"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::report::human::check::collect_framework_rules (cyclomatic 19): fallow_cli::report::human::check::collect_framework_rules has cyclomatic complexity 19 (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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0184a2f8c4774d26635510be40592640d76c223eeb03f38f36944cf24d08bc5"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageJson::entry_points (cyclomatic 19): PackageJson::entry_points 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":"crates/config/src/workspace/package_json.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0fb0cabcd14680c734ddb7be03f7c16ac025e634a1aee47dd3b10593184741"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::members::propagate_computed_enum_key_accesses (cyclomatic 19): fallow_core::analyze::members::propagate_computed_enum_key_accesses has cyclomatic complexity 19 (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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddee1d8f153714cc5fee9036564436d69aeb5ca20b65db2740bf510b31b7ff56"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::unused_deps::add_source_package_manifests (cyclomatic 19): fallow_core::analyze::unused_deps::add_source_package_manifests 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":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfbc5ab9fc278036e32d843877043bfcf6139e95c9456726b836655ddadba25"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::discover::infrastructure::collect_flag_value_file_refs (cyclomatic 19): fallow_core::discover::infrastructure::collect_flag_value_file_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":"crates/core/src/discover/infrastructure.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c7f535d887dd925d83daefbb8e66983e46d56e48ed44e9807fe1374a3707c3"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::discover::parse_scripts::collect_script_file_refs (cyclomatic 19): fallow_core::discover::parse_scripts::collect_script_file_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":"crates/core/src/discover/parse_scripts.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efb94651b24d7244ce813d026d34f811ecb7237f4f8b3cb1af763ee9318a10c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::scripts::hooks::js_string_literals (cyclomatic 19): fallow_core::scripts::hooks::js_string_literals has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/hooks.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"755367841d6ae022358b2f537dcd0e2975efadee53c096a8c1055ae246b74dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_engine::dead_code::apply_base_collection_rules (cyclomatic 19): fallow_engine::dead_code::apply_base_collection_rules has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/dead_code.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"646c46cbdcb5c65fc04b75031bd6050bbf4507184d13a0aac57efa1c4426b287"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_engine::discover::advance_past_package_manager (cyclomatic 19): fallow_engine::discover::advance_past_package_manager 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":"crates/engine/src/discover.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8cbdb188e2ed3199f06afbd81734542f165e4987e6bc02cbaaf7850cbe1426"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_engine::health::coverage_v8::convert_file (cyclomatic 19): fallow_engine::health::coverage_v8::convert_file 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":"crates/engine/src/health/coverage_v8/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117202cdda2b01e95021ce3a57ccee5cfe63a515969957ddc2e73f1e8f0222f"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractCollector::angular_class_props (cyclomatic 19): ContractCollector::angular_class_props 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":"crates/extract/src/component_contracts/classes.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b0c335c104655766827a1972ee254311eae857bda24b1a2cadaf63d38a8abb"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractCollector::add_macro_shapes (cyclomatic 19): ContractCollector::add_macro_shapes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7e463c6b8ec5f64cd75764fb6ab3b292987835f73a3f5297e9d67e80d48585"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::extract_declaration_exports (cyclomatic 19): ModuleInfoExtractor::extract_declaration_exports has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/declarations.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7b909db7cf7db7bdcd0cdecb585d16c47b98e52d180e6d358e6ab50026586c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_playwright_factory_call_definitions (cyclomatic 19): ModuleInfoExtractor::resolve_playwright_factory_call_definitions has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93229c0521bc36369833ac637b0da316f94941341b2a632ec616438eb327f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::callback_result_proof (cyclomatic 19): ModuleInfoExtractor::callback_result_proof 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":"crates/extract/src/visitor/visit_impl_callback_properties.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e868145c4353297b5811e6fb1f8d5a157187114941824a4e9fdd140f83606539"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_direct_object_binding_fallback (cyclomatic 19): ModuleInfoExtractor::record_direct_object_binding_fallback 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":"crates/extract/src/visitor/visit_impl_object_binding_patterns.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57012aa7490857eb369b02556af55e4dcc0b5863ba6e72ff8e6985cafb17824"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_security_sinks::should_capture_literal_sink_value (cyclomatic 19): fallow_extract::visitor::visit_impl_security_sinks::should_capture_literal_sink_value 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":"crates/extract/src/visitor/visit_impl_security_sinks.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"edef8233aee41b60880b3682d9af25266fd1637ede4512d33e8ebf4c8b7a7ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_similar_code_sidecar::protocol::process_request (cyclomatic 19): fallow_similar_code_sidecar::protocol::process_request has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/similar-code-sidecar/src/protocol.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"31356fa5927ef0c76699dd4380765613bab1d952f350a03cb41f710c80498568"}},{"ruleId":"D1","level":"warning","message":{"text":"select-heavy-runner.parseAllocation (cyclomatic 19): select-heavy-runner.parseAllocation 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":"scripts/select-heavy-runner.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9131b9199e84f30e2c37b32eccf3e64899be79c1160f63661b991a7885adf9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"select-heavy-runner.trustedWorkflow (cyclomatic 19): select-heavy-runner.trustedWorkflow 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":"scripts/select-heavy-runner.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001cb539dcf34e6537c48cf2672209184dba19187c362469fbce46a69b58d31"}},{"ruleId":"D1","level":"warning","message":{"text":"project-state.stripJsonComments (cyclomatic 19): project-state.stripJsonComments 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":"tools/type-aware-sidecar/src/project-state.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46fdca8ff7a640108f1cac2fa4e60338e77d1baf199ac24bb8786524a9f5abe"}},{"ruleId":"D1","level":"warning","message":{"text":"tooltip.lensLine (cyclomatic 19): tooltip.lensLine 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":"viz-frontend/src/tooltip.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"829fb9c4ab82778adb50c0c0c0fff6afece7b617e6c7129c3e9e50cc67950a85"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::diff_risk::detect_file (cyclomatic 18): fallow_api::diff_risk::detect_file has cyclomatic complexity 18 (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":"crates/api/src/diff_risk/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce51e6dbc77c6c8517516e5312182674ad1930154e27aaab8781719306b27b07"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::runtime::similar_code::review_similar_code (cyclomatic 18): fallow_api::runtime::similar_code::review_similar_code 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":"crates/api/src/runtime/similar_code.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e57198eaa145f1cca9d04bafbf1bafdbc73fe345dd5d7395bf5676e826bdda"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::agent_install::mcp::merge_enabled_server (cyclomatic 18): fallow_cli::agent_install::mcp::merge_enabled_server 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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d708adc2c9c23467b741389f13e624edbea0ff2e3ed4700e9b60f08af282b7"}},{"ruleId":"D1","level":"warning","message":{"text":"FederationCallCollector::merge (cyclomatic 18): FederationCallCollector::merge has cyclomatic complexity 18 (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":"crates/core/src/plugins/module_federation.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"724d11ff675c59f7ca5cddde70b1e05336d9538b636877b35390ac0e2ad60597"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::absent_component_prop::emit_findings (cyclomatic 18): fallow_core::analyze::absent_component_prop::emit_findings 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":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"99889f67a458e20c3d9e6c856b455e690e742a412f8674b2760f692f1982412f"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::project_glob::expand_with_limit (cyclomatic 18): fallow_core::plugins::project_glob::expand_with_limit 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":"crates/core/src/plugins/project_glob.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0a2bbe62e1dc6368cee46fac77046a9685e0b7f2be0e2b7eda14093fd933cf"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::react_router::collect_route_call (cyclomatic 18): fallow_core::plugins::react_router::collect_route_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":"crates/core/src/plugins/react_router.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a22b8963822d1def1636cfe3fcf4f79afcbd9c5346c76e70bff7c36d262bb7"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::webpack::walk_rule (cyclomatic 18): fallow_core::plugins::webpack::walk_rule 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":"crates/core/src/plugins/webpack.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88263ea01f7ddf770f7f1fd233ce307b62cd158dc7fc25b17fbf8f4a404f219"}},{"ruleId":"D1","level":"warning","message":{"text":"IstanbulFileCoverage::lookup (cyclomatic 18): IstanbulFileCoverage::lookup 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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b60bf7e420084d9f06e77e42f053d6e8195881e5d0493a4a9de696346d6cacd"}},{"ruleId":"D1","level":"warning","message":{"text":"Scan::specifier_usages (cyclomatic 18): Scan::specifier_usages 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":"crates/engine/src/trace_usage_impl.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"8983914deabf10ee1abbd0234fcc8c9ac58d5353c3922dacbe9f046dd6992b20"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_engine::health::css_analytics::classes::css_class_inventory (cyclomatic 18): fallow_engine::health::css_analytics::classes::css_class_inventory 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a93407167b8807d965d7ca8e5011528ef6c97728c9f99655fa8ea71a3ff48ca"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_engine::health::result::classify_dead_style_export (cyclomatic 18): fallow_engine::health::result::classify_dead_style_export 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":"crates/engine/src/health/result.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53acdcfcacd219edc3a8495c6ad1aad0db92ffc4bd6421a7c3563f49df046c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_program_namespace_import_locals (cyclomatic 18): ModuleInfoExtractor::record_program_namespace_import_locals 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e2e280e3957dd1c03131edefe53ac79777e466190a82958d8b4c5840ed2c92"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_projection_source (cyclomatic 18): ModuleInfoExtractor::record_projection_source 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5f45e8581fda3863fec3828d6d829a17f9460d0c0d618489c084bbb3e9f01a"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::helpers::extract_class_generic_instance_bindings (cyclomatic 18): fallow_extract::visitor::helpers::extract_class_generic_instance_bindings 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"8413842900ac0c995463f0176f73e6e7c9434e30f18bf68ecd029a4fae21caca"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_signature::collect_returned_expression_refs (cyclomatic 18): fallow_extract::visitor::visit_impl_signature::collect_returned_expression_refs has cyclomatic complexity 18 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"73913b9b3c49ebd37eb270d043d5df52a102c28f9627edfb7b5d7ffd3c8ef125"}},{"ruleId":"D1","level":"warning","message":{"text":"public-config-corpus.render_markdown (cyclomatic 18): public-config-corpus.render_markdown 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":"scripts/public-config-corpus.py"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4458dfde772bcaac60496ab7449a6923e569f6c81f4315bf0c0456cfba7fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-installed.superviseVerification (cyclomatic 18): verify-installed.superviseVerification has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"action/scripts/verify-installed.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"91194ffe1da36ece31db6e6e07b75072ef383eb9e95e0e689588a61c1ca4666c"}},{"ruleId":"D1","level":"warning","message":{"text":"client.startClient (cyclomatic 18): client.startClient 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":"editors/vscode/src/client.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4840ac803702a197fa3fcbf3e1009eb5bfe661347da7455564843c7382c53433"}},{"ruleId":"D1","level":"warning","message":{"text":"coverage-producer-conformance.runSelfTest (cyclomatic 18): coverage-producer-conformance.runSelfTest has cyclomatic complexity 18 (threshold 15). Of this number, 16 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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6fb5df58dc4b2254472f35e2e771eef91ad44603ce9e0cf04cffd265c075af"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic-clone-conformance.loadManifest (cyclomatic 18): semantic-clone-conformance.loadManifest 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a996659b71687f463ce87d1ffed58590c2eeb0772cd27af108ee2c6f33bda2a1"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.sessionFileChanges (cyclomatic 18): cli.sessionFileChanges 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, 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":"tools/type-aware-sidecar/src/cli.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad41f68d85869accd8966408c87b55b280a8a46bc38442f05e8db834ee805214"}},{"ruleId":"D1","level":"warning","message":{"text":"ego.drawStageColumn (cyclomatic 18): ego.drawStageColumn 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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cb41f1cb0b61b88e9cff4d209dd6629fb520c675db056db30ccab474afd8a0"}},{"ruleId":"D1","level":"warning","message":{"text":"render.drawHoverNeighborhood (cyclomatic 18): render.drawHoverNeighborhood 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16f3bfbdafbf1ac599036be27ac93df82fab14d1e280cc19a70a63b73444ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::audit_brief::build_test_reach_facts (cyclomatic 17): fallow_cli::audit_brief::build_test_reach_facts 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":"crates/cli/src/audit_brief.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc322097f1ee9d1bfe992c4819ef96c11d399ce422d84c61fe32922af0c83bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::cli_report::run_report (cyclomatic 17): fallow_cli::cli_report::run_report has cyclomatic complexity 17 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/cli_report.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbe9de046db7abdc2a0abff1ecb6059332cc80829f47f6910ce90b035008e1"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::mutation_cli::run_inner (cyclomatic 17): fallow_cli::mutation_cli::run_inner 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":"crates/cli/src/mutation_cli.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e6e78838883f2bd468c27d5d84ae83873b51ac0b8ab58befbfd4f2c3e7ae8f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProofOrigins::resolve_export (cyclomatic 17): ProofOrigins::resolve_export 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":"crates/core/src/analyze/policy/gdp.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7b8eb58b710c2335b11276894329cccec259a6d4df89a7792f4d5282cb80a8"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::members::instance::collect_inherited_bindings (cyclomatic 17): fallow_core::analyze::members::instance::collect_inherited_bindings 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":"crates/core/src/analyze/members/instance.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"76788bc630ac8907b05b6c25d4e977da3a2cd70823f6860d8bacc7ae4b686f9c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::typescript::parse_tsconfig_references (cyclomatic 17): fallow_core::plugins::typescript::parse_tsconfig_references 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":"crates/core/src/plugins/typescript.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf69109e7cf58f8d7f152f4fc3d30c39c850a24b97443252ac0dfc6a5caf2686"}},{"ruleId":"D1","level":"warning","message":{"text":"CacheStore::evict_lru_to_target (cyclomatic 17): CacheStore::evict_lru_to_target has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/cache/store.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2d5272a18b92972c536c220020596008c796e7156530175cbcde965d75ec85"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractCollector::function_props (cyclomatic 17): ContractCollector::function_props has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6c5c5dc1a9ee2e84fb69c684131b422b640d2e866e37f991e7a7c57b6d89b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectStyleCollector::collect_call (cyclomatic 17): ObjectStyleCollector::collect_call 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":"crates/extract/src/css_in_js/object.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"83795c818b81cca5dd055f68333ecbf1626add8525d00add0727ad98c5de9ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::collect_layer_references (cyclomatic 17): Collector::collect_layer_references 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":"crates/extract/src/effect_facts.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d353f6a8c333a725e2abf2e7900a0511b9d1c619d271c5fe21363242311a62"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_subclass_member_access (cyclomatic 17): ModuleInfoExtractor::record_subclass_member_access 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"776d8574238fa8066c659f734a4d4020b54439c2a4f854412cb7602c062a5b53"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_variable_declarator (cyclomatic 17): ModuleInfoExtractor::record_variable_declarator 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6014595b20f86e2438f2f2146ab80814f96bd2ca2b646abcd98c3486ead873f"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::classify_di_call_site (cyclomatic 17): ModuleInfoExtractor::classify_di_call_site has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_di.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22c868b1b0e37933e7c1c767fef80b89eb8401de26511dee53ba6cead351daf"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::static_sink_literal_value (cyclomatic 17): ModuleInfoExtractor::static_sink_literal_value 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":"crates/extract/src/visitor/visit_impl_scope_bindings.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e7ca5018488c9cd5377fc628e7425ca516137a95377c162723e7df857b0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::parse::subclass_reference_spans (cyclomatic 17): fallow_extract::parse::subclass_reference_spans 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":"crates/extract/src/parse.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2b5c35edc6744fcc06238cf624db72cbd025a39443adbbd08da2c8a7aadd21"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_props::collect_define_props_names (cyclomatic 17): fallow_extract::sfc_props::collect_define_props_names 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3954d41c478a546fff74db5e40d82eca7419e48f89ad86372a94fdcdc0e42d00"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_template::shared::split_top_level (cyclomatic 17): fallow_extract::sfc_template::shared::split_top_level has cyclomatic complexity 17 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (fallow_extract::sfc_template::shared::split_top_level_once) 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":"crates/extract/src/sfc_template/shared.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7addb8e087ed2358c156b6be3cf99d83dc249f164922e52499aa8c6d11e65f9"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_template::shared::split_top_level_once (cyclomatic 17): fallow_extract::sfc_template::shared::split_top_level_once has cyclomatic complexity 17 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (fallow_extract::sfc_template::shared::split_top_level) 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":"crates/extract/src/sfc_template/shared.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"df209e567a9215a23b86627e01456743beef8bbab8d1a6aabf0075a7abeb11a4"}},{"ruleId":"D1","level":"warning","message":{"text":"public-config-corpus.main (cyclomatic 17): public-config-corpus.main 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":"scripts/public-config-corpus.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa131d138c320c2c69ed909dc471d69c617702bffff78c4e339f7dd5cbeb65a8"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis-utils.buildAnalysisArgs (cyclomatic 17): analysis-utils.buildAnalysisArgs 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":"editors/vscode/src/analysis-utils.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf7c538c9fea24b1740b705a4326c2b5117011dff27fec38fbb759f7a82420e"}},{"ruleId":"D1","level":"warning","message":{"text":"coverage-producer-conformance.loadManifest (cyclomatic 17): coverage-producer-conformance.loadManifest 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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7738c240cc3589fa96d596a487e6cdfa2a80a98cf53dfe2ca7e4e2f52ee9c55"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-wait-checks.ghRunMetadataReader (cyclomatic 17): ship-wait-checks.ghRunMetadataReader 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 one function literal inside it that branches (line 720). 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0399933fb78bb1075d2cfc93a14b0152377e0703abe20dc5bf27bfa9d13403c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.init::handleGraphHover (cyclomatic 17): main.init::handleGraphHover 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":"viz-frontend/src/main.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a833fc1aa24eed1aa39b5657357027b44fd28efe09792d9e571d4c288fdb1aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"frameworkContractRelationsFor (cyclomatic 17): frameworkContractRelationsFor 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":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b2fce5657b4ffd1c84045b0d6e09ee52fecd63cd50359f5f2b1da371453206"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::mutation::report::completion (cyclomatic 16): fallow_api::mutation::report::completion 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":"crates/api/src/mutation/report.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"33248648c38b22ed20a84fe90e0cd55ba91f06b0578f1fbef1b6fd8c96d69fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::mutation::scheduler::read_dry_run (cyclomatic 16): fallow_api::mutation::scheduler::read_dry_run has cyclomatic complexity 16 (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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab9530c321d36eb40518f2721aa806c579f83441bef68ca7f48ba1ee2b50df"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::type_aware::client::validate_response (cyclomatic 16): fallow_api::type_aware::client::validate_response 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: fallow_api::type_aware::client::gap_reason_phrase (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf6ee431e9fb38ac9f6e306934c23f65703da5f8967d36bb0f4bc890f0816bc"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_api::type_aware::client::validate_symbol_use_data (cyclomatic 16): fallow_api::type_aware::client::validate_symbol_use_data 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: fallow_api::type_aware::client::gap_reason_phrase (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83b1070f2a551bec117b6a70aa44d5a90b8971fef43a58a5e505aadccc6dafd"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::agent_install::mcp::merge_json_server (cyclomatic 16): fallow_cli::agent_install::mcp::merge_json_server 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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"29083e3b44392081ac09034ca36b58aee10c3c368d38f37eb2a25fe94b0e5f77"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_cli::flags::run_flags (cyclomatic 16): fallow_cli::flags::run_flags has cyclomatic complexity 16 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/flags.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"119c6b0fb7e6bedf07cdd9387ddef0ef41bfc80640c9ab773e84a601f266c727"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::members::collect_direct_member_accesses (cyclomatic 16): fallow_core::analyze::members::collect_direct_member_accesses has cyclomatic complexity 16 (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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"997d670d431232a8bee07fadc6d463eacec6d480267d9ebcd247f31ce372ee3d"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::analyze::members::factory::factory_return_object_property_classes (cyclomatic 16): fallow_core::analyze::members::factory::factory_return_object_property_classes has cyclomatic complexity 16 (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":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"159842aeaa55054c622ce7c782fb65c0b8e6ecfe7aae270971cec31e7799184a"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves (cyclomatic 16): fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves 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":"crates/core/src/plugins/gatsby.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5499edb21a243dc3d014eca5ed2fe6e15c28b7e174abe6f2dfe576c7e4f085aa"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_core::plugins::prisma::strip_schema_comments (cyclomatic 16): fallow_core::plugins::prisma::strip_schema_comments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/prisma.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23f4db05e0e2c85fee25f73312685182db0ec3a6f7f8a0a78e842b8fdfe3c98"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractCollector::vue_options_props (cyclomatic 16): ContractCollector::vue_options_props 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":"crates/extract/src/component_contracts/classes.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab52ae5f9eae95f1743e61db324d895cad5c0eaaa5b7f81524aed2f6ed265790"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::record_factory_return_candidate (cyclomatic 16): ModuleInfoExtractor::record_factory_return_candidate 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a6627cb2dfb3c054222ff39129bef047366e4b45906071482fc69bc72be931"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::retain_new_constructor (cyclomatic 16): ModuleInfoExtractor::retain_new_constructor 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":"crates/extract/src/visitor/visit_impl_constructor_alternatives.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b207fcf0d3c0e114cdf63fe98eaa668af477a8d7bdf14ae56c884c163716d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::complete_binding_producer_calls (cyclomatic 16): ModuleInfoExtractor::complete_binding_producer_calls has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"566c2167d38a308aa983cf2249036c13d343af85f583d83cb4f6ae4345e9fc8d"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleInfoExtractor::defer_vue_local_array (cyclomatic 16): ModuleInfoExtractor::defer_vue_local_array 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c7963202b6dd21780812d1e7ba047121ad359321c02ae25de735d3c84034ac"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::css_in_js::tokens::is_static_stylex_composite_expression (cyclomatic 16): fallow_extract::css_in_js::tokens::is_static_stylex_composite_expression 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8053504232e4289638504bf363b4461aab62b496d567d52730f8ab497618e6"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::parse::compute_mock_api_reference_spans (cyclomatic 16): fallow_extract::parse::compute_mock_api_reference_spans 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":"crates/extract/src/parse.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42e8e24c9f5ded576e4d9f67ce5916870759f00028ce299da49fc841556f4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::sfc_template::angular::split_pipes (cyclomatic 16): fallow_extract::sfc_template::angular::split_pipes 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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98ef983074699a55aebdc3c7d03cc1bc758834a574b8fd8614c9a146d52ee1b"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::collect_returned_imports_from (cyclomatic 16): fallow_extract::visitor::collect_returned_imports_from has cyclomatic complexity 16 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":4411}}}],"partialFingerprints":{"codehealthFindingId/v1":"07780393b5dc66a644c4930e8c66a3e14290f7f19776eb8640fbd92ec7234a55"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::helpers::apply_decorator_property (cyclomatic 16): fallow_extract::visitor::helpers::apply_decorator_property 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c901871583103345c9aea236487f0be3c73d25a975fd2accbb78dc8e778e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_factory_returns::for_each_return_in_statement (cyclomatic 16): fallow_extract::visitor::visit_impl_factory_returns::for_each_return_in_statement has cyclomatic complexity 16 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: fallow_extract::visitor::visit_impl_factory_returns::statement_declares_identifier (cyclomatic 20) 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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_factory_returns.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"028017f91e2837a1a034b7469b2018d1ff21fdd57df279cecbbc592215c02cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"NamespacePropagationIndexes::new (cyclomatic 16): NamespacePropagationIndexes::new has cyclomatic complexity 16 (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":"crates/graph/src/graph/namespace_indexes.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"585d864d66b0236c37367f4f1e75de5aedf7db3de5a4d900de94147943b03221"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_graph::graph::narrowing::attach_symbol_reference (cyclomatic 16): fallow_graph::graph::narrowing::attach_symbol_reference 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":"crates/graph/src/graph/narrowing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d768f08dc7417cb78c6884f46d47579c2df4c022ed0e1d94a1feea400a0470"}},{"ruleId":"D1","level":"warning","message":{"text":"fallow_graph::resolve::upgrades::apply_specifier_upgrades (cyclomatic 16): fallow_graph::resolve::upgrades::apply_specifier_upgrades has cyclomatic complexity 16 (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":"crates/graph/src/resolve/upgrades.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"575bb5cba7152b8b2763e9d970e065bd14f57382291f4636272f71ddc80aecff"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::visit_binary_expression (cyclomatic 16): Collector::visit_binary_expression 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":"crates/mutation/src/collect.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0f6b5db94602157dd774d039be958b7eb29c9359f9fd12a2b712d39216a17d"}},{"ruleId":"D1","level":"warning","message":{"text":"run-binary.superviseSetup (cyclomatic 16): run-binary.superviseSetup 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 4 function items inside it that branch (terminate, handler, a function literal at line 135, \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":"npm/fallow-similar-code/scripts/run-binary.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870850b8e84e40fbbec753f95d8954d9d50ac91f4e7215431df0f162cb867df"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-agent-adapters.generateSkillAdapters (cyclomatic 16): generate-agent-adapters.generateSkillAdapters 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":"scripts/generate-agent-adapters.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5a03acac7c2c21dc8161a2b4a8237341ec3c94b462432786f66bb6a3c5c542"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic-clone-candle-conformance.validateResponse (cyclomatic 16): semantic-clone-candle-conformance.validateResponse 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":"scripts/semantic-clone-candle-conformance.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f191afcc17827eb0a3caab17ffbb43eae8ce59322ea397e4018e1be6d273bab2"}},{"ruleId":"D1","level":"warning","message":{"text":"data.lensFindingLevel (cyclomatic 16): data.lensFindingLevel 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":"viz-frontend/src/data.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0d836b7f19ee0f2e4ac0ccbbcfb9e0cf9ccb3d5b748ce8e7c2857b6dc66382"}},{"ruleId":"D1","level":"warning","message":{"text":"annotations.drawHoverLabels (cyclomatic 16): annotations.drawHoverLabels 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ad52661a02f2f681a208ef702c5bce326ccf36649be486700afa7f61c16c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"annotations.drawPathTrace (cyclomatic 16): annotations.drawPathTrace has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00552c5a9f7318bcc75536c39b27645d6e421ef3b450aff980633f8ba7f4d19"}},{"ruleId":"D1","level":"warning","message":{"text":"render.nodeAppearance (cyclomatic 16): render.nodeAppearance 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"529fda9e5cc3ac196556c890c43dcfc02a2066a58bc29bcba7d7b028d0ea874d"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.analysisContent (cyclomatic 16): panel.analysisContent 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":"viz-frontend/src/panel.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b48184880fc456329f7b3d0ee395410a63520d2b59b4fd158f663ea6a618cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"main.countLensFindings (cyclomatic 16): main.countLensFindings 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 (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":"viz-frontend/src/main.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6c6fee01b5e14a2aa0d68eabfd106176dc80d4180c46beb576647b8ef2402c"}},{"ruleId":"D2","level":"warning","message":{"text":"extension.activate (cognitive 105): extension.activate has cognitive complexity 105 (threshold 15). Drivers by points: if/else 72 (84 pts), ternaries 6 (10 pts), boolean chains 8, error handling 3 (nesting depth added 16). Most of this is not in the body itself: 7 of the 105 points are its own statements and the rest belongs to 36 function items inside it that branch (a function literal at line 1101, a function literal at line 372, syncAuditStatusBar, \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":"editors/vscode/src/extension.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8e1d5e6d642ce6fe8c68f87e3a1e652bee51e2fafe161a31994a2bc808ed7c"}},{"ruleId":"D2","level":"warning","message":{"text":"annotations.drawClusterLabels (cognitive 83): annotations.drawClusterLabels has cognitive complexity 83 (threshold 15). Drivers by points: if/else 17 (41 pts), ternaries 9 (20 pts), boolean chains 15, loops 4 (7 pts) (nesting depth added 38). Of this number, 80 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ae13776c1324ae03917becf6b9df7af622476ebc481437b7ab71a152c82022"}},{"ruleId":"D2","level":"warning","message":{"text":"download.downloadBinary (cognitive 65): download.downloadBinary has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (46 pts), ternaries 4 (12 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 40). Most of this is not in the body itself: 1 of the 65 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1122, 1136). 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":"editors/vscode/src/download.ts"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a632b1fec1910196e991cdb33ae09f91ff1d3fc684b7976aed16daea352ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::typescript::parse_tsconfig_references (cognitive 62): fallow_core::plugins::typescript::parse_tsconfig_references has cognitive complexity 62 (threshold 15). Drivers by points: if/else 9 (39 pts), loops 3 (11 pts), match/switch 2 (11 pts), boolean chains 1 (nesting depth added 47). 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":"crates/core/src/plugins/typescript.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e10ffe4f9280a90c2a0801aca1ae803e991d2718908a99e385b4beff37ee7f"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-producer-refresh.main (cognitive 55): coverage-producer-refresh.main has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 14 (19 pts), ternaries 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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6399441fc507f634e04427764215376d5d4266947d5f6b7ff3300201607355"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::helpers::extract_class_generic_instance_bindings (cognitive 53): fallow_extract::visitor::helpers::extract_class_generic_instance_bindings has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (46 pts), loops 2 (5 pts), match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"318d9804b135fbf8006ad1b9f34b416c7461945c6b08c3b4371b607f8d3acbe6"}},{"ruleId":"D2","level":"warning","message":{"text":"render.drawNodes (cognitive 52): render.drawNodes has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 11, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/graph/render.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7ad1c5615a541ec4d19f20af0acb1ddd7e72f6218923bfdf7e5ce2290551ab"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.complexitySection (cognitive 51): panel.complexitySection has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 6 (19 pts), loops 3 (8 pts), boolean chains 3 (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":"viz-frontend/src/panel.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf52e92576bc4c23665bd532f6688339414acb636a06733eee3dcfff66c965"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadCodeAuditLedger::annotate_results (cognitive 50): DeadCodeAuditLedger::annotate_results has cognitive complexity 50 (threshold 15). Drivers by points: loops 50. 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":"crates/api/src/audit_keys.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13b641fb70700cf760c4f4a6b125ed99fe74d2a28ecb1b2073c21b55e594549"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_types::workspace::render_message (cognitive 49): fallow_types::workspace::render_message has cognitive complexity 49 (threshold 15). Drivers by points: if/else 28 (41 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 16). 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":"crates/types/src/workspace.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ad7149d7f32a66d32b6791cfcbc44efc18ca0085aac5a9b4a8adacfc7f4a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.rankRowsForLens (cognitive 48): panel.rankRowsForLens has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 18 (39 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 23). Of this number, 17 points are the body\u0027s own statements and 31 belong to 6 function literals inside it that branch. 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":"viz-frontend/src/panel.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"7241a2ec581c9c077055e214f8a804e7e8d01a5e378ebd61fa099be167cbf7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::propagate_computed_enum_key_accesses (cognitive 47): fallow_core::analyze::members::propagate_computed_enum_key_accesses has cognitive complexity 47 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 6 (20 pts), boolean chains 2 (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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e972af82f862c63fe26ed5fc5a7ae03fb0986fba724a992de06c8094b09943a7"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::audit_brief::decision_surface_lines (cognitive 46): fallow_cli::audit_brief::decision_surface_lines has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit_brief.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"287cbb935e4d75dfc70b85631959c03dedb27dd18a9eb1cb5ea0d01ab79c6694"}},{"ruleId":"D2","level":"warning","message":{"text":"TsconfigOutputMap::resolve_source_for_entry (cognitive 45): TsconfigOutputMap::resolve_source_for_entry has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 4, 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":"crates/config/src/workspace/tsconfig.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd61df36fbbca2db4b0bc336b428bb574c69b5a44c3db45b1478d088f8bf543c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::collect_define_props_names (cognitive 45): fallow_extract::sfc_props::collect_define_props_names has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (10 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_props.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"280bf3a0910efcc4362c0e3597d6c4ee7c81e14055af20aca6e8e385c0e55abd"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::angular_class_props (cognitive 44): ContractCollector::angular_class_props has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"crates/extract/src/component_contracts/classes.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad3fc3ea78c614e7c3d83e14436604b5101eb12702796c372f34f148844e34a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadCodeTreeProvider.getChildren (cognitive 44): DeadCodeTreeProvider.getChildren has cognitive complexity 44 (threshold 15). Drivers by points: if/else 38, ternaries 3 (6 pts) (nesting depth added 3). Of this number, 37 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":"editors/vscode/src/treeView.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"72023d1f917ecc10c1f007602efed35311a78776b32239124fc917140b236ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::absent_component_prop::find_absent_component_props (cognitive 43): fallow_core::analyze::absent_component_prop::find_absent_component_props has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 9 (17 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":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b846e831883988ca9615c435356928e0df6e236d25447e6e2f1dda40d460e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::collect_callers (cognitive 43): ContractCollector::collect_callers has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 5 (14 pts), loops 2 (3 pts), boolean chains 2 (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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf53a0c40315ae57133c0a581422662b096dccbdee63f7b759466d5f3482d873"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::factory::propagate_exported_object_instance_accesses (cognitive 42): fallow_core::analyze::members::factory::propagate_exported_object_instance_accesses has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 5 (15 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4774c7f70f785abe037a6b7b95a802a0e940cb749ee915cd7dbcaa008d64deb9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::heritage::build_interface_implementation_contracts (cognitive 42): fallow_core::analyze::members::heritage::build_interface_implementation_contracts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 5 (15 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":"crates/core/src/analyze/members/heritage.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83b222f6e7313957b8ce47138eee5a77f5651cb6e054c28c1009c20ff94a459"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::component_contracts::collect (cognitive 42): fallow_extract::sfc_template::component_contracts::collect has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (29 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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"525fab720ad54902f14f244d2826f655ee5e5d6200537e49e7785e5a15de63af"}},{"ruleId":"D2","level":"warning","message":{"text":"build.tarjanSCC (cognitive 42): build.tarjanSCC has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 4 (10 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/graph/build.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf3641b6e53e7374d27884f7f3bb89f33bd2a17ff90fa97353179f9a9b9566c"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.renderLensPanel (cognitive 42): panel.renderLensPanel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 5, match/switch 1 (nesting depth added 11). Of this number, 39 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":"viz-frontend/src/panel.ts"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75aad12e09648190604f8f87016514810741149fe5965f8a61774a2e8f9925c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::collect_direct_member_accesses (cognitive 41): fallow_core::analyze::members::collect_direct_member_accesses has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 5 (16 pts), boolean chains 1 (nesting depth added 26). 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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d653251118c1adc0ec37167eb962f031408d3e1a3ae016559caeeb347a6bc391"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementBoundary::push (cognitive 40): StatementBoundary::push has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 4 (13 pts), boolean chains 2, loops 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":"crates/extract/src/mdx.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"765896ecd73722adc9b4579df1478b16c8160842d7600bc2f5f936af61f21ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_program_namespace_import_locals (cognitive 40): ModuleInfoExtractor::record_program_namespace_import_locals has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 3 (11 pts), loops 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1771a6caccad6912609ad8cfaaa66d75dbe36cc1252e08ab1e669926de97efe"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::parse::subclass_reference_spans (cognitive 40): fallow_extract::parse::subclass_reference_spans has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 4 (8 pts), match/switch 1 (4 pts), boolean chains 3 (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":"crates/extract/src/parse.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a206a8cbb8e12d4fd2b99227d3d27a23d08679a39278e5ffbf41ecd1653187"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-wait-checks.currentRollupChecks (cognitive 40): ship-wait-checks.currentRollupChecks has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (12 pts), ternaries 2 (6 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"267b8da79be49b46833cfdd287f8a2591046bb9a9f3519cd309234e0ff6d9ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::webpack::walk_rule (cognitive 39): fallow_core::plugins::webpack::walk_rule has cognitive complexity 39 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 4 (13 pts), loops 2 (5 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":"crates/core/src/plugins/webpack.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddf8f5defd627aefc83ad167247f4b4ab5fc4c3f20d05a64711d76a4ba22983"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::classes::css_class_inventory (cognitive 39): fallow_engine::health::css_analytics::classes::css_class_inventory has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (10 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c0e64b20e5f68119de6a5f09a1b712b03d1c881b32e08b21e9d20deaa506a4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::collect_define_emits_names (cognitive 39): fallow_extract::sfc_props::collect_define_emits_names has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (10 pts), loops 2 (7 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"82baa0a40099b72040056b12754c2ddb218ac6ec315df3b229111c39fbe602b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-wait-checks.supersededCancellations (cognitive 39): ship-wait-checks.supersededCancellations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (9 pts), boolean chains 6 (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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"895aa55c06bc9cabb89cb3d9691d94d48f8c6bb3d9cc989b6a241e30e2a20378"}},{"ruleId":"D2","level":"warning","message":{"text":"chrome.buildChrome (cognitive 39): chrome.buildChrome has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 7, ternaries 4 (5 pts), boolean chains 4 (nesting depth added 8). Most of this is not in the body itself: 8 of the 39 points are its own statements and the rest belongs to 10 function items inside it that branch (refreshLensOverflow, a function literal at line 275, a function literal at line 307, \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":"viz-frontend/src/chrome.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8154f3baa9ba73728ab3bf6bdf32c6ba05d9fe2b2bbf13ed3ce412139cf2b25a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::package_json_utils::find_dep_line_in_json (cognitive 37): fallow_core::analyze::package_json_utils::find_dep_line_in_json has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (36 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":"crates/core/src/analyze/package_json_utils.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4340cb55723a694063380b907f5449b174be9f52384d82759e1ed3d6fecf642"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::unused_deps::add_source_package_manifests (cognitive 37): fallow_core::analyze::unused_deps::add_source_package_manifests has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb24b0e296363534a1bc49e9436f04c6780ab8ff60fd738c48b647713eb715"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::ci_references::github_script_bodies (cognitive 37): fallow_core::scripts::ci_references::github_script_bodies has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, match/switch 1 (3 pts), loops 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":"crates/core/src/scripts/ci_references.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0100c588bc6d63feefeac4c583f6334f68db3bd1029a43d3777652adfba9d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_direct_object_binding_fallback (cognitive 37): ModuleInfoExtractor::record_direct_object_binding_fallback has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (6 pts), match/switch 3 (5 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":"crates/extract/src/visitor/visit_impl_object_binding_patterns.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a9db8dc9aa2169cca11431fad1215838b0a2f521342bf2cf0ae1bc533a3563"}},{"ruleId":"D2","level":"warning","message":{"text":"public-config-corpus.strip_jsonc_comments (cognitive 37): public-config-corpus.strip_jsonc_comments has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (7 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/public-config-corpus.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9408c15cb29ff120fde29f053f137b287b04b90d3c974ab34713901d55194695"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.securityCandidateEl (cognitive 37): panel.securityCandidateEl has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22, ternaries 6 (10 pts), loops 2 (4 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/panel.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d500ed0bc022bec1bf59d3ca733b337631e527d128fb18aa35a100e18fb4adf"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::effect::find_unused_layers (cognitive 36): fallow_core::analyze::effect::find_unused_layers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 9 (15 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/effect.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"def7f337485ec4c6b20d0dc9775200ec7cfbea12ab3c702d3aac8222a81b303d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::factory::factory_return_object_property_classes (cognitive 36): fallow_core::analyze::members::factory::factory_return_object_property_classes has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 5 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 24). 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":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa268994a4cb6175ec7bba622d91d83a24b23b8f037a2fb6f5da44cbb38a161"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-producer-conformance.runSelfTest (cognitive 36): coverage-producer-conformance.runSelfTest has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 16). Of this number, 34 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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba887e0852acdcded26c0a2d747a399069a8bc029c4e5f918a8ecb851417181"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::runtime::similar_code::review_similar_code (cognitive 35): fallow_api::runtime::similar_code::review_similar_code has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 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":"crates/api/src/runtime/similar_code.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258568bad4e3d7aeba1ee515ce50903fc38e07fe82f9f20d139cc54e3b84eed"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractIndex::block_reference (cognitive 35): ContractIndex::block_reference has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 3 (10 pts), loops 1 (4 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":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"73347fba87dde48ff7565afa14a1229a3c06423920210e226dee64da02ddc5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::absent_component_prop::emit_findings (cognitive 35): fallow_core::analyze::absent_component_prop::emit_findings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e871805bf62ffa46f1a11ca0a48b7b1dc1f694a88bcea0852ed4ec05b471dce"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::instance::collect_inherited_bindings (cognitive 35): fallow_core::analyze::members::instance::collect_inherited_bindings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 5 (8 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":"crates/core/src/analyze/members/instance.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5779450faaf2bbb89c55a7e9f6f7f039d67e99753bb52cbd38953e260a3e7554"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::package_cycles::strongly_connected_packages (cognitive 35): fallow_core::analyze::package_cycles::strongly_connected_packages has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 6 (12 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":"crates/core/src/analyze/package_cycles.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f47c6a2bfb7fa6f060338b085b8d0c92daa337bb26adbbb3f8c970057e3f51"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::join_constructor_outcomes (cognitive 35): ModuleInfoExtractor::join_constructor_outcomes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 3, 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":"crates/extract/src/visitor/visit_impl_constructor_alternatives.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de574794c91faea2a0489de5b47f1a14318905780ae0fa3f6f666c60cff5b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-agent-adapters.generateSkillAdapters (cognitive 35): generate-agent-adapters.generateSkillAdapters has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (6 pts), ternaries 2 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-agent-adapters.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"08663d5d544cffb1828707270316575d19b90274fac0529f4a048fb44dae6e76"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance (cognitive 34): fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 13 (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":"crates/cli/src/similar_code_help.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfea2e6fad425b01737b11a2ab1841996b0cefbd5f4aeebb64c4034db087af8d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::discover::infrastructure::collect_flag_value_file_refs (cognitive 34): fallow_core::discover::infrastructure::collect_flag_value_file_refs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), match/switch 2 (6 pts), boolean chains 5 (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":"crates/core/src/discover/infrastructure.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf57568048354425bdf3fb77bb65bef895879d395635c0872e40a2efd65ffc8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::shell::advance_past_package_manager (cognitive 34): fallow_core::scripts::shell::advance_past_package_manager has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"161f6a8ead8ad0728f197288719868e4c24717c20accf5180521b6a93743e846"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::collect_declarations (cognitive 34): ContractCollector::collect_declarations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (6 pts), boolean chains 3, loops 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4872a1ce71d472c7b2eff072633a3d2648fe68599177c93d31f4c8391f61359e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::callback_result_proof (cognitive 34): ModuleInfoExtractor::callback_result_proof has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 2, loops 1 (2 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_callback_properties.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9034c35e589f4a0b0c25512836b41e9b6952f6334dceff6f0531ff0744f45fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::narrowing::attach_symbol_reference (cognitive 34): fallow_graph::graph::narrowing::attach_symbol_reference has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, loops 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":"crates/graph/src/graph/narrowing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec4ab17f29b06422ef2bc69f3d2913ff45411f0660ead2dbdba9981e96354c5"}},{"ruleId":"D2","level":"warning","message":{"text":"frameworkContractRelationsFor (cognitive 34): frameworkContractRelationsFor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (10 pts), boolean chains 3, other 3, 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":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d84307094ec9bc26e84c162093a67217991958b9d8f29f8157c2e2b2d206f1"}},{"ruleId":"D2","level":"warning","message":{"text":"stripJsonComments (cognitive 34): stripJsonComments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (7 pts), boolean chains 4, ternaries 1 (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":"tools/type-aware-sidecar/src/project-state.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57b9aef2bbac403d5a050c8d0679cb7161f7cb25a1c9c5c5e5be98034f298b6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::cli_startup::validate_input_flags (cognitive 33): fallow_cli::cli_startup::validate_input_flags has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 8, loops 2 (4 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":"crates/cli/src/cli_startup.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a47185dfbfda91d783d1ea2685aa85ae84058664b58fff12e5ce82aea32a659"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::config_parser::find_config_object (cognitive 33): fallow_core::plugins::config_parser::find_config_object has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (7 pts), boolean chains 2, 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ca99ce695d0e4915b4eadc3994ced37bed6c4469b4c3a7e2446c53686661aa"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::prisma::strip_schema_comments (cognitive 33): fallow_core::plugins::prisma::strip_schema_comments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), match/switch 1 (2 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":"crates/core/src/plugins/prisma.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c283300a8ef8ede11f37609a7dfb5eca6f2f394cb3e4db5b86b2c7e59c3dc62"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::ci_references::matrix_values (cognitive 33): fallow_core::scripts::ci_references::matrix_values has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/ci_references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c10a92be1e4d50e2e167fa90f9e688ab0b360c0b1038f145e32a4c79c2e067"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::cva::collect_animate_keyframe_names (cognitive 33): fallow_engine::health::css_analytics::cva::collect_animate_keyframe_names has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/cva.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a726047b2d0e9329bdc082f7f2d87f174499ac6cc28b010fc32bc431ff2bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_layer_references (cognitive 33): Collector::collect_layer_references has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (5 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":"crates/extract/src/effect_facts.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5f6f01c0c11b501bf205d7cc600bfd0839299dd58374ab9e1c6f9a017d3ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::visit_binary_expression (cognitive 33): Collector::visit_binary_expression has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mutation/src/collect.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa3081225519ee8ecf40bb156323116ee8c9d856aa79c4ac53490417307c63"}},{"ruleId":"D2","level":"warning","message":{"text":"download.downloadManagedBinary (cognitive 33): download.downloadManagedBinary has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 19). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1014, 1028). 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":"editors/vscode/src/download.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c61c272c76d9a6b99cfcf01203da79bece3f984afec59ade109c8666727fce5"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::base_worktree::legacy_registered_pass (cognitive 32): fallow_cli::base_worktree::legacy_registered_pass has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/base_worktree.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b98353e17d8d20096e2c1c24d8f1267ae9c415911a4675e27e339e95288e86"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::oxlint::extract_ultracite_selected_js_plugin_dependencies (cognitive 32): fallow_core::plugins::oxlint::extract_ultracite_selected_js_plugin_dependencies has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (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":"crates/core/src/plugins/oxlint.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac7d50750e37d809688b01159365f2c33d09dfe3fea249b299e085ce2fd2421"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::referenced_package_scripts (cognitive 32): fallow_core::scripts::referenced_package_scripts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d86d67e0bcd5724e30fca7be3d8a13ef7929afa8d17bf81ba092a2e2860c83"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::preseed_class_array_fields (cognitive 32): ModuleInfoExtractor::preseed_class_array_fields has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 pts), match/switch 1 (3 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7833ee56012308e1877592aa8ef69b4df5b62e6bf5a770eae1e30984b8f4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"chrome.updateChrome (cognitive 32): chrome.updateChrome has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (7 pts), ternaries 3 (6 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":"viz-frontend/src/chrome.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c094fe2aa2739f0313715b97260b21fc70ccc86cbdc9b6355b267781022ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::discover::parse_scripts::collect_script_file_refs (cognitive 31): fallow_core::discover::parse_scripts::collect_script_file_refs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (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":"crates/core/src/discover/parse_scripts.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b793b5a8e37d106c0b84804d6064e848c0d6645eee19fade1745d4cb6f93ede5"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::hooks::js_string_literals (cognitive 31): fallow_core::scripts::hooks::js_string_literals has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts), boolean chains 6, 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":"crates/core/src/scripts/hooks.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da5d814635f5270ad972b41b0bcd24fa37bdced3220c4945504f899901f1ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::complete_binding_producer_calls (cognitive 31): ModuleInfoExtractor::complete_binding_producer_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7e5e87327e94dcc3037aac621c914ef152ea142ab23760b02f231d52976c9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css_in_js::tokens::is_stylex_conditional_object (cognitive 31): fallow_extract::css_in_js::tokens::is_stylex_conditional_object has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 1 (3 pts), 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b9ded3ee63ccc7b0ada58d2b76ecfcd8eedf87afd9a0396b3e166f9c85fb76"}},{"ruleId":"D2","level":"warning","message":{"text":"ProfileWorklist::run (cognitive 31): ProfileWorklist::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 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":"crates/graph/src/graph/reachability.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fcbe6c7501d4e2590b409e1d5a12e9436f3326677a300c44bcbf92249eaf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"check-miri-cfg.scanFile (cognitive 31): check-miri-cfg.scanFile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 11, loops 2, ternaries 1 (nesting depth added 6). None of this is in the body itself: all 31 points belong to 3 function items inside it that branch (a function literal at line 124, a function literal at line 108, insideGated). 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":"scripts/check-miri-cfg.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ff50be472a281282442dcca30e25ef220f32d72ec1e712349d2537762c78ae"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::coverage_v8::convert_file (cognitive 30): fallow_engine::health::coverage_v8::convert_file has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 3, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/coverage_v8/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe9d58fccf44e8d62416e6300b1f2b0746bda5d2dc64bce04c2176de696eea8"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_factory_return_candidates (cognitive 30): ModuleInfoExtractor::resolve_factory_return_candidates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (8 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6302bd510e9932dfefb99d637cd4408ab1000d6d9328132739f60aeef092d15"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_factory_return_function (cognitive 30): ModuleInfoExtractor::record_factory_return_function has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 11 (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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e959a7c0bc741b2684bb87e5dac368f67027bd52a2e3b5dc0f88276c9bd44f85"}},{"ruleId":"D2","level":"warning","message":{"text":"render.drawRoads (cognitive 30): render.drawRoads has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, ternaries 4 (6 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d5d7fcf99161d06517aaaae0a54a1ecfc17c6bfc3ed4cdd4677f42139d50e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::discover::advance_past_package_manager (cognitive 29): fallow_engine::discover::advance_past_package_manager has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, 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":"crates/engine/src/discover.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b4b49fab4c154bc9ea26ab9314acfc3645b5e74d5d01ddaa37bb5bdc44f8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::duplication_detector::detect::extraction::extract_clone_groups (cognitive 29): fallow_engine::duplication_detector::detect::extraction::extract_clone_groups has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (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":"crates/engine/src/duplication_detector/detect/extraction.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2622adcc055a9b7b9ca7d724ea5c0204ccbc75d718571a4544ea678b2d2dcdb"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::duplication_detector::near::candidate_components (cognitive 29): fallow_engine::duplication_detector::near::candidate_components has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (11 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":"crates/engine/src/duplication_detector/near.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6ea880ee58617090df224bc37585311576021d99744c97e4501e4a550418b3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::classes::collect_quoted_class_tokens (cognitive 29): fallow_engine::health::css_analytics::classes::collect_quoted_class_tokens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (8 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e0fb7f4f156f15a26932f6e2d1f9d4c661f868dcf9508a6c643241353c3474"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::vue_options_props (cognitive 29): ContractCollector::vue_options_props has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/component_contracts/classes.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3b5944533a0d6d0fa2de7199932adda62286db743a2db975dbd99434801568"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchedBindingCollector::build_root_reference_spans (cognitive 29): BatchedBindingCollector::build_root_reference_spans has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (11 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3295b595c8d7a07d4608d4cdb7ae8dfded45049cf45431827b0086af4477e068"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_playwright_factory_call_definitions (cognitive 29): ModuleInfoExtractor::resolve_playwright_factory_call_definitions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 9 (12 pts), boolean chains 2, match/switch 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"684a5688c5b84002d8440b458b13f804f43a78b7a432cad95de94437352b6eab"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_declarator_instance_bindings (cognitive 29): ModuleInfoExtractor::record_declarator_instance_bindings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (9 pts), boolean chains 7 (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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1152d101755a46f8c570c4fe396299baddc77fd5ba3934958b82ef8f34cbbf4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_exported_direct_object_binding_facts (cognitive 29): ModuleInfoExtractor::record_exported_direct_object_binding_facts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (8 pts), 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f7084ff771b8fbabcfa0b4dca06127b769e86479482650056dd60d932b0596"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-emitted-versions.scanJsonExample (cognitive 29): sync-emitted-versions.scanJsonExample has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 2 (nesting depth added 11). Of this number, 28 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":"scripts/sync-emitted-versions.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fae682a1012eb94b85ac3f50605108846fabb5414b1fef8018b6395866a31d"}},{"ruleId":"D2","level":"warning","message":{"text":"data.legendText (cognitive 29): data.legendText has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 7 (12 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":"viz-frontend/src/data.ts"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f9cd1fa82fa4f5e1816f14bfcd951685a78608277bd15a05792ee86efc6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::diff_risk::detect_file (cognitive 28): fallow_api::diff_risk::detect_file has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (12 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":"crates/api/src/diff_risk/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3167fe328e0a6ba7977ee8e59f62c06c6383d469e78865779db17fbff6f1f3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::agent_install::mcp::merge_codex (cognitive 28): fallow_cli::agent_install::mcp::merge_codex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (4 pts), boolean chains 3, 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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"f148d2590c1faad079462b77711259b1144a1c6ec9c074b71cd1ddffd06b47c5"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::entry_points (cognitive 28): PackageJson::entry_points has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (6 pts), match/switch 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":"crates/config/src/workspace/package_json.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdfdc0b88d6e561c4527cd6c1d197d598857dfded12cee12a28bfdbff21d061"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::factory_callback::propagate_callback_factory_accesses (cognitive 28): fallow_core::analyze::members::factory_callback::propagate_callback_factory_accesses has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (6 pts), match/switch 1 (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":"crates/core/src/analyze/members/factory_callback.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec30bf2c13cdff86adfd3ca9ca157c4678c1e5435a7f0f6d65b75ee1710363d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::production_only_suppressions::is_re_exported_by_production_entry (cognitive 28): fallow_core::analyze::production_only_suppressions::is_re_exported_by_production_entry has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 3, match/switch 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":"crates/core/src/analyze/production_only_suppressions.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf057382d7cb56f2ccf46ccec5ed27ee0a52e66f8895a1be36797c6624b5120c"}},{"ruleId":"D2","level":"warning","message":{"text":"IstanbulFileCoverage::new (cognitive 28): IstanbulFileCoverage::new has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee65da085d4e5e3df7491d5230611d9b908cc755c34428589687d8bbba84487b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::parse::parse_source_to_module_unbounded (cognitive 28): fallow_extract::parse::parse_source_to_module_unbounded has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (7 pts), boolean chains 2 (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":"crates/extract/src/parse.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68faa8c1b8b027e657ce0dcc118c4e71fb542ef2bf8ab1dc9170b0c54bcd2aa"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::recovery::section_ends (cognitive 28): fallow_extract::sfc_template::recovery::section_ends has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (7 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":"crates/extract/src/sfc_template/recovery.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dba539eafa93adf9c38b3e86fd0ea4fda55cae9ed58dd0fe7ec04d8e678235e"}},{"ruleId":"D2","level":"warning","message":{"text":"TestReachabilityIndex::active_route_profiles (cognitive 28): TestReachabilityIndex::active_route_profiles has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 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":"crates/graph/src/graph/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"5632651bb996e23f8fd87b0730b75e89c10e0e9ebebea87e35d06844391ce148"}},{"ruleId":"D2","level":"warning","message":{"text":"check-miri-cfg.stripLiterals (cognitive 28): check-miri-cfg.stripLiterals has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-miri-cfg.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf50d1dbac16273b1c43359fbe4b25cc894dbb56f036ba531fb64839350da6b"}},{"ruleId":"D2","level":"warning","message":{"text":"tooltip.lensLine (cognitive 28): tooltip.lensLine has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 8 (11 pts), boolean chains 4 (nesting depth added 10). 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":"viz-frontend/src/tooltip.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7891052807e101acf665119d518b0758db1f2175efecd00aa74e52d64b9c2d40"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::parse_script_internal (cognitive 27): fallow_core::scripts::parse_script_internal has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 3 (7 pts), match/switch 1 (3 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"350f438b73fc32c0a76efae9a38f4f0870d7cdd7caf7ad45a1d4f6308b31fbb3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_walk_order_member_access (cognitive 27): ModuleInfoExtractor::record_walk_order_member_access has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ec04b0014317ed5c8afa60e702229e10e1d161059811c9a4258ad0e207b1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_factory_return_candidate (cognitive 27): ModuleInfoExtractor::record_factory_return_candidate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (6 pts), boolean chains 2, 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf94615b9251c3d39b098ea5d91ccb3561c5b15db9a48e059d092d314265db63"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::parse::compute_semantic_usage_with_candidates (cognitive 27): fallow_extract::parse::compute_semantic_usage_with_candidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/parse.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"c378446738c18bd725d6a0f3f7ed4c9fa79d12ebc4c913917969f876f995202e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::helpers::extract_identifiers_from_host_expr (cognitive 27): fallow_extract::visitor::helpers::extract_identifiers_from_host_expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc70228e4dc3525c5fc16be5b186fe98e042889a6a87ce2e4852794d5bfcb61"}},{"ruleId":"D2","level":"warning","message":{"text":"ExposedNameSearch::reaches_exposure (cognitive 27): ExposedNameSearch::reaches_exposure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/re_exports/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"03efe10c8578cfedd601d76ae56d8875c86c0cf10f8e7cba6c8654c8d9e16845"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_lsp::hover::check_react_prop_intel (cognitive 27): fallow_lsp::hover::check_react_prop_intel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/hover.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"996c20e451ccbcc5a545f3a678a5f07ab16509c1377667d2484579999408f0c4"}},{"ruleId":"D2","level":"warning","message":{"text":"render.drawHoverNeighborhood (cognitive 27): render.drawHoverNeighborhood has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, loops 2 (4 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee3b2e63121127b5f82f12f99d864be10c0ef8d7706386bde75781548a9d7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"treemap.renderTreemap (cognitive 27): treemap.renderTreemap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 7 (11 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"55edb12ade8ae17edda277362aad9eac28336d9d57c9f1c6a30a265638ccf9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::diff_risk::clones::diverged_clone_siblings (cognitive 26): fallow_api::diff_risk::clones::diverged_clone_siblings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (7 pts), loops 2 (3 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":"crates/api/src/diff_risk/clones.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc73789797190609837c1ccd7a3d20791dd32b972946394db30872357bf400"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandCollector::collect_segment (cognitive 26): CommandCollector::collect_segment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/core/src/plugins/mise.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd74d9b9c2e9fd60e96daa7f29db69e1cb01117605dfd4bc815486b51a8c2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginRegistry::resolve_script_config_files (cognitive 26): PluginRegistry::resolve_script_config_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0770c20202b1bdfbda2516d154381f9cdfe3d8c9be0becf6c0191c9a3253965"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::playwright::playwright_indexed_access_targets (cognitive 26): fallow_core::analyze::members::playwright::playwright_indexed_access_targets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/playwright.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d5e819ee87fafbfb5e015a65ed795a2d149ec1384e657ec5706f8d75e5b59f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::unused_exports::partition_by_common_importer (cognitive 26): fallow_core::analyze::unused_exports::partition_by_common_importer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 7 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_exports.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e00f13a16ec19b7f4f4f39f4887059feba9f3a32bf84d103693974a371d7c91"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::adonis::resolve_v5_adonisrc (cognitive 26): fallow_core::plugins::adonis::resolve_v5_adonisrc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (10 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":"crates/core/src/plugins/adonis.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"df126ef7b033a3129a47b5a38cb4d19c885e11d2247950ce2408583a932a07c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::specifier_usages (cognitive 26): Scan::specifier_usages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (6 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":"crates/engine/src/trace_usage_impl.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5389f4ac79651c89ad43d37f54c6066f5447d302efc57ccffeb2e1f69c9ec359"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::lit_attribute_names (cognitive 26): ContractCollector::lit_attribute_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (4 pts), loops 2 (3 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":"crates/extract/src/component_contracts/classes.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edd1248e75daa53eb683f4fca3d501b0b5be0ea51cf196e174ca60eb339b90c"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectStyleCollector::collect_call (cognitive 26): ObjectStyleCollector::collect_call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 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":"crates/extract/src/css_in_js/object.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef704c92adc57e003c1e4f777b5ed7dacacdd6b222c0d63c832b32e20f74828b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::handle_cjs_member_export (cognitive 26): ModuleInfoExtractor::handle_cjs_member_export has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (4 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dfa122e4e5eddc586426072f1df67f41029f829a7e71ac616bc3f5e682221e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::visit_assignment_expression (cognitive 26): ModuleInfoExtractor::visit_assignment_expression has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376ce498ade17a4ef04bde74344a985b00daaae99215607f47bd8c0e936d488"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespacePropagationIndexes::new (cognitive 26): NamespacePropagationIndexes::new has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (10 pts), match/switch 1 (3 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":"crates/graph/src/graph/namespace_indexes.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1a145f1e04f581eebebdf2b047f698d88ba53ee47ab629bb0b75b0133a4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"download.downloadAsset (cognitive 26): download.downloadAsset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 2 (4 pts), 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":"editors/vscode/src/download.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fe0764cf668d40dfde377a11c7598420ca3bc0331574e91ca81bf05de9bf25"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic-clone-conformance.loadManifest (cognitive 26): semantic-clone-conformance.loadManifest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, loops 2 (3 pts), 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec5991f1ace838f8c565634231609bcd4dc1d9656ead513579e29ad11b2c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"interact.graphHandleClick (cognitive 26): interact.graphHandleClick has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4 (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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78d7e3b7d60b2dd9bb8e3be0cdadfeb62beb49ab1165b8a5d4c20cdc37875f3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::audit_run::base_files::can_reuse_current_as_base (cognitive 25): fallow_api::audit_run::base_files::can_reuse_current_as_base has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (4 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":"crates/api/src/audit_run/base_files.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2f61915ef23dc64ffb32a73dc042592befcdc077c4d0420d74b224cef409cc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::mutation::scheduler::read_dry_run (cognitive 25): fallow_api::mutation::scheduler::read_dry_run has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 5 (8 pts), match/switch 2 (4 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8e85856e69a475d82480892f84cf7a3be03cc343c7e15500d292ebc6dc1577"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::check::output::handle_type_aware_trace_output (cognitive 25): fallow_cli::check::output::handle_type_aware_trace_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (7 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":"crates/cli/src/check/output.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"485d8d3efc182ba57900a6e162af1f019cc4168c967b2a3db6fb8a2c3236681e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::fix::deps::process_package_dependency_removals (cognitive 25): fallow_cli::fix::deps::process_package_dependency_removals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 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":"crates/cli/src/fix/deps.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b200048b9ec3b3e07ed1330723f71b85021374b61ab7d67e32f94d3abd475"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::factory::propagate_factory_call_accesses (cognitive 25): fallow_core::analyze::members::factory::propagate_factory_call_accesses has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (10 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":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88f07c18e37e97e93726fe8340bcf4c6df95cf17bfe7290fd0dfeaf18161be1"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::heritage::build_parent_to_children (cognitive 25): fallow_core::analyze::members::heritage::build_parent_to_children has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (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":"crates/core/src/analyze/members/heritage.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98b52241c5a7d3b9219675a76472b4b619c1282eee2b5d8d8a24cc5f86bea24"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves (cognitive 25): fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), match/switch 2 (3 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":"crates/core/src/plugins/gatsby.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"192a38b9e9cb8b4ab4409ab2fa24bb2d0b62b7642911cd9511b5e6e74e49bb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::flag_credits::parse (cognitive 25): fallow_core::scripts::flag_credits::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 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":"crates/core/src/scripts/flag_credits.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d51eb1b0fbdef2f818048f2effc5ee733ca4f7f5f30c1e08a9c5c778d78fd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_program_spy_api_locals (cognitive 25): ModuleInfoExtractor::record_program_spy_api_locals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (9 pts), loops 2 (4 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":"crates/extract/src/visitor/visit_impl_spy_calls.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dee35113299de67586d4a7c99fa5f5529135f196832f435bae323fcc47ee5e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::shared::collect_pattern_usage (cognitive 25): fallow_extract::sfc_template::shared::collect_pattern_usage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (7 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":"crates/extract/src/sfc_template/shared.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bbe8f3189cddd2dfb71e64e10fd81e459117957b8ba8cee536d49fcbe08ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_factory_returns::flatten_object_shape (cognitive 25): fallow_extract::visitor::visit_impl_factory_returns::flatten_object_shape has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (11 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_factory_returns.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82238137d1cc0163af64def77ece9453d93e3d732baef8cfc8868b4a3739f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::specifier::try_tsconfig_root_dirs (cognitive 25): fallow_graph::resolve::specifier::try_tsconfig_root_dirs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"43425ce7cc1413a07960882da00646924627240891b79908ca6373870a8d0fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_similar_code_sidecar::protocol::process_request (cognitive 25): fallow_similar_code_sidecar::protocol::process_request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 3 (5 pts), 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":"tools/similar-code-sidecar/src/protocol.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6af0e1885a50b7f435aef06d3ccd72e9b77bc6d388b7685da7141a24ffe45ce"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::health_codeclimate::build_health_codeclimate (cognitive 24): fallow_api::health_codeclimate::build_health_codeclimate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 6 (10 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":"crates/api/src/health_codeclimate.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3892430b73b6e6e84db17da6f7f447a8c97e5c89680fa8fe25dc4ef4cd5763c4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::ci::collect_gitlab_discussion_fingerprints (cognitive 24): fallow_cli::ci::collect_gitlab_discussion_fingerprints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 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":"crates/cli/src/ci.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b01e96278598508f4c666e04850a80ce14acde3a53b5ee4587db9234695938"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::fix::emit_residual_skip_warnings (cognitive 24): fallow_cli::fix::emit_residual_skip_warnings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (24 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":"crates/cli/src/fix/mod.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e69843f744b9916b343fef809c9c978be42f50c3f9fa5600bdd022a791a4df0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::mutation_cli::run_inner (cognitive 24): fallow_cli::mutation_cli::run_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 1 (3 pts) (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":"crates/cli/src/mutation_cli.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b59c846f284315bde16cea7e9d4fa79a7c3d065d45b349c3a2235c46793e00d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::instance::build_typed_instance_binding_targets (cognitive 24): fallow_core::analyze::members::instance::build_typed_instance_binding_targets has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (9 pts) (nesting depth added 16). 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":"crates/core/src/analyze/members/instance.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be3a9ff949ca1be57d3dab335cf541d8d89c40f24fb0e4268ed2c46ba34f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::playwright::build_playwright_fixture_type_targets (cognitive 24): fallow_core::analyze::members::playwright::build_playwright_fixture_type_targets has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 16). 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":"crates/core/src/analyze/members/playwright.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3264bda43f7460f6dd67c4af44a1658caa8d6af120167db5f6bb62719e95166"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::unrendered_component::find_unrendered_lit_elements (cognitive 24): fallow_core::analyze::unrendered_component::find_unrendered_lit_elements 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":"crates/core/src/analyze/unrendered_component.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01ab3a322bdd04189f77ea86488cf093243e6a1881ea91cbe7281c456f90f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::project_glob::expand_with_limit (cognitive 24): fallow_core::plugins::project_glob::expand_with_limit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 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":"crates/core/src/plugins/project_glob.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e24d988b74a13f82ace264c221b4a174c1ada9905d39dc5c4954f8dae9cd82"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::baseline::identity_counts_with_placeholder_allowance (cognitive 24): fallow_engine::baseline::identity_counts_with_placeholder_allowance has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (10 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":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d44dd5fcdb4ac97791fab3ff38ec4f38f6011a154c11893fbf41fc0f675c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::change_coupling::analyze_change_history (cognitive 24): fallow_engine::change_coupling::analyze_change_history has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (10 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":"crates/engine/src/change_coupling.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f23426176e5b3161ecaa6e61d035d828b7543efe70930ef56b3a7f84581a63"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::add_macro_shapes (cognitive 24): ContractCollector::add_macro_shapes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 2 (3 pts), match/switch 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d6e63a966b6447f92790ad5bb53a9e8fd2a512a1489e23e854b54315e1b27f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::subclass_reference_candidates (cognitive 24): ModuleInfoExtractor::subclass_reference_candidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (7 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7685a04271a68a68beb8845f4e5ea85ab859ca1f4f459f2132b3f596243436"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::expand_typed_property_compound (cognitive 24): ModuleInfoExtractor::expand_typed_property_compound has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b2ac40ad8f3b9dc0e71ebbf33358db99f9562ab8ae484658c8d82943e298be"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_factory_property_observations (cognitive 24): ModuleInfoExtractor::resolve_factory_property_observations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_factory_properties.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46fc37b6c8bacbfd74bdecb08ce7b4987cb73f42bc26f78ace87eef657cbd64"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_typed_member_destructuring (cognitive 24): ModuleInfoExtractor::record_typed_member_destructuring has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (3 pts), loops 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":"crates/extract/src/visitor/visit_impl_member_destructuring.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f9022bc6f189c2640a4e66d45f2c2b40ca4b9e43b9a3dd5359ed6abf9c185c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css_classes::is_typo_edit (cognitive 24): fallow_extract::css_classes::is_typo_edit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, 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":"crates/extract/src/css_classes.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"76083cd4e9782433bd0a641b8ee80e88b0c9736eeaaf41ad73d9e3d81bf4be92"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::helpers::extract_class_instance_bindings_with_origins (cognitive 24): fallow_extract::visitor::helpers::extract_class_instance_bindings_with_origins has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (9 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"30633066b2c9c5b67e35d6bbdf78583459c8b8dd0e4fe0c2cff67dbb1c92b7ab"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::upgrades::apply_specifier_upgrades (cognitive 24): fallow_graph::resolve::upgrades::apply_specifier_upgrades has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (9 pts), boolean chains 3 (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":"crates/graph/src/resolve/upgrades.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e0505189546cdf67f4e16278389d17e153e17c8fc7b5a3dc6259280f183384"}},{"ruleId":"D2","level":"warning","message":{"text":"check-benchmark-harness.extract_matrix_targets (cognitive 24): check-benchmark-harness.extract_matrix_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-benchmark-harness.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9e7c0635ef0867b0d4a3c13ab3d855a7b294b040281f7f29212258779204ee"}},{"ruleId":"D2","level":"warning","message":{"text":"check-benchmark-harness.validate_targets (cognitive 24): check-benchmark-harness.validate_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, 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":"scripts/check-benchmark-harness.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b55b6402d10362bd99d7811f51e08f19ee711278a36e5de9178158746d8a548"}},{"ruleId":"D2","level":"warning","message":{"text":"public-config-corpus.render_markdown (cognitive 24): public-config-corpus.render_markdown has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 5 (9 pts), boolean chains 1 (nesting depth added 4). 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":"scripts/public-config-corpus.py"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02251e7d5b8542e5ca65b8c2557ad0965d6ec00ed5d2a12e2dd2f5a15f69369"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic-clone-conformance.validateFallowReport (cognitive 24): semantic-clone-conformance.validateFallowReport has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcee76cd719dc61909046cb3e3d2582a3d5ba47af471c9288621597b9a9a40e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-wait-checks.waitForChecks (cognitive 24): ship-wait-checks.waitForChecks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba276be9c3b25667cd2b04157b58813f769ee88ee2388c1ff6684a19612d4d43"}},{"ruleId":"D2","level":"warning","message":{"text":"ego.drawStageColumn (cognitive 24): ego.drawStageColumn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (9 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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ce8b0b99eea4898acef9923a9e283536252be923b1eccd3872697a911ddb03"}},{"ruleId":"D2","level":"warning","message":{"text":"build.louvainCluster (cognitive 24): build.louvainCluster has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 4 (7 pts), loops 6, boolean chains 3 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 11 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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6441273b1bd09d679954321ba114ec1259b5ab27f1e24d165bae99c4398a172f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::agent_install::render_human (cognitive 23): fallow_cli::agent_install::render_human has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (5 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":"crates/cli/src/agent_install/mod.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d73bfc362ab789fdf1b1efa2f109df61293448b40bb0fc84633c03658ca6f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::cli_report::normalize_saved_envelope (cognitive 23): fallow_cli::cli_report::normalize_saved_envelope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 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":"crates/cli/src/cli_report.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf5ad379e0bd4a0a34f3678fb1dc6099e557a852bfc7cdc21aa5ee18c195f54"}},{"ruleId":"D2","level":"warning","message":{"text":"ProofOrigins::resolve_export (cognitive 23): ProofOrigins::resolve_export has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/policy/gdp.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1756e9820215a014e68168b527b12ae498b09a36dc7af61d0022be65c9ba7d05"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceCollector::read_top_level (cognitive 23): ServiceCollector::read_top_level has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 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":"crates/core/src/plugins/railway.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"95799448439c5ae6a5eb62cff11bbdec9a7937f25b1ff795b7fd66215bda3877"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::fluent_chain::propagate_fluent_chain_accesses (cognitive 23): fallow_core::analyze::members::fluent_chain::propagate_fluent_chain_accesses has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (fallow_core::analyze::members::fluent_chain::propagate_fluent_chain_new_accesses) 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":"crates/core/src/analyze/members/fluent_chain.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f30dc2dde8a7de2d4fd7b959130e61fef7e82ead0fde4db0c9bbb87278182f0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::fluent_chain::propagate_fluent_chain_new_accesses (cognitive 23): fallow_core::analyze::members::fluent_chain::propagate_fluent_chain_new_accesses has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (fallow_core::analyze::members::fluent_chain::propagate_fluent_chain_accesses) 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":"crates/core/src/analyze/members/fluent_chain.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"569cd06c3eb41de9d0019b9c5991e7f616e38a32b25151c78f9d47f9545ec6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::prop_drilling::non_maximal_origins (cognitive 23): fallow_core::analyze::prop_drilling::non_maximal_origins has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 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":"crates/core/src/analyze/prop_drilling.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"da91bd213f6144da69f63dff37a01dc2c7f0a8cc821b0fccbc4bb45d489b441a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::config_parser::collect_require_sources (cognitive 23): fallow_core::plugins::config_parser::collect_require_sources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa6d586cf2b12be33362a173bac93cbf6fb91de39b8f333275b1045ca4da173"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::nuxt::outside_layer_roots (cognitive 23): fallow_core::plugins::nuxt::outside_layer_roots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"8438a3d823c70cb49dca2fa2da6e0b1fcfabf2b92d22aa1da154686e614f188a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::react_router::collect_route_call (cognitive 23): fallow_core::plugins::react_router::collect_route_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (2 pts), match/switch 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":"crates/core/src/plugins/react_router.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"72354b92a8c9948550df9a660b4dabb98edd0e9b7fb393cd11f146f5929555d6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::coverage_v8::load_v8_coverage_map (cognitive 23): fallow_engine::health::coverage_v8::load_v8_coverage_map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/coverage_v8/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f3bf5cd7c067a26ad7b8060e3c3028f0f3cab336b6c28837c049694d957cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::cva::collect_quoted_cva_class_blocks (cognitive 23): fallow_engine::health::css_analytics::cva::collect_quoted_cva_class_blocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/cva.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2247a917f8813712105fc0cf479e8786bd1897eb9250bb560f34f492fb02b218"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::collect_exports (cognitive 23): ContractCollector::collect_exports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e7c1c1b9464f103f263e2b4bae73c82b82a0aacda35dce3b52b361cba2021a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::visit_property_definition (cognitive 23): ModuleInfoExtractor::visit_property_definition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda0f001029b1aec29d16a390949eaed631aaa0a4778d16fa1699daf094193f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_projection_source (cognitive 23): ModuleInfoExtractor::record_projection_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 11). 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a706748e925cf3b3a4e2b120f8ad8ee32dfa28baf65b7a07a422c4cd3a0f3ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::component_contracts::runtime_vue_shapes (cognitive 23): fallow_extract::component_contracts::runtime_vue_shapes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (9 pts), 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2779b234d60681f7a73f8cc5e22e8a39dc4d2c010244fbe0f87091e924a6e044"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::scan_define_emits_statement (cognitive 23): fallow_extract::sfc_props::scan_define_emits_statement has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, loops 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca41c8ee1e1b3c361235b37990da30a6cb2778e53c076bda2d47c1c0f5c4b39"}},{"ruleId":"D2","level":"warning","message":{"text":"public-config-corpus.main (cognitive 23): public-config-corpus.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, error handling 2 (3 pts), 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":"scripts/public-config-corpus.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c61a3c39bc869b95445c2610e0b40d248c8f1e6a9562ee2719f92c7971c3da"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-hidden-unicode.scan_agent (cognitive 23): scan-hidden-unicode.scan_agent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (10 pts), boolean chains 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":"scripts/scan-hidden-unicode.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcdb0b294b074c94471a5d68e97933f096600d821ea71a4a1c6f7fa09954515"}},{"ruleId":"D2","level":"warning","message":{"text":"vsix-inventory.validateEntry (cognitive 23): vsix-inventory.validateEntry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, 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":"editors/vscode/scripts/vsix-inventory.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"045be9ce15cbed2647bd794f65f92014522ea5914385a24bae1c98f606709f71"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-producer-conformance.loadManifest (cognitive 23): coverage-producer-conformance.loadManifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9940efb0bdb582c3a954f705004857a2105df8182b10f8e603aa91255d83f7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic-clone-conformance.loadCandidateEvidence (cognitive 23): semantic-clone-conformance.loadCandidateEvidence has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, loops 1 (nesting depth added 4). None of this is in the body itself: all 23 points belong to 2 function literals inside it that branch (lines 56, 105). 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b76e4e79dc6bcea7e9a843ecab8defa6eee85a4079c8eb9ebc392182db103e"}},{"ruleId":"D2","level":"warning","message":{"text":"ego.buildColumn (cognitive 23): ego.buildColumn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 3 (4 pts), ternaries 4 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 8 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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2370fd848107e9cdd227fb23d8fb3f4125a4363c1adbc466d6ba400db2c8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"main.init::handleGraphHover (cognitive 23): main.init::handleGraphHover has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (15 pts), boolean chains 4, if/else 4 (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: one other method here (main.init::selectFile) 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":"viz-frontend/src/main.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f80ad702d946e809a1fd79ae1ab852b7fab21fc4ef095686d91c05f93342e6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::audit_complexity::classify_complexity_attribution (cognitive 22): fallow_api::audit_complexity::classify_complexity_attribution has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 5 (9 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":"crates/api/src/audit_complexity.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af9e8a8b7ef0aa3c7476de25ee70e00b48f15af0182f0ee2d7ecb157cf60e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::mutation::scheduler::build_jobs (cognitive 22): fallow_api::mutation::scheduler::build_jobs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, match/switch 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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f0d397e68e4b4d6990f881f56d5f204c8a351a8b32f12fc934c26217dff465"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::dispatch::dispatch_audit_cache_command (cognitive 22): fallow_cli::dispatch::dispatch_audit_cache_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). 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":"crates/cli/src/dispatch.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"485acd67360d5c0c2b9ee5b7a5f16f3338e91e7530ef3b636359c7a27e752aad"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::scope_path::resolve_scope_path (cognitive 22): fallow_cli::scope_path::resolve_scope_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/cli/src/scope_path.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be149548f3ab3f9dcc531dbbc8c989de9072187d17c075d0a8d31d80569615d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::heritage::close_upward (cognitive 22): fallow_core::analyze::members::heritage::close_upward has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), 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":"crates/core/src/analyze/members/heritage.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"46375aa7c0abca16c47e890b43dbf38b39c7e1650fcd4a8a23bcde37d85c5fae"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::playwright::expand_playwright_fixture_aliases (cognitive 22): fallow_core::analyze::members::playwright::expand_playwright_fixture_aliases has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (7 pts) (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":"crates/core/src/analyze/members/playwright.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26f9303c431c1ed0444e6ce947b83fa5901d69738a85199554a8709b03bfb32"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::playwright::propagate_playwright_fixture_accesses (cognitive 22): fallow_core::analyze::members::playwright::propagate_playwright_fixture_accesses has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 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":"crates/core/src/analyze/members/playwright.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec787221e8307b74f751cfa219b045fbdb85b4e4de2284c102e783b21d177ba"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::discover::build_script_scope (cognitive 22): fallow_core::discover::build_script_scope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 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":"crates/core/src/discover/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"482cb2074e7c4024ebc5c126c55618211d9efb1b632f7b287c0e8e143e10b5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::external_style_usage::augment_external_style_package_usage (cognitive 22): fallow_core::external_style_usage::augment_external_style_package_usage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 pts), match/switch 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":"crates/core/src/external_style_usage.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0320526c268f9445b7a15a0b7a9cac6c738b984c0faf12b76d9776ce27d7f86"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::manifest_entries::expand_interpolations (cognitive 22): fallow_core::plugins::manifest_entries::expand_interpolations has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (9 pts), match/switch 1 (2 pts) (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":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1a44ea91f9880e11cc0445ba081eb73b7d678a5f2fd4b988fe899b64576c0a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::nuxt::collect_script_auto_imports (cognitive 22): fallow_core::plugins::nuxt::collect_script_auto_imports has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), match/switch 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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5f723f98ce822dd04f306c7022c40265b761098e555e46014bf72878db953a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::hooks::collect_hook_commands (cognitive 22): fallow_core::scripts::hooks::collect_hook_commands has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (7 pts), match/switch 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":"crates/core/src/scripts/hooks.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"501c3304d234f78464e458485f6679786258e6f87c1464dc0d213ddbb3d74997"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::baseline_growth::baseline_growth (cognitive 22): fallow_engine::baseline_growth::baseline_growth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), boolean chains 2, 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":"crates/engine/src/baseline_growth.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0811473565bc9dc154d5f83c4717277185b3b8d91759c2b44f7b91a98e88067b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::discover::build_script_scope (cognitive 22): fallow_engine::discover::build_script_scope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 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":"crates/engine/src/discover.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"84341e992c7e586cce00a616c5d5e1f6467eaeb4f2c8e892c5f7a0bfb0506035"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::function_props (cognitive 22): ContractCollector::function_props has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (5 pts), match/switch 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c926163dda4175a18c84fff2ad65d94577e8a782d258d3b781f8a7bab516d61"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectStyleCollector::build_import_map (cognitive 22): ObjectStyleCollector::build_import_map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), match/switch 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":"crates/extract/src/css_in_js/object.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21d74f7fa629a26e3e34b9d07f0d348e727f8093310498934cd1198d26b71db"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchedBindingCollector::build_static_value_map (cognitive 22): BatchedBindingCollector::build_static_value_map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c787a857505fd9aecbcef13abe8fcd992e06686c85055de2c2016a8f2b0c04"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_structural_class_calls (cognitive 22): ModuleInfoExtractor::resolve_structural_class_calls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef133ed3a38b2b0e7af376a2d597b6c34222a86f76955f81ade78bd254c58801"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::invalidate_assignment_target_proof (cognitive 22): ModuleInfoExtractor::invalidate_assignment_target_proof has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b079468d7b67e7b5e38f328f621b400a285e4d725ee08b245e51224d1b3687"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_factory_property_accesses (cognitive 22): ModuleInfoExtractor::resolve_factory_property_accesses has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_factory_properties.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc4ac57ba319ef6ac69cdd8026dac99f2cbb6942dc355a120c05d93c58d97d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::remove_direct_object_binding_targets_at_or_below (cognitive 22): ModuleInfoExtractor::remove_direct_object_binding_targets_at_or_below has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"943b1d2b50bc661f880bdec48a0e81409eeb195facb782ce4363f886a6c56bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::scan_define_props_statement (cognitive 22): fallow_extract::sfc_props::scan_define_props_statement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 2, loops 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b734531ed775e871b8617ce2844358a4db04412c529f4cfeadd609897f06cb"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::component_contracts::named_attribute_supply (cognitive 22): fallow_extract::sfc_template::component_contracts::named_attribute_supply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, match/switch 1 (nesting depth added 5). 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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"21331ba8f26eff0a0beada9774339b5f0987cca19d9e12cc278f527be1df66ba"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::fallbacks::find_scss_in_dir (cognitive 22): fallow_graph::resolve::fallbacks::find_scss_in_dir has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 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":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ae49f0be7fdc345610e1bd326987ccbbbeab8baf2e9fa4a7ad5130b387fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-hidden-unicode.agent_surface (cognitive 22): scan-hidden-unicode.agent_surface has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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":"scripts/scan-hidden-unicode.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7e6283d296765cb231347c919ba3da0475731b9d319d99a50638e2b6e40fa"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.runAnalysis (cognitive 22): commands.runAnalysis has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (7 pts), boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/commands.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6c9cc24036f9c1e6e16788c82215b4d0dd5491dc43c28b0239b5cbe400307b"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-agent-docs.parseArgs (cognitive 22): generate-agent-docs.parseArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4, loops 1 (nesting depth added 2). 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, 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":"scripts/generate-agent-docs.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4d2af4c09774ea9951f4a3e0cde4133731e1773ae72fc1191859ebdd5e39a7"}},{"ruleId":"D2","level":"warning","message":{"text":"build.relaxRows (cognitive 22): build.relaxRows has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 2 (8 pts) (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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"8603ddf929f9af9560f273bbfd15a82cb5fbb065b717523a7ac2021ee435eb55"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.analysisContent (cognitive 22): panel.analysisContent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). 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":"viz-frontend/src/panel.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ae9505ae59cb71d279c3fe5374ad119d87e70ac6c2c0ea96c63673fd2570ba"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::agent_install::mcp::merge_json_server (cognitive 21): fallow_cli::agent_install::mcp::merge_json_server has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31c2a472116bc7886b732c83e7e5d9aba32e96bea7bb738133605c44080270b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::coverage::setup_cloud::wait_for_activation (cognitive 21): fallow_cli::coverage::setup_cloud::wait_for_activation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (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":"crates/cli/src/coverage/setup_cloud.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d7616fc0b98cb72462a6eaeeeb2061016e57961a57e2ab422a860f6a4dec7a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::plugin_check::print_human (cognitive 21): fallow_cli::plugin_check::print_human has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/plugin_check.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"934394113ecaeeb4b0bde5622c7aef12c1c9cf44ba5f142bc829dcd043b47f33"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveContext::add_project (cognitive 21): ResolveContext::add_project has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (6 pts), boolean chains 2, match/switch 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":"crates/core/src/plugins/rstest.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b627d09dd334c9578492f15cd1894f422bbd9eebe446788fce3b25e11cd819bc"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualRouteCallCollector::visit_variable_declaration (cognitive 21): VirtualRouteCallCollector::visit_variable_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 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":"crates/core/src/plugins/tanstack_router.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba128ee9d4c855222e93d7953854a4bab78665e0cdc31912f3d97b37067a1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"WuchaleVitePluginCollector::visit_variable_declaration (cognitive 21): WuchaleVitePluginCollector::visit_variable_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 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":"crates/core/src/plugins/wuchale.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db8fed14f01186cae612b4e08d07e383d275c023f19a701b7bbb87d81799f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::update_cache (cognitive 21): fallow_core::update_cache has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"74512d52459debe8a880342f185ffa08ca3fb50d5377a0123026ed6d080fd913"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::policy::gdp::collect_producer_violations (cognitive 21): fallow_core::analyze::policy::gdp::collect_producer_violations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 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":"crates/core/src/analyze/policy/gdp.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca3c91f0ef012639eb622c3d6ac5c69f81bdbc9c9f20287f1b726630b21b44f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::unused_overrides::collect_lockfile_packages (cognitive 21): fallow_core::analyze::unused_overrides::collect_lockfile_packages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 1, match/switch 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":"crates/core/src/analyze/unused_overrides.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb37a91e70d9e6d7b8a4359a75a9a05154255aad0f35a790de1a7ebe793f3f1"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::manifest_entries::build_rule_report (cognitive 21): fallow_core::plugins::manifest_entries::build_rule_report has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 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":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb458ca6c12685ac410f04d47e6f0d3a62fe5bcc16995572f3c430c153eb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::registry::helpers::discover_config_files (cognitive 21): fallow_core::plugins::registry::helpers::discover_config_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (7 pts), boolean chains 3, 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":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fafad24efc8587df5068db8cf349e3bb20d06215b007a02e9861337a5c8c43"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::trace_provenance::push_plugin_export_credits (cognitive 21): fallow_core::plugins::trace_provenance::push_plugin_export_credits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (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":"crates/core/src/plugins/trace_provenance.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5197cf50e279972bd45c018da96156f55778d5c3b93fc1bc6e888a6d84735272"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::resolution_inputs::package_entry_target_states (cognitive 21): fallow_core::resolution_inputs::package_entry_target_states has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 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":"crates/core/src/resolution_inputs.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca71d4538ad454352c457d949a4bff6b1635b2e553c6157942f2615d720eb975"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens_located (cognitive 21): fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens_located has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 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":"crates/engine/src/health/css_analytics/theme_tokens.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5262f03a2470eebd458d49025c1729dfd2358c920c1a296aafb6159c8f75f03"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::session::update_parse_cache (cognitive 21): fallow_engine::session::update_parse_cache has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f584a693f4212d2c37071c5ca4f0672f5a10874a19a00e0cc79e9c14eaf3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::trace_error::collect_candidates (cognitive 21): fallow_engine::trace_error::collect_candidates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (7 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":"crates/engine/src/trace_error.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"53929a60bc0b543abae6b200210212cebf2b797fb3a57b36c312fe93285d74ca"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::trace_usage_impl::wrapper_consumers (cognitive 21): fallow_engine::trace_usage_impl::wrapper_consumers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), match/switch 1 (4 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":"crates/engine/src/trace_usage_impl.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e05e1aca21368c4b58094910e9ee0b9620fdfc5d69334d40f623e52f59a5df"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheStore::evict_lru_to_target (cognitive 21): CacheStore::evict_lru_to_target has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 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":"crates/extract/src/cache/store.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd2e6bc943069486ab391ebb9cf790dbf223f5fd26804f4db7821708135dba6"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::macro_props (cognitive 21): ContractCollector::macro_props has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 13). 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8031f661d3357ace850fddb9057cf3a7b99e63bcce903909537bafc1db6d916"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::collect_escapes (cognitive 21): ContractCollector::collect_escapes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"34600a54b373c9ed6b58d43d4b75ebc7a858aaf759bbe81c865159fcfbc9646f"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenDefCollector::build_const_object_map (cognitive 21): TokenDefCollector::build_const_object_map has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1d6fcb27a86f1b31818ce533956ddec91d4651040cbc422ff2943682dc26f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::collect_class_signature_refs (cognitive 21): ModuleInfoExtractor::collect_class_signature_refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, match/switch 1 (2 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":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1d5b563086d1e9d06f9672d3d06ec20c843f243fd2773838a2ec6778a8e36e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::binding_references::collect_through_wrappers (cognitive 21): fallow_extract::binding_references::collect_through_wrappers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/binding_references.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e82c1555a902685941d06c9b54752fbb1e3776d38112c922c357ab510a8eca"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css::mask_css_module_global_scopes (cognitive 21): fallow_extract::css::mask_css_module_global_scopes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 2, match/switch 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":"crates/extract/src/css.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e02b37ef7f13207986db12a0dff04ffd1d491df2eab0bf6a074ebb81af23472"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css_classes::is_edit_distance_one (cognitive 21): fallow_extract::css_classes::is_edit_distance_one has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_classes.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e212e39f8f7787787ef91fb8604d627dec5a56edd7f78e6e3de086b18d59f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::html::collect_asset_refs (cognitive 21): fallow_extract::html::collect_asset_refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 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":"crates/extract/src/html.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db0bea768ed8db1cced8af82757475aec5b837d39755fdb92f00804f7850c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::angular::split_pipes (cognitive 21): fallow_extract::sfc_template::angular::split_pipes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 2, match/switch 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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"91787d4f8d8b3d35e33cd820a3a2928620d6fabcf27e4013ec5f14e01534aff1"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::vue::find_template_body_end (cognitive 21): fallow_extract::sfc_template::vue::find_template_body_end has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 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":"crates/extract/src/sfc_template/vue.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a288fa833c6c266c78c7075bd309fecce5e769a5c1de0227401a8251db001933"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_server_actions::record_declaration (cognitive 21): fallow_extract::visitor::visit_impl_server_actions::record_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). 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":"crates/extract/src/visitor/visit_impl_server_actions.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d32412af2291e77b2862b964272a9fb7cdd87426f3d793ba0bd267e23f07307"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraph::collect_coordination_gaps (cognitive 21): ModuleGraph::collect_coordination_gaps has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (8 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":"crates/graph/src/graph/impact_closure.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa0b308231de769559946e1c70a070974f5bf301820675f34b48b6540f3086e"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespacePropagationIndexes::enumerate_reachable_barrels_with (cognitive 21): NamespacePropagationIndexes::enumerate_reachable_barrels_with has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 4 (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":"crates/graph/src/graph/namespace_indexes.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9294ee70e01e94d1f21533e7dea6e46485034149e8c4ad69278e13e2e3e788"}},{"ruleId":"D2","level":"warning","message":{"text":"ProfileWorklist::new (cognitive 21): ProfileWorklist::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (6 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":"crates/graph/src/graph/reachability.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e391980d7bb799c1c817d4b3fbf67f9105b62f17b12141bd89151e4d9f86ec"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::react_native::synthesize_platform_family_edges (cognitive 21): fallow_graph::resolve::react_native::synthesize_platform_family_edges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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":"crates/graph/src/resolve/react_native.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"660c9065829cf62caab376e329250fc1a1b492a17f67962fa5ff740a318736c8"}},{"ruleId":"D2","level":"warning","message":{"text":"client.startClient (cognitive 21): client.startClient has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 6 (9 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":"editors/vscode/src/client.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad14ea0e503564f7132ea8ac140d52a0d7435c0df8065cb24a4d5af8dd486b84"}},{"ruleId":"D2","level":"warning","message":{"text":"styling-pr-smoke.selectPrs (cognitive 21): styling-pr-smoke.selectPrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 5, 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":"scripts/styling-pr-smoke.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e16bae84268b45b4896f26ce0f355e6ca763666a8cebdab46eff81e13b5ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"treemap.renderFileCell (cognitive 21): treemap.renderFileCell has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dbe94606b6adf94f1824a7fc0d6a71a652842e307888935bd3cda23cbc1eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"withLinearSnapshots (cognitive 21): withLinearSnapshots has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 5, boolean chains 3, loops 1 (nesting depth added 1). None of this is in the body itself: all 21 points belong to 9 function items inside it that branch (handle::get, updateSnapshot, disposeWhenUnused, \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":"tools/type-aware-sidecar/src/backend.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be0b0fa1f5b6008d6f212ba8c71fb1a2b2ccae93d9e18dfe9bea903af555a0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::similar_code::embed_selected_with_factory (cognitive 20): fallow_api::similar_code::embed_selected_with_factory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (6 pts), match/switch 2 (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":"crates/api/src/similar_code/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5ceb6e4af306b2d24dc89289f7516fd5aedc296f35b7fc69a4d9e8f8862df"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::similar_code::transport::validate_embed_response (cognitive 20): fallow_api::similar_code::transport::validate_embed_response has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 6, match/switch 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":"crates/api/src/similar_code/transport.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f1046933eb5d0bdeebafdac570dfbe4b17a57ee5a97be7f914fc4f3bc122a4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::agent_install::mcp::merge_enabled_server (cognitive 20): fallow_cli::agent_install::mcp::merge_enabled_server has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, match/switch 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, 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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"6470ae9b71e9f540ec7d09ea228ebe267c242c9895a2dabfdd6330cc61b8e099"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::onboarding::build_recommendation_from (cognitive 20): fallow_cli::onboarding::build_recommendation_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/onboarding.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"38895f4a715fcd9d9d29f9c2b03e604b752cb3a4710469425c35061b1b71d7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"FallowConfig::find_and_load_with_options (cognitive 20): FallowConfig::find_and_load_with_options has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (6 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":"crates/config/src/config/parsing.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dcb085a9d29ca866428ce45583ea72ccf877737feb3bc389bdce9ed7d6048c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_config::workspace::pnpm_catalog::parse_key (cognitive 20): fallow_config::workspace::pnpm_catalog::parse_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"crates/config/src/workspace/pnpm_catalog.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f23fe2f6b2c772d24526a3ee0d8521356b726deb69a3c3ed467e826376522f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::credit_imports (cognitive 20): Context::credit_imports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2, match/switch 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":"crates/core/src/analyze/effect.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f84bc0b99097d141e9ce7afe3955ad5ce104478da5dcc3ed953ab7208f7a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"UntrustedSourceIndex::build (cognitive 20): UntrustedSourceIndex::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/security/rank.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"da41be7c802f99f8eff173017b6e259e9b50cf6ae0c1ea309335c0b92e47e50c"}},{"ruleId":"D2","level":"warning","message":{"text":"FederationCallCollector::merge (cognitive 20): FederationCallCollector::merge has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (8 pts), boolean chains 7, if/else 3 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/module_federation.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"5608d91b2652565c0631e0bd520ef22f76b49e1d050c06951c306c5f418a0aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveContext::add_projects (cognitive 20): ResolveContext::add_projects has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (7 pts), loops 3 (4 pts) (nesting depth added 11). 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":"crates/core/src/plugins/rstest.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"121d8669c9296709dc564ca10214774af23946af8b6e081d3103371b64d049f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeScriptPlugin::resolve_config (cognitive 20): TypeScriptPlugin::resolve_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, 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":"crates/core/src/plugins/typescript.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7d034eedd7012f986e1ba4da4aa2b11049da90410dac986dc84bea3a7c719e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::boundary::chain_origin_edges (cognitive 20): fallow_core::analyze::boundary::chain_origin_edges has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts), match/switch 1 (3 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":"crates/core/src/analyze/boundary.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d2d476ee5562b747aca66a56a85858519a079c735ca43db5b383f5cf26a59a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::effect::find_unproduced_catch_tags (cognitive 20): fallow_core::analyze::effect::find_unproduced_catch_tags has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 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":"crates/core/src/analyze/effect.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4ce917af1953b30eaf04fe5c0c83be979772dce28621a5e8cf170ccf0bafd8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::build_ol_interaction_subclass_keys (cognitive 20): fallow_core::analyze::members::build_ol_interaction_subclass_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ede7be59a9c060e5f56877f234bc498b6be925ac05d051fb575738d74bb081"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::propagate_type_alias_surface_accesses (cognitive 20): fallow_core::analyze::members::propagate_type_alias_surface_accesses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (9 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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f7c46ce6740cf608ab6ae9e72065cdefda35da1be11804474ad9cd4ad770fc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::nuxt::collect_component_auto_imports (cognitive 20): fallow_core::plugins::nuxt::collect_component_auto_imports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa39a093e5d03ffae228579d990add24446d3940643845d6329dc49b267ea33"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::oxlint::ultracite_selector_binding (cognitive 20): fallow_core::plugins::oxlint::ultracite_selector_binding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 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":"crates/core/src/plugins/oxlint.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a92d69b8f15cf1fe524e0818f915b292aaa6f68244649b00fdb1ee3cc2dc31"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::retain_new_constructor (cognitive 20): ModuleInfoExtractor::retain_new_constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/extract/src/visitor/visit_impl_constructor_alternatives.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a31a8b5aba1b4c024558e85e03608dfcd95f982ff8ede9809923bb2ca46d73"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::install_constructor_outcomes (cognitive 20): ModuleInfoExtractor::install_constructor_outcomes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 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":"crates/extract/src/visitor/visit_impl_constructor_alternatives.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b0957493917474f2fab716909904723994a568e812a17dd3bdc583e2bed061"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::static_sink_literal_value (cognitive 20): ModuleInfoExtractor::static_sink_literal_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (2 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":"crates/extract/src/visitor/visit_impl_scope_bindings.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643a39a2a54952ca58889b6607560367162f0e416bb7135f7f18cdbbb7a7973"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_typed_destructure_binding (cognitive 20): ModuleInfoExtractor::record_typed_destructure_binding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0e7a99f306b0f6739a204b36321a411f39815873f983aa5caf28e4b7ea074b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css::import_sources_from_masked (cognitive 20): fallow_extract::css::import_sources_from_masked has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5ac19f6421bd362752f108c522e2d6579111864540cf7ecbd92ca59b26bcd9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::parse::compute_mock_api_reference_spans (cognitive 20): fallow_extract::parse::compute_mock_api_reference_spans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/parse.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f943b20bfd8ce707151d79c7718a5007722a1af47daf08ad882e6f0449bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::helpers::collect_nested_type_bindings (cognitive 20): fallow_extract::visitor::helpers::collect_nested_type_bindings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 11). 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b381ee3184fa32b99ede4c4da0f68fb75a9a31b7606d7473a910c6015d82e2"}},{"ruleId":"D2","level":"warning","message":{"text":"DominatorTree::new (cognitive 20): DominatorTree::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 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":"crates/graph/src/graph/entry_load.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"de853d3284f9be4bab5daeb9adcc7e990de4ae74aa34d94a29a5ca1acfd9dc11"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::cycles::dfs_find_cycles_from (cognitive 20): fallow_graph::graph::cycles::dfs_find_cycles_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 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":"crates/graph/src/graph/cycles.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7feaa250fa3e7d41976f247b578b8d727876ef76573556bd23a2862785382fa"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::namespace_re_exports::propagate_namespace_re_exports (cognitive 20): fallow_graph::graph::namespace_re_exports::propagate_namespace_re_exports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/namespace_re_exports.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b4e59bbe3240ecdfdaedf2ac58ab918280791a17822c352fbf545c80f7159a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::auto_imports::synthesize_auto_import_edges (cognitive 20): fallow_graph::resolve::auto_imports::synthesize_auto_import_edges has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (6 pts), boolean chains 1 (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":"crates/graph/src/resolve/auto_imports.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db164ceccfbc1d952323f35ffd0b09eb55a366177d5aceb2a0471b0e6fd093e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::fallbacks::try_path_alias_fallback (cognitive 20): fallow_graph::resolve::fallbacks::try_path_alias_fallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), 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":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c55d605617eed7159933d115970a035eb94ca5cb047e3e0747c575543f8844"}},{"ruleId":"D2","level":"warning","message":{"text":"public-config-corpus.parse_toml_fallback (cognitive 20): public-config-corpus.parse_toml_fallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 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":"scripts/public-config-corpus.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4788f02803169f5eef018babd13ec2ea28a1ce31a5fc95ee85dc656866f5275"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-hidden-unicode.codepoint_hits (cognitive 20): scan-hidden-unicode.codepoint_hits has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (7 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":"scripts/scan-hidden-unicode.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba32e385000f7c59ad6f5fcb525abc9745eaf22bda32d49511ab584058a7fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"data.buildIndex (cognitive 20): data.buildIndex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 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":"viz-frontend/src/data.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bff14f88d2d7bd4ed2006d73d229504b53f6f38f944412e964b5f5641591dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.countLensFindings::walk (cognitive 20): main.countLensFindings::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 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":"viz-frontend/src/main.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"434055a65e065d1503904baa425c3e3ac6b59109a08f0b873e4ca3f22e4f61ef"}},{"ruleId":"D2","level":"warning","message":{"text":"stripTrailingCommas (cognitive 20): stripTrailingCommas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1, other 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":"tools/type-aware-sidecar/src/project-state.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"629a2d0a457792703d62cc5ade3753f4f62ddc6477cd4de10ca35e077a251804"}},{"ruleId":"D2","level":"warning","message":{"text":"IssueFilters::apply_component_filters (cognitive 19): IssueFilters::apply_component_filters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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":"crates/cli/src/check/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db2c3f546f37a46b77b0d278bfc24f382d2ba6c8428cfc40147d81c535074e4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::unsupported_security_global (cognitive 19): fallow_cli::unsupported_security_global has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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":"crates/cli/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"01380dd1e757d4c0e711310d5c1dba1152d312689de5c578d7e3674d5490aefb"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::audit::compute_dependency_anchors (cognitive 19): fallow_cli::audit::compute_dependency_anchors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 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":"crates/cli/src/audit.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8a63d1682cabd7388d492ee1e344ccd7609d56e5a1fd26da29c3676c70ee73"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::audit_brief::build_test_reach_facts (cognitive 19): fallow_cli::audit_brief::build_test_reach_facts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 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":"crates/cli/src/audit_brief.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"86273d126a0b3f380888c043ede0a5f9e43f6205eacf7aeb660249be382d1989"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::bin::schema_emit::normalize_schema (cognitive 19): fallow_cli::bin::schema_emit::normalize_schema has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (7 pts), boolean chains 3, 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":"crates/cli/src/bin/schema_emit.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9210628e15764a7b4f4c160546c5b53395fa643f083c0907381e9c2aebacbe80"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::config::run_config_with_options (cognitive 19): fallow_cli::config::run_config_with_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts) (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":"crates/cli/src/config.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a7d31f4d4625aca87161dda4d24c92db86311648e40367beb874a8d40615a8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::flags::run_flags (cognitive 19): fallow_cli::flags::run_flags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 7 (8 pts) (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":"crates/cli/src/flags.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"555c37903299483136d50560582f8498c80570645a2a9e72c26939119769fb91"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::health::run_health (cognitive 19): fallow_cli::health::run_health has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 4). 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":"crates/cli/src/health/mod.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47ecd5bc8ecc9124fd7f58f8286132099ee80f1888c92cb703930e281ef6829"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::human::traces::build_dependency_usage_human_lines (cognitive 19): fallow_cli::report::human::traces::build_dependency_usage_human_lines has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (5 pts), match/switch 1 (3 pts) (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":"crates/cli/src/report/human/traces.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0b56ba2e38fcb05c4af5662ab718fbf427fbfa80071508bfddc1cd176e86be"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::instance::augment_with_inherited_bindings (cognitive 19): fallow_core::analyze::members::instance::augment_with_inherited_bindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (9 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":"crates/core/src/analyze/members/instance.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcf3843d14b5422c0f1ae35fbf61d9de94b7b2f1ad1a6b5f11751256efeeeec"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::package_cycles::collect_cross_imports (cognitive 19): fallow_core::analyze::package_cycles::collect_cross_imports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/package_cycles.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2e7efe5e35daeaa4d37498814b5d413f1c5b581838f81493a30fc5940a40fc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::discover::entry_points::workspace_runtime_script_seeds (cognitive 19): fallow_core::discover::entry_points::workspace_runtime_script_seeds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce443800efb33c73a4af33ce417f12181137ffd48888b2b9636f1b24cd3b5a8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::manifest_entries::field_values (cognitive 19): fallow_core::plugins::manifest_entries::field_values has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (8 pts), match/switch 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":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd29047980a49c379fdd0e38caa1512f269f56326385086bbb9ab3b2c47c28d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::flag_credits::credit_value (cognitive 19): fallow_core::scripts::flag_credits::credit_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"crates/core/src/scripts/flag_credits.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbda364cfa67f36564c087ac6248229b8d27ca816821d9fa3d8ee515b5813e27"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::duplication_detector::detect::rolling::build_seed_buckets (cognitive 19): fallow_engine::duplication_detector::detect::rolling::build_seed_buckets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 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":"crates/engine/src/duplication_detector/detect/rolling.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ece3e126bbe164f640b74412f9620ad0697544e246785a6de6a95735a66e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::result::classify_dead_style_export (cognitive 19): fallow_engine::health::result::classify_dead_style_export has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 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":"crates/engine/src/health/result.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab84b0c0ef55b91e0e17c7db06771fb0a278b00f0743d3748f1332a3afd275b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::search_visibility::may_export_binding (cognitive 19): fallow_engine::search_visibility::may_export_binding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"crates/engine/src/search_visibility.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4d102c44f41e24cdac2847bfd7a68d92266efc871add0b0b95d3c4f9b12f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::astro_props (cognitive 19): ContractCollector::astro_props has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fb0c75d4e1e17fb05ac2dce4354cf1af829d1d07b551974603ac39962ab541"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeBindings::collect (cognitive 19): RuntimeBindings::collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 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":"crates/extract/src/federation_runtime.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d1ed2d8f7884e4c84941f55508969706f90a94b21a1cd57d9076dd8c99e28b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::module_dir_join_source (cognitive 19): ModuleInfoExtractor::module_dir_join_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_node_runtime.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6095e99c72b32981a50062d5c0f45a30d653e2e41339fcd138298010b6a51d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::join_conditional_binding_scopes (cognitive 19): ModuleInfoExtractor::join_conditional_binding_scopes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7e22241ee68c38dec0b48261814a2e8f93e340e57ede1bc4ad24665175dae3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::copy_direct_object_binding_targets (cognitive 19): ModuleInfoExtractor::copy_direct_object_binding_targets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff566a6c929269c1a7a638d80b0c8ba9ac84092a725f000db547bb019fb7e98"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::projection_type_value (cognitive 19): ModuleInfoExtractor::projection_type_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e01f2124c67967ecec30d2908dfb3eaa7cefd67742a03ee16fd8bcf8ff44592"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_projected_member_accesses (cognitive 19): ModuleInfoExtractor::resolve_projected_member_accesses has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7beda5bc758cd23cf178c1cc34e7f75ea5401fa963c5f13b51bdae41ce2f455"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::jsdoc_attach::collect_export_statements (cognitive 19): fallow_extract::jsdoc_attach::collect_export_statements has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (7 pts), loops 1 (nesting depth added 12). 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":"crates/extract/src/jsdoc_attach.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b899efc7d67cc62cdbd62c4f234113507a5d1f821545e07604b83b95180ba87"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::component_contracts::collect_attribute_escapes (cognitive 19): fallow_extract::sfc_template::component_contracts::collect_attribute_escapes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 6, loops 3 (5 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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2838d42be9ca36b03fc6d11d95e4c44eb417acf1510f42a2d1a208aefb73b0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::glimmer::scan_tags (cognitive 19): fallow_extract::sfc_template::glimmer::scan_tags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_template/glimmer.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0694890b5d3d08b7656d085a8ca79dd08fc3c1803d2ca274fe82d0ccdcb7c395"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::scanners::scan_delimited_section (cognitive 19): fallow_extract::sfc_template::scanners::scan_delimited_section has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 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":"crates/extract/src/sfc_template/scanners.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddadcd64a177c1a0f53428f6d96e05f91950f6f7892be4ded4805705c38e020"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::scanners::scan_html_tag (cognitive 19): fallow_extract::sfc_template::scanners::scan_html_tag has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/extract/src/sfc_template/scanners.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e2148e2a8d00b1b5233cc8e21134ef3fe2c53e8d5076686c224dd16325e08d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::template_complexity::svelte::split_await_shorthand (cognitive 19): fallow_extract::template_complexity::svelte::split_await_shorthand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 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":"crates/extract/src/template_complexity/svelte.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff6f59a8e72500b9bd6e8f0838f5441375056a47512a49ffa0760f21beb57a2"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::helpers::extract_angular_inputs_outputs (cognitive 19): fallow_extract::visitor::helpers::extract_angular_inputs_outputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (6 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada04dbabaadf2324a9daaefc73432058658b7ef8e5f2d15a5db7d3036775777"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::effective_exports::seed_direct_bindings (cognitive 19): fallow_graph::graph::effective_exports::seed_direct_bindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/effective_exports.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8298a3ad255228cd7a0fcecb03b9b0d7dd4064ae1b131a93baa5ab9bbfa9d44"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::namespace_re_exports::collect_consumer_credits (cognitive 19): fallow_graph::graph::namespace_re_exports::collect_consumer_credits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"crates/graph/src/graph/namespace_re_exports.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca1ff17f870d42a853e4910faad80ddc2eb5afe26a697d1f4fb15359b26f530"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_lsp::diagnostics::structural::push_package_cycle_diagnostics (cognitive 19): fallow_lsp::diagnostics::structural::push_package_cycle_diagnostics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0073a81a4f6e8739113300771b84ec2290adee1b6c2a1c03cd32a74a5152bc49"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_mcp::tools::collect_semantic_completeness (cognitive 19): fallow_mcp::tools::collect_semantic_completeness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 2, 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":"crates/mcp/src/tools/mod.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbff2e3ba7da55aab3fb7c3797e2a46891b84a6aee9f84a2a49a344900c6add"}},{"ruleId":"D2","level":"warning","message":{"text":"check-comment-quality.lineCommentBodies (cognitive 19): check-comment-quality.lineCommentBodies 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":"scripts/check-comment-quality.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c705039a05eebd9c12ca92d5ec1d8dcf5651c7ff70649c21dc85f499eca8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-producer-conformance.loadFixtures (cognitive 19): coverage-producer-conformance.loadFixtures has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0860e32c90cdf5164779a4846a736f3cb63bd8fa1023bcbdd776c6ffa04c4f86"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-agent-docs.main (cognitive 19): generate-agent-docs.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1, 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":"scripts/generate-agent-docs.mjs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c3c0f97715e5d7b31731d2c95808d1d5e43fa6112e4d703a1c60ea3ade965"}},{"ruleId":"D2","level":"warning","message":{"text":"data.lensFindingLevel (cognitive 19): data.lensFindingLevel has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (8 pts), boolean chains 1, 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":"viz-frontend/src/data.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d73d8d7802d531cd5e39af74b5faca857d2d033f03dcc74a0690d76321c2a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::attempt (cognitive 18): Worker::attempt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, match/switch 3 (4 pts) (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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ee8918cd9e067d80f4d5cdd71432ef77ce6703489c2d939fafaf1bd5401cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::derive_health_sections (cognitive 18): fallow_api::derive_health_sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. 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":"crates/api/src/lib.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc272a2b46639807738d383c50fddfde116a38d1739c03559a076ef973e864f4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::diff_risk::text::call_chains (cognitive 18): fallow_api::diff_risk::text::call_chains has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 5 (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":"crates/api/src/diff_risk/text.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"120201ed84243969085b740c9fbb7a8cdc7783bcec8cea8222f3ffc831771062"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::agent_install::hosts::detect_with (cognitive 18): fallow_cli::agent_install::hosts::detect_with has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), match/switch 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":"crates/cli/src/agent_install/hosts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a482fbd7d3c7580aaf92d8da3f6042bd387ceeacd97e83fb501483b647ebe33f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::check::execute_check (cognitive 18): fallow_cli::check::execute_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 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, 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":"crates/cli/src/check/mod.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea0fa1faf264315765f18a066d9f85789154f96fe8d8db458c0ec9508323fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::coverage::upload_inventory::collect_caller_edges (cognitive 18): fallow_cli::coverage::upload_inventory::collect_caller_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts), 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":"crates/cli/src/coverage/upload_inventory.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"19602be2a4c18706f9055396ab8d36ab90a9dc54b0fd63708beb96f8439b50a6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::dispatch::dispatch_type_aware_command (cognitive 18): fallow_cli::dispatch::dispatch_type_aware_command has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (8 pts) (nesting depth added 11). 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":"crates/cli/src/dispatch.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94834a370edef4fdc4e20a218363a40dba7cca142db2a914eccd5d9279eac70"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::human::check::collect_framework_rules (cognitive 18): fallow_cli::report::human::check::collect_framework_rules has cognitive complexity 18 (threshold 15). Drivers by points: loops 18. 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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4dc5efbf2eaf79cb63962f35b25481572a26fa56f738845cfc0096ea8c4b41"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::human::traces::build_dependency_trace_human_lines (cognitive 18): fallow_cli::report::human::traces::build_dependency_trace_human_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (6 pts) (nesting depth added 5). 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":"crates/cli/src/report/human/traces.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"54025718aca3c36859e701ad30c1fcd989d62b1cb353bed9d75bdc13312a2e76"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::sarif::native_rule_id (cognitive 18): fallow_cli::report::sarif::native_rule_id has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 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":"crates/cli/src/report/sarif.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc0ca188e5deea8ca5ce454f24e3a94796876718d173aa34bb97711f7ec5db8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_config::rule_pack::zone_reference_errors (cognitive 18): fallow_config::rule_pack::zone_reference_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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":"crates/config/src/rule_pack.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575613e29bb8c50713e227b4edc0a89e7f1553c7b5dda585c2f34bdb472061d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_config::workspace::parsers::walk_workspace_dirs (cognitive 18): fallow_config::workspace::parsers::walk_workspace_dirs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/config/src/workspace/parsers.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a725de57ec5b50902c23ac105b4a184d6748cfa965ebd517ccc320b580c1e6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::effect::find_unused_errors (cognitive 18): fallow_core::analyze::effect::find_unused_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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":"crates/core/src/analyze/effect.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aee7c2587d9662387c8644a36e0939d0f6468889b36ca9b16714077f392f53"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::inline_loaders::collect_inline_loader_referenced_deps (cognitive 18): fallow_core::analyze::inline_loaders::collect_inline_loader_referenced_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/inline_loaders.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcb7beb2293925cabf60e3d7fb324be97558720b6ef581006e04fde862ef969"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::adonis::resolve_v6_adonisrc (cognitive 18): fallow_core::plugins::adonis::resolve_v6_adonisrc has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (8 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/adonis.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab30320801c5e775a05d7b5fc2efea2d68a282a5e920bed3a1de9538ef067d5"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::expo::collect_added_entries (cognitive 18): fallow_core::plugins::expo::collect_added_entries 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":"crates/core/src/plugins/expo.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd9225a57e5a82353fddd5239af3ab8cc4f06c966510cb0eff2711aa7f853b2"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::pinia::collect_store_auto_imports (cognitive 18): fallow_core::plugins::pinia::collect_store_auto_imports 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":"crates/core/src/plugins/pinia.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fd28bea4ec518758b6415e6ca1ae3c0a32af7df62ebdb7fc356bb8bac77e31"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::typescript::parse_tsconfig_content_mappers (cognitive 18): fallow_core::plugins::typescript::parse_tsconfig_content_mappers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"crates/core/src/plugins/typescript.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea38ded56c2de4801881ca6b5e06855aca8a30df80348905bd25b156b9010494"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::webpack::webpack_merge_bindings (cognitive 18): fallow_core::plugins::webpack::webpack_merge_bindings has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), match/switch 2 (6 pts), if/else 1 (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":"crates/core/src/plugins/webpack.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a177d2f723ddd6d28086f591ce5ad21fa069d365f3d06adb2ecb458e29fd55e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::concurrently_inline_commands (cognitive 18): fallow_core::scripts::concurrently_inline_commands has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"83baac853a373e57ac4de12f73576605f791f3e2c7c7357ebbc39508a5811e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::extract_args_for_binary (cognitive 18): fallow_core::scripts::extract_args_for_binary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ff19426098c083518b099470856f51fa31739ff2bfe3c061746ec2e1f02967"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::nx_targets::run_commands_scripts (cognitive 18): fallow_core::scripts::nx_targets::run_commands_scripts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/core/src/scripts/nx_targets.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b89c952658b83dfeb5ae3c36342198c7bebceeca31cb0e1b75b27be4b4f263d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::shell::split_shell_operators (cognitive 18): fallow_core::scripts::shell::split_shell_operators 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e570e204ff06b881777918b6552e72ea7288b68561e6663a55fccc73d551a73"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::shell::command_substitutions (cognitive 18): fallow_core::scripts::shell::command_substitutions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"39afb7cc5f9c5ea86ecfbfdae7b95f95e9c6a9396d7450515fc0b5bfe781726f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::shell::skip_initial_wrappers (cognitive 18): fallow_core::scripts::shell::skip_initial_wrappers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (7 pts), boolean chains 4 (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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1615a9a2dcb099100ec1afec5ad63788eba6b6f704fb33c79ded624fefb097"}},{"ruleId":"D2","level":"warning","message":{"text":"IstanbulFileCoverage::lookup (cognitive 18): IstanbulFileCoverage::lookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 2, 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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbe00952a5117bd832dd1f9099e08f90bf4d4e4f06c868fb5b6e7b7daf0f697"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::dead_code::apply_base_collection_rules (cognitive 18): fallow_engine::dead_code::apply_base_collection_rules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. 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":"crates/engine/src/dead_code.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f251b439a312cb1cb637cc32b0727b186992fdf0398bffc6540d602b8b384b45"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::duplication_detector::near::complete_link_clusters (cognitive 18): fallow_engine::duplication_detector::near::complete_link_clusters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/duplication_detector/near.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e26a20c7ab2294bfb2718f530e8411e766ef7f5dbb59d971dd03e07f024e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::derive_health_sections (cognitive 18): fallow_engine::health::derive_health_sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. 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":"crates/engine/src/health/mod.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a225b92ec120061c050a8258aa8402b9a622df106952a05a8f6f4975e55bf1af"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::classes::extract_dotted_class_names (cognitive 18): fallow_engine::health::css_analytics::classes::extract_dotted_class_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c825d0ccede2b4f72b95d6b51f4f30acc35bb25fd9f199e37c3e20d46f4c16f3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens (cognitive 18): fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (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":"crates/engine/src/health/css_analytics/theme_tokens.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb2b310361f33731a3451dca974f10136f2ebf32dcec81d55b3f1461cc07370"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::findings::collect_findings_with_resolver (cognitive 18): fallow_engine::health::findings::collect_findings_with_resolver has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 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":"crates/engine/src/health/findings.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a236f91d3f2ebc67287509a792e9ce522d50c06765e1a967ea2f1afb4465cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::large_functions::collect_large_functions (cognitive 18): fallow_engine::health::large_functions::collect_large_functions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/engine/src/health/large_functions.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f14ede5db1aad1626f32e25125052b06267c5ed9a9244aa23da4d099ef3e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::module_graph::test_adjacency_for_changed_paths (cognitive 18): fallow_engine::module_graph::test_adjacency_for_changed_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/engine/src/module_graph.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3164796e893dfbe21c3bce904bed49e298323afa46010621f9f6c463e337a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::trace_chain_impl::walk_callers_recursive (cognitive 18): fallow_engine::trace_chain_impl::walk_callers_recursive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/trace_chain_impl.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49f744c428aa1f72cfdd428265aad321bddd15a902d0380d9c1e61333de7b39"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::viz::build_files (cognitive 18): fallow_engine::viz::build_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 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":"crates/engine/src/viz.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01cc2ad566dfbc4848fa9dddc008f3322059620ac836485412391d3f2a780c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_subclass_member_access (cognitive 18): ModuleInfoExtractor::record_subclass_member_access has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b5d1545c09af3e9f91789667d8e9cd40b4397095a085b73aa0a35181bcee0d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::visit_tagged_template_expression (cognitive 18): ModuleInfoExtractor::visit_tagged_template_expression has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":5393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fca961c0e5e58f5e2a7c66c07c4d771550c37eb2e080b8570341259a2e6a24"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::prepare_callback_property_observations (cognitive 18): ModuleInfoExtractor::prepare_callback_property_observations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_callback_properties.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d332bfd0d4ef81060e4b854e1d963bc6b5d575b16fa02c98be7ac28cf08bcfd"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::factory_property_value (cognitive 18): ModuleInfoExtractor::factory_property_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_factory_properties.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eee504b8aeeb320ef8ec81b5e5bae05035d80316f02ef6f374ec2f0e4406c00"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_projection_contract (cognitive 18): ModuleInfoExtractor::record_projection_contract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeaed09c15b958a7e45d636a8a4467e56df0084bb2d0e56d874e479e98beed9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_projected_value_at (cognitive 18): ModuleInfoExtractor::resolve_projected_value_at has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49d02b15dc868766d1065f911b03695ac7169a5c04884fafafecee52971367c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::dom_classes::classify_value (cognitive 18): fallow_extract::dom_classes::classify_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 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":"crates/extract/src/dom_classes.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe4586730587b352f292fcdfd880248d46bfddfaa1a30ea95464a7c6a174690"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::helpers::apply_decorator_property (cognitive 18): fallow_extract::visitor::helpers::apply_decorator_property has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"754a602aed773dc7b61809b8b850ea5fa5602a457b54ba707cdf3636a9b9d878"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraph::effective_re_export_routes (cognitive 18): ModuleGraph::effective_re_export_routes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/effective_re_exports.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d2b98ec701f37b417b5be83e259b315ee3198d5f67f3650a0dd7989cb98180"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasChain::build (cognitive 18): AliasChain::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 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":"crates/graph/src/graph/namespace_aliases.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8993e1934c6625ff52db8e7fb95e9b374f1b1d8dabb55d9a18f8642c0e84724"}},{"ruleId":"D2","level":"warning","message":{"text":"ExposedNameSearch::build (cognitive 18): ExposedNameSearch::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 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":"crates/graph/src/graph/re_exports/mod.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29cb4bbcf48db0598c7b5fcb68c1455267a9cf362864040844ff3c9338ccb16"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::narrowing::narrow_namespace_references (cognitive 18): fallow_graph::graph::narrowing::narrow_namespace_references has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, 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":"crates/graph/src/graph/narrowing.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f4d340fec68f68b007e1a77f69fb094d42d402a4f1a181584c2b901ef6e941"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::fallbacks::try_source_subpath (cognitive 18): fallow_graph::resolve::fallbacks::try_source_subpath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"8194e4d460e71cdbcf9adb39bd116bf82bb0ccef9e06fff04299e62fad9a1ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::specifier::try_tsconfig_alias_sass_target (cognitive 18): fallow_graph::resolve::specifier::try_tsconfig_alias_sass_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"646bba9506598516be4e71283eec19855d602bc3e843d8ad4123141459879d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_mcp::tools::code_mode_subprocess::run_fallow_sync (cognitive 18): fallow_mcp::tools::code_mode_subprocess::run_fallow_sync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 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":"crates/mcp/src/tools/code_mode_subprocess.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"618167d7b82316e9e7dd024c7a7ede196ab5c988b51a9de7e78ea1eed9a7225f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_mutation::regex::edits (cognitive 18): fallow_mutation::regex::edits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, match/switch 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":"crates/mutation/src/regex.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89fc30c3f6df0f228f1667a6b2082419577fbb234054172a098cd21b005e1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"public-config-corpus.strip_jsonc_trailing_commas (cognitive 18): public-config-corpus.strip_jsonc_trailing_commas 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":"scripts/public-config-corpus.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"13899f7926ec59ec45a5475d28df357d8c5a508490522bc31e9231ff160b54b6"}},{"ruleId":"D2","level":"warning","message":{"text":"statusBar-utils.buildStatusBarTooltipMarkdown (cognitive 18): statusBar-utils.buildStatusBarTooltipMarkdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (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":"editors/vscode/src/statusBar-utils.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc64d9ff84edd13aada3253e8caa0a0ad098515ac89690bde1bf621d3afcefa3"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.runWorkspaces (cognitive 18): commands.runWorkspaces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (2 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":"editors/vscode/src/commands.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cf610276643bcc9825ada5465c67a453963da03a66fc07dbd0ec0fa9d17bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-producer-conformance.loadCensusUnits (cognitive 18): coverage-producer-conformance.loadCensusUnits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 246). 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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd6c9119933e23e5c5fe58944b371097e06eabcd03a4ef551df5b879d18706a"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-release-ci.verifyReleaseCi (cognitive 18): verify-release-ci.verifyReleaseCi has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). 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":"scripts/verify-release-ci.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"20293e12d9e9818b14971cd1dbb0e23671fdabbf68291b8eed19fe4cf5692c09"}},{"ruleId":"D2","level":"warning","message":{"text":"interact.graphHoverTarget (cognitive 18): interact.graphHoverTarget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 2 (3 pts) (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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd1d075724bc89ff802361484c231adeab8cd06c847d0d3e336c66594d72c21"}},{"ruleId":"D2","level":"warning","message":{"text":"main.init::selectFile (cognitive 18): main.init::selectFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (4 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. This shape REPEATS in the file: one other method here (main.init::handleGraphHover) 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":"viz-frontend/src/main.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea33d03a9013538a8f2482d5c1953e6a5da085394b400796a4b5c19be94e02eb"}},{"ruleId":"D2","level":"warning","message":{"text":"contractRelationsFor (cognitive 18): contractRelationsFor has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (4 pts), ternaries 1 (4 pts), boolean chains 2, other 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":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c3cfdea1113f72d92dd8eb39becc006aedfd7d3b2ebb596c71b4019f0982a7"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::mutation::report::completion (cognitive 17): fallow_api::mutation::report::completion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/report.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d8a4694cb1d2b8630c1f2582e53c68e22b53839449d31db7ea22a07bc8cb46"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::type_aware::client::validate_response (cognitive 17): fallow_api::type_aware::client::validate_response has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, 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":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5465adc85004ba2f8227964916ed84c9176de9e9c0a1208c583fc0b68f625e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::audit_cache_prune::print_prune_human (cognitive 17): fallow_cli::audit_cache_prune::print_prune_human has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 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, 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":"crates/cli/src/audit_cache_prune.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0414543ea3bfd26942e111b0314683f5b1e21043c43fd904438b68614ed8ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::impact::classify_file_disappearances (cognitive 17): fallow_cli::impact::classify_file_disappearances has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ef842a9248e4c76314d5dd4a5e5c5941171afd9698b627b4e7658a909bd9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::mutation_human::render_footer_lines (cognitive 17): fallow_cli::mutation_human::render_footer_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 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":"crates/cli/src/mutation_human.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"045750bd630592ebf32542e2b6d14b176f14359a51873a3bdfccfa4a2ca71740"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::github_summary::render_health_with_runtime (cognitive 17): fallow_cli::report::github_summary::render_health_with_runtime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19004cdd7c26d556e51350a1040b06799320ef33c47a4eaebe1b90f0a34bc96"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::setup_hooks::upsert_managed_block (cognitive 17): fallow_cli::setup_hooks::upsert_managed_block has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/setup_hooks.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d760c60e6bbcaae1329acdb0d8b89e8c224b7c465608b315f392b96f2c83a758"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::watch::handle_root_lifecycle (cognitive 17): fallow_cli::watch::handle_root_lifecycle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/cli/src/watch.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e94b9bd68a80adea7dbe1dcf5f40816412426b41b2e2adeaf792965bc1871"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_config::config::boundaries::expand_rules_for_groups (cognitive 17): fallow_config::config::boundaries::expand_rules_for_groups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/config/src/config/boundaries.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"67996648a3a63023879e894b0daaeec049dd0b4e251051272ece14cb22027e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_config::extglob::rewrite (cognitive 17): fallow_config::extglob::rewrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 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":"crates/config/src/extglob.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1ddf6dd19249033536a3aac4c9114ad9d4b6a02e2d5b535dabbc892412eec9"}},{"ruleId":"D2","level":"warning","message":{"text":"AngularTemplateRefContext::propagate (cognitive 17): AngularTemplateRefContext::propagate has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (6 pts), boolean chains 1 (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":"crates/core/src/analyze/members/heritage.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc7b7b727c86d779666a6d30b08ec16d443ee7bee583b8b6e037d6002ec2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildResolver::new (cognitive 17): ChildResolver::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"crates/core/src/analyze/react_resolve.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6573583d4bd2c6a349672998efa21a9bd3bf0ab6593accd051a1589d1599c08"}},{"ruleId":"D2","level":"warning","message":{"text":"RouterPluginCallCollector::visit_variable_declaration (cognitive 17): RouterPluginCallCollector::visit_variable_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 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":"crates/core/src/plugins/tanstack_router.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"044d140f5c98efeb2465c5b45daae31d397ab2d8bee741184b110f22502f683d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::absent_component_prop::block_public_and_entries (cognitive 17): fallow_core::analyze::absent_component_prop::block_public_and_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (7 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":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c00f99330070e2b46734c0a4b4751af9d65d5d05820388846548843f237c8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::feature_flags::correlate_with_dead_code (cognitive 17): fallow_core::analyze::feature_flags::correlate_with_dead_code has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 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":"crates/core/src/analyze/feature_flags.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab0c47bf2d83d6ba0645ec589454f114b9f369836f95d635f0d373d32a491d0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::typed_property::typed_property_terminals (cognitive 17): fallow_core::analyze::members::typed_property::typed_property_terminals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 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":"crates/core/src/analyze/members/typed_property.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c738b5bea98253f2aac0601173f3461ada932f248a38a64f0b8ab0996efbb0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::policy::collect_banned_exports (cognitive 17): fallow_core::analyze::policy::collect_banned_exports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/policy/mod.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5058fe31da5c45040b69cde51fc25448600d32eedd7ec70f32e759c1c59a421"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::unused_exports::collect_dynamic_reexport_sources (cognitive 17): fallow_core::analyze::unused_exports::collect_dynamic_reexport_sources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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":"crates/core/src/analyze/unused_exports.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c483bdacc7a8b4a7e16146e6324e92ee826b77b719b1c753fb421b327f7510a5"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::unused_overrides::collect_dependency_map_names (cognitive 17): fallow_core::analyze::unused_overrides::collect_dependency_map_names has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). 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":"crates/core/src/analyze/unused_overrides.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"662918a431d09a5b7c0cabc5a5459ab1b35283db485de3464c5cf199e330d55f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::discover::infrastructure::extract_fly_toml_file_refs (cognitive 17): fallow_core::discover::infrastructure::extract_fly_toml_file_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"crates/core/src/discover/infrastructure.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e72e13f343a584302e1b8e509879d7cc2f1347bc05a3b4b05d6ae73da16f36c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::nuxt::nested_surface_overrides (cognitive 17): fallow_core::plugins::nuxt::nested_surface_overrides has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"31442ecf702732836d3ac20b6d618ddb58325e19b9a58b1e14981239313f1a69"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::vitest::add_vitest_project_config_files (cognitive 17): fallow_core::plugins::vitest::add_vitest_project_config_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/vitest/mod.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"6795f125650bba023438705a122329bb8008b81ef4b469073524951556825c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::accumulate_parsed_commands (cognitive 17): fallow_core::scripts::accumulate_parsed_commands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb45ccbebbf5a5d289444400588be7588ff91adf5d6d5203d96fb2080b84b7f4"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::skip_pnpm_flags (cognitive 17): fallow_core::scripts::skip_pnpm_flags has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc82eeedd8678669a8d27ab78cd62f2ed190e6d76d6c9e4c3f54c715ecff91"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::ci::rewrite_anchors (cognitive 17): fallow_core::scripts::ci::rewrite_anchors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 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":"crates/core/src/scripts/ci.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c976189af8546c9d14a010d90b35425cb8d4f6310735951076f8de44753921ad"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::scripts::shell::decode_shell_word (cognitive 17): fallow_core::scripts::shell::decode_shell_word has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dc4220364dd587931513031118b9dbc6b0d3ba75a65af3044c066d9d0f9f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"ThresholdOverrideStateTracker::record_complexity (cognitive 17): ThresholdOverrideStateTracker::record_complexity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, 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":"crates/engine/src/health/threshold_overrides.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f684e83c0c39a68186bf1e4e5b3c2cc2af524bce553419c02dbd3dee93547a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::baseline::moved_identity_bucket_remaps (cognitive 17): fallow_engine::baseline::moved_identity_bucket_remaps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 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":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":2928}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb4b0a014a3b32314e4a027ad14d8002b3bc46d4992fc1baddeffe965e5a59e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::dead_code::input_files_digest (cognitive 17): fallow_engine::dead_code::input_files_digest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/engine/src/dead_code.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acee1365db242e1b94e77af035421d373dfac6add5dbbcd1592ffc9d8442814"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::classes::collect_css_module_properties (cognitive 17): fallow_engine::health::css_analytics::classes::collect_css_module_properties has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe76bbfe1fac9541bb9b19748a067f6ddb3196a18604439b7dfd0058d407ab15"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::inline::inline_complexity (cognitive 17): fallow_engine::health::inline::inline_complexity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/inline.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ee24461f9b946fbacf6103bbd5716afae744e6f71a4415c7e749d08339265b"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractCollector::collect_shapes (cognitive 17): ContractCollector::collect_shapes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a810b42dfc73e8494e51350665cf742bd8e7702ae476cc7f7aacee3a45861d"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchedBindingCollector::build_import_map (cognitive 17): BatchedBindingCollector::build_import_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53276627aac2a9f368d3813ac29b64a8cb24ea50e108aed1a3004de9ea4025"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateScanner::scan_attributes (cognitive 17): TemplateScanner::scan_attributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (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":"crates/extract/src/template_complexity/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ca50afe3894be4283505c35c540aa846d19689dab2053467df8b469160f490"}},{"ruleId":"D2","level":"warning","message":{"text":"VueScanner::scan_attributes (cognitive 17): VueScanner::scan_attributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (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":"crates/extract/src/template_complexity/vue.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e15b0157505cb30a35b68d24e7338778cd42154f2f8ac1071522d4194e1c3b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::extract_declaration_exports (cognitive 17): ModuleInfoExtractor::extract_declaration_exports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, 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":"crates/extract/src/visitor/declarations.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0545e534739801d1278294472666e640de969892f8a56741e31289a84b976a47"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::collect_namespace_object_aliases (cognitive 17): ModuleInfoExtractor::collect_namespace_object_aliases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":3639}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eacf7c97f82c60f96fb22c112e565a28adace66fd517112030d95ec7ac2e98a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_top_level_class_declaration (cognitive 17): ModuleInfoExtractor::record_top_level_class_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d54d629c453ca41bb9bc7044f9d86bb175df9775a68c9601e89732ce5195b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_variable_declarator (cognitive 17): ModuleInfoExtractor::record_variable_declarator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a266f94c899900592578913ff256450e8022e42b14e8df38e06b52661a5331b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::visit_unary_expression (cognitive 17): ModuleInfoExtractor::visit_unary_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (6 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":5004}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1dcdd678946406980c86dba1f2554bae1300108642c58f900c58ea4013fe65"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::classify_di_call_site (cognitive 17): ModuleInfoExtractor::classify_di_call_site has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), match/switch 1 (nesting depth added 1). 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":"crates/extract/src/visitor/visit_impl_di.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e092d667096fa5358e617ed9c5b8361aa3dcdc73a1a82741f0ea71ad0029f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_direct_object_binding_path_barrier (cognitive 17): ModuleInfoExtractor::record_direct_object_binding_path_barrier has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f5a6aa8a45213034191ee5ba068a80bd0f4ca144d43fd8c2fc0f5e469656b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::collect_pick_member_accesses (cognitive 17): ModuleInfoExtractor::collect_pick_member_accesses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1, 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":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"19351a0beac98457c0047d7e08fae266a8b39eb7d5d3811d4412ad1bb95fb3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css_in_js::tokens::collect_stylex_token_object (cognitive 17): fallow_extract::css_in_js::tokens::collect_stylex_token_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab82b7856f47302133302fcc7d141e49bd11e5909b94da7998850f7837206a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::css_metrics::walk_rules (cognitive 17): fallow_extract::css_metrics::walk_rules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_metrics.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d1c23400499693e86dcfd0cf8c4b3116cb71651be786339b00ef3b5f0fda80"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::federation_runtime::registered_remotes (cognitive 17): fallow_extract::federation_runtime::registered_remotes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"crates/extract/src/federation_runtime.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aa46e00ddb061ffae1484185f6a5c263df359bb4755cdb741c2e03d6115727"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::find_options_object (cognitive 17): fallow_extract::sfc_props::find_options_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9886b865a6ede4fbcae9b7350d68c2cc2756a9a23fc28b3e0aad5c079f97b6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::collect_options_prop_names (cognitive 17): fallow_extract::sfc_props::collect_options_prop_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 2 (4 pts) (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. This shape REPEATS in the file: one other method here (fallow_extract::sfc_props::collect_options_emit_names) 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a67bb6b0ebeb942e2d71261891c22c0964056bb139b5cde8b77d19abbf8311"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::collect_options_emit_names (cognitive 17): fallow_extract::sfc_props::collect_options_emit_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 2 (4 pts) (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. This shape REPEATS in the file: one other method here (fallow_extract::sfc_props::collect_options_prop_names) 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a92f8e4e64ae4396d32a2d4be748e557e06547b036d899fe18f53b548198e83"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::component_contracts::attribute_supply (cognitive 17): fallow_extract::sfc_template::component_contracts::attribute_supply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efeebc014e79b0dce17e2d9d13b7cc7b23dd0940db2a09358a2c5d34e24a80b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::vue::scan_template_body (cognitive 17): fallow_extract::sfc_template::vue::scan_template_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_template/vue.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"318f751fab03253fca89988090c4ae70002fcd32a9006f24ccbc990880f8e30d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::template_complexity::engine::find_top_level_ternary (cognitive 17): fallow_extract::template_complexity::engine::find_top_level_ternary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1027879cc9d61e6b1fc9c0ad656a2c1194040544c66b16b4515c3653ef0e94ca"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::template_expression_scan::scan_template_usage (cognitive 17): fallow_extract::template_expression_scan::scan_template_usage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 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":"crates/extract/src/template_expression_scan.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a14b5b9c103409b9c7e8d36b42ea4cb3a7308a26c71d732a7064660ee1d1e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_pinia::setup_store_members_read_in_body (cognitive 17): fallow_extract::visitor::visit_impl_pinia::setup_store_members_read_in_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_pinia.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9437963413e5578dae5554dcd4b7d5c6c0e4c2b97cc60d72fb4ff3e6358a19"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_security_classifiers::regex_branch_tokens (cognitive 17): fallow_extract::visitor::visit_impl_security_classifiers::regex_branch_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_security_classifiers.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecc0bb0af9fc098e14b360ed4d3bde8b438c0928ff991a10d385eeb348dc8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_security_sinks::should_capture_literal_sink_value (cognitive 17): fallow_extract::visitor::visit_impl_security_sinks::should_capture_literal_sink_value has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, match/switch 3 (5 pts) (nesting depth added 2). 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":"crates/extract/src/visitor/visit_impl_security_sinks.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee3a5a5752fc8caeaaa5148ed8a5be8ef9a0e7d2a4bd140aec6e0b299d6b91e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_signature::collect_local_callables (cognitive 17): fallow_extract::visitor::visit_impl_signature::collect_local_callables has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"b024ea9d613a11f8fc9e39c30bc30607780cd0ce65c865638f5484756b77133a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraph::collect_exposed_namespace_targets (cognitive 17): ModuleGraph::collect_exposed_namespace_targets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), 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":"crates/graph/src/graph/re_exports/mod.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"96751bd7e0434672e0283c43418ab9252d6dea2de64931e42ff58bd8df40276c"}},{"ruleId":"D2","level":"warning","message":{"text":"TestReachabilityIndex::covers_reference_path (cognitive 17): TestReachabilityIndex::covers_reference_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 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":"crates/graph/src/graph/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"20238ba42d2b96471dcf06f5819c9783d1421318a3b4605d5ed315ef791b9ba9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::effective_re_exports::effective_declaration_route (cognitive 17): fallow_graph::graph::effective_re_exports::effective_declaration_route has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), 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":"crates/graph/src/graph/effective_re_exports.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e7a386fa48a21149566d9cd83ef6a1cb2a9e228c93eca25fdf58f16dd9baa6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::narrowing::attach_direct_export_references (cognitive 17): fallow_graph::graph::narrowing::attach_direct_export_references has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"crates/graph/src/graph/narrowing.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"067d946a94ed8cc768042155b3828ea08503cfcd96d0bdaeab118a8c16de9d71"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::auto_imports::forwarded_reads (cognitive 17): fallow_graph::resolve::auto_imports::forwarded_reads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 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":"crates/graph/src/resolve/auto_imports.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"25975f379948fe42a797262e36d4ce147303e556a3491e47b8c2eaeac4745692"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::specifier::try_tsconfig_alias_target (cognitive 17): fallow_graph::resolve::specifier::try_tsconfig_alias_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ada44a9bf35a9d59cc3db333ed6ee99bdef5659b5260c9f66c89d75e569abc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_similar_code_sidecar::protocol::read_bounded_line (cognitive 17): fallow_similar_code_sidecar::protocol::read_bounded_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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":"tools/similar-code-sidecar/src/protocol.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c32aa7ada730d791c5579ad22999daea9c0afb1c7382fc6e7b34091968d532"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-installed.superviseVerification (cognitive 17): verify-installed.superviseVerification has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (terminate, handler, a function literal at line 94, \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":"action/scripts/verify-installed.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f74d142abc348378390bd1cd6a09539dd17c2f033f3e48d2a33eb94ffb3320"}},{"ruleId":"D2","level":"warning","message":{"text":"binary-utils.platformPackageNames (cognitive 17): binary-utils.platformPackageNames has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/binary-utils.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54ff310373248d36b329bc48f056c4bb1ec1db6babc7d41f6127dbc9e28c91e"}},{"ruleId":"D2","level":"warning","message":{"text":"binary-utils.findBinaryInPath (cognitive 17): binary-utils.findBinaryInPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 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":"editors/vscode/src/binary-utils.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3a0927adc982a3a6e98e4845f6a228c22b643716424cfe928ad2087d616be8"}},{"ruleId":"D2","level":"warning","message":{"text":"interact.shortestPath::bfs (cognitive 17): interact.shortestPath::bfs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"08376493ba2fae0f3eb04ccbc9de77caaffd7a1dcefdc047782c3b309f168536"}},{"ruleId":"D2","level":"warning","message":{"text":"treemap.layoutStrip (cognitive 17): treemap.layoutStrip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (4 pts), boolean chains 2, loops 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fac653b40701a4fa7fbc00446df877c8f6eb630c3f9ed164a28d10fa54da0c"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.renderFindingList (cognitive 17): panel.renderFindingList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). Of this number, 10 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":"viz-frontend/src/panel.ts"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0c209a7b708fec4d659189c2fd182cfbae375e60a3765890946014892249f8"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::audit_run::attribute (cognitive 16): fallow_api::audit_run::attribute 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":"crates/api/src/audit_run/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd7d40f30fbe2f771d39a2513c01eca9a638eb66e29e54936a6b38e768b5a60"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::diff_risk::read_files (cognitive 16): fallow_api::diff_risk::read_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 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":"crates/api/src/diff_risk/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa3a9bc2a022cdc931a66b2cd3631ae76211613c9a4ec7c0c97f3b964aad89"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::doctor::canonicalize_with_missing_suffix (cognitive 16): fallow_api::doctor::canonicalize_with_missing_suffix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/doctor.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030970654d8bf977333c238f0360a8b490688422c11e640fe71a91d089bd76a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::mutation::transport::read_lines (cognitive 16): fallow_api::mutation::transport::read_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), match/switch 2 (5 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":"crates/api/src/mutation/transport.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9803fb92eed09ad38e9e8babbd88b52468e4936fb2e11beb0cfb6aba8c921abf"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_api::similar_code::cache::decode_cache (cognitive 16): fallow_api::similar_code::cache::decode_cache 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/similar_code/cache.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75db01d31dc51ac6fafbbd7400a4ac2a36c7b440a544799727a2534c1b1c1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::audit_brief::test_reach_lines (cognitive 16): fallow_cli::audit_brief::test_reach_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit_brief.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd74034b3b19aa01d39567964892df211c69fdfc0d712a3bd4d5b607ccc4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::audit_cache_prune::entry_row (cognitive 16): fallow_cli::audit_cache_prune::entry_row has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 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":"crates/cli/src/audit_cache_prune.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a948ec2bd4c3a897bc72bf4e1d1ab110b9e542c54d085efabb34f5a88c9d06"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::bin::stub_sidecar::emit_findings_from_static_response (cognitive 16): fallow_cli::bin::stub_sidecar::emit_findings_from_static_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), 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":"crates/cli/src/bin/stub_sidecar.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a260a5a9479f0db9b859feb16b4e71a88ac4eebdedb96889d0d88694f2582ec"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::fix::run_analyze (cognitive 16): fallow_cli::fix::run_analyze has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 1 (4 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":"crates/cli/src/fix/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b39b9b4fdf4bf77fa3a47ad71d2864ce879c39c469f7c146993f0bb2c8ab16"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::fix::enum_helpers::find_enum_declaration_range (cognitive 16): fallow_cli::fix::enum_helpers::find_enum_declaration_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), match/switch 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":"crates/cli/src/fix/enum_helpers.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bba9cea20ef47bc66394fb85a4edf5239147a14816c6635db504c6daea1c466"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::list::print_list_human (cognitive 16): fallow_cli::list::print_list_human has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 3 (6 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":"crates/cli/src/list.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"50673f25a806ddb64c245a911771eaeffc285061f67d129a4c69af5d13ed3dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::mutation_human::render_status_lines (cognitive 16): fallow_cli::mutation_human::render_status_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 2, match/switch 1 (2 pts) (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":"crates/cli/src/mutation_human.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab572334cbc0e2db7c9c0053380f36502cd5e8923bce1b34449d169b081a447"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::github_summary::render_fix_summary (cognitive 16): fallow_cli::report::github_summary::render_fix_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":3011}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb64a4a081daab7b4334f848d3afff22f59e6859db19bc8838598d9987e35070"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::report::human::health_hotspots::render_ownership_line (cognitive 16): fallow_cli::report::human::health_hotspots::render_ownership_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (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":"crates/cli/src/report/human/health_hotspots.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf8882ca557f133158a360579ee5fe91e00fa772ac549d0407f162342ac882b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::rule_pack::list::emit_human (cognitive 16): fallow_cli::rule_pack::list::emit_human has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/cli/src/rule_pack/list.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdea74410f33fbbee66fe8c23394bcf9df24f0972ef7092ca3bc12d48c31cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::setup_hooks::strip_fallow_handlers (cognitive 16): fallow_cli::setup_hooks::strip_fallow_handlers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1, match/switch 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":"crates/cli/src/setup_hooks.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dd04bba0d1e562a3a10b9e11c1a7707cdff7e270b29de03783e6c39d4182f6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_cli::similar_code_cli::run (cognitive 16): fallow_cli::similar_code_cli::run has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (7 pts) (nesting depth added 7). 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":"crates/cli/src/similar_code_cli.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"719d321b8801f5c89e7b806ce7ebd309269acd9f8d250ceffeb71205df40552b"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundaryConfig::validate_zone_references (cognitive 16): BoundaryConfig::validate_zone_references has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 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":"crates/config/src/config/boundaries.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c0e4340e893d7ede978d324b2ee1acb815e400a7d2c58fd415c4f24933692f"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_config::workspace::npm_overrides::parse_resolution_key (cognitive 16): fallow_config::workspace::npm_overrides::parse_resolution_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 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":"crates/config/src/workspace/npm_overrides.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4bcde6ed0efec274bb745613a81b92b4d2e279912fbe8f919a4a45297d911"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::collect_aliases (cognitive 16): Context::collect_aliases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 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":"crates/core/src/analyze/effect.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabded56b75e290dc0d5768263d423aa62ee3876530e1ed696f15aa6b8c60b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"AngularTemplateChainContext::propagate (cognitive 16): AngularTemplateChainContext::propagate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/core/src/analyze/members/heritage.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"168ab24b187b32e632d0bf11e0e2abd2f7a816a9032e242ef9b6fb43a31e2717"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::members::heritage::close_downward (cognitive 16): fallow_core::analyze::members::heritage::close_downward has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 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":"crates/core/src/analyze/members/heritage.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee134117031e550ab41fb0fa78b5f2fe182fedd3c299013fd86e1288416bf236"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::react_intel::aggregate_render_edges (cognitive 16): fallow_core::analyze::react_intel::aggregate_render_edges 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":"crates/core/src/analyze/react_intel.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c6d66cfe976ab312cf68e0e3f338fc9f06e090b7094e1d744f7f179cf78ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::analyze::security::tainted_sink::collect_module_tainted_sinks (cognitive 16): fallow_core::analyze::security::tainted_sink::collect_module_tainted_sinks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 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":"crates/core/src/analyze/security/tainted_sink.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac078fa5e8adf69318237fb5d299cf2090c9f89047ac5f2d121ac2ef55bbb9cd"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::discover::entry_points::push_script_entries (cognitive 16): fallow_core::discover::entry_points::push_script_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4224dd8a4b98123160a9724e618a621535b54d6d401b491161ed1b0c6324c95"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::federation_trace_provenance (cognitive 16): fallow_core::plugins::federation_trace_provenance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), match/switch 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":"crates/core/src/plugins/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ddf1d93dcddf82285fbafe78becdc9def3ce54768dcc90f42bc753a2c3d409"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::config_parser::collect_shallow_string_values (cognitive 16): fallow_core::plugins::config_parser::collect_shallow_string_values has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddad91ef89687ca5a84846144de23f834bee8db25e8cc1bc3e3e9e2d2108617d"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_core::plugins::trace_provenance::push_config_export_provenance (cognitive 16): fallow_core::plugins::trace_provenance::push_config_export_provenance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), boolean chains 2, match/switch 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":"crates/core/src/plugins/trace_provenance.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2777a3a0d661de2c6fc5c44c6d25ae1b09840d338d15d9bf34b97c9f082424"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::duplication_detector::near::build_candidates (cognitive 16): fallow_engine::duplication_detector::near::build_candidates 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/duplication_detector/near.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe184e59279e88a7294bc6223be318c12dcb2cab888bbb92b8dd33558eb28ba"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::flag_age::parse_blame_porcelain (cognitive 16): fallow_engine::flag_age::parse_blame_porcelain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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":"crates/engine/src/flag_age.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1381e8f57e7ca8444cd908e2360432587536dc89954dce12cf61f2d32c03818a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::coverage_gaps::scan_runtime_files (cognitive 16): fallow_engine::health::coverage_gaps::scan_runtime_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/engine/src/health/coverage_gaps.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8182c225f378ced12d0acab63c86fe4e1cc71bd4ee266496675daffe2e539cc"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::classes::collect_dynamic_literals (cognitive 16): fallow_engine::health::css_analytics::classes::collect_dynamic_literals 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f4526c918aeee86adb74991ff7e0b358acc827fad1cf5e04e4bb8aa2a61691"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::cva::scan_call_end (cognitive 16): fallow_engine::health::css_analytics::cva::scan_call_end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/engine/src/health/css_analytics/cva.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e49485352dc78e3cd126cab24aea82c432101d26e040fe81e7c40e8bd7b44b"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::near_duplicates::annotate_raw_style_value_nearest_tokens (cognitive 16): fallow_engine::health::css_analytics::near_duplicates::annotate_raw_style_value_nearest_tokens 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/near_duplicates.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"be62490cf782f3ff165710e6cbd5bf9a2c503949dee87c58681db0facbd00b33"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::health::css_analytics::token_consumers::collect_css_in_js_definers (cognitive 16): fallow_engine::health::css_analytics::token_consumers::collect_css_in_js_definers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, 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":"crates/engine/src/health/css_analytics/token_consumers.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb14a95d392e54a997aa2f663cf072a25d8400a6fac62c079a35e0822bc6df6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_engine::trace_impl::consumer_search_checks (cognitive 16): fallow_engine::trace_impl::consumer_search_checks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 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":"crates/engine/src/trace_impl.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad9cd24567d517a5f8001c89522fd915c58b7bb11743e614026c52934b75bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::handle_promise_all_dynamic_imports (cognitive 16): ModuleInfoExtractor::handle_promise_all_dynamic_imports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 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":"crates/extract/src/visitor/declarations.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca9cd6f4c6770d3d55b61756c64488f20e162641851015935df6734fe48cee8"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::resolve_bound_member_accesses (cognitive 16): ModuleInfoExtractor::resolve_bound_member_accesses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (6 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e150e4e786c5b224f0c6b4bb289a75e0ffcf4f32c1af06aeeb804e44a6c210f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_local_function_return_types (cognitive 16): ModuleInfoExtractor::record_local_function_return_types has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 2 (5 pts), if/else 1 (3 pts) (nesting depth added 10). 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"65988b5e332145f9476afed8dedab535962c143d11a9f10e05cdc3117b89524e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_callback_value_assignment (cognitive 16): ModuleInfoExtractor::record_callback_value_assignment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 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":"crates/extract/src/visitor/visit_impl_callback_properties.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0ecd027dccfd981a33cbb397fc2578d3e0771721094c86cde1f28d43758190"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_import_meta_glob_patterns (cognitive 16): ModuleInfoExtractor::record_import_meta_glob_patterns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_dynamic_imports.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fcb783acedeaf9f90ff2fd23b86f30b63dbb8aa22f10e461cfe65cbc17cc41"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_program_component_loader_imports (cognitive 16): ModuleInfoExtractor::record_program_component_loader_imports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (6 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":"crates/extract/src/visitor/visit_impl_dynamic_imports.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f305e8f17f7daf276dea03ec57914858c2daf78c465ae3a30878cffc488c826"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::factory_property_path (cognitive 16): ModuleInfoExtractor::factory_property_path 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":"crates/extract/src/visitor/visit_impl_factory_properties.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cfdc8216d4c7e847b7552f368b1a2407b124f4d4032c803f2089ef4e9d0e11"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_factory_property_declarator (cognitive 16): ModuleInfoExtractor::record_factory_property_declarator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (3 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":"crates/extract/src/visitor/visit_impl_factory_properties.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9560198e9816f54643a55d1cc9e29bb0c894e54efb8fa3281245019f73f08ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::record_direct_object_binding_target_in_scope (cognitive 16): ModuleInfoExtractor::record_direct_object_binding_target_in_scope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 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, 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a437a7188cb2e54d9769fa7576342206bcd839bd64cd73b7ec39a44c9116ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleInfoExtractor::defer_vue_local_array (cognitive 16): ModuleInfoExtractor::defer_vue_local_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7d20e22d9110ce46e330f4771a6edb2e502c9181fd63bc5c90c166ee9c4d74"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::parse_single_file_cached (cognitive 16): fallow_extract::parse_single_file_cached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, match/switch 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":"crates/extract/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe504b948c38a39bdcfc3adafd87199adf332a40e96da53b87f6606085fd39e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::binding_references::collect (cognitive 16): fallow_extract::binding_references::collect 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":"crates/extract/src/binding_references.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ded51fbc26d9ba85ef2bfe8cf922508c8caad03ff392450fa3528a8dec92c6"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::dom_classes::collect_class_keyword_values (cognitive 16): fallow_extract::dom_classes::collect_class_keyword_values has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/dom_classes.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f65ae22c23bfac0744932ba7fd7c14ce9b9b5b5a0fa75d358a7b2c5b8038371"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::parse::scan_jsdoc_namespace_members_in (cognitive 16): fallow_extract::parse::scan_jsdoc_namespace_members_in 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":"crates/extract/src/parse.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"339bd1c58e91adb032aaf1619f2ea420f0f6b89187275f3fe989e3a0d00f699e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc::apply_template_emit_usage (cognitive 16): fallow_extract::sfc::apply_template_emit_usage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"be01055b778bac16a6388e17ef6d13412dbf47d56cea299e5489c3ae8903e41a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_props::scan_astro_props_statement (cognitive 16): fallow_extract::sfc_props::scan_astro_props_statement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (2 pts), match/switch 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"659330c39bd7889ffd79c081023890603a78635cec123ca1f630f33d185cd50a"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::angular::handle_ng_for (cognitive 16): fallow_extract::sfc_template::angular::handle_ng_for has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"7024f905a76b8f1b9dab794d538cafba72dfb8cd53cb9ee8d20dc9a3c2c61ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::sfc_template::glimmer::argument_tokens (cognitive 16): fallow_extract::sfc_template::glimmer::argument_tokens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/extract/src/sfc_template/glimmer.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"7942c4eaf8d1672e6e22ae8998712f2ae5a004d8dd06eb08996af836cd466313"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_factory_returns::object_declarator_init (cognitive 16): fallow_extract::visitor::visit_impl_factory_returns::object_declarator_init 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":"crates/extract/src/visitor/visit_impl_factory_returns.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda2efaab89b71d133b98379c2aa0cd8ea282861bfcf47ba8c3fa3bc54c7e144"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_helpers::find_returned_const_declarator_call (cognitive 16): fallow_extract::visitor::visit_impl_helpers::find_returned_const_declarator_call 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":"crates/extract/src/visitor/visit_impl_helpers.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd72df04068f162c87a6afcfd7d42c16b79660cab3e1512ecbacf42d92807391"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_extract::visitor::visit_impl_security_classifiers::has_unbounded_quantifier (cognitive 16): fallow_extract::visitor::visit_impl_security_classifiers::has_unbounded_quantifier 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":"crates/extract/src/visitor/visit_impl_security_classifiers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"debff9ef242a52fbd0f446ff272a7e89d8b11e92578328302f7f16ea3fafa20f"}},{"ruleId":"D2","level":"warning","message":{"text":"EagerSubgraph::new (cognitive 16): EagerSubgraph::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 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":"crates/graph/src/graph/entry_load.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e737e922a0d31e8415f252a37d34a1f50bea9c30d5e1cfd0a417c9ba396c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraph::star_contributor_bindings (cognitive 16): ModuleGraph::star_contributor_bindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 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":"crates/graph/src/graph/ambiguity.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e97855cfc902df1903136f9c7950ce8a3375773be6fc233b5ce08baf662f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::graph::effective_exports::register_named_observer (cognitive 16): fallow_graph::graph::effective_exports::register_named_observer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), 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":"crates/graph/src/graph/effective_exports.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f80478cc4ac6a16333369fa3ea2aa615a62188a957e888b4ea67b9c77582ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::specifier::try_nearest_tsconfig_path_alias (cognitive 16): fallow_graph::resolve::specifier::try_nearest_tsconfig_path_alias has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"111a9026779320f6cb6b27fc4e10815b0c840e75fc0db66d48af907743868c34"}},{"ruleId":"D2","level":"warning","message":{"text":"fallow_graph::resolve::specifier::try_tsconfig_paths_from_config (cognitive 16): fallow_graph::resolve::specifier::try_tsconfig_paths_from_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfe4f956403a58bf9bd800e0059962bc94536b384356972dfe6801fb00571eb"}},{"ruleId":"D2","level":"warning","message":{"text":"check_telemetry_doc_sync.main (cognitive 16): check_telemetry_doc_sync.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_telemetry_doc_sync.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b267f793976746a03effc2e8b453c6315c7bec2ad088e3964b609bf1c7f7a9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"public-config-corpus.extract_toml_comments (cognitive 16): public-config-corpus.extract_toml_comments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 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":"scripts/public-config-corpus.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2082ed05ed1c626821fdcaddc7d525d09afc012832718fc2385cc0c8af0bfd8"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis-utils.buildAnalysisArgs (cognitive 16): analysis-utils.buildAnalysisArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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":"editors/vscode/src/analysis-utils.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"635a13dcc2043c6c67564d4399196ee11a0193ddc51ccf9043ece860f0bb71f6"}},{"ruleId":"D2","level":"warning","message":{"text":"download.retryReleaseDownload (cognitive 16): download.retryReleaseDownload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), error handling 2 (nesting depth added 5). Of this number, 11 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":"editors/vscode/src/download.ts"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde166be2f7467584907e603c3de2cd0c84d2595440e807797381ab3a347704"}},{"ruleId":"D2","level":"warning","message":{"text":"check-comment-quality.multilineOpener (cognitive 16): check-comment-quality.multilineOpener 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-comment-quality.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"effeb80e94c2e5e83bcd5ca7b611b18a2e01f4c782469d962901901b26bb487d"}},{"ruleId":"D2","level":"warning","message":{"text":"check-comment-quality.maskMultilineStrings (cognitive 16): check-comment-quality.maskMultilineStrings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (5 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":"scripts/check-comment-quality.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"75118327cf48cddee6486ae5d3ce1401c9e2e41988941dac5a8e3ddd1d6e6205"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-metrics.parseArguments (cognitive 16): ci-metrics.parseArguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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":"scripts/ci-metrics.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b088188516cb21a82d8049a5a512e0d09693aacab0e06b2824ecec5ecca062"}},{"ruleId":"D2","level":"warning","message":{"text":"select-heavy-runner.trustedWorkflow (cognitive 16): select-heavy-runner.trustedWorkflow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (6 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":"scripts/select-heavy-runner.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"da95aff56db2ba27164cced32302bedce0778d2ee610c0c35433c13a9576e4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"styling-corpus-smoke.collectObjectArrayEntries::visit (cognitive 16): styling-corpus-smoke.collectObjectArrayEntries::visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 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":"scripts/styling-corpus-smoke.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb363312f11f32409c39aaa4b24220d69577d87644e03f3c09e85072ceb189a"}},{"ruleId":"D2","level":"warning","message":{"text":"build.directoryCluster::split (cognitive 16): build.directoryCluster::split has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/graph/build.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8245526036e34621540e294e38a1d9e5458febbb98cd85fc12b422e6d66906"}},{"ruleId":"D2","level":"warning","message":{"text":"build.orderWithinLayers (cognitive 16): build.orderWithinLayers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 4 (5 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (sweep, a function literal at line 375, a function literal at line 354, \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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2e8fd48781d3cd343981eb04daa12342551ec66dc052e2e3a89f5e482b81bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleInfoExtractor: TooManyMethods \u2014 718 methods, declared across 33 files: visitor/visit_impl.rs (123), visitor/mod.rs (94), visitor/visit_impl_object_bindings.rs (65), visitor/visit_impl_scope_bindings.rs (38), \u002B29 more file(s). The bar is 30 methods; this is 688 over it, 23.93\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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe7a4ff583f93659b9a6f1d5f69467420ed181289fa2cd65fa2fc4a1c1d65a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ModuleInfoExtractor: TooManyFields \u2014 244 stored fields beside 718 methods. The bar is 30 stored fields; this is 214 over it, 8.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f684c09fcf1faa22136bd57ca4284312771140b6a977e709601b39ee35191ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl.rs: FileTooLong \u2014 3949 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 86% of them inside a single declaration: ModuleInfoExtractor (5 blocks, 184-6324), declaring 46 free functions. The bar is 500 significant lines; this is 3449 over it, 7.90\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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f3f5d61010c4740b2d86d7dd611258744afe72c5caa516f410ed251a73c84e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: human/check.rs: FileTooLong \u2014 3252 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 150 free functions. The bar is 500 significant lines; this is 2752 over it, 6.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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0468a7f7a6522b9db9c8135d78fca1d6cc04dbd404bfd7c7a812975cfb502ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/mod.rs: FileTooLong \u2014 2711 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 73% of them inside a single declaration: ModuleInfoExtractor (2 blocks, 620-4053). The bar is 500 significant lines; this is 2211 over it, 5.42\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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6851774068e9dffc4194152d84cb780d5ac63e113ac0c0b93626d15f1143715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dispatch.rs: FileTooLong \u2014 2685 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 87 free functions. The bar is 500 significant lines; this is 2185 over it, 5.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":"crates/cli/src/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"514e2ff0a2ad250b12b074f1ee94ee29057e96daa26b107751e651d0807a7229"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/github_summary.rs: FileTooLong \u2014 2525 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 107 free functions. The bar is 500 significant lines; this is 2025 over it, 5.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d798793cd587cf64e1d26e64b6e68c64c7e28cc5ccec6670dee551613b8fc1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_in_js/tokens.rs: FileTooLong \u2014 2516 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 66 free functions. The bar is 500 significant lines; this is 2016 over it, 5.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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50c017b3dc53d76d07a645539c15fd6f8968856380ee3e7be86ceb629aafaf6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleInfoExtractor: ClassTooLong \u2014 1978 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), 718 methods, 2 blocks, lines 620-4053. The bar is 400 significant lines; this is 1578 over it, 4.95\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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"29058118f5708fd52ca889311b785d97541cc48f36bc8d5377d15bbe83ab7517"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2338 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 89 free functions. The bar is 500 significant lines; this is 1838 over it, 4.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":"crates/core/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82170d0694b9c5b3404e829866b3358e7c9e63439f22d7db6738aabf60cf2e07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/output_dead_code.rs: FileTooLong \u2014 2327 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 1827 over it, 4.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/output_dead_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a362ae308a0c8c339ef6da31a7bfad5afff561bdde5e499f59be659d63cbeee6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/results.rs: FileTooLong \u2014 2312 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 1812 over it, 4.62\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":"crates/types/src/results.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a992715098f00b1f74a0bbc57df01a45098bbfe44f1b7105062b53f6dc042"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/security.rs: FileTooLong \u2014 2269 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 132 free functions. The bar is 500 significant lines; this is 1769 over it, 4.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/security.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"615da52aabc86885bc2832d6885c7be5424f53a819c74c762c6ff208763235b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/markdown_output.rs: FileTooLong \u2014 2226 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 113 free functions. The bar is 500 significant lines; this is 1726 over it, 4.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/markdown_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0f0dbe13d2b94e151215cd4af8f63d566264257da60ece4eaa6bb6443d557e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/type-aware-corpus.mjs: FileTooLong \u2014 2182 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1682 over it, 4.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":"scripts/type-aware-corpus.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"865e2660e25527fde35fcf9108caa202724937ddf8480ebf999205c681813ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: human/health.rs: FileTooLong \u2014 2108 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 113 free functions. The bar is 500 significant lines; this is 1608 over it, 4.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/human/health.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd1d7a35db419e13a60241d7f23028460f91fbba1948ec32428cee7f0827894"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audit.rs: FileTooLong \u2014 2050 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 63 free functions. The bar is 500 significant lines; this is 1550 over it, 4.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874f861f8fa67503561eefaf0df56f66b8ca59810f2b39405327d4067a551c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: health/scoring.rs: FileTooLong \u2014 2040 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 71 free functions. The bar is 500 significant lines; this is 1540 over it, 4.08\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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad15b76087aa9db5eeea07d2fa78aa43d4375cd3b48c423686a7cf0092d7662"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/panel.ts: FileTooLong \u2014 2006 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1506 over it, 4.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":"viz-frontend/src/panel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"336d0f602cac5fc801e9e6f8001a779af80d046f0491e8409880ceee2dec58a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/mod.rs: FileTooLong \u2014 1933 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 57 free functions. The bar is 500 significant lines; this is 1433 over it, 3.87\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":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28693bc66093cd543306dc6d36247764eb41112bf5e696b4cd703ae98ec19d8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extract.rs: FileTooLong \u2014 1923 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 1423 over it, 3.85\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":"crates/types/src/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c02d304dae26f262fdb42df8e578a584492f6d5ac6e5958f8d9e4da98fecece"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/mod.rs: FileTooLong \u2014 1919 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 103 free functions. The bar is 500 significant lines; this is 1419 over it, 3.84\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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a062d3dca94c93fa62d022c7e09b22c313921e85484740411dbaa47ae09e0138"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/viz.rs: FileTooLong \u2014 1905 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 61 free functions. The bar is 500 significant lines; this is 1405 over it, 3.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/viz.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6ebad9476b918770e7046bd59a4f3836b4e96976dc829065cad46305bfc47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeadCodeTreeProvider.getChildren: MethodTooLong \u2014 getChildren runs 372 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 272 over it, 3.72\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":"editors/vscode/src/treeView.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7166b57c9c62da6ea07f9c98067b83445c1a6985762b8428151de6f61865eacb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/config_parser.rs: FileTooLong \u2014 1847 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 148 free functions. The bar is 500 significant lines; this is 1347 over it, 3.69\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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f54447d4a2667cb29258b615bcd02a26c5af8855718532b383d0cb2f119dde4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/impact.rs: FileTooLong \u2014 1846 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 109 free functions. The bar is 500 significant lines; this is 1346 over it, 3.69\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":"crates/cli/src/impact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a1c734cec1106fb496c560090f25d1f87f9c8fa971d3804e60e4d29e2b7e53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/unused_deps.rs: FileTooLong \u2014 1846 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 83 free functions. The bar is 500 significant lines; this is 1346 over it, 3.69\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":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f627be65b07c025d47ea793ad3ddf61945a8290e40441e669c5a319c52133b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ci.rs: FileTooLong \u2014 1808 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 82 free functions. The bar is 500 significant lines; this is 1308 over it, 3.62\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":"crates/cli/src/ci.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eb539144765d0f61338a98cdb3016c0c72ee99b6d38846be960dbb82b2459f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baseline/mod.rs: FileTooLong \u2014 1790 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 66 free functions. The bar is 500 significant lines; this is 1290 over it, 3.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dce18c6a8cbf5b2eb0f4a32b108178bf6ae7d7e03001282d0a0c4410fc9cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_types::workspace::render_message: FunctionTooLong \u2014 fallow_types::workspace::render_message runs 357 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 257 over it, 3.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":"crates/types/src/workspace.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b337cdc8bbdeecbd6bbebfc2d0cf4d167bc1fcf4454f8bdcf4f1ad464d2e141"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dead_code_codeclimate.rs: FileTooLong \u2014 1764 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 51 free functions. The bar is 500 significant lines; this is 1264 over it, 3.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea191b23ff3a63639411510112ab4a809145ab9468b19e43ad1fb39fb72dae50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/mod.rs: FileTooLong \u2014 1754 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 65 free functions. The bar is 500 significant lines; this is 1254 over it, 3.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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f3dcd8157135ea2620a6c1d8d595066e407233c9a8fe25c2716fcf6bfba1fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: health/coverage.rs: FileTooLong \u2014 1696 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 88 free functions. The bar is 500 significant lines; this is 1196 over it, 3.39\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":"crates/cli/src/health/coverage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fcbf883ca4796a64730021c74f8a27a1d8e36456cbb6858946f74bdeb077dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dead_code_sarif.rs: FileTooLong \u2014 1684 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 84 free functions. The bar is 500 significant lines; this is 1184 over it, 3.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":"crates/output/src/dead_code_sarif.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8971a725c8b173e55b9f0daf099e73a847f6fb81bd59d5bec3a2cf61cfd90b3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/mod.rs: FileTooLong \u2014 1675 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 48 free functions. The bar is 500 significant lines; this is 1175 over it, 3.35\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":"crates/cli/src/check/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf578ad66b4778f70b19ab8446f82a64cf73782b18cbee5751148688f90fff48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantic.mjs: FileTooLong \u2014 1643 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1143 over it, 3.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fc56e50858f8640b0e72dbd0763eaf565f64e3fbaab5c55ccf782135de52c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/issue_meta.rs: FileTooLong \u2014 1622 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 1122 over it, 3.24\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":"crates/types/src/issue_meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26541068e9e8966852081ad88be1481c3ad4b1e22c06575f71c1b1de608c12b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chrome.buildChrome: FunctionTooLong \u2014 buildChrome runs 317 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 217 over it, 3.17\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":"viz-frontend/src/chrome.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f573ead4a9739ac24b3f97d44bb28457c0cef8f29fcf898338d9a706d64c77b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleGraph: TooManyMethods \u2014 95 methods, declared across 14 files: graph/mod.rs (31), re_exports/mod.rs (13), graph/public_exports.rs (9), graph/ambiguity.rs (7), \u002B10 more file(s). The bar is 30 methods; this is 65 over it, 3.17\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":"crates/graph/src/graph/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bec41a7870ee9ab3342c560d6e526c7ef34150899bf654f4f5f61eeb6cad054"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/telemetry.rs: FileTooLong \u2014 1583 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 105 free functions. The bar is 500 significant lines; this is 1083 over it, 3.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"955fd5bf632dc512a96ace22930b59e802b7af287c6d3f16b68c6bc7a22d2f58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/similar_code.rs: FileTooLong \u2014 1563 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 73 free functions. The bar is 500 significant lines; this is 1063 over it, 3.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/runtime/similar_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0c4c49d12b0e13d9e1080d3561fc6b75ce773355ace904a2ebc68eb26abae2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ModuleInfo: TooManyFields \u2014 91 stored fields beside 6 methods. The bar is 30 stored fields; this is 61 over it, 3.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/extract.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3945d9318c5c8a64804b678246ed090eadc8e9098a799ced55d2b17d4c08ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_object_bindings.rs: FileTooLong \u2014 1474 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: ModuleInfoExtractor (63-2035). The bar is 500 significant lines; this is 974 over it, 2.95\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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51aa69553f5c504342e4a2e426c2510254a8e4feabc014f623e5c324296ae6d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parse.rs: FileTooLong \u2014 1463 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 60 free functions. The bar is 500 significant lines; this is 963 over it, 2.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":"crates/extract/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7721c16f44bd60e93a699b8a208d8af6c2425b01659d53196e261c3cdca871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduler/mod.rs: FileTooLong \u2014 1454 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 33 free functions. The bar is 500 significant lines; this is 954 over it, 2.91\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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b98119e11562221f7d383892e9ac97cda03d6de5602b9a16a968f1c725d68b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolve/specifier.rs: FileTooLong \u2014 1377 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 86 free functions. The bar is 500 significant lines; this is 877 over it, 2.75\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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f2a957b7cf13863d2527095b32fafcc4220eb6d4add794aa04033979f67b36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audit_brief.rs: FileTooLong \u2014 1280 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 64 free functions. The bar is 500 significant lines; this is 780 over it, 2.56\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":"crates/cli/src/audit_brief.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e631350c05a9e9355fcd2bc1b72d32a34aac883fb2227088d087d6a4192834ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/mod.rs: FileTooLong \u2014 1257 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 757 over it, 2.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":"crates/core/src/plugins/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5225a425455ccd6310c1bc04783672756e0e829cfddbfaa3b4ef705a6987dd19"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Cli: TooManyFields \u2014 75 stored fields beside 2 methods. The bar is 30 stored fields; this is 45 over it, 2.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/cli_args.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d78ab52a7b7e56de97b49cf1683fc09542e97d2d5e036fa0d8bdb0ae983e3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli_args.rs: FileTooLong \u2014 1246 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 746 over it, 2.49\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":"crates/cli/src/cli_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8dbc2b6cb17c0a0f48b5ae9debda0dc8b57e9eb4a159269d3be25431926c98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audit_keys.rs: FileTooLong \u2014 1232 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 732 over it, 2.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":"crates/api/src/audit_keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9b4f90da757dae3a5edb8969972d436dec9eafe56e91e4d3fc937d984298b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: re_exports/propagate.rs: FileTooLong \u2014 1207 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 35 free functions. The bar is 500 significant lines; this is 707 over it, 2.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":"crates/graph/src/graph/re_exports/propagate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02222ead278a9c1d6608a8927972936283191b555c445fef472dea70b1065b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: members/mod.rs: FileTooLong \u2014 1199 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 54 free functions. The bar is 500 significant lines; this is 699 over it, 2.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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b94e110f0afebd6eb273465445898a03f44a771873b571357b02224208e77a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/nuxt.rs: FileTooLong \u2014 1198 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 79 free functions. The bar is 500 significant lines; this is 698 over it, 2.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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbabf5a53b61747c03e095145a6d11a5349937fcb669eed0bfe91cc552bb39af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/collect.rs: FileTooLong \u2014 1184 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 684 over it, 2.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":"crates/mutation/src/collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ea61065003ee83a875e2f3ca3ea3cd1f7b3e0c3b38f183e3df35f52a9ff42d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/github_annotations.rs: FileTooLong \u2014 1168 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 44 free functions. The bar is 500 significant lines; this is 668 over it, 2.34\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":"crates/cli/src/report/github_annotations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e121bcbf0c52cad90cb34a013784a25bb88db72eb7f09ed86d5f7650aabbb8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/explain.rs: FileTooLong \u2014 1160 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 31 free functions. The bar is 500 significant lines; this is 660 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/explain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d225ae7ae7b4c7ce4480721b2c32d319455341da74144ad0d13194b819f3eec4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RulesConfig: TooManyFields \u2014 69 stored fields beside 3 methods. The bar is 30 stored fields; this is 39 over it, 2.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/rules.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"18de6c658ac608977f74caa40d4d1882419991ec85c2f89c19ab50c7651530ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AnalysisResults: TooManyFields \u2014 68 stored fields beside 38 methods. The bar is 30 stored fields; this is 38 over it, 2.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/results.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fb5501b28fd27ea2594621ba20b6b2d8169dd6b991420b4c9786ba6d0b05be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PartialRulesConfig: TooManyFields \u2014 68 stored fields. The bar is 30 stored fields; this is 38 over it, 2.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/rules.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5943fb2af1b1054bdc9a12b3242989c1ceaec750c14f86f07bd800d54befb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/unused_exports.rs: FileTooLong \u2014 1123 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 52 free functions. The bar is 500 significant lines; this is 623 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":"crates/core/src/analyze/unused_exports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8e7f85dd3a9fa50637e869913c4699202ceaf66aa71b41199e0503e08ac7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base_worktree.rs: FileTooLong \u2014 1117 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 69 free functions. The bar is 500 significant lines; this is 617 over it, 2.23\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":"crates/cli/src/base_worktree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"028daadac3757e2ecc26c7ecf291915dcca6c560e450b318959d069bd14f4aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 1111 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 65% of them inside a single declaration: AnalysisSession (2 blocks, 41-1349). The bar is 500 significant lines; this is 611 over it, 2.22\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":"crates/engine/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8303adb9ac2393436de480a84d85b9de80c61df259f9ac004d3f197dfeda0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: combined/output.rs: FileTooLong \u2014 1109 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 63 free functions. The bar is 500 significant lines; this is 609 over it, 2.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/combined/output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e1d045e87a499bc6b441ec38c98e0dd432c0ebb3fa4300b30a34fe9baf67bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeadCodeKeyCollector: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.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":"crates/api/src/audit_keys.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"789ab61ad273e7bacb47bff27dc2764e0fd25226f9b63d96ba1d6bcb26edeca4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: discover/entry_points.rs: FileTooLong \u2014 1073 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 46 free functions. The bar is 500 significant lines; this is 573 over it, 2.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":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ac6f598c18d1e142e3aef0ed332731f050ad92ff8ac10d2b2b52718f61207b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/mod.rs: FileTooLong \u2014 1066 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 31 free functions. The bar is 500 significant lines; this is 566 over it, 2.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":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5584d138b9ce8ff66c89c353a7b7474b784115a22785009d624b7fa5c931c0ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trace_impl.rs: FileTooLong \u2014 1034 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 42 free functions. The bar is 500 significant lines; this is 534 over it, 2.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":"crates/engine/src/trace_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1eadd57627ff1dbd9bbd9b234ea6a833271285e6bf68b0cc316b30251255ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/setup_hooks.rs: FileTooLong \u2014 1027 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 57 free functions. The bar is 500 significant lines; this is 527 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/setup_hooks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb275751e480df3178f271176e749814eed1ef083587d745765205712fdb4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audit_output.rs: FileTooLong \u2014 1021 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 63 free functions. The bar is 500 significant lines; this is 521 over it, 2.04\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":"crates/cli/src/audit_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85299199043c712731da7197b9609bcb8722df3abdfd5fb82108c0bc2e48055e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inspect.rs: FileTooLong \u2014 1009 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 52 free functions. The bar is 500 significant lines; this is 509 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/inspect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1236e3b145e44c223ef9238f0058e4e394cb5650f119ac971fcd69004826e3ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/mod.rs: FileTooLong \u2014 1003 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 49 free functions. 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":"crates/cli/src/report/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad3239329703dc6d71609ca697675d06cdde782cad7f97e2d0d03cac3b7709c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_manifest.rs: FileTooLong \u2014 998 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 498 over it, 2.00\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":"crates/types/src/mcp_manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6aedff13fb2a33ec3a01730987500edbb631d0ce7941f971443808e8eed131"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_analytics/mod.rs: FileTooLong \u2014 997 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 497 over it, 1.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":"crates/engine/src/health/css_analytics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc0439652493db583e90309c5fe4c3eaa3abb0fb8a8ddefe3b36d825001baa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trace_usage_impl.rs: FileTooLong \u2014 997 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 497 over it, 1.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":"crates/engine/src/trace_usage_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9eac3a517d4aad1478bc96e1300b21b3e4c3ac3e17a5b21a8abfc430488536"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/boundaries.rs: FileTooLong \u2014 992 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 492 over it, 1.98\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":"crates/config/src/config/boundaries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19bf496c523a3566549143ad3be7701ef8a24e8fbd71f6b78ce7c5e41e4b68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/repo_refs.rs: FileTooLong \u2014 989 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 63 free functions. The bar is 500 significant lines; this is 489 over it, 1.98\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":"crates/engine/src/repo_refs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32262e3605a50376d280c2cdb05c7a42a084e8816e6c0a04e1892eaf7dcd19a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/parsing.rs: FileTooLong \u2014 973 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 473 over it, 1.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":"crates/config/src/config/parsing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17666a5953f170bb2ad89e45ec02e1d458eea2334c4182664d70f0baa86a3c95"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContractCollector: ClassTooLong \u2014 778 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), 40 methods, 2 blocks, lines 71-1141. The bar is 400 significant lines; this is 378 over it, 1.95\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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be0ee03e721894da72ad15c5eb6a877533e27eccb51679083815492bdb40145"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/schema_emit.rs: FileTooLong \u2014 966 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 38 free functions. The bar is 500 significant lines; this is 466 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":"crates/cli/src/bin/schema_emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45905abd7bf01f0d71b5b060f4a6266751018ccfc5605afc0e585b4e3e07aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: component_contracts/mod.rs: FileTooLong \u2014 965 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: ContractCollector (2 blocks, 71-1141). The bar is 500 significant lines; this is 465 over it, 1.93\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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef4b78a0e5e6b2b01601578737526fa343b1bdf7edc10355ab9c34d1e01c7cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_helpers.rs: FileTooLong \u2014 955 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 48 free functions. The bar is 500 significant lines; this is 455 over it, 1.91\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":"crates/extract/src/visitor/visit_impl_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d12d42375dfe79942ab3e1433619ca64dc82fe7d0b8bc96481fd7db76587ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 954 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 454 over it, 1.91\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":"crates/types/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21823e8a02d375797c0714560399afef6050602ae2eff124cb10660090c3a37a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnalysisSession: 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":"crates/engine/src/session.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d49cac28ba4b3a6acdc4100575af4b7b77b7d9f7040dcde63cde540410c142"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ResolvedConfig: TooManyFields \u2014 57 stored fields beside 4 methods. The bar is 30 stored fields; this is 27 over it, 1.90\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/resolution.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64a25e277749418fbea976aa59da0981b21f7b04424d75893ea7cc07263b3bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: health/result.rs: FileTooLong \u2014 942 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 35 free functions. The bar is 500 significant lines; this is 442 over it, 1.88\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":"crates/engine/src/health/result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"662cf30cc65a8be94fada9e02c41702e82de5b04f06408481b62ea73d27dd7fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: panel.rankRowsForLens: FunctionTooLong \u2014 rankRowsForLens runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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":"viz-frontend/src/panel.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cfb768d63d4f5141a9c964cf12d6a6f23cea0ddbfa83e56a3cfd2fa639c580"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flags.rs: FileTooLong \u2014 931 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 35 free functions. The bar is 500 significant lines; this is 431 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"916624d93769db8cd4484f78a00cf6cedaae5cb6f012d7b7a8f5de0fde4146e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flags.rs: FileTooLong \u2014 924 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 424 over it, 1.85\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":"crates/extract/src/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53bb654cd8b52dfcf902f5f03a4f4c7d049361dc8fe0c2932b1254998463770"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compact_output.rs: FileTooLong \u2014 921 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 421 over it, 1.84\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":"crates/api/src/compact_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c423dd5a55261782aec917f8d8b9fdb6e3fb45b4d0a0b07eb7efa7180f7c9d80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BaselineData: TooManyFields \u2014 55 stored fields beside 6 methods. The bar is 30 stored fields; this is 25 over it, 1.83\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20298cb285bcb287a59d3f7515d7597ebad977777b57830e1d4f013818fad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 914 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 74% of them inside a single declaration: FallowLspServer (3 blocks, 302-1449). The bar is 500 significant lines; this is 414 over it, 1.83\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":"crates/lsp/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11694b9b1eff6827cbb2441995ab9e2c0562c431486ac32fdb8925f1bae1bb5c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnalysisSession: ClassTooLong \u2014 727 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 41-1349. The bar is 400 significant lines; this is 327 over it, 1.82\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":"crates/engine/src/session.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce2d87cd5e25ac25676da15cfcb4ee6c9d5e7090b1c729480099dd1dbe801c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::dispatch::dispatch_subcommand: FunctionTooLong \u2014 fallow_cli::dispatch::dispatch_subcommand runs 181 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 81 over it, 1.81\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":"crates/cli/src/dispatch.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ccad4a7205a23d706bdbe5f0340f234a7c304412732e7a567da1836b954f0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/ship-wait-checks.mjs: FileTooLong \u2014 894 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 394 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-wait-checks.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8821f1d5ef43bda80e29cc50133bb782f9180af5ff8a746c4af3f2497c1acd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/mod.rs: FileTooLong \u2014 893 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 393 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0057373226728722e72f139abeea014d3efc5ea01717969dd4bcddb283e5c42"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HealthExecutionOptions: TooManyFields \u2014 53 stored fields. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d6af279dcfdc7b57f32be5ce0ca3c8a9335d74e88b3e72dd3d6db35427b50"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DeadCodeOptions: TooManyFields \u2014 53 stored fields. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/napi/src/lib.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66ff58868800e87ba7fd986bc20aa4e9f1ff71265f6bf67881eb930a4569597"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dupes.rs: FileTooLong \u2014 878 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 39 free functions. The bar is 500 significant lines; this is 378 over it, 1.76\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":"crates/cli/src/dupes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac6c4afa6ed5f94c53fd1a77a8856ff3b0dba18156ecefa6d82c2d1ed299b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/code_mode.rs: FileTooLong \u2014 873 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 34 free functions. The bar is 500 significant lines; this is 373 over it, 1.75\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":"crates/mcp/src/tools/code_mode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"081cabd7556131a9daa97b869e14b9fa3bc38b7bedb288dd9ef61868e15b18a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/churn.rs: FileTooLong \u2014 872 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 40 free functions. The bar is 500 significant lines; this is 372 over it, 1.74\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":"crates/engine/src/churn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8711f7670e12c633a049dd601ae6bcac39d77a71a586a1d76a604038a038e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnalysisResults: ClassTooLong \u2014 694 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), 38 methods, 2 blocks, lines 246-2121. The bar is 400 significant lines; this is 294 over it, 1.74\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":"crates/types/src/results.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"289434cc4ab630e69d172f1cf68f6921bba84a47bf457d4da4600b3c71309602"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: discover/walk.rs: FileTooLong \u2014 867 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 41 free functions. The bar is 500 significant lines; this is 367 over it, 1.73\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":"crates/core/src/discover/walk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a783336db77b1a57d4443655203810d2b8f6bbae6a80d3c95b0020b16258ef2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 863 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 40 free functions. The bar is 500 significant lines; this is 363 over it, 1.73\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":"crates/cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f79c9b05ad57d8af108aa7929ddac80f6b6bfed77cb534e201d8670e348bd99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vital_signs.rs: FileTooLong \u2014 847 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 44 free functions. The bar is 500 significant lines; this is 347 over it, 1.69\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":"crates/engine/src/vital_signs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d81038b7390953a6f082bb1db20930f09955ffbd00c7f1a93606f08d2f966"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/mutation.rs: FileTooLong \u2014 842 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 44 free functions. The bar is 500 significant lines; this is 342 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":"crates/api/src/runtime/mutation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ff8a667822393444a67ced9e4754a7eb2b00b4aabdab23c6382ca05d95edf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FallowLspServer: ClassTooLong \u2014 672 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), 25 methods, 3 blocks, lines 302-1449. The bar is 400 significant lines; this is 272 over it, 1.68\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":"crates/lsp/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecebb72bb6c184645f4ba9cc7094ec3c7ac0d4f007e042c912cbdbe6f6d2ef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_analytics/classes.rs: FileTooLong \u2014 838 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 39 free functions. The bar is 500 significant lines; this is 338 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e233eda64dbd5be417c0611565992f09b08492f464bb6e019763780ffe92bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::report::github_summary::check_sections_core: FunctionTooLong \u2014 fallow_cli::report::github_summary::check_sections_core runs 167 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 67 over it, 1.67\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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cadaf382f762c37af6260ae401d00abb9d7b93e094ed91b6324fa4d1736847"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CombinedOptions: TooManyFields \u2014 50 stored fields. The bar is 30 stored fields; this is 20 over it, 1.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/combined/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627caf746f9ae751eab4a743e308ada23ffa81582045f08602f4e73b1611f91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CheckSummary: TooManyFields \u2014 50 stored fields. The bar is 30 stored fields; this is 20 over it, 1.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/envelope.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8222bc49c9e71315b3ef49725c489953589023a08b00c066b1b82863bee3e67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 823 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 323 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"630879d7f5381af50bd0c567a5a84acbdd9312ad660c7bd90cca23f277793f08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/json.rs: FileTooLong \u2014 819 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 319 over it, 1.64\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":"crates/cli/src/report/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f290f5d997c472fbabf044fe2933aafde3cb63c16efbed8dbbb72f43e73a1b32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dead_code.rs: FileTooLong \u2014 819 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 40 free functions. The bar is 500 significant lines; this is 319 over it, 1.64\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":"crates/engine/src/dead_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1873d359d90ae8e8bcf35f1133e49e30c17442c91d9e88dea22aac2f20d55fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HealthParams: TooManyFields \u2014 49 stored fields. The bar is 30 stored fields; this is 19 over it, 1.63\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/params_health.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0502b40af5745aa381eba4686093dd0670d840585fcd27d945e8a6fb2d65d2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/annotations.ts: FileTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 306 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7df10e92fcbcd50b0c3116cd65d1803449048e956bef54f1c9b84d20b41b8c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/module_federation.rs: FileTooLong \u2014 805 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 35 free functions. The bar is 500 significant lines; this is 305 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":"crates/core/src/plugins/module_federation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87e20936582d4ad4e071de5a196007f752f11b736eff46f2cc9f1b04f9019fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: type-aware-corpus.summarize: FunctionTooLong \u2014 summarize 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":"scripts/type-aware-corpus.mjs"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97b96c875790480c9d437d3e2fc6c20494fa5068b4a80b492360880cfa65f00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/dead_code.rs: FileTooLong \u2014 802 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 42 free functions. The bar is 500 significant lines; this is 302 over it, 1.60\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":"crates/api/src/runtime/dead_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f1aa65ce5c7f27046ce484139c930f5b6553113a45cc65890aa57634c73174"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sfc.rs: FileTooLong \u2014 802 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 39 free functions. The bar is 500 significant lines; this is 302 over it, 1.60\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":"crates/extract/src/sfc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d9ff734eeba01137ef2b7c944d08b9709c2543a1a2d95bddb1c0830ee4795"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AuditOptions: TooManyFields \u2014 48 stored fields. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"10899fa7866fb378861bd9ad2400da98cf071577ec332ebae589b19b7110ba19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/effective_exports.rs: FileTooLong \u2014 795 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 295 over it, 1.59\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":"crates/graph/src/graph/effective_exports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b140bfb3e1de52bbd3dd413e1c235bd500228e44c85ade7098f82bd1649854"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/treemap.ts: FileTooLong \u2014 791 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 291 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/treemap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"647754be3fb5ea73f540e7d25ba7a8f5d366371ecd4ac1c3e28b8ae3ff7c8d11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolve/fallbacks.rs: FileTooLong \u2014 789 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 44 free functions. The bar is 500 significant lines; this is 289 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaec2106d9aa9c4c8e79edf428165ac2b1edb37a74706be7643c59c1373e477"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_projections.rs: FileTooLong \u2014 788 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 95% of them inside a single declaration: ModuleInfoExtractor (59-1095). The bar is 500 significant lines; this is 288 over it, 1.58\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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d95b3390a6a9006fedf721c1449450db238a7c0efe6c6657d328fe8ca96de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CheckOptions: TooManyFields \u2014 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd3863902bcf725222c084313b95f48aaaeee287a621296c2966a9a48788d45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: coverage-producer-refresh.main: FunctionTooLong \u2014 main runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c811a4ddb175ae3a4547acac15b193f83ea19613df171999a7d2a31169b871e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::check::execute_check: FunctionTooLong \u2014 fallow_cli::check::execute_check runs 155 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 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":"crates/cli/src/check/mod.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb323b48e2bc0b70f6416e79ea837f63ecf45e0c6d0bc03e128b036a4fd09fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/rules.rs: FileTooLong \u2014 774 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 274 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a971cda03e9728f7eb9c002a8f2c37a551c5e1523631e84e86f9fa33c9baaf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/public-config-corpus.py: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 271 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/public-config-corpus.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9897ab031ead2077b8ac425297d0687b67788084a25fcbd0b42e459ca01a4bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.ts: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"007e37de6416562dbe005f32363ccf21290cb53207eee7661291db385a4a98e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vitest/mod.rs: FileTooLong \u2014 768 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 34 free functions. The bar is 500 significant lines; this is 268 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/vitest/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17e6250f873ba9518ab20cf96a25e79a4f96c307bec72047eb59a420970454b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FallowConfig: TooManyFields \u2014 46 stored fields beside 17 methods. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7e53b29fbfacc0ca83ffd17c73f9e133435c23770f5aef1bded507f3cce0f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/tanstack_router.rs: FileTooLong \u2014 766 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 35 free functions. The bar is 500 significant lines; this is 266 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/tanstack_router.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc295835a79e1cd7035defb88e34908f4c0538a79ac4b48e3953abde2a991ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/unused.rs: FileTooLong \u2014 762 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 33 free functions. The bar is 500 significant lines; this is 262 over it, 1.52\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":"crates/lsp/src/diagnostics/unused.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a879a07927e88b8d3d217e7fed1adce87f037124b9c6e40b7f493534dd0b06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/identity.rs: FileTooLong \u2014 755 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 255 over it, 1.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":"crates/types/src/identity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0bdd6970df6d959837c705a7c9853fc5cf7cbf7d458532ef172928999ed3be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_types::results::split_merge_parts: FunctionTooLong \u2014 fallow_types::results::split_merge_parts runs 151 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 51 over it, 1.51\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":"crates/types/src/results.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8615f5ef140597dab94040dddb1c077c446511dea3013930e462255c8d659c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ci_output.rs: FileTooLong \u2014 750 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 46 free functions. The bar is 500 significant lines; this is 250 over it, 1.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":"crates/output/src/ci_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1dd862c938eee6af1a9c804ffc2c85d1efa0c7995feb904ceaf90d765af6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check.rs: FileTooLong \u2014 746 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 246 over it, 1.49\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":"crates/output/src/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76292267b33c53d6b299a8c812ce822e01305b80fad38612c893718da06a9a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/download.ts: FileTooLong \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 244 over it, 1.49\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":"editors/vscode/src/download.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32436e7f95aed618dcfae6b8d160e933680fd6f46be1ffbf9facaa477e996a50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sfc_props.rs: FileTooLong \u2014 742 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 38 free functions. The bar is 500 significant lines; this is 242 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_props.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bd381dbd18e4f8802d02d920275ee22f6ab83f8de866f26e0f7f843552616e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 740 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 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/napi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c40cbbcc93c5be16f6743bcd89179efa8ef028ae0ed4df13f63c73cacb277"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/similar_code.rs: FileTooLong \u2014 736 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 236 over it, 1.47\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":"crates/engine/src/similar_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae401666e65c5cefbe47d621d9d907e85c0c79a1653e3f3504ee8f62934d63b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fix/catalog.rs: FileTooLong \u2014 734 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 36 free functions. The bar is 500 significant lines; this is 234 over it, 1.47\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":"crates/cli/src/fix/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad9440ecb9b0b66895149b71ccad6d7c2b56a4fc2ffa13ea70b38a388d9739"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FallowMcp: 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":"crates/mcp/src/server/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"affea7033d160360b19028f0f81554e682650033c08bec8de19440e72e5a5e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AnalysisCompleteParams: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/protocol.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"994598bf7bfd9d69efdf9eab0f535bb46d6c53ab8ded90974e9333aa8fd411ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/audit.rs: FileTooLong \u2014 732 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 232 over it, 1.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":"crates/api/src/runtime/audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eb5ebe6e2d0934bdf3693e195da00f4281b879566e06f9df341c25a3efc3e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: re_exports/mod.rs: FileTooLong \u2014 726 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 226 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/re_exports/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c17cc90f470616510b28949940db09bad22433f8bb96dc56d380375d3d1ec9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: annotations.drawClusterLabels: FunctionTooLong \u2014 drawClusterLabels runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28c50e018684138052878ea4f36784023e2050ceaff59067d92dac90467eb20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/init.rs: FileTooLong \u2014 724 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 41 free functions. The bar is 500 significant lines; this is 224 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f226ec94277e824c37327ea7e5d5c85dd544217163950c28c21737625a1be8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/changed_files.rs: FileTooLong \u2014 723 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 49 free functions. The bar is 500 significant lines; this is 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/changed_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9c3b6f60e62286607e0f1927f9d134d0258d4618ede7a6b5cbf143cbf5b46e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/list.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), declaring 31 free functions. The bar is 500 significant lines; this is 222 over it, 1.44\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":"crates/cli/src/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac2fefab4219e1c325037ade363db4269b452e725915ea73489f8f5c0ae51d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_install/mcp.rs: FileTooLong \u2014 720 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 32 free functions. The bar is 500 significant lines; this is 220 over it, 1.44\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":"crates/cli/src/agent_install/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf602a131779e8acfdf7b07bab4ca52270f7eb9f7dce801a1655b27dcf98b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/mod.rs: FileTooLong \u2014 720 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 45 free functions. The bar is 500 significant lines; this is 220 over it, 1.44\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":"crates/mcp/src/tools/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2197da7395d7834c3352316713c6d46891b08a4bdc159995365dcbda18ff4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_factory_properties.rs: FileTooLong \u2014 716 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: ModuleInfoExtractor (204-1006). The bar is 500 significant lines; this is 216 over it, 1.43\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":"crates/extract/src/visitor/visit_impl_factory_properties.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"877e3b1ed06875d231dcc837ea0ee00ee493ae170297d3f56e5250be9f97f1c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extension.ts: FileTooLong \u2014 715 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: activate (169-1253). The bar is 500 significant lines; this is 215 over it, 1.43\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":"editors/vscode/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a2d2b15aaa03ce79239119315236a5411922b22dda3596ca3ccc7cf0205193"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_security_sinks.rs: FileTooLong \u2014 713 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 43 free functions. The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_security_sinks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31caf2a930ceeeccd53e3ecefda642695054fa10aa26f00d0272c41b1ea479d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module_graph.rs: FileTooLong \u2014 708 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 208 over it, 1.42\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":"crates/engine/src/module_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b02776e4bb5c0ce1d83823bab98beafd3ba41841522da9c4a9e3fed537f31e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mutation/plan.rs: FileTooLong \u2014 707 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 207 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":"crates/engine/src/mutation/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad69fdf2401fdfb9ccc3831c78d0345f421110a519f6229d0fde7b9d14588f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/build.ts: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 205 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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6293a2f33b24edb4e36d492c9cdf2307b0e4d486fd75f3884d11ee36636bcde9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IssueFilters: TooManyFields \u2014 42 stored fields beside 10 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3328fcfd92a6bc3949c40eb6906e8c37761ef79e3ddd6027ba8b6b89d2a744"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/react.rs: FileTooLong \u2014 690 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 33 free functions. The bar is 500 significant lines; this is 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/react.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38004329ad72902f6ce212f4db0c06c711d915e04c7d58da4942da7b200dece4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hover.rs: FileTooLong \u2014 690 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 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cdf2380e51d47aa00c382ad1bc6c0dd4d28e155598ee05e208e19369e5cec0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fix/mod.rs: FileTooLong \u2014 687 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 187 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":"crates/cli/src/fix/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"058bd50dddde12898c7030de728693b7bb8102c61f66efb37988700612c3795c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_similar_code_sidecar::protocol::process_request: FunctionTooLong \u2014 fallow_similar_code_sidecar::protocol::process_request runs 137 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 37 over it, 1.37\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":"tools/similar-code-sidecar/src/protocol.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d6700cf04fe71646427a593268a35f05dbd235161c1cf3f2a94297e975ca4c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FlagVisitor: ClassTooLong \u2014 545 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, 3 blocks, lines 185-1022. The bar is 400 significant lines; this is 145 over it, 1.36\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":"crates/extract/src/flags.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8718eb16f05b45cdfdc4251c9a69363030343320ea1cbfd9e90cf6cd2d60cfbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data.ts: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 over it, 1.35\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":"viz-frontend/src/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa69216188157068743d4f410ae64fda452954bd288ce9993c521ad3a97f9a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::report::github_summary::check_sections_architecture: FunctionTooLong \u2014 fallow_cli::report::github_summary::check_sections_architecture runs 134 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 34 over it, 1.34\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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a662c0c315a05b331c07844d6940916541091bffd9269a65bab76f0530c50a76"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContractCollector: TooManyMethods \u2014 40 methods, declared across 2 files: component_contracts/mod.rs (29), component_contracts/classes.rs (11). The bar is 30 methods; this is 10 over it, 1.33\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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae01d6ad85b5a92e40af7986565d7d68a55ba9ed149132a27bd0021917c03e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/codeclimate.rs: FileTooLong \u2014 666 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 41 free functions. The bar is 500 significant lines; this is 166 over it, 1.33\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":"crates/cli/src/report/codeclimate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1439047c0d01320bc5db5a3697bea060dd626bb3138f30f2cf0cb029f3eb17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: report/sarif.rs: FileTooLong \u2014 665 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 36 free functions. The bar is 500 significant lines; this is 165 over it, 1.33\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":"crates/cli/src/report/sarif.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa37d615b360eb5817cda81ab55686ad31575ed1862f3fe6efd22a37a6568715"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComplexityVisitor: ClassTooLong \u2014 531 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), 26 methods, 3 blocks, lines 117-1004. The bar is 400 significant lines; this is 131 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":"crates/extract/src/complexity.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3331060d5c6929aa57a933e4364c4b7ffbf69ae33b1f21ddec1a20264994e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TokenExtractor: ClassTooLong \u2014 530 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), 11 methods, 3 blocks, lines 19-906. The bar is 400 significant lines; this is 130 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":"crates/engine/src/duplication_detector/token_visitor.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8833fde524514873d67a0f00c03d8560c572ec82354b67e9bbacf51ec31d2ad1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Command: ClassTooLong \u2014 529 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), 0 methods. The bar is 400 significant lines; this is 129 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":"crates/cli/src/cli_args.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a119f872df8d8f7bb85e68e19aba5f3ad071f4b08dbdf3baaeb3faa7d56950f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleGraph: 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), 95 methods, 3 blocks, lines 162-1576. 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":"crates/graph/src/graph/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2968fae8381e38234af91362cdacdf8babce8b80432e06c2db13188d3e892e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mutation_human.rs: FileTooLong \u2014 654 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 32 free functions. The bar is 500 significant lines; this is 154 over it, 1.31\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":"crates/cli/src/mutation_human.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a2f43f609ca399748c82faf6a58b33cae229ffa886e86067d0cecc2682a72c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: health/mod.rs: FileTooLong \u2014 651 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 32 free functions. The bar is 500 significant lines; this is 151 over it, 1.30\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":"crates/cli/src/health/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c018fa9d8d79ef793f3f90cfd2862507dfc9f9b232dff909c0570f0827958071"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/resolution.rs: FileTooLong \u2014 651 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 34 free functions. The bar is 500 significant lines; this is 151 over it, 1.30\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":"crates/config/src/config/resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6393e82b1a556c08288068a5ca98dd2e16ec8bb120e2666a4ebe44a50ccd1a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::check::output::handle_type_aware_trace_output: FunctionTooLong \u2014 fallow_cli::check::output::handle_type_aware_trace_output runs 128 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 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":"crates/cli/src/check/output.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee1e8d9f26eb8f2f9e4f87c0a5bde263eaa4149349a845c769b8ff8bbd2d242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sfc_template/svelte.rs: FileTooLong \u2014 636 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 136 over it, 1.27\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":"crates/extract/src/sfc_template/svelte.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"185261d2b716f6432ea17bf326be25f5f8c031b3ea9f53835a12f0a34c9eb0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnalysisResults: TooManyMethods \u2014 38 methods, declared across 2 files: src/results.rs (35), src/results_component_health.rs (3). The bar is 30 methods; this is 8 over it, 1.27\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":"crates/types/src/results.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5374ae6c763d69d9368ba310bf1ab2f3ab838631f77734d0a034de8ed3bde08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/params.rs: FileTooLong \u2014 631 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 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/params.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a455de8371a08ac20198dc7b67e76aabfca60b88e5e389467736859059a5550"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/render.ts: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/graph/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e7247664053a48b1785d17225e241268ac1d2452c4bd321db3278567826a5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/similar_code_cli.rs: FileTooLong \u2014 630 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 130 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/similar_code_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca7fae1de06f05f6c97e905a80b60aa2a965d4767c48f1a21f76fea1196a739"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: template_complexity/engine.rs: FileTooLong \u2014 626 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 126 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34526731e48edce8d8dd527a95d5e60800f2137999c2552b6681515abbd43ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/health_scores.rs: FileTooLong \u2014 623 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 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/output/src/health_scores.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebfbe02c37f1d66c9d8c75f40cbef2839d3e6e0ad564c29e5ee5e35e2a35bb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli_report.rs: FileTooLong \u2014 620 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 120 over it, 1.24\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":"crates/cli/src/cli_report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abec08945f2e77691b63dafda6724280e9d03580f82bd904d1e2061f271bb28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::inspect::collect_semantic_evidence: FunctionTooLong \u2014 fallow_cli::inspect::collect_semantic_evidence runs 124 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 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":"crates/cli/src/inspect.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6d81b915b883b772b8e401f66c344a03c8d2337fe2e86c4c348856e955d3dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CheckResult: TooManyFields \u2014 37 stored fields. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d89732fc9866d44ca132fe79b26f26c62a416bc7bce717d893ce95d7d58cd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diff_risk/mod.rs: FileTooLong \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). The bar is 500 significant lines; this is 116 over it, 1.23\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":"crates/api/src/diff_risk/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8131b084db221e9f95bb012870aa7144d6152a3153da133aa099d950f08ae921"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: human/traces.rs: FileTooLong \u2014 613 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 35 free functions. The bar is 500 significant lines; this is 113 over it, 1.23\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":"crates/cli/src/report/human/traces.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"229bb025645a1d29a33c3a0489371218e95ef1a042ebc44eccd9b5002bd35d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/report_contract.rs: FileTooLong \u2014 610 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 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/output/src/report_contract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1c400872d320a4f41f1addcb1813b74b3d13a1c28773f57d0477d827592b2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_types::identity::visit_families: FunctionTooLong \u2014 fallow_types::identity::visit_families runs 122 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 22 over it, 1.22\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":"crates/types/src/identity.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"766a15b3cbe558b8d5f1704664f454131f45a9a428e47bb93d1bd9abf03ea8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/css.rs: FileTooLong \u2014 608 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 39 free functions. The bar is 500 significant lines; this is 108 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8fc06ee0b61f3a97c177e409f62c23ea36ab90135b9fb66d29e49e26ec2f3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_actions/quick_fix.rs: FileTooLong \u2014 607 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 107 over it, 1.21\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":"crates/lsp/src/code_actions/quick_fix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a22322bb28a1199214c19eeda78141c2ae8b7bdf32e2b04dbbe16e466315ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chrome.ts: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 107 over it, 1.21\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":"viz-frontend/src/chrome.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d4bf330a24db1a235d21df8bfe5ea9592784240f412b981bc90ab8e281ec4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/complexity.rs: FileTooLong \u2014 604 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: ComplexityVisitor (3 blocks, 117-1004). The bar is 500 significant lines; this is 104 over it, 1.21\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":"crates/extract/src/complexity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568c8d3af5af51320f4d73276d3a5b7b9b63c3977ea853f8038e5a2b5f91041b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sfc_template/angular.rs: FileTooLong \u2014 604 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 32 free functions. The bar is 500 significant lines; this is 104 over it, 1.21\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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93619c462a823a5404aa9035428df884eb98c1e3caca644787ed6234ed4b06ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: health/targets.rs: FileTooLong \u2014 601 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 101 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":"crates/engine/src/health/targets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"158e00640ce5855484f61123bd288d40c275448cfd37b11484747eaca03c63e8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DeadCodeFilters: TooManyFields \u2014 36 stored fields beside 4 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/lib.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8325562a1561c0f9180c22da7305cb8a4c368ed9f5b572b737664b146aa53a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CheckCounts: TooManyFields \u2014 36 stored fields beside 4 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/regression/counts.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b72231485a0df99206e36e0776a26d97b2aa92fddb527416bd9871b5695401"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AggregatedPluginResult: TooManyFields \u2014 36 stored fields beside 4 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d133a524ba088f409b4df487a08277b2583ef588c83598ca23b557db6604882b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/conversion.rs: FileTooLong \u2014 600 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 100 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71295d810340681a5b6d4861e0241ec5d1fe7d296e129d19774611037b544558"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/treeView.ts: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: DeadCodeTreeProvider (160-834). The bar is 500 significant lines; this is 100 over it, 1.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":"editors/vscode/src/treeView.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4671d5f192e04fbd6205602c3e70be787a22c73ab13e0028d8da3779372976c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::report::github_summary::check_sections_frameworks_and_hygiene: FunctionTooLong \u2014 fallow_cli::report::github_summary::check_sections_frameworks_and_hygiene runs 120 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 20 over it, 1.20\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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"b299c250f9c652eb516dff46a7f165b964512aa29b048748c8fc70a0238931f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_engine::effective_severity::for_each_gated_finding: FunctionTooLong \u2014 fallow_engine::effective_severity::for_each_gated_finding runs 120 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 20 over it, 1.20\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":"crates/engine/src/effective_severity.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8edd7fe48e220eed89b0d4a8540778d9db7a24dbb527761863df9c78fc1df72"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HealthDispatchArgs: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/dispatch.rs"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd4b11214d746dddcc4a10a5e773c82b65487fa9e43aa5760765943c7e6a6b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CssAnalyticsSummary: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/output/src/health_css.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac2686fbd4164f7785603f07ecb5e1f4f88a466d257d933295000c822dfd29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: combined/mod.rs: FileTooLong \u2014 599 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 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":"crates/cli/src/combined/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07da28a37853255f29a5e78c0a4de46e7570dffd9fbf395dbbc825a8b5d1cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/search_visibility.rs: FileTooLong \u2014 590 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 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/search_visibility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a32a08ca82fac5e68cd7a6252772f2b1cb70c8dcf3c9684b5ce3225b3a8395"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_engine::effective_severity::tally_gated_findings: FunctionTooLong \u2014 fallow_engine::effective_severity::tally_gated_findings runs 118 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 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":"crates/engine/src/effective_severity.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c21e0a406613d54ad09b6d80885f9f50ee2caf0eef2b8852003959f12d95f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: duplication_detector/token_visitor.rs: FileTooLong \u2014 583 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 91% of them inside a single declaration: TokenExtractor (3 blocks, 19-906). The bar is 500 significant lines; this is 83 over it, 1.17\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":"crates/engine/src/duplication_detector/token_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3a48ac51d2cead6aaa91562c0ea438e10abd52e327dc7d2a6f092b75d4a2be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/discover.rs: FileTooLong \u2014 582 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 31 free functions. The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/discover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab36c6264dee30234aed56afe2e2d6b5d665aa44331d404ce593f4f436ef87c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/coverage-producer-conformance.mjs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d5373fa506a63cb186046371dd55bb7f56555742a5943a79b61b122d8fa127"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/docusaurus.rs: FileTooLong \u2014 578 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 39 free functions. The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/docusaurus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45246a4469456d156e301074c8137bb6d79a24f2b4fed9677a2a10606d8faa62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: external_plugin/mod.rs: FileTooLong \u2014 576 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 76 over it, 1.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":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92f5f14924f01c6e5ce72a0b7fe5eae12ad320d30866f4a9271de8b3a955565"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: type-aware-corpus.capabilities: FunctionTooLong \u2014 capabilities 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":"scripts/type-aware-corpus.mjs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b5561b2ded5622911a908c5fb620abd97e1959f0da3e0b781054312753f002"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/watch.rs: FileTooLong \u2014 572 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 72 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/watch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8db0c4a95ef0212b9faa8b103fbaabae66df126923b699ca790e33acfcece87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scan: ClassTooLong \u2014 457 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), 19 methods, 2 blocks, lines 279-940. The bar is 400 significant lines; this is 57 over it, 1.14\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":"crates/engine/src/trace_usage_impl.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16d398f26ea71a7ac9c9db9df3e30cd558dc300995ec5fca6c87d62a0ddf738"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DupesOptions: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/dupes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e11c8046e5ff96e37435a0e7624e792dd84497d2ddf7ae95a8d57f1ec1b582"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ComplexityOptions: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/napi/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ebd98c4d94d7817a90465cdce470374d37f34f231384c6b04f8ce7cac8ad8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/doctor.rs: FileTooLong \u2014 564 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 64 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":"crates/api/src/doctor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1029ecede127104f2ee518e73aba1bc931ff9e7379d1f4b6a2dea3ab2d0566d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 564 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 64 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":"crates/security/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdbba23f519471d4904867d586d34ff3e9baac21aef155ec9223664c3bf46d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: detect/rolling.rs: FileTooLong \u2014 561 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 61 over it, 1.12\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":"crates/engine/src/duplication_detector/detect/rolling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc77be0c7763baf2e5d8a0b86406cb27755b38885acf59f0b8eec1c00675912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/styling-corpus-smoke.mjs: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\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":"scripts/styling-corpus-smoke.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14243af9d72be7da3d1b28099f04f0bbc5bdd78b74e8c1a781fa75909b1014a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/helpers.rs: FileTooLong \u2014 560 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 60 over it, 1.12\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":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f27c52107789e8fdc3f665952996fc682e89101d666c7581b5f6a13b4f7355"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.drawNodes: FunctionTooLong \u2014 drawNodes runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5126df77c1fa27f162eeaaa63c373437ea634ffb6355380d97565367de387305"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: human/dupes.rs: FileTooLong \u2014 557 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 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/human/dupes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e08c6c52d8c0876926a83be352055cc4a06aca8ca6a72bf537737c4951500c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: security/rank.rs: FileTooLong \u2014 557 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 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/security/rank.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9372233ff3abb14d68dfefb8d0533bbfaeff3b7e8903ad4c4cde3ca50ad873f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_install/mod.rs: FileTooLong \u2014 556 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 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/agent_install/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9757cddf526d4f323bb02a8e36c6f14140672612137b39c02725587206249d04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vitest.createAdapter: FunctionTooLong \u2014 createAdapter runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"tools/mutation-runner/src/adapters/vitest.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"03464ef98d9f49d74c35c11c88c8db3d7e5a20cb06d4e69056a2a51292e1d863"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_signature.rs: FileTooLong \u2014 554 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: ModuleInfoExtractor (8-715). The bar is 500 significant lines; this is 54 over it, 1.11\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":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5c98cd57c78bada23d0b92c6c0c8415b711eea41309ab95e4d633e17e5afe3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: fallow_extract::visitor::visit_impl_security_classifiers: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; this is 3 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":"crates/extract/src/visitor/visit_impl_security_classifiers.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2739865fe281e376dd624660b51d0dfb44bc74257e6cdc2a7ba133be68dec43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleInfoExtractor.into_module_info: MethodTooLong \u2014 into_module_info runs 110 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 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":3774}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5b368cd1d9c1965866224e7d891d09c6155c10dea5f0a0604694971caacfb6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TelemetryEvent: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/telemetry.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d617ccd2c2a8985a1aafa8c07093f8ffb9ec818cc65f0053f054611e7eb78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AuditParams: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/params.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4615aa7fede3531ea11d641c7d9faa90c94136101286d022fffdd0ecab93a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli_startup.rs: FileTooLong \u2014 549 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 36 free functions. The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/cli_startup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fe22431cc78e1348255ee63d660f36c0d11692ee1040f5baa351051b94938c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/absent_component_prop.rs: FileTooLong \u2014 548 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 60% of them inside a single declaration: ContractIndex (2 blocks, 43-480). The bar is 500 significant lines; this is 48 over it, 1.10\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":"crates/core/src/analyze/absent_component_prop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dd32759b713332eb238aff99ce4aee5ba287621a0c8a6579e0d258e93c1b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_analytics/token_consumers.rs: FileTooLong \u2014 548 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 31 free functions. The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/token_consumers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc6199cfe5a86da112af9e5ac60e40667691951b66b381b2e9655229e22335f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trace_error.rs: FileTooLong \u2014 548 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 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/trace_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48db5b37b639314a812acf21d7f735fff99ec65a39a1037c7c7b9c3428c58c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/ci.rs: FileTooLong \u2014 545 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 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":"crates/core/src/scripts/ci.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498cec35189c1baa047a336e9e857c6a8273ed1ea5c784f3604003a0d41531a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/narrowing.rs: FileTooLong \u2014 545 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 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":"crates/graph/src/graph/narrowing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db4aca879270f1f544e8df063fbbcacd166bd7c9fa7d74ec15cff6484cca30c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DeadCodeTreeProvider: ClassTooLong \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 35 over it, 1.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":"editors/vscode/src/treeView.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1774b09acb1ab787a8fd203baf576f5bf2a1f6ef3e002e931b2a29f13fa787"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/structural.rs: FileTooLong \u2014 543 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 43 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee5c78715ea332ab19b818526cc50e9d1a8862658f29e7a975ef7cd4319bb46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolve/mod.rs: FileTooLong \u2014 541 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 41 over it, 1.08\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":"crates/graph/src/resolve/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee2f97ef44466e9af186b8fcec91fe8c90ff51e33615af18b5c5aefe05ba810"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sfc_template/vue.rs: FileTooLong \u2014 540 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 32 free functions. The bar is 500 significant lines; this is 40 over it, 1.08\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":"crates/extract/src/sfc_template/vue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b1b7ee84c4e81a130dd67af4de11514e3e0d355d3002100e2287bd2ba42910"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/mod.rs: FileTooLong \u2014 540 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 40 over it, 1.08\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":"crates/graph/src/cache/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f977b450142ec0bd2c10d1542a0c57fd42290b9d5f3554cac5ba06c71e769eff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/codegen-contracts.mjs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\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":"editors/vscode/scripts/codegen-contracts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6fb2d470434d38993937b6ce91ab75588a0071f8aa482d2cb52bc11ebb24ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyze/unused_overrides.rs: FileTooLong \u2014 536 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 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":"crates/core/src/analyze/unused_overrides.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c3239ab1e867056855f37d72d0832a604263e90ad65cc81f1bae6b56f08aeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mutation.rs: FileTooLong \u2014 535 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 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":"crates/output/src/mutation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"305866b64b6a7ac08e8b3452fa63f385ab116d3807825af29bf7424378748634"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/similar_code.rs: FileTooLong \u2014 535 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 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":"crates/output/src/similar_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f0ee3230e9627221a637fe7d6cd148e1ebe9baf5e4d7f54e356e63ae9fc043"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: fallow_mcp::tools::trace: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\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":"crates/mcp/src/tools/trace.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0f25109bcc8599a9b35bf22c2e2fe8d9cebb5294e6cd397ce601b2ff2ec765"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticFactView: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"crates/types/src/extract.rs"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0cb1c0ea61f3b3ecfbe141ba02c36fbd07ec4c4396b861a2947e58f7212b69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FallowLspServer: TooManyFields \u2014 32 stored fields beside 25 methods. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daf71c59c31a3e6df4085731a4ef0a17601c5a4bd542329266cb42b761b260a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: license/mod.rs: FileTooLong \u2014 531 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 40 free functions. 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":"crates/cli/src/license/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38116a6f6f7f20b88d638f69089377e102582c6d300eae4fe57dc5b4105b91f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_analytics/preprocessor.rs: FileTooLong \u2014 531 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 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":"crates/engine/src/health/css_analytics/preprocessor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe786368b877ddb4bda8462dc44e87a2fc6448dff7c1e6925e1734052edc2db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/types.rs: FileTooLong \u2014 530 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 30 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":"crates/graph/src/graph/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c0e68b6e1ff7842610ddbd8cb7d221765bf7eacc5ac4c69f93280f1abfccd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: download.downloadBinary: FunctionTooLong \u2014 downloadBinary runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"editors/vscode/src/download.ts"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f73667a54ac78d5b69ab54eb23e32733e5cf667e1e45df18f11cfb62ca5e2b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/effective_severity.rs: FileTooLong \u2014 527 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 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/effective_severity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df756d45c7d043b875c7e639283d5cea1ba12fefb0fec089292009cd4068d45a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: regression/baseline.rs: FileTooLong \u2014 525 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 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/regression/baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e93f1eb7cebeab362e7270d4555fa33c7d87e5d195f9ebc4572563cf411088"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mutation_cli.rs: FileTooLong \u2014 524 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 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/mutation_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ea020ed6f467b314ebcd64a040332c407f65073e5d00166da8f40aba0c2a51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_analytics/near_duplicates.rs: FileTooLong \u2014 524 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 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/near_duplicates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"026d013d86f6c573cf4582eba4bc313467f3157634354a6415d19a89e8d2cad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_extract::cache::conversion::cached_to_module_opts: FunctionTooLong \u2014 fallow_extract::cache::conversion::cached_to_module_opts runs 104 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 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d83dbe66f320d9ef2a271b8346a62beb61347cbff6df87136420ba9212a5a91"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BaselineFilterContext: ClassTooLong \u2014 415 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), 19 methods, 2 blocks, lines 1692-2220. The bar is 400 significant lines; this is 15 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":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dade18cb86675cccb9fe195c5af62c583f4290f4b8f372393b288dbf1a34417"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/ego.ts: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ba23331c610a1e0fd32ce4a27cea1c52487a58614fa81483f2198162fca077"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/visit_impl_scope_bindings.rs: FileTooLong \u2014 512 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: ModuleInfoExtractor (124-761). The bar is 500 significant lines; this is 12 over it, 1.02\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":"crates/extract/src/visitor/visit_impl_scope_bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9040d8e9b28c289ba12c6ec497eb41b917e6092c71b056f9367d59eeff00b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analysis.rs: FileTooLong \u2014 512 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 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4c5a3dc4aba0e3732c923af2d215a332d02117a02c3222b6db311efa66d008"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/effect_facts.rs: FileTooLong \u2014 511 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: Collector (2 blocks, 108-667). The bar is 500 significant lines; this is 11 over it, 1.02\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":"crates/extract/src/effect_facts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5242eaedeb16c1f03461a4c3baf9f35be7c7bf191d07a89e1a7c0921a15df28e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_extract::cache::conversion::module_to_cached_payload: FunctionTooLong \u2014 fallow_extract::cache::conversion::module_to_cached_payload runs 102 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 2 over it, 1.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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e64c70f358a4bc8e9d2804082e4cf1ff6d6efab3f6c87b391dc53398096522"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: duplication_detector/near.rs: FileTooLong \u2014 509 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 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/duplication_detector/near.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d490c63a01da61cb2b15c7560ccc5d045a26a05b1182bd75bad29b677aded641"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: similar_code/cache.rs: FileTooLong \u2014 505 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 5 over it, 1.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":"crates/api/src/similar_code/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"705a54b9537b972e485abd0f1a5853639fa8d5c32472c68b20a7a95ab5aa0ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fallow_cli::onboarding::build_recommendation_from: FunctionTooLong \u2014 fallow_cli::onboarding::build_recommendation_from 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":"crates/cli/src/onboarding.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de7a148477c3bb6cc20012849a29e8a7343a92842c6b906fc7f1b87434d67d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analysis_sarif.rs: FileTooLong \u2014 503 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 3 over it, 1.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":"crates/output/src/analysis_sarif.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca36a269bd67f6d478601c0e095be060c84eaa7002d41014c1d1884013ea57f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/shared.ts: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.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":"viz-frontend/src/graph/shared.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b6190fcc5a38c1f7ade3bb070305f8cfdd8a15a22cc41ce4934a97ea7e8a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.ts: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: init (87-643). The bar is 500 significant lines; this is 3 over it, 1.01\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":"viz-frontend/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76d32f8e81982a911fb8cb8d8e12608229c485dadddc65a9b3ea155b449fec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: health/coverage_intelligence.rs: FileTooLong \u2014 501 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 1 over it, 1.00\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":"crates/engine/src/health/coverage_intelligence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"200ea8effd2728ad5cb9a0ee58de1a7db6ddfc79436e4732bea3151b9c20bdf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/extract/src/sfc_template/shared.rs:358-392 | crates/extract/src/sfc_template/shared.rs:394-424 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_template/shared.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05657c6f91015e00bdc65050dc91d88b32f6f297c71914ecbd81bcbf18aca3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/engine/src/health/css_analytics/theme_tokens.rs:21-44 | crates/engine/src/health/css_analytics/theme_tokens.rs:56-86 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/theme_tokens.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d67d8fa7301931e4c3de00dec0c9be1e2a5f7ffb27a0b83b9f70a9071a94375"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/core/src/plugins/config_parser.rs:352-375 | crates/core/src/plugins/config_parser.rs:539-557 | crates/core/src/plugins/config_parser.rs:603-635 | crates/core/src/plugins/config_parser.rs:646-677 | crates/core/src/plugins/config_parser.rs:687-713 | crates/core/src/plugins/config_parser.rs:765-784 \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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b14c2bdc30a87166ace690cf0388f9552ff48422dba88e207fa0a76c5fe685"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/cli/src/flags.rs:158-271 | crates/cli/src/suppressions.rs:41-92 | crates/cli/src/trace_chain.rs:45-110 | crates/cli/src/trace_error.rs:41-78 | crates/cli/src/trace_path.rs:40-96 \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":"crates/cli/src/flags.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c1f407e30c9cd740953c224039ffe87b9976fea85cf8d39c8df921730bb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/cli/src/bin/stub_sidecar.rs:131-177 | crates/cli/src/bin/stub_sidecar.rs:181-238 | crates/cli/src/bin/stub_sidecar.rs:240-313 | crates/cli/src/bin/stub_sidecar.rs:318-348 \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":"crates/cli/src/bin/stub_sidecar.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6620e4ce58fb2a4fb72f0dbca30e3a2b21e31a05593d715a3a3913b39f46398e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/cli/src/report/human/check.rs:3221-3273 | crates/cli/src/report/human/check.rs:3282-3320 | crates/cli/src/report/human/check.rs:3329-3356 | crates/cli/src/report/human/check.rs:3411-3439 \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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d011d428f070abf727f4c3ea39384645bb5424b908b30ee9edb2aae3c742d660"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/core/src/analyze/members/factory.rs:18-51 | crates/core/src/analyze/members/fluent_chain.rs:47-85 | crates/core/src/analyze/members/fluent_chain.rs:108-146 | crates/core/src/analyze/members/typed_property.rs:14-48 \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":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef6db18231214e12a510023787fb4d498d18c2b8468f3c32771804fab6df251"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/core/src/analyze/unused_component_emit.rs:43-75 | crates/core/src/analyze/unused_component_input.rs:55-88 | crates/core/src/analyze/unused_component_output.rs:52-85 | crates/core/src/analyze/unused_svelte_event.rs:42-82 \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":"crates/core/src/analyze/unused_component_emit.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4128396e4eb75b290c7ea48ec9fa8717aa38518ce232f2317d72bac0e64ff9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/changed_files.rs:157-180 | crates/engine/src/changed_files.rs:183-209 | crates/engine/src/changed_files.rs:226-264 | crates/engine/src/changed_files.rs:603-625 \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":"crates/engine/src/changed_files.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"510dd7844404579e885f3a8520035ef13b7ea8a4d429ab9426e93fc31e66fa6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/effective_severity.rs:483-605 | crates/engine/src/effective_severity.rs:616-734 | crates/types/src/identity.rs:440-569 | crates/types/src/results.rs:829-981 \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":"crates/engine/src/effective_severity.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef45a7ea7ac7015c5ad03b6a3d983d84f7f62719a7867b09c5a6a52ef29d5ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/health/result.rs:291-319 | crates/engine/src/health/result.rs:324-355 | crates/engine/src/health/result.rs:360-394 | crates/engine/src/health/result.rs:447-478 \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":"crates/engine/src/health/result.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eecbfd2ed51fd83b41ac7fe801becb8c16af70c216ea9f1ec5b09bec64f9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/extract/src/css_in_js/tokens.rs:1110-1205 | crates/extract/src/css_in_js/tokens.rs:1327-1396 | crates/extract/src/css_in_js/tokens.rs:1558-1612 | crates/extract/src/css_in_js/tokens.rs:1729-1813 \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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5c4a444b59652b3a1efe0414288a720829a29289e76506141ca034c872e184"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/extract/src/visitor/visit_impl.rs:1474-1552 | crates/extract/src/visitor/visit_impl.rs:1575-1614 | crates/extract/src/visitor/visit_impl.rs:1810-1817 | crates/extract/src/visitor/visit_impl.rs:1966-1974 \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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e563023758c3b6764bb6473fd5ee67b194cb3119c2ec11ac41c5d455b9236e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/napi/src/lib.rs:474-501 | crates/napi/src/lib.rs:507-551 | crates/napi/src/lib.rs:612-632 | crates/napi/src/lib.rs:638-685 \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":"crates/napi/src/lib.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6505668a82f74a2214c48899df51f7f6b525706a16546060cc6e08af29415034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201354 lines \u00D7 2): crates/api/src/audit_keys.rs:173-216 | crates/api/src/audit_keys.rs:653-706 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/audit_keys.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0201da0479997148ae6032fbfbe7a870ea2446ef199710e646c19d20a7d237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201354 lines \u00D7 2): crates/engine/src/effective_severity.rs:504-557 | crates/engine/src/effective_severity.rs:637-686 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/effective_severity.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baa46b9dd1291b699310a0d364ea310c15f3a1960084df93f12b06287c8239e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49\u201350 lines \u00D7 2): crates/core/src/lib.rs:302-350 | crates/engine/src/discover.rs:319-368 \u2014 before extracting anything, compare \u0060crates/core/src/lib.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 80 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":"crates/core/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f64f2f14227470c594f9921cd4364430a4ca1f7ad3b5f7ec7c59044d76765a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 2): crates/api/src/lib.rs:1275-1311 | crates/engine/src/health/mod.rs:612-647 \u2014 before extracting anything, compare \u0060crates/api/src/lib.rs\u0060 and \u0060crates/engine/src/health/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 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":"crates/api/src/lib.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"96492514087e664cc09636becc6a0b376670cb24914cfb5a2d4b33aeed1d349b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/api/src/lib.rs:533-568 | crates/cli/src/check/mod.rs:170-205 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/lib.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af1509a069eb8691c64ccdbebe36ad517a31d5ab8e0eb23bc62b44f727e34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/api/src/audit_keys.rs:1478-1512 | crates/engine/src/changed_files.rs:710-744 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/audit_keys.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8fb900973a4560e57e0c3023c659dfa21ecc1a210f99dafec875c6857613ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/api/src/lib.rs:595-626 | crates/cli/src/check/mod.rs:132-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/lib.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"117aa1848d65ccac9de3e4c1382b90623fc6d211832fb88db5605c77f8059ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/cli/src/dispatch.rs:1295-1324 | crates/cli/src/dispatch.rs:1407-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/dispatch.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ce101349854a4204ff0c0fcf545dced59b86405fbabc45f8cd6973926be973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 4): crates/engine/src/effective_severity.rs:484-512 | crates/engine/src/effective_severity.rs:617-645 | crates/types/src/identity.rs:443-471 | crates/types/src/results.rs:830-858 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/effective_severity.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd978fdd3ea9db0a405fc666a7fc10845339b7ea77bafe34a1b1768ed0bd0138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): crates/core/src/scripts/mod.rs:1821-1847 | crates/engine/src/discover.rs:740-768 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/mod.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94d8c27e7df4c4e18a52b3cf2b470d91b8a696167a58067d6430a0c6f595d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/core/src/scripts/shell.rs:423-451 | crates/engine/src/discover.rs:680-708 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/shell.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d515379a8c16bb94c7e650aa1cbfecdb903e6ffdb80f1ef9f9750e2c2113ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/cli/src/security.rs:258-284 | crates/cli/src/security.rs:306-332 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/security.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"843ae9bee03cd9e9c362f6ebcfc968f281425729773c886eba0f07b9a98f8488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/api/src/lib.rs:1319-1343 | crates/engine/src/health/mod.rs:727-751 \u2014 before extracting anything, compare \u0060crates/api/src/lib.rs\u0060 and \u0060crates/engine/src/health/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 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":"crates/api/src/lib.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef0462da36a77b55f2ed600362bbe9bc612456dd6bb01a6fbabd7128aed9bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/core/src/analyze/unused_load_data_key.rs:145-168 | crates/core/src/analyze/unused_load_data_key.rs:231-255 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/unused_load_data_key.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"430bca2c23148ef9918b36de33271baf5b2b805a35983e68c1b7957f6742e2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/core/src/discover/mod.rs:259-283 | crates/engine/src/discover.rs:489-513 \u2014 before extracting anything, compare \u0060crates/core/src/discover/mod.rs\u0060 and \u0060crates/engine/src/discover.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdd0c69b19cb142d30cb97b5884093b27280593abc495ebe14a3e5a10bf29d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/extract/src/template_complexity/mod.rs:254-278 | crates/extract/src/template_complexity/vue.rs:154-178 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_complexity/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1bf8d540fb24793be99b18ac31425728bdecc13ab7336730f38443c7d326ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/core/src/analyze/unused_component_input.rs:197-220 | crates/core/src/analyze/unused_component_output.rs:176-197 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/unused_component_input.rs\u0060 and \u0060crates/core/src/analyze/unused_component_output.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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":"crates/core/src/analyze/unused_component_input.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"374cb033a4f702aa869eca98bb3eb9c825b1dbd22e01ec018352c4243e0c533a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/types/src/workspace.rs:1025-1048 | crates/types/src/workspace.rs:1086-1109 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/workspace.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6956bf84ade9b194b9a5977e5e646d910b33cd4e639e480ec75116d8ef4681a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/core/src/analyze/mod.rs:402-424 | crates/engine/src/public_api.rs:129-151 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/mod.rs\u0060 and \u0060crates/engine/src/public_api.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"39037e5a9c8e9b93121e9c3e22ee325b36761ce0eeb6c3aada6295638d4673c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/core/src/analyze/unused_load_data_key.rs:485-507 | crates/extract/src/parse.rs:222-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_load_data_key.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535b7102c86d8903c7cb71998b3c95a8ae45f2adb658a20d5bde07b79ec1ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/cli/src/fix/catalog.rs:215-236 | crates/cli/src/fix/catalog.rs:645-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/fix/catalog.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aef8f2375930d6566ecf11c1dff1af14fd0f3bc565fd205a5b635336cc561a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/core/src/analyze/mod.rs:350-371 | crates/engine/src/public_api.rs:29-50 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/mod.rs\u0060 and \u0060crates/engine/src/public_api.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73e5e487e8578ced503ab62a3f303f43f858cacd7b6df8630aa6bdf2d2abafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/extract/src/cache/conversion.rs:570-591 | crates/extract/src/cache/conversion.rs:705-726 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae47c9ece8f2fee85471214467fb97c6a1940990d35d916c0e46bc04c2dfe9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/extract/src/sfc_template/shared.rs:361-382 | crates/extract/src/sfc_template/shared.rs:395-416 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_template/shared.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c54264ee823af8c8de15be368daebdc88430ed1e936c07607d09d32cbcbd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/graph/src/graph/mod.rs:554-573 | crates/graph/src/graph/test_reach.rs:288-309 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aca9d074df3d33611eb96f3c83968cd280ea3b7f12ccd5225e56a3eced2935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/graph/src/graph/mod.rs:596-617 | crates/graph/src/graph/test_reach.rs:337-357 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2179b55635e2ff893f2801e28ee71a34cbc455e48fba196306da3335a5862f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/mcp/src/tools/semantic.rs:18-39 | crates/mcp/src/tools/semantic.rs:93-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/semantic.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e5013621cf61e7431f9e59f0706cefcff15a55fcaaabf95bdc119c0719b42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/mcp/src/tools/fix.rs:26-46 | crates/mcp/src/tools/fix.rs:53-73 \u2014 both copies are in the same file, so extract the block 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":"crates/mcp/src/tools/fix.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bafaf03030166411ce698c65ff438513d84c369a6e4586cec0aeb117d7efa77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/api/src/type_aware/client/mod.rs:2121-2140 | crates/api/src/type_aware/client/mod.rs:2143-2162 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ef813a2094c9fe93f85759a23cbf3b108f7331a5210626baa99897d9b1c67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/api/src/type_aware/mod.rs:81-100 | crates/api/src/type_aware/mod.rs:144-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":"crates/api/src/type_aware/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4089fa497064816cfc874413cbd3706d0cbdbebc064eb91de97bded4b592a8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/cli/src/agent_install/guide.rs:170-187 | crates/cli/src/agent_install/guide.rs:206-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/agent_install/guide.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3492620384a5c600f69178d341f6a577bbcf0d0f46cb23aa7e4bc647dbb96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/config/src/workspace/pnpm_catalog.rs:562-580 | crates/core/src/analyze/unused_catalog/mod.rs:765-784 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/pnpm_catalog.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc869b081e9d21fa7bc83cfdf2a32b57bac775b95a84ffef7d8836faf4b1ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/core/src/scripts/shell.rs:170-189 | crates/engine/src/discover.rs:590-609 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/shell.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeec3cdf5565a5d99ade01a2f0b26d6eaa69c6b424b20e2e004b88a58cb7e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): crates/extract/src/sfc_props.rs:160-179 | crates/extract/src/sfc_props.rs:651-665 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef34cb434d5b1ff4022c6164d0028334259ed4443434a8764cf02a10cf33d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/extract/src/template_complexity/engine.rs:634-653 | crates/extract/src/template_complexity/engine.rs:740-759 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e543c34449457926aa77fdfe335ece911db1a086a31adf5c4e599c520c0a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/graph/src/graph/re_exports/propagate.rs:794-813 | crates/graph/src/graph/re_exports/propagate.rs:867-886 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/graph/re_exports/propagate.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"03027a1d8fe92c529d541dffc3181dbe4a7c2206a4ce2c5719dec02df188072e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/extract/src/css_in_js/tokens.rs:1148-1166 | crates/extract/src/css_in_js/tokens.rs:1364-1382 | crates/extract/src/css_in_js/tokens.rs:1580-1598 \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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"388b8851e4238b632024a14025f0eee64d8c5966163a38fc55ea5fccf931939f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/core/src/analyze/policy/mod.rs:553-571 | crates/core/src/analyze/policy/mod.rs:596-614 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/policy/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d14c2c69e9f0d83d837d42ab18c7a48f10ba242ba89d47c206e2d8234e27bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): crates/core/src/discover/infrastructure.rs:218-231 | crates/core/src/discover/parse_scripts.rs:128-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/infrastructure.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0e8139e03b62060e679e1fe6983d82dd3200e67bc2a9f9bca9665d59c86aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/core/src/lib.rs:367-384 | crates/engine/src/discover.rs:387-405 \u2014 before extracting anything, compare \u0060crates/core/src/lib.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 80 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":"crates/core/src/lib.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"34789ec175358ad03429afd280c497284c16014dec5c3d6717861643dcec1547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/core/src/scripts/shell.rs:322-340 | crates/engine/src/discover.rs:624-642 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/shell.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 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":"crates/core/src/scripts/shell.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"45012925d572cb3a28fd6ea40739452ba9d75a2ebe0460048aad5986a0bfc9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:393-411 | crates/extract/src/css_in_js/tokens.rs:2942-2960 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"06918961205ad79ea3b6c77d75bc692293256da4f4b34294f85dce9b840ed98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/extract/src/sfc_template/angular.rs:677-693 | crates/extract/src/sfc_template/angular.rs:934-952 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3f99b86748ea8b729ea0be9908fc07680572ffb6a0b010898105f07987d29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/mcp/src/tools/dupes.rs:174-192 | crates/mcp/src/tools/trace.rs:378-396 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/dupes.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"499d47a76ee8910f5aa691f8f599d727f71e2a57be998929278660a0b21ee8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/cli/src/trace_chain.rs:120-137 | crates/cli/src/trace_dependency.rs:158-175 | crates/cli/src/trace_path.rs:99-116 \u2014 before extracting anything, compare \u0060crates/cli/src/trace_chain.rs\u0060 and \u0060crates/cli/src/trace_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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":"crates/cli/src/trace_chain.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"11590e0ff8b26534ed6d843015c85690e854b5991bc81c800928e0c6e3b11771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/mcp/src/tools/analyze.rs:68-85 | crates/mcp/src/tools/audit.rs:125-142 | crates/mcp/src/tools/inspect_target.rs:31-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/analyze.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd7311397d04f9ef69499d9a032702cf4d1d1b665c05071a1f63e1ef997c466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/cli/src/report/human/health.rs:817-834 | crates/cli/src/report/human/health.rs:851-868 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/human/health.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"439f41c434d30bfb7dddc4c7a0f5c0c3c9c56b9e8a17d74a36ee5730c59a3e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/cli/src/trace_error.rs:49-66 | crates/cli/src/trace_path.rs:41-58 \u2014 before extracting anything, compare \u0060crates/cli/src/trace_error.rs\u0060 and \u0060crates/cli/src/trace_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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":"crates/cli/src/trace_error.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a24d7ed6069e5b0b278b01e26670e89a4e8f3fc79996a1404de10f9e93eeacf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/core/src/analyze/mod.rs:320-337 | crates/engine/src/public_api.rs:332-349 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/mod.rs\u0060 and \u0060crates/engine/src/public_api.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1c466ae64be6bb75cff811bca5b428405b3f9542e36f0aa99ecc5b50b4708e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/core/src/analyze/predicates/import.rs:156-173 | crates/graph/src/resolve/path_info.rs:11-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/predicates/import.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cace7b49a886510ab3091a69068b015d3bbb7bbac4eee1abe45dbee79f8c50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/core/src/analyze/react_intel.rs:145-159 | crates/core/src/analyze/render_fan_in.rs:135-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/react_intel.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d001318890ad3391607c92c1ccdede6c870653daf21375a7eec1d3fc0038d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/core/src/scripts/mod.rs:2832-2849 | crates/engine/src/discover.rs:771-788 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/mod.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd7501789d71d35d3f56edcd121f775a2b7b0a917354b9738a119821e261f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/vital_signs.rs:360-377 | crates/engine/src/vital_signs.rs:391-408 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/vital_signs.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6794e669f469e1cc41bcfa9d5325d13fe2e7f66814ad7be66892a493301cb92f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/extract/src/css_in_js/object.rs:305-322 | crates/extract/src/css_in_js/tokens.rs:2910-2925 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_in_js/object.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1352272c835c7761ef7e3f977655b841a3528c33be27364cd52e048b403b4921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/lsp/src/code_actions/quick_fix.rs:456-473 | crates/lsp/src/code_actions/quick_fix.rs:689-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":"crates/lsp/src/code_actions/quick_fix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c383279369708e61a2884c1e852ec58d709de7ba84c5f62d21a592ca138a867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/mcp/src/tools/dupes.rs:148-165 | crates/mcp/src/tools/trace.rs:419-436 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/dupes.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5a012452c040f54026ee1a12eaa9b388f00e00134f7d62ec152693d82cfa59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/types/src/workspace.rs:898-915 | crates/types/src/workspace.rs:1100-1117 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/workspace.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1c5c2aa35f3974f7fc0ec68af270b16fa3f705315bfc46408c979c53e0ab8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/types/src/workspace.rs:910-927 | crates/types/src/workspace.rs:975-992 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/workspace.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4f23c712a869cb7f407ca30ddd6bac9356941efbd5bbc25cdf523e768eb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/mcp/src/tools/impact.rs:93-108 | crates/mcp/src/tools/trace.rs:195-211 | crates/mcp/src/tools/trace.rs:222-237 \u2014 before extracting anything, compare \u0060crates/mcp/src/tools/impact.rs\u0060 and \u0060crates/mcp/src/tools/trace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"crates/mcp/src/tools/impact.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12abad056363aad893368b44d24735ee6e8c53698dbde5bd2274b874d1ed6c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/api/src/type_aware/mod.rs:47-63 | crates/api/src/type_aware/mod.rs:124-139 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/type_aware/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"992215763c841483d19e9afd2fb4b13ceebc8d627f6b884c26aee03321d3699b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/config/src/workspace/npm_overrides.rs:354-370 | crates/config/src/workspace/pnpm_overrides.rs:359-375 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/npm_overrides.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"211890056530c6c835335a4a7c9a4ec5dfcf4610be8e512b16f851938cb59e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/core/src/analyze/members/fluent_chain.rs:69-85 | crates/core/src/analyze/members/fluent_chain.rs:130-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/fluent_chain.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aec4e29dcf439a6948249e6679a9db6fbc4e5077dbf68d0655eec82b1502e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/core/src/analyze/members/mod.rs:704-720 | crates/core/src/analyze/members/mod.rs:1155-1171 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35ecc4ab3fd5f9f51f2dd7950800b7d136a210facfc26d33199a74ea7b1b886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/engine/src/health/css_analytics/near_duplicates.rs:121-137 | crates/engine/src/health/css_analytics/near_duplicates.rs:188-204 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/css_analytics/near_duplicates.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"376d8ecabf6948da10e1c2adcd67a74dd83b5e527ce3ac062bd6287ee161c8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/extract/src/template_complexity/engine.rs:569-585 | crates/extract/src/template_complexity/engine.rs:689-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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecf29fa9d8d04ae421dcc0fe7115653b7a647c266d3e659fd33148fb2da5337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/graph/src/graph/re_exports/propagate.rs:775-791 | crates/graph/src/graph/re_exports/propagate.rs:848-864 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/graph/re_exports/propagate.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0706a5bc22a2078a658745a92dc3fa890aeed3d6668b441a7c1a7816e719df0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/mcp/src/tools/mod.rs:564-580 | crates/mcp/src/tools/mod.rs:586-602 \u2014 both copies are in the same file, so extract the block 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":"crates/mcp/src/tools/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4403eee54ab2bdb940e8665715cd03feb96054648c3c508072075c57280bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/types/src/output_dead_code.rs:1083-1099 | crates/types/src/output_dead_code.rs:1161-1177 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/output_dead_code.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9eae60964403d44dbb27fbbdf11ca4b0f1b05165b053968760d4b4106cb12b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/types/src/workspace.rs:762-777 | crates/types/src/workspace.rs:1031-1046 | crates/types/src/workspace.rs:1092-1107 \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":"crates/types/src/workspace.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7662203e30cc8a51eaf481afd22c77251eb0ab741b857df34811121f5b5aa4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1751-1766 | crates/output/src/dead_code_sarif.rs:1083-1098 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"852c29cef1904cae0fe86815fb895d96caf17808f1b769c8bbda7b21ea05c1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/api/src/type_aware/client/mod.rs:940-955 | crates/api/src/type_aware/client/mod.rs:1309-1323 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a261c5b88eacf095c94de83797c839b5b9e92275f06c2a1ba760322f8b4b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/cli/src/check/output.rs:86-101 | crates/cli/src/check/output.rs:124-139 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/check/output.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c6d9b2f59f87fd1d89207959efbe765cab659edff9ee926e9d0b7e46230391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/cli/src/ci_pr_comment_post.rs:83-97 | crates/cli/src/ci_pr_comment_post.rs:145-160 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci_pr_comment_post.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c0b9d95e1ea34b3903c4e6ef0dbd5ea5d87fd1849df374a87e425093052b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/cli/src/dispatch.rs:451-466 | crates/cli/src/dispatch.rs:503-518 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/dispatch.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79e6110e1f8bddb9d5365e4845906334f0f3fd85ac6f5b871d7369a0fec24e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/cli/src/fix/catalog.rs:109-124 | crates/cli/src/fix/catalog.rs:508-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":"crates/cli/src/fix/catalog.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bba05e980c8f75192d3e30b6213232683f067f5b8a27d3910d1fe5e4488020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/cli/src/flags.rs:725-740 | crates/cli/src/suppressions.rs:200-215 \u2014 before extracting anything, compare \u0060crates/cli/src/flags.rs\u0060 and \u0060crates/cli/src/suppressions.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/cli/src/flags.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b980fc723fc6877eee69aac4d6ef6a99216ff3ee80c9f175834841854b68596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/cli/src/impact.rs:1023-1038 | crates/cli/src/impact.rs:1096-1109 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/impact.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bdd7264276fa7df3337c8b30f5593f77effabee6d49ac3d11e489278ff4f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/config/src/config/mutation.rs:62-77 | crates/mutation/src/operator.rs:63-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/mutation.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fd260a004bddcf4d47805feddda393381be04cbe15bdae66780562720699e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/duplication_detector/tokenize/mod.rs:164-179 | crates/engine/src/duplication_detector/tokenize/mod.rs:190-205 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/duplication_detector/tokenize/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"133e40d3c1592717cca4b9f6323ab0aed4198de6282b8b21f7e359c01688331b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/health/component_rollup.rs:105-120 | crates/engine/src/health/findings.rs:560-575 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/component_rollup.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"37092270f5b774796922b3b363fdf7162ec23b8e6a3ac0bb285f26fe462e7b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/health/css_analytics/cva.rs:220-235 | crates/engine/src/health/css_analytics/mod.rs:691-706 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/cva.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"917bf8f64221adc9f989760967271da711300db689f43c09a9686c8acc65fc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/extract/src/template_complexity/engine.rs:627-642 | crates/extract/src/template_complexity/svelte.rs:668-682 \u2014 before extracting anything, compare \u0060crates/extract/src/template_complexity/engine.rs\u0060 and \u0060crates/extract/src/template_complexity/svelte.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeacb0b62ac8981663fe6fb96a5ed23a2e8529ab5279ad92f8ec1f76b86f701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/graph/src/resolve/specifier.rs:506-521 | crates/graph/src/resolve/specifier.rs:771-783 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd5b241a9212505fee56db16cd38dd3bc8e3e5b610e91ebb3dc4edef642e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/core/src/analyze/policy/gdp.rs:304-318 | crates/core/src/analyze/policy/mod.rs:553-567 | crates/core/src/analyze/policy/mod.rs:596-610 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/policy/gdp.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa33307c9d1d8b1731f1d38cd05af07313f2eba04929b912aa48c3613be90df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/core/src/analyze/policy/mod.rs:518-532 | crates/core/src/analyze/policy/mod.rs:559-573 | crates/core/src/analyze/policy/mod.rs:602-616 \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":"crates/core/src/analyze/policy/mod.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdf37d69ef5bd01a9fb66525316a00038ae6d5038ddcb3d2df8eb0e9ccf2a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/cli/src/report/badge.rs:38-52 | crates/cli/src/report/badge.rs:94-108 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/badge.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4b8ee6fab6ca26f07deaa3e53b96e988e313f64156efd7598fcd16809a677b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/analyze/mod.rs:298-312 | crates/engine/src/public_api.rs:352-366 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/mod.rs\u0060 and \u0060crates/engine/src/public_api.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b40c70dbb4fd29892203e0d8d32b3a76df36f108be017d41d6b843b68cf8a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/analyze/unused_component_input.rs:56-70 | crates/core/src/analyze/unused_component_output.rs:53-67 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/unused_component_input.rs\u0060 and \u0060crates/core/src/analyze/unused_component_output.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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":"crates/core/src/analyze/unused_component_input.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bc8830d83ae1a278ebf43882d3699cde0b035ff337ecb012cf20b8b966f421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/discover/entry_points.rs:447-461 | crates/engine/src/public_api.rs:289-303 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"76470b6692bd7c591d513c7bdc395fbeae18e5ffb7d3ebf143570a8d16d00375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/lib.rs:1619-1633 | crates/engine/src/session.rs:1399-1413 \u2014 before extracting anything, compare \u0060crates/core/src/lib.rs\u0060 and \u0060crates/engine/src/session.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"crates/core/src/lib.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72750cbcfc15aabe545f0061c27e84aa9fd0c883b05aef2f3c5d7cc4c9fb626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/plugins/module_federation.rs:676-690 | crates/core/src/plugins/module_federation.rs:751-765 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/module_federation.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6011e5d6639c59242a9060969a3626ba286b66e9ebdf3c7e53826a66dc8f326b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/scripts/mod.rs:1804-1818 | crates/engine/src/discover.rs:730-744 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/mod.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"866740534ecbf5f252df5dc674e86d78b524ef822b2a11404045f7bbc3e53205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/health/css_analytics/theme_tokens.rs:23-37 | crates/engine/src/health/css_analytics/theme_tokens.rs:60-74 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/css_analytics/theme_tokens.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"04467d994fecac73c0224ebcf5344f1f1662755ea18e8546d61b6eefa71144e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:1129-1143 | crates/extract/src/css_in_js/tokens.rs:1561-1575 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8849679fe4d31b09996199f4e629ae284b7a8c4a6bc4fa675daf77808a109f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/lsp/src/code_lens.rs:149-163 | crates/lsp/src/hover.rs:919-930 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/code_lens.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba7d91646c38c18da8bb0be32bcd9e2f4461a06a68dbf0f486e4444a88041c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 9): crates/mcp/src/tools/analyze.rs:66-79 | crates/mcp/src/tools/architecture.rs:51-63 | crates/mcp/src/tools/audit.rs:123-136 | crates/mcp/src/tools/code_mode_tools.rs:643-655 | crates/mcp/src/tools/dupes.rs:59-72 | crates/mcp/src/tools/flags.rs:58-71 | crates/mcp/src/tools/inspect_target.rs:29-41 | crates/mcp/src/tools/semantic.rs:20-32 | crates/mcp/src/tools/semantic.rs:95-107 \u2014 there are 9 copies across 8 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/analyze.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1b23b142b809fe02a475f4f3325ed3482ee06e03fe7d17b49f0676bffbf3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/cli/src/bin/stub_sidecar.rs:164-177 | crates/cli/src/bin/stub_sidecar.rs:225-238 | crates/cli/src/bin/stub_sidecar.rs:300-313 | crates/cli/src/bin/stub_sidecar.rs:335-348 \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":"crates/cli/src/bin/stub_sidecar.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ffcf75a7712e5e99c1f0a7d00097677c121986d073e5a44c4a030e2bb7feec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/core/src/analyze/react_intel.rs:143-154 | crates/core/src/analyze/render_fan_in.rs:95-108 | crates/core/src/analyze/render_fan_in.rs:133-146 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/react_intel.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ab2000428946e9fa9ff81f8e24d5be9e1a9fb657add6f9da337fd49293908d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/api/src/markdown_output.rs:24-37 | crates/cli/src/report/human/health.rs:1175-1188 \u2014 before extracting anything, compare \u0060crates/api/src/markdown_output.rs\u0060 and \u0060crates/cli/src/report/human/health.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"crates/api/src/markdown_output.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"69df9786ff9cf510cda77108044d4d64c38ea28dde6ba5cbadda71d999d3767d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/src/check/mod.rs:1641-1654 | crates/cli/src/dispatch.rs:2475-2488 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cde505b43237d15e162aa72c0a063ba1f879965a1963982648d22cc5193ca1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/src/dispatch.rs:1024-1037 | crates/cli/src/dispatch.rs:1055-1068 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/dispatch.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d48bb1d6514e7c926681d957247fd80882315631bea67745e5e2f49eac4ce27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/core/src/analyze/unused_component_prop.rs:123-136 | crates/core/src/analyze/unused_component_prop.rs:271-283 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/unused_component_prop.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e79231169eed7b8dfdffdc704f0c2146f7f048a23a8816603a10f05056c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/discover/mod.rs:50-63 | crates/engine/src/discover.rs:423-436 \u2014 before extracting anything, compare \u0060crates/core/src/discover/mod.rs\u0060 and \u0060crates/engine/src/discover.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/mod.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"912facd57ec3199838e42febd096af5a205e69090ad5fa2af2d1031e6c3c17ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/extract/src/cache/conversion.rs:543-556 | crates/extract/src/cache/conversion.rs:681-694 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"700b235228ae3a5119e899a0061ab3e1f2733d663e7105188b7755b91d1183ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/mcp/src/tools/mutation.rs:163-174 | crates/mcp/src/tools/similar_code.rs:132-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/mutation.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8592f0fe85503c1d2d8f79596e9d0e56180f5782b6d7cea918f9ffbcbd6bb62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 9): crates/mcp/src/tools/impact.rs:95-107 | crates/mcp/src/tools/list_boundaries.rs:55-67 | crates/mcp/src/tools/project_info.rs:55-67 | crates/mcp/src/tools/security.rs:58-70 | crates/mcp/src/tools/suppressions.rs:32-44 | crates/mcp/src/tools/trace.rs:197-209 | crates/mcp/src/tools/trace.rs:224-236 | crates/mcp/src/tools/trace.rs:254-266 | crates/mcp/src/tools/trace.rs:313-325 \u2014 before extracting anything, compare \u0060crates/mcp/src/tools/impact.rs\u0060 and \u0060crates/mcp/src/tools/trace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"crates/mcp/src/tools/impact.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a05dd021ce396dc9b62ba654c30bd9b3e413ab3191f2cd1585a0a8e78960844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/cli/src/health/coverage.rs:919-931 | crates/engine/src/health/component_rollup.rs:106-118 | crates/engine/src/health/findings.rs:561-573 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/health/coverage.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff98895200c3f34305e6bbe73d629b7579f272d24936f7dc2858ef4331d2feb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/cli/src/regression/counts.rs:139-151 | crates/lsp/src/protocol.rs:153-165 | crates/output/src/check.rs:1261-1273 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/regression/counts.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"263ff1c1cf33e38ccc974749b053069b3dfe8978af5d7d007c0ded04811e8bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/cli/src/trace_chain.rs:76-88 | crates/cli/src/trace_error.rs:57-69 | crates/cli/src/trace_path.rs:49-61 \u2014 before extracting anything, compare \u0060crates/cli/src/trace_chain.rs\u0060 and \u0060crates/cli/src/trace_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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":"crates/cli/src/trace_chain.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505ef16922dc5ffcecfcfb78b7a6a9f8dc8c58adefa31d8e5ce7b91d104ad8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/core/src/plugins/contentlayer.rs:70-82 | crates/core/src/plugins/fumadocs.rs:63-75 | crates/core/src/plugins/velite.rs:66-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/contentlayer.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c77a99ac649f0c1327899c9a9824121d072f70cdbea8dc34e685bc4b265182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/engine/src/health/css_analytics/cva.rs:219-231 | crates/engine/src/health/css_analytics/markup_scan.rs:204-216 | crates/engine/src/health/css_analytics/mod.rs:690-702 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/cva.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d455a3dd0000de140ab8cbb583560db86cb3d93b2d4e0d3b674377631b69a240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/api/src/type_aware/mod.rs:101-113 | crates/api/src/type_aware/mod.rs:165-177 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/type_aware/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaaa1efe46f7e81d1203423719670f587078f72f3732ba870d3efc3b3c0e273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/audit_brief.rs:1014-1026 | crates/cli/src/report/human/check.rs:772-784 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit_brief.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd94111558222ef92b67e00dc2147b838bb3ce73bb8d5822aacfd03eae0856e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/flags.rs:527-539 | crates/cli/src/suppressions.rs:107-119 \u2014 before extracting anything, compare \u0060crates/cli/src/flags.rs\u0060 and \u0060crates/cli/src/suppressions.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/cli/src/flags.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa5a3438650e850bc60a91bbc9558d89fc4d851df5e31faf114aab85e4d78f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/cli/src/report/human/dupes.rs:506-516 | crates/engine/src/duplication_detector/families.rs:199-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/human/dupes.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"785726ff9ec54764b8d544722a7546bf37d46a27d30cfaea949b45f2adae38dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/analyze/unused_component_input.rs:72-84 | crates/core/src/analyze/unused_component_output.rs:69-81 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/unused_component_input.rs\u0060 and \u0060crates/core/src/analyze/unused_component_output.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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":"crates/core/src/analyze/unused_component_input.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6cfdc7a2b9591d24ed900029e285234e37599a0bea6e684606c5b4d551b55d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): crates/core/src/scripts/ci.rs:441-448 | crates/core/src/scripts/mod.rs:1197-1209 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/ci.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7572435ed2499a7eaf955ee18f2db324e6ab2bf918c655ed7e31f28400574cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/health/result.rs:497-509 | crates/engine/src/health/result.rs:536-548 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/result.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a693b8428bda29911bfae79b521f0584cad7a74d28c2919aabb9ad08f9ef8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/extract/src/cache/store.rs:271-279 | crates/extract/src/cache/store.rs:282-294 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/cache/store.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b3f4fce1f316a71e56356b3921ba5bdc76fc136cca89343920aaed9241d304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:1450-1462 | crates/extract/src/css_in_js/tokens.rs:1533-1545 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47700af10e1605c41f084648d0da7732a13c93986a6f19d6ade039fc2da09ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/extract/src/parse.rs:880-892 | crates/extract/src/suppress.rs:67-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/parse.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78fed26e0d655e5d48aa697c867a4cb5dfa777709890e70daff109b830448dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/extract/src/visitor/helpers.rs:1519-1531 | crates/extract/src/visitor/helpers.rs:1611-1623 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7760f5cc06446748e5d99e943ef3e6f1d8aebf9d4ed55a7e1f77f5691ea6706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:4712-4724 | crates/extract/src/visitor/visit_impl.rs:5226-5238 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":4712}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9e7c358f4fbd2c827106ae59addf40075359c642fde520d10aeaee1320d04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:6201-6213 | crates/extract/src/visitor/visit_impl.rs:6216-6228 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":6201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51c1bd791605ebf9525e5553e6c9ae8a3c9bce80534228bf6256c7e05a43a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/graph/src/resolve/react_native.rs:170-182 | crates/graph/src/resolve/react_native.rs:222-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":"crates/graph/src/resolve/react_native.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4a9431330d3e14236b2e1449babbc29b49e461101c459e655f00c4604fce7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp/src/tools/security.rs:64-76 | crates/mcp/src/tools/similar_code.rs:180-192 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/security.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4c5bf7feb1c30d90b579e0e72fb5cbaddacf03af160b2097dcf3348410229a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp/src/tools/trace.rs:336-348 | crates/mcp/src/tools/trace.rs:625-637 \u2014 both copies are in the same file, so extract the block 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":"crates/mcp/src/tools/trace.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcb7d86c72135d078b1ad6e4e66b78626c973b72316e687e32543ca94c9647e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): crates/core/src/analyze/members/factory.rs:23-31 | crates/core/src/analyze/members/fluent_chain.rs:52-63 | crates/core/src/analyze/members/fluent_chain.rs:113-124 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8bbb5c0dc4d343244d09e5f99b5ebe92e5313d9fe3993219c66a13b2dc87b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/output/src/dead_code_sarif.rs:292-303 | crates/output/src/dead_code_sarif.rs:316-327 | crates/output/src/dead_code_sarif.rs:340-351 \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":"crates/output/src/dead_code_sarif.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffce23a6170ec9e79bae40a6c4e88f59aaab052d0a9ec89f30bf6a49d827af0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/types/src/workspace.rs:897-908 | crates/types/src/workspace.rs:1038-1049 | crates/types/src/workspace.rs:1099-1110 \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":"crates/types/src/workspace.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c7c233342ddabe27430a0ded6821c196c67109577f5f37c3cae3102eb6a81b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:664-675 | crates/api/src/dead_code_codeclimate.rs:712-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f1deffa399dede6bd3ccab85fa4a3d0e1fb42926b180ec30fec403608be15f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/api/src/runtime/decision_surface.rs:375-385 | crates/cli/src/audit.rs:2085-2096 \u2014 before extracting anything, compare \u0060crates/api/src/runtime/decision_surface.rs\u0060 and \u0060crates/cli/src/audit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"crates/api/src/runtime/decision_surface.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"118f4d09bc5a7363e8747af2bd2e9322c3e1cbc6b6e2ba36199af21eab700441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/api/src/runtime/trace.rs:454-465 | crates/api/src/runtime/trace.rs:475-484 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/runtime/trace.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1008becdced296c70c337ed260c4fa27dc732f661b8054c0e521cf4625730a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/api/src/similar_code/mod.rs:347-357 | crates/api/src/similar_code/transport.rs:311-322 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/similar_code/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"343d603f9ae9a8fd39b2a8bf50160ba8f1f5c42a2730b1301c92b6e830d16944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/audit_output.rs:240-251 | crates/cli/src/audit_output.rs:282-293 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/audit_output.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e3dc6d01a28536bf8100c5dd37576665b844ff57ff707ce5aeb17d0d689808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/ci.rs:1193-1204 | crates/cli/src/ci.rs:1739-1750 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a421b87e481c15d7498bf298b17dd35a3018acbeaf9899e55d57843fb65557b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/report/mod.rs:818-829 | crates/cli/src/report/mod.rs:943-954 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/mod.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a025bc78f7a5879768f52ebab027f1da18555b06e236583a315756d600297e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/report/sarif.rs:61-72 | crates/output/src/dead_code_sarif.rs:1325-1336 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/sarif.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6d816866e8bc3e1b2a089e76b2646b9578fadc2cc7e069d75800caa3a3dd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/rule_pack/list.rs:138-149 | crates/engine/src/guard.rs:306-317 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/rule_pack/list.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3442a57f5808fe8e1d276f0d1c57673fea4a17e366c90693c46fe07ae0898955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/telemetry.rs:1922-1933 | crates/cli/src/telemetry.rs:2018-2029 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/telemetry.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"67202fa97addd3bbf9a709caf95883d45493e75c3823ddd302042eb1f1407ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/trace_chain.rs:162-173 | crates/cli/src/trace_chain.rs:176-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/trace_chain.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebda65277a07f2c10f1180065c964156cc572bf374719b0bcd8303669056d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/analyze/unused_deps.rs:1717-1728 | crates/core/src/analyze/unused_deps.rs:1858-1869 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d881286e80ce521621db4fc35435677cda57c54a1952e2f389229daf3c786a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/core/src/lib.rs:241-252 | crates/engine/src/session.rs:1572-1582 \u2014 before extracting anything, compare \u0060crates/core/src/lib.rs\u0060 and \u0060crates/engine/src/session.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"crates/core/src/lib.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ec427c012741b2c757e3da133a6298de86ee44770a795072a43081dac16443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/plugins/config_parser.rs:2769-2780 | crates/core/src/plugins/config_parser.rs:2804-2815 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a0bd32748920c67c412f7e08cf621245729f7a59642b69e8eafbcfee2a78e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/plugins/vitest/mod.rs:838-849 | crates/graph/src/resolve/jsx_runtime.rs:212-223 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/vitest/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e581b7b60532085c4c891ff29d5243b667bc363864caa4fff6c5e18adc951624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/suppress.rs:283-294 | crates/core/src/suppress.rs:308-319 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/suppress.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22c7a5af59fae67bc910bfbf12c1bceab2a5e0fb9fbee494a8f0bd900cd46c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/duplication_detector/token_visitor.rs:408-419 | crates/engine/src/duplication_detector/token_visitor.rs:424-435 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/duplication_detector/token_visitor.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5942c7068f3b77b418f542d91ea1755212a7844c7212e4dba1ff850f1fdd3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/health/runner.rs:113-124 | crates/engine/src/health/runner.rs:191-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/runner.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e487b9e854aeedaa4f4aff92c5e7cc53f654cec51c1eac43543487c2ed1ef0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/extract/src/visitor/mod.rs:3066-3077 | crates/extract/src/visitor/mod.rs:3178-3189 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4cfadf082f96dba5ff69c442d7564b81cc38d5d7aad95305cc07031d0d2e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/extract/src/visitor/visit_impl_signature.rs:280-291 | crates/extract/src/visitor/visit_impl_signature.rs:304-315 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl_signature.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f2df6726867c4f2115fe78ca7b88df16c10b8ea0b1d74c0ebbbb4bfa2e6834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/graph/src/resolve/fallbacks.rs:975-986 | crates/graph/src/resolve/fallbacks_scss_paths.rs:15-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d82fce2a49d8d70e14bd8c6c94d1dcc5386f97eb1e78b24e78307c4afc2aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/lsp/src/diagnostics/structural.rs:736-747 | crates/lsp/src/diagnostics/structural.rs:776-787 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20905ae7c3116044c0259338458f87d564b156d1b96585e97c7cd83dea03553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/lsp/src/hover.rs:328-339 | crates/lsp/src/hover.rs:367-378 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/hover.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6065a3f195cbfad48f7fdf1961d3c40755270ca0db96e452c1480984031b59a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp/src/tools/analyze.rs:92-103 | crates/mcp/src/tools/check_changed.rs:78-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/analyze.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d39c6f75bf02c8a69eabbfde643267544773aa9d7cd45d5a624e2a93aa49d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp/src/tools/architecture.rs:58-69 | crates/mcp/src/tools/suppressions.rs:39-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/architecture.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d3c32c15b5e8802fa2beb23bfeaab8db2cbbb402d3e7bd23fc9fff2266e75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp/src/tools/mod.rs:955-966 | crates/mcp/src/tools/mod.rs:975-986 \u2014 both copies are in the same file, so extract the block 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":"crates/mcp/src/tools/mod.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f15206e7cb75d4d71211096725f66c742086ef6d8c683a6229f7351253a5d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/output/src/baseline_staleness.rs:86-97 | crates/output/src/finding_id_query.rs:65-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/output/src/baseline_staleness.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7d6c955823af3c7d9763cf12b41fe295cf41cbae844e23c2455974e74a5f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/engine/src/changed_files.rs:159-168 | crates/engine/src/changed_files.rs:187-197 | crates/engine/src/changed_files.rs:235-245 | crates/engine/src/changed_files.rs:605-614 \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":"crates/engine/src/changed_files.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c095fdf8c58077df75148ab23cb343f9d39eaa0b1b5310b1a017c67398e243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/extract/src/css_in_js/tokens.rs:1136-1146 | crates/extract/src/css_in_js/tokens.rs:1352-1362 | crates/extract/src/css_in_js/tokens.rs:1568-1578 | crates/extract/src/css_in_js/tokens.rs:1790-1800 \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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9beb367f7d36e371abf071a0717d7b01a6c8587eb9c5d36faa5f60121971d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/core/src/analyze/unused_component_emit.rs:48-58 | crates/core/src/analyze/unused_component_input.rs:57-67 | crates/core/src/analyze/unused_component_output.rs:54-64 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/unused_component_input.rs\u0060 and \u0060crates/core/src/analyze/unused_component_output.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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":"crates/core/src/analyze/unused_component_emit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7036cba9ea865022ecf5d4631b76cd1ae7664be157a4028689469dc9e816a288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/core/src/plugins/docusaurus.rs:304-314 | crates/core/src/plugins/docusaurus.rs:345-355 | crates/core/src/plugins/docusaurus.rs:375-385 \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":"crates/core/src/plugins/docusaurus.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6327099093d8916671598b1051c77a33abfdb3a08e0bed9823b514a9f1991486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/extract/src/css_in_js/tokens.rs:3349-3359 | crates/extract/src/visitor/visit_impl_factory_returns.rs:473-483 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:549-559 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":3349}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f74f1bb210fa446a7550ec0c810ed9f6af6509f130f3514d88e2de47edbac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/mcp/src/tools/dupes.rs:63-73 | crates/mcp/src/tools/security.rs:61-71 | crates/mcp/src/tools/similar_code.rs:178-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/dupes.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0503184b7d1062ac5066fbc587d79cc34d04009f6d1e3699afcd2ff6c1ca95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/types/src/workspace.rs:920-930 | crates/types/src/workspace.rs:985-995 | crates/types/src/workspace.rs:1120-1130 \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":"crates/types/src/workspace.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e94e00362fe7c862673e55bfdd8d16400509cbcb1bd48998f275e394065e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/api/src/json_output.rs:342-352 | crates/api/src/json_output.rs:381-391 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/json_output.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8210a0c737d890bf945d7b0a62388f9cfdac5bdd350202d23848aea742ff65c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/api/src/mutation/last_report.rs:36-46 | crates/api/src/runtime/similar_code.rs:1563-1573 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/last_report.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60e2a76cb6951f5b1b84adf819cc41e336655535e7dda6e15e17a4fc6d508e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/api/src/runtime/feature_flags.rs:238-248 | crates/cli/src/flags.rs:589-599 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/runtime/feature_flags.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de29369bd9e70df3b2f465c7eff8adea35ebf055d3e905ce0f5339edc48654f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/api/src/similar_code/mod.rs:191-201 | crates/api/src/similar_code/mod.rs:219-229 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/similar_code/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"435282333c42ed7d98ad9c5d19fcfd5ef0d8ac4aafeed7a03d6a657ba1d7ac82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/base_worktree.rs:1170-1180 | crates/cli/src/base_worktree.rs:1208-1218 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/base_worktree.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"95caca63ea14ee3a2e87efeb4328b8b5e892220924e63fc27288d8f86c34cb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/ci_pr_comment_post.rs:209-219 | crates/cli/src/ci_pr_comment_post.rs:244-254 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci_pr_comment_post.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"447bfd3bb0cd44812fac18994c963c1f040927a12d25571985ed8e6d14bc5377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/cli_impact.rs:240-250 | crates/cli/src/cli_impact.rs:287-297 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/cli_impact.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2e0dd85f36459177c87997c3a0aa0bdeb129716fc0eddab7093b7ca3f8258f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/report/human/check.rs:2571-2581 | crates/cli/src/report/human/check.rs:3384-3397 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4173f39f514f220f76ba624dffcc3b1f686eabb6c4b69b74afe56139e5582c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/report/human/check.rs:3055-3065 | crates/cli/src/report/human/check.rs:3201-3211 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3055}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7f5d665040ebd481ec5af9ffbeceae743a28969e4e857ff5b20319f725e671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/report/json.rs:1071-1081 | crates/cli/src/report/json.rs:1101-1111 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/json.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c2efc8b6a6d8827378634b84032ec49db34dadd35ec75cae4e86bebe4c02d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/report/mod.rs:907-917 | crates/cli/src/report/mod.rs:1291-1301 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/mod.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"162ff1d2db8c653802ec93a82559e2801249ad867b47505b0fb16c315dac9efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/security.rs:1988-1998 | crates/cli/src/suppressions.rs:173-183 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/security.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"63121214a53c964d736f62446297d81e4241f969089a83f6fc23b5f8dafd017f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/src/analyze/members/mod.rs:350-360 | crates/core/src/analyze/members/mod.rs:373-383 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5fb5b369fdba9f26a87f85f2b899e94b58c747a362f29c10ceee829018c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/src/discover/walk.rs:371-381 | crates/core/src/discover/walk.rs:442-452 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/discover/walk.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"235b11ff9b15531e72f4c5ebce8e16a9ac13c5c0920c61884c35ee5e84418bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/core/src/lib.rs:476-486 | crates/engine/src/discover.rs:262-271 \u2014 before extracting anything, compare \u0060crates/core/src/lib.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 80 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":"crates/core/src/lib.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7512950fa2cb943e9a510f19397f6ccd45815319f991fda8043c14c904b23f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/src/scripts/mod.rs:2865-2875 | crates/engine/src/discover.rs:815-825 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/mod.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7f4f4ec740d214b078d5311b0889c7cd6e900274eda43cd5f7a6962d0ceec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/engine/src/baseline/mod.rs:1749-1759 | crates/engine/src/baseline/mod.rs:1765-1775 | crates/engine/src/baseline/mod.rs:1780-1788 \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":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8068ef24afc658a548b1362bae7e5dbefa30d9d0880f0a04e47f058294dca87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/engine/src/health/css_analytics/near_duplicates.rs:85-93 | crates/engine/src/health/css_analytics/theme_tokens.rs:209-219 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/near_duplicates.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa472735ba633366807c4dc54fcf2600c76c800deaf0964f196ea7020a84457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/health/css_analytics/preprocessor.rs:150-160 | crates/lsp/src/position.rs:89-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/preprocessor.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0c6f74093ca9cf2cc6bd8500104f5821eddd244ff790af98da2d2ca82d33a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/health/filters.rs:31-41 | crates/engine/src/health/filters.rs:74-84 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/filters.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"777d8c82dcb055700b218859cc2b09dfda058b503ae550fbd0ef17c45ea8ef48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/health/threshold_overrides.rs:213-223 | crates/engine/src/health/threshold_overrides.rs:234-244 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/threshold_overrides.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c2bec175c26893cd3a72308924d799bb85762165cba65d08f767296c226282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:367-377 | crates/extract/src/css_in_js/tokens.rs:379-389 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f870e41082cc43e733dce9296a197c90b6560b14d995a62e17c946483af3b68a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/extract/src/template_expression_scan.rs:214-224 | crates/extract/src/template_expression_scan.rs:266-276 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/template_expression_scan.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcefce16cb2db5086807f15831438ed2362011b9995b63f02a9531f0bdca785f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:3870-3880 | crates/extract/src/visitor/visit_impl_scope_bindings.rs:684-694 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3870}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b37da5a0b7b54ea5c2a25f472622f39b1e4bc8cd1011963c21c2ff90f502ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:4961-4971 | crates/extract/src/visitor/visit_impl.rs:5008-5018 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aca0b9a1560d778d7e5f338dbcb554a4b45521491354add9801ec9c489feb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/extract/src/visitor/visit_impl_member_destructuring.rs:207-217 | crates/extract/src/visitor/visit_impl_member_destructuring.rs:243-253 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl_member_destructuring.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a4316174261d4c447ce6584d7a909071c415eab546dc743b3fe21d504afa0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/extract/src/visitor/visit_impl_object_bindings.rs:418-428 | crates/extract/src/visitor/visit_impl_object_bindings.rs:477-487 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1d75dd65add40be953252101e95f84b36fc161c56d1065650be44a518ad77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/graph/src/graph/effective_exports.rs:1106-1116 | crates/graph/src/graph/effective_exports.rs:1143-1153 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/graph/effective_exports.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2236227765c9b245a88e9651f5e4c8fbad181056a22bc24812e5e510f4f846d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/cli/src/report/human/check.rs:3264-3273 | crates/cli/src/report/human/check.rs:3311-3320 | crates/cli/src/report/human/check.rs:3347-3356 | crates/cli/src/report/human/check.rs:3430-3439 \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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bdb4257a87fe15438302a43fbd0675905109588aa7997495fc3079b0bdbafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/napi/src/lib.rs:475-484 | crates/napi/src/lib.rs:508-517 | crates/napi/src/lib.rs:613-622 | crates/napi/src/lib.rs:639-648 \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":"crates/napi/src/lib.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d53428bd833f0ef7c14639cc8b1f8a18cdbe405ee87dc6ca3b6cbe1802c07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/cli/src/report/ci/pr_comment.rs:436-445 | crates/cli/src/report/ci/pr_comment.rs:452-461 | crates/cli/src/report/ci/pr_comment.rs:468-477 \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":"crates/cli/src/report/ci/pr_comment.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c75b0bf28fc3b2776164a6477c40d91f75fa117854da15c33acf98d4a8acf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): crates/extract/src/sfc_props.rs:420-427 | crates/extract/src/sfc_props.rs:1349-1358 | crates/extract/src/sfc_props.rs:1451-1457 \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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9cc4e8318f0fcd5daf7b8c13249b79c590700f85c7ded4953607290ef042e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/types/src/workspace.rs:908-917 | crates/types/src/workspace.rs:973-982 | crates/types/src/workspace.rs:1110-1119 \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":"crates/types/src/workspace.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c5fdbaeee05ecda96e710840c2a3cfc8d84dc2b251462c8692b233a65d0bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1679-1688 | crates/api/src/dead_code_codeclimate.rs:1789-1798 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46415a84294fc32d88a13a93f539ec92412e1bad3db68fffb232f732295f14f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1826-1835 | crates/api/src/dead_code_codeclimate.rs:1872-1881 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a0b6c09046e03205f45c8460674932f7d4b19b0a0004ef3e62f926b88a0f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/markdown_output.rs:60-69 | crates/cli/src/report/human/health.rs:1928-1937 \u2014 before extracting anything, compare \u0060crates/api/src/markdown_output.rs\u0060 and \u0060crates/cli/src/report/human/health.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"crates/api/src/markdown_output.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbaee11e1b4423e492bd0b10d61de058a29945747fcb85f8fbf76e5b4b4b711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/runtime/decision_surface.rs:436-445 | crates/cli/src/audit.rs:2167-2176 \u2014 before extracting anything, compare \u0060crates/api/src/runtime/decision_surface.rs\u0060 and \u0060crates/cli/src/audit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"crates/api/src/runtime/decision_surface.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"47731bc85e4aa3a41589106bc97ca63ffc42e72d04e89ce735c060ce6b81d809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/type_aware/client/mod.rs:1041-1050 | crates/api/src/type_aware/client/mod.rs:1255-1264 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7b7b859b1763b6a2a8fae3d11842ae8e53897f38bc7ab48dfaaa2ba0775598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/src/agent_install/mod.rs:770-779 | crates/cli/src/agent_install/status.rs:508-517 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/agent_install/mod.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0ae1d4acaa74e09b89c487019c2ee4d41fa4571fb73bdeabb3f8c98a51b1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/src/audit.rs:2239-2248 | crates/cli/src/audit.rs:2308-2317 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/audit.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c4b290ec1740b06a47b713f0c5f097e9ba594fb468428aa5a034c0b16c2f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/src/base_worktree.rs:1343-1352 | crates/cli/src/base_worktree.rs:1420-1429 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/base_worktree.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a385630dcbda44b0663f532399201c992a557b243a04c5a7c0da95dfa2ac2ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/src/combined/mod.rs:723-732 | crates/cli/src/security.rs:1571-1580 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/combined/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"e858fe89e621f803126f10101db376842e885eefb0afd485838e75af6d29f7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/config/src/rule_pack.rs:670-679 | crates/config/src/rule_pack.rs:701-710 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/rule_pack.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e282826e01e444e609c9faf118110b811ca5f8e76354a9f23ce918472afbc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/analyze/duplicate_prop_shape.rs:184-193 | crates/core/src/analyze/prop_drilling.rs:140-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/duplicate_prop_shape.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce50976b54fa3961d0811f8d1a18651fbd125ef3aea56edc6b2da4c2e324d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/analyze/prop_drilling.rs:139-148 | crates/core/src/analyze/react_intel.rs:92-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/prop_drilling.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a971cf83126c6834df07147b0c4d291a5098dddf7d3d0866e5c1a899b714b8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/plugins/eslint.rs:131-140 | crates/core/src/plugins/typescript.rs:77-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/eslint.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b4a5fb9c69f9df2104680587d5072452bbfd0483ac18a3539375b1bfa2abe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/duplicates.rs:148-157 | crates/engine/src/health/derived_sections.rs:502-511 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/duplicates.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"816bddb08ebf42455900e594bce7b664dcd0094dae7265482ce9fbcc93a3a24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/health/css_analytics/theme_tokens.rs:176-185 | crates/engine/src/health/css_analytics/token_consumers.rs:18-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/theme_tokens.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"69193c5253ec845989c2fc28ee1f59e449065aaff347bb94b4bcb82b0eccb3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/health/grouping.rs:165-174 | crates/engine/src/workspace_scope.rs:229-238 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/grouping.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"199bcc5d8dffe5b34e9f91704245efb49286c10bb6f3db5c98d3afd57dc03ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/vital_signs.rs:1202-1211 | crates/engine/src/vital_signs.rs:1218-1227 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/vital_signs.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5befb0771e72ec7681ad64950d520f8eec476391c20d6b9f52fedb154a2716d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/extract/src/astro/mod.rs:608-615 | crates/extract/src/sfc.rs:2192-2201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/astro/mod.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8dfbdd3f83aa818853d1858881ae02e3618d33328b97d61b6ad761f876f78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/extract/src/cache/conversion.rs:80-89 | crates/extract/src/cache/conversion.rs:285-294 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2350e953bdcaff0a9a8c07ede3b2181880c75c3c54e22359437db89a9c264bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/extract/src/complexity.rs:680-687 | crates/extract/src/complexity.rs:705-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":"crates/extract/src/complexity.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd21af8d10cb5fe07139e3aad60c7de4e2c821facb2860944f515c03b791004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/extract/src/parse.rs:839-848 | crates/extract/src/parse.rs:939-948 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/parse.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad33006ea6c975b81dd16b8a772e38120078b74ba201554bc32aeb3340891d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/extract/src/template_complexity/engine.rs:819-828 | crates/extract/src/template_complexity/engine.rs:888-895 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f987bf99a726b00cd94d495d5662dbf3fba458e2da8ab2b9cdcd1983df1963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/extract/src/template_usage.rs:323-332 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:302-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_usage.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8202ddcba668341584febcb0ff5093df9930f4748c765f7321836e85cff296b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:3581-3590 | crates/extract/src/visitor/visit_impl.rs:6314-6323 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2a86af200517092a8a2442e83749f336e738295115d4f42537438f61967e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/extract/src/visitor/visit_impl_object_bindings.rs:1906-1915 | crates/extract/src/visitor/visit_impl_object_bindings.rs:1934-1943 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"0619565a4b85d684e2b4055c773cc7ea1f6a3aa112f660ae30782af8f04dabfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/extract/src/visitor/visit_impl_structural.rs:301-310 | crates/extract/src/visitor/visit_impl_structural.rs:334-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_structural.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"462d31d97472fc51777eb557e45da66720296c649e2814a566c82b09cbc8bff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/graph/src/graph/mod.rs:1355-1364 | crates/graph/src/graph/mod.rs:1496-1505 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/graph/mod.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75fb77aab5cc1b92b96501ad90f55afe0047848e990e51d07c5311678b29c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/graph/src/resolve/fallbacks.rs:84-93 | crates/graph/src/resolve/specifier.rs:1204-1213 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"789e528ac3c662fd91d81c705c9b0e68d2cdbbe363987094c2508edbac5a3857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/mcp/src/tools/check_runtime_coverage.rs:94-103 | crates/mcp/src/tools/flags.rs:66-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/check_runtime_coverage.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45e9789503d5eceab7c16e52fdcc9ec1650aa61d60e81a59b4bf05cd9579b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): crates/mcp/src/tools/architecture.rs:56-64 | crates/mcp/src/tools/check_changed.rs:69-77 | crates/mcp/src/tools/check_runtime_coverage.rs:92-100 | crates/mcp/src/tools/fix.rs:36-44 | crates/mcp/src/tools/fix.rs:63-71 | crates/mcp/src/tools/flags.rs:64-72 | crates/mcp/src/tools/impact.rs:100-108 | crates/mcp/src/tools/suppressions.rs:37-45 | crates/mcp/src/tools/trace.rs:202-210 | crates/mcp/src/tools/trace.rs:229-237 | crates/mcp/src/tools/trace.rs:259-267 \u2014 before extracting anything, compare \u0060crates/mcp/src/tools/impact.rs\u0060 and \u0060crates/mcp/src/tools/trace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"crates/mcp/src/tools/architecture.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90393b2349a66ad7426ec2c1e3098faf1b4fdbbeeb35d61ae423bf7418c4bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/cli/src/check/mod.rs:1273-1281 | crates/cli/src/dupes.rs:373-381 | crates/cli/src/health/mod.rs:180-188 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ef26593ff42143947ec7ceb8298254a7abef271cc80386dc184ef88eaf9ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/extract/src/visitor/visit_impl.rs:3568-3576 | crates/extract/src/visitor/visit_impl.rs:3581-3589 | crates/extract/src/visitor/visit_impl.rs:6314-6322 \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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec69145b008de13f1c8d2cb89da9508011a09129195bc7520b56f54be6c13319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:292-300 | crates/api/src/dead_code_codeclimate.rs:523-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6703c006aefe897fb7f7a601d2b31ce3f0bb7c460ef108cd0283daaeddaeaa60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/api/src/runtime/decision_surface.rs:456-464 | crates/cli/src/audit.rs:2138-2146 \u2014 before extracting anything, compare \u0060crates/api/src/runtime/decision_surface.rs\u0060 and \u0060crates/cli/src/audit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"crates/api/src/runtime/decision_surface.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80817a8b935c3896595d34c7be12460c24fdc146b6768ffb4fde30d7f740dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/src/agent_install/mod.rs:417-425 | crates/cli/src/agent_install/mod.rs:476-484 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/agent_install/mod.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e35013846d32c55c769593084a4c3bcf1b8415ee5dff689ceb41d4015b691ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/src/ci_review_post.rs:128-136 | crates/cli/src/ci_review_post.rs:181-189 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci_review_post.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b4e0c4c0a40f68cee828cb94408e88c57313fdb1ae7c497a0a653a5282fb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/cli/src/fix/io.rs:102-110 | crates/cli/src/fix/plan.rs:495-501 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/fix/io.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb77fbbd7db9bf1c2c33259970bc480048db1d3b62331520f44af9d79daa11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/cli/src/health/coverage.rs:861-869 | crates/cli/src/health/coverage.rs:2316-2323 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/health/coverage.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"722a513aacfdedb68091ffef9cfaf46ba4f0299cc4bcb3ed8c615d5c27e400d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/src/migrate/toml_gen.rs:38-46 | crates/cli/src/migrate/toml_gen.rs:118-126 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/migrate/toml_gen.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb282c70354f8e9c8a4cc155a2856610e135da8b9d1e1ea263b8056307535ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/src/report/sarif.rs:142-150 | crates/cli/src/report/sarif.rs:194-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/sarif.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9484ea1ae20aeaafc86fd6ac63b17ac73ab449e1829120b37e782737cdbd210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/analyze/unused_exports.rs:1043-1051 | crates/core/src/analyze/unused_exports.rs:1074-1082 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/unused_exports.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460a9674a378ee6b7fa497cbf196b54c818dd7b1f172f8d40201632fdb2e954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/external_style_usage.rs:149-157 | crates/graph/src/resolve/specifier.rs:589-597 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/external_style_usage.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f934e14e3f49b67cc2a9b82aa9576c1f84826b17fed058fc30807895bd2b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/plugins/config_parser.rs:549-557 | crates/core/src/plugins/config_parser.rs:571-579 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eb55a7c01b8ee1740045cf5f37a2373f955edf62e6fd2593a6b1642fca0e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/plugins/config_parser.rs:1629-1637 | crates/core/src/plugins/config_parser.rs:2496-2504 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9ea2f154e0aecdd1d0d37d44e633a2cd1f2a6ca47af4759db89bb9f45a83bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/plugins/gatsby.rs:94-102 | crates/core/src/plugins/typescript.rs:423-431 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/gatsby.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6907a7add17ff3181b8e913bdd91c8175a6753d6c8c92d67023ec1db0470e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/plugins/typescript.rs:288-296 | crates/core/src/plugins/webpack.rs:151-159 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/typescript.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f16d950d8f416cbefabdf4e55540e4c9124190ff84570ec6ca53802e235727a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/duplication_detector/token_visitor.rs:575-583 | crates/engine/src/duplication_detector/token_visitor.rs:622-630 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/duplication_detector/token_visitor.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7c35b727baaf496b21afcaaab761ebed26287437930fe81bfb91308ac57073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/engine/src/health/css_analytics/classes.rs:172-177 | crates/engine/src/health/css_analytics/classes.rs:687-695 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b0da0b52452f41b6a6b8e2c36a1d958d01c50953febd6e8d7b8c9e4935c3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/health/scoring.rs:886-894 | crates/engine/src/health/scoring.rs:903-911 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"105d681562ef64523a7e9f8727caa1a652f8ddf268f4dbb6d89859d3e0a39912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/trace_impl.rs:573-581 | crates/engine/src/trace_impl.rs:696-708 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/trace_impl.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1788d4d91f178554bf9d815055fdffc87ac590a9b2efb9c9c2e57085148430e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/engine/src/viz.rs:1313-1320 | crates/engine/src/viz.rs:1445-1453 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/viz.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c5461704eeff9369c192c8d0436a5a5b2dbc1b2f34c5853c65714c09e7d326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/binding_references.rs:198-207 | crates/extract/src/binding_references.rs:280-288 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/binding_references.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e33b2ecf67d6e91b5632d6b9dbc8b1344e78cc2ccd697270d9022e19acc6eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/cache/conversion.rs:596-604 | crates/extract/src/cache/conversion.rs:727-735 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77427da3fb677ca798e099a06d89e6866b36ca3f3937e7f0748ba10fd685f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:834-842 | crates/extract/src/css_in_js/tokens.rs:867-875 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"6083f2599d45b73c69b4ede5c60d15cab7765fbe3dcf530d1b75972078d5f968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:2078-2086 | crates/extract/src/css_in_js/tokens.rs:2381-2389 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"1418394fb5c8caea20f3ce8c492b847488b56dc8bf58c78b824c552b3a724b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/federation_runtime.rs:382-390 | crates/extract/src/flags.rs:1278-1286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/federation_runtime.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b557ff4e30f44a0531d387860f35f923ab18f3b9bb36a047f89c735a8da44389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/sfc_template/angular.rs:46-54 | crates/extract/src/template_usage.rs:31-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b8e7cfc5c26983eb12e5e95830124b98752ce254a3f4a78c44db093ca9d0e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/template_complexity/engine.rs:625-633 | crates/extract/src/template_complexity/engine.rs:727-735 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6670e44232ae3d6052cc112664f5dc594123f84a4c336511fd6218f9232859a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/template_usage.rs:336-344 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:361-369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_usage.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91264625fb44282cad2b2511240c23d2b515294dbe4c7c95f96fe989faf539b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/visitor/helpers.rs:564-572 | crates/extract/src/visitor/helpers.rs:666-674 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ffbca8bc19e558624453adf3db0fcb76215c375a93aabef5a4d04743455554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/visitor/helpers.rs:1839-1847 | crates/graph/src/resolve/dynamic_imports.rs:378-386 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"4044fe7fa488298da08411aa12a55c30fe992a5b4afcb0c7ebed7e853bbd8f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/visitor/react.rs:990-998 | crates/extract/src/visitor/visit_impl_chain_names.rs:125-133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/react.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea64c2fc4e4f37cc91428ca730c0293f86d4f1d7598f7d0c68edc948b6548e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/visitor/visit_impl_chain_names.rs:39-47 | crates/extract/src/visitor/visit_impl_source_paths.rs:19-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl_chain_names.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"403768f5136888245083d3d53bfed756ac7d38e1e1ad171838cc30152cbffaf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/extract/src/visitor/visit_impl_projections.rs:122-130 | crates/extract/src/visitor/visit_impl_projections.rs:385-393 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b605029e0f808e547d3633e2a7757d39a90d2fe96f5dcef76cbbf384437c49c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/graph/src/graph/re_exports/mod.rs:459-467 | crates/graph/src/graph/re_exports/mod.rs:473-481 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/graph/re_exports/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab71cda58e669926c4165b92e77909b24424b369cb1502ad7e2261b6c29cce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/graph/src/resolve/specifier.rs:406-414 | crates/graph/src/resolve/specifier.rs:659-667 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba62f7b3265cf91b008208cdd60926a68c7f6b06c7a2b6027984a637e1465376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/lsp/src/diagnostics/structural.rs:485-493 | crates/lsp/src/diagnostics/structural.rs:511-519 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"700d91f372e7d64047240df2f09addf919729e5c03d99394a5e3626dac88b1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/lsp/src/protocol.rs:166-174 | crates/output/src/check.rs:1239-1247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/protocol.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"da45a79bb57d5b0c1552af0cf9cd49ff1487e2628ea0a82e36f2f45a19198aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/output/src/check.rs:1117-1125 | crates/output/src/check.rs:1135-1143 \u2014 both copies are in the same file, so extract the block 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":"crates/output/src/check.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7012224a5498c1fe0e9771e33e39f769b669f62014d5bd8e930c99621ff977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/process/src/spawn_retry.rs:80-88 | crates/process/src/spawn_retry.rs:99-107 \u2014 both copies are in the same file, so extract the block 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":"crates/process/src/spawn_retry.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"26766279316bb0786cc8845b3fb660da2fd26763a5316ae17eddec57870fdc72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/types/src/workspace.rs:888-896 | crates/types/src/workspace.rs:1086-1094 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/workspace.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36afc6e1310a465fcc878ea6a3a9b60e83e833ef8d05c6441d705ca9214f669"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/cli/src/flags.rs:169-175 | crates/cli/src/trace_chain.rs:81-88 | crates/cli/src/trace_error.rs:62-69 | crates/cli/src/trace_path.rs:54-61 \u2014 before extracting anything, compare \u0060crates/cli/src/trace_chain.rs\u0060 and \u0060crates/cli/src/trace_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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":"crates/cli/src/flags.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aad167bc0df4685169d4d51d572472e1a0cf9538c43fb0a80c503092a51f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/api/src/dead_code_codeclimate.rs:365-372 | crates/api/src/dead_code_codeclimate.rs:399-406 | crates/api/src/dead_code_codeclimate.rs:433-440 \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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c949de44831490392d9dd6e68f815b9298b635594fe5993823951eb788822459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/core/src/plugins/nuxt.rs:1133-1140 | crates/core/src/plugins/nuxt.rs:1221-1228 | crates/core/src/plugins/pinia.rs:39-46 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90927127acb6deb7934e1be723ac5cb32ae31b0671d12b2561aa34ca05cf5f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/engine/src/health/css_analytics/near_duplicates.rs:132-139 | crates/engine/src/health/css_analytics/near_duplicates.rs:199-206 | crates/engine/src/health/css_analytics/theme_tokens.rs:252-259 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/css_analytics/near_duplicates.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4dc861b3db8b04d1ace066e520e02cc0ce70c6203489876645356a7982149f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/engine/src/health/threshold_overrides.rs:166-173 | crates/engine/src/health/threshold_overrides.rs:211-218 | crates/engine/src/health/threshold_overrides.rs:232-239 \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":"crates/engine/src/health/threshold_overrides.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d666b0fcdceb1e260e90359e5969b49fa3db36dad3ccec99199d8b2526a95b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/graph/src/resolve/specifier.rs:409-416 | crates/graph/src/resolve/specifier.rs:662-669 | crates/graph/src/resolve/specifier.rs:1198-1205 \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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d9664cf7eadf821c075fb500b95ee16ac0c796961cc9ef9f9e9ad84a560689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/combined_output.rs:163-170 | crates/api/src/combined_output.rs:181-188 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/combined_output.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"33898a5e03f13ff4829e6c84c8b69a77ab40dff39a4456d19a10a85485e68b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/runtime/decision_surface.rs:427-434 | crates/cli/src/audit.rs:2158-2165 \u2014 before extracting anything, compare \u0060crates/api/src/runtime/decision_surface.rs\u0060 and \u0060crates/cli/src/audit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"crates/api/src/runtime/decision_surface.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c49986e6a6e9ff052a575247a73e7fe939124278ab5ce32e85397b88975b3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/api/src/runtime/duplication.rs:217-222 | crates/cli/src/dupes.rs:248-255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/runtime/duplication.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fded94b8319d605295b2029442e39b8c6a30808bfcff07779bf2d6f1de1eb5d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/similar_code/transport.rs:127-134 | crates/api/src/similar_code/transport.rs:177-184 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/similar_code/transport.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b521bead192e47717844e1133ee69e05aaa34eff3eee502e80c88e52c89999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/agent_install/skill.rs:138-145 | crates/cli/src/agent_install/skill.rs:161-168 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/agent_install/skill.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5449e1063d148ea5e118a8a098eea769f6db15c9da761688a3206d13fd6bbc39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/check/mod.rs:1738-1745 | crates/cli/src/health/mod.rs:670-677 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e28a1c4522128f5431bc66fa8b88901129dd173fa9746b5edb32a2671eaad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/ci.rs:2370-2377 | crates/cli/src/ci.rs:2394-2402 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci.rs"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e3fc8e4d69bc6c8251890cc5985ab897e38f8811232146eee5261e2da3c9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/ci_pr_comment_post.rs:48-55 | crates/cli/src/ci_pr_comment_post.rs:111-118 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci_pr_comment_post.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e25779a64d9a917856add42c9095b489deb39f99129dd7d4bed755c1cf6353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/fix/exports.rs:217-224 | crates/graph/src/graph/namespace_aliases.rs:224-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/fix/exports.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d37011e55e6a459421aa169068a4203a9f5c8e6dc9a6d29de76adf8b62308e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/report/github_summary.rs:2506-2513 | crates/cli/src/report/github_summary.rs:2699-2706 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0170921173578448535bd789457157c70d7aec876168f743be6e11c1cdcb666b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/analyze/effect.rs:479-486 | crates/core/src/analyze/effect.rs:670-677 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/effect.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"30215ad4e4719d782f87e2881d102ee8549a6e608e7ffa7a41bccbd153d10727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/analyze/feature_flags.rs:99-106 | crates/engine/src/flags.rs:470-477 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/feature_flags.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f856cbc55401aa9bb6d5f9a661d25e56272c9c92abf549f231403ea634d381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/plugins/bun.rs:58-65 | crates/core/src/plugins/bun.rs:70-77 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/bun.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e36001de8a9766c60001e3fa2ba529c5aadcb6f3c42dc5bf1fa31e51fb1d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/health/runtime_filter.rs:127-134 | crates/output/src/diff.rs:313-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/runtime_filter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6967d30933eb58dba319fe3063ef11cc356a1ca22501ac9b347f1f5d19a18cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/cache/conversion.rs:559-566 | crates/extract/src/cache/conversion.rs:697-704 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1199ed3b87f5097f3cfde77068659a89bb7b83162409cbf5017f7b07cbd39706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/component_contracts/mod.rs:455-462 | crates/extract/src/component_contracts/mod.rs:464-471 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"071ddd1f166cceacc74542764aa321cf151d20f6b7520b8166267095f7159001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/extract/src/component_contracts/mod.rs:983-990 | crates/extract/src/component_contracts/mod.rs:994-1000 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/component_contracts/mod.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a2830dce998594d783c172faabbec02f7cf797d713fdec7f8511cb1b17352c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:1985-1992 | crates/extract/src/css_in_js/tokens.rs:2435-2442 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"701bc75fff8d941f84dd97226f9c3af912fca2ec591f77f66e2546ed3e2e67df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/extract/src/flags.rs:394-400 | crates/extract/src/flags.rs:812-819 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/flags.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ad028057570fa0f1191e9a0ca0e941d83e852b62800c7833e6aa8a932b7552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:741-748 | crates/extract/src/visitor/visit_impl.rs:3772-3778 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd5f2e68a5b8a1ae17e37464d7840461af315bd4c4793a843e35cade2f3c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:1217-1224 | crates/extract/src/visitor/visit_impl.rs:1228-1235 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bace0fa480a1c0d8e0d236296b4b1623c8491a8b1085644f164921c45d82074a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:3985-3992 | crates/extract/src/visitor/visit_impl.rs:4038-4045 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":3985}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28ca67aa316021a6619773b534d47898b362f7295646f6d97877aaced516881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/visitor/visit_impl.rs:5854-5861 | crates/extract/src/visitor/visit_impl_factory_returns.rs:520-527 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":5854}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2bf4a9999e798bae34907f000296aef5038f7633ac6748c02d57138d8c0246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/graph/src/graph/effective_exports.rs:1105-1112 | crates/graph/src/graph/effective_exports.rs:1166-1173 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/graph/effective_exports.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa024e24369003847708a76c3c00ffa665a4e23cf17c7b105575268a4ecb80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/graph/src/graph/public_exports.rs:219-226 | crates/graph/src/graph/re_exports/mod.rs:863-870 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/public_exports.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84c37556d115707856f2e3650efb6e0b6d71c96a9ba258da25426255ac45269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp/src/tools/security.rs:72-79 | crates/mcp/src/tools/suppressions.rs:46-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/security.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a776b63024d5619ac54ff76d0b311bfabeaeb08c908ce49b85b5d4d68f13b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp/src/tools/trace.rs:360-367 | crates/mcp/src/tools/trace.rs:651-658 \u2014 both copies are in the same file, so extract the block 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":"crates/mcp/src/tools/trace.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ae34f61d73e76b2deff0acdb964f45720ed6591f3ad1e40bc3e028db5e67a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/core/src/plugins/config_parser.rs:353-359 | crates/core/src/plugins/config_parser.rs:540-546 | crates/core/src/plugins/config_parser.rs:604-611 | crates/core/src/plugins/config_parser.rs:647-654 | crates/core/src/plugins/config_parser.rs:688-695 | crates/core/src/plugins/config_parser.rs:766-772 \u2014 all 6 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":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"067c0449f6b89fd9e8e58efceb32fe73b21c6fd2852df3d7d93407e0e134a61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/core/src/analyze/members/factory.rs:25-31 | crates/core/src/analyze/members/fluent_chain.rs:54-63 | crates/core/src/analyze/members/fluent_chain.rs:115-124 | crates/core/src/analyze/members/typed_property.rs:22-34 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae08f02b8f5cc7e3f4cdbd5be3b9e9b33b1d18a7cfec536e61517ef6ec133dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/suppress.rs:139-145 | crates/core/src/suppress.rs:158-164 | crates/core/src/suppress.rs:182-188 \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":"crates/core/src/suppress.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4c95a639afce76d4e4db5fbc0f0cafb21810a88740a39f35346a6b360077e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/extract/src/html.rs:108-114 | crates/extract/src/html.rs:117-123 | crates/extract/src/html.rs:125-131 \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":"crates/extract/src/html.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"68706d3206bbb47c534abd7ab212fbd3583d03292b9e9ede1eebec8160ed7028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/extract/src/sfc_template/angular.rs:328-334 | crates/extract/src/sfc_template/svelte.rs:625-631 | crates/extract/src/sfc_template/vue.rs:223-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622fdf5170b49ba6aa624e3a1620ea4904464970faefe658036711eda640359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/extract/src/template_complexity/engine.rs:576-582 | crates/extract/src/template_complexity/engine.rs:696-702 | crates/extract/src/template_complexity/svelte.rs:622-628 \u2014 before extracting anything, compare \u0060crates/extract/src/template_complexity/engine.rs\u0060 and \u0060crates/extract/src/template_complexity/svelte.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd945484a2d2d40fb3e56dec378bc1645e0d720fa9fd7fdd2d20fdcc4ed851aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/api/src/audit_keys.rs:1861-1867 | crates/engine/src/diff_scope.rs:67-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/audit_keys.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c590d5ec4053acd5f56e89e4fdd2849e7ec3b7971f726615b0e1121f0dc877df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/api/src/markdown_output.rs:2044-2050 | crates/cli/src/report/human/health.rs:1396-1402 \u2014 before extracting anything, compare \u0060crates/api/src/markdown_output.rs\u0060 and \u0060crates/cli/src/report/human/health.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"crates/api/src/markdown_output.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"543f8edd742e141166035a31a0cc647afda5adedeacfab1cb1cb93fdad85603d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/src/dispatch.rs:1694-1700 | crates/cli/src/dispatch.rs:1741-1747 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/dispatch.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"330fadece8ed774c45a399ea37c2f15349a5d009192ce1d8f12f3e573e3df1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/src/fix/catalog.rs:873-879 | crates/lsp/src/code_actions/quick_fix.rs:882-888 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/fix/catalog.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d74ee9ce181bf3a479366c35656e51c10087439f26982671ca2f49cf1093a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/cli/src/report/compact.rs:44-50 | crates/cli/src/report/markdown.rs:56-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/compact.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f376978e703702e8e330e6e4bdb70ea9e6458ca111a94a1a481b6ea29a97d343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/cli/src/report/human/check.rs:3083-3088 | crates/cli/src/report/human/mod.rs:606-612 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"850a366f5e993e300ce34588173dce415a96db7ddb62827623b15c281f515da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/config/src/workspace/diagnostics.rs:754-760 | crates/config/src/workspace/diagnostics.rs:776-782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/diagnostics.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c25752fd766e751057b1270b84230c71d403c769595d47ba3eac34a7a7da7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/analyze/security/tainted_sink.rs:117-123 | crates/core/src/analyze/unused_deps.rs:1756-1762 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/security/tainted_sink.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0ef9ab6d3f9bfcc75ed89c5aa073bb1982caf3a833234eaef3fded3ac85d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/discover/infrastructure.rs:189-195 | crates/core/src/discover/parse_scripts.rs:96-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/infrastructure.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c8663ed4bca9d5345fd1b959ab6ca2bf1884e762a45d07512fed2e62f65bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/plugins/registry/helpers.rs:559-565 | crates/core/src/plugins/registry/helpers.rs:587-593 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a28cdee518d8cfb21bd6d18e590a337d5983b1a9bdfaa4901044117953bb581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/scripts/mod.rs:1856-1862 | crates/engine/src/discover.rs:647-653 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/mod.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"a021ee690982cea1ec64618e1c3a508f45effc76799bdaa34a0724c6a2393619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/health/scoring.rs:463-469 | crates/engine/src/health/scoring.rs:598-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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"775eab70dbdb150144a09a4ac426e7b5d358178fd0a7acaf4d67330a17bbf459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/engine/src/health/scoring.rs:1294-1299 | crates/engine/src/health/scoring.rs:1375-1381 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6020303ed2238d4a559b4f5197e79794ea0a4678d2c66406c8e91305b1d156e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/extract/src/css_mask.rs:53-59 | crates/extract/src/css_mask.rs:71-77 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/css_mask.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cdfb89825bee39547d553da545c97fb3a46fdb426e39e3cf2b5786c270466d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/graph/src/graph/fan_io.rs:98-104 | crates/graph/src/graph/partition_order.rs:103-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/graph/fan_io.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fb816f452d5b25e8ca31e4d82851d2ff89b8491cd73846096d732dc5e239e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/graph/src/resolve/fallbacks.rs:994-1000 | crates/graph/src/resolve/fallbacks.rs:1033-1039 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47d03c5ead5237a30873bebe50e328834d4552db74d595a5bdd7b49a7664776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/types/src/results.rs:1597-1602 | crates/types/src/results.rs:1605-1610 | crates/types/src/results.rs:1622-1627 | crates/types/src/results.rs:1694-1699 \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":"crates/types/src/results.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c9627566fc78439a61ba40d167e85942e931c2c63ce7c35f97056c7a61bdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/core/src/plugins/config_parser.rs:1930-1935 | crates/core/src/plugins/react_router.rs:419-424 | crates/extract/src/visitor/visit_impl_security_sinks.rs:310-315 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e9f35e26ba4687d5e1209031a44d7b9b00cac6fefb46cdcf653422dee4865a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/extract/src/template_complexity/engine.rs:573-578 | crates/extract/src/template_complexity/engine.rs:693-698 | crates/extract/src/template_complexity/svelte.rs:477-482 \u2014 before extracting anything, compare \u0060crates/extract/src/template_complexity/engine.rs\u0060 and \u0060crates/extract/src/template_complexity/svelte.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a648a0d8edfa87d55b58cfa238a5f73fcb072b293f8d94c99085fcc0e46189d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/types/src/results.rs:1630-1635 | crates/types/src/results.rs:1638-1643 | crates/types/src/results.rs:1646-1651 \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":"crates/types/src/results.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4d0910a0d0c55ee9726f092eafe3e1fe6600bcadcaa13089a9bd79b4e21c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/types/src/results.rs:1919-1924 | crates/types/src/results.rs:1927-1932 | crates/types/src/results.rs:1935-1940 \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":"crates/types/src/results.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16d5ae98a898f162fea247633e2133883663bf973fe1a001a99dcadfae4ed64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/api/src/similar_code/transport.rs:122-127 | crates/api/src/similar_code/transport.rs:169-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/similar_code/transport.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad0c26f2fac56e1a7a014745a9a83af398ac1b977b793b4b5bb29e40a782b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/src/ci.rs:1476-1481 | crates/cli/src/ci.rs:1669-1674 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"97732910c804a5a222143cfa4d9200fa8595280c05060594be336bab48b80db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/config/src/external_plugin/mod.rs:965-970 | crates/config/src/external_plugin/mod.rs:984-989 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb21d0eb2acfef9dd4cbb390bd2131ee846a294ba13eb838095f869ddf39f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/analyze/effect.rs:492-499 | crates/core/src/analyze/effect.rs:684-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/effect.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8942b025c145ce1571d3d43697536eb376007ac50cc7cd8668e7ad6faf1b4d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/analyze/unrendered_component.rs:124-129 | crates/core/src/analyze/unused_component_prop.rs:53-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unrendered_component.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f996b5845302510396403cdc04748a24d3e3686a9142183c681141bd9d7239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/discover/parse_scripts.rs:208-213 | crates/engine/src/discover.rs:807-812 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/parse_scripts.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca38b5ba8d2c95cbe8cd5d8048c5aa97c9d8c1d6eb88dd56cb913d245dbb938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/baseline/mod.rs:1960-1965 | crates/engine/src/baseline/mod.rs:1971-1976 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/baseline/mod.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb289ddd14e57b7cbcee41517012665b8db67e3f8e23414f96bfc089ea3dd980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/trace_chain_impl.rs:183-188 | crates/engine/src/trace_chain_impl.rs:262-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/trace_chain_impl.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"675e4617be55a54f7fc3736ce7ebdb070e0d6364756e601b3325872143153130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/extract/src/sfc_template/angular.rs:429-434 | crates/extract/src/sfc_template/angular.rs:544-549 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee9fbceb12b17645dfa77c520df7aa6bcf1a777bbbc8276839291ea2f4c7841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/extract/src/sfc_template/angular.rs:606-611 | crates/extract/src/sfc_template/angular.rs:853-859 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_template/angular.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dc69e65a1033cab392bc118d9efed0afa31e3ad11c5ea9d5f0dbbc5c059aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/lsp/src/code_actions/quick_fix.rs:884-889 | crates/lsp/src/code_actions/quick_fix.rs:917-922 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/code_actions/quick_fix.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"830a3ac6a6e21d1fac4d8bdf634eaf05b0b27f713de294aa63988b7527dbb640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/lsp/src/protocol.rs:176-181 | crates/output/src/check.rs:1252-1257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/protocol.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"991a2512df575df23564b4d73257c2d2625dc9e2b64bc0da62943ee7d9e8838e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/output/src/dead_code_sarif.rs:725-730 | crates/output/src/dead_code_sarif.rs:756-761 \u2014 both copies are in the same file, so extract the block 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":"crates/output/src/dead_code_sarif.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a1bc968d1e9530932c604ff81bf23f6c0761683d7137427d4cd6490e4f2124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/types/src/results.rs:1763-1768 | crates/types/src/results.rs:1770-1775 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/results.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f35c159bec589bef0c36f2f8b0af4a2a6ce4f33ae631fd6a8260a880cc26399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/types/src/results.rs:2067-2072 | crates/types/src/results.rs:2081-2086 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/results.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"97248ae0e28a0ad09fb28ede5ed3670426e1aacdf7c2a6dff6a535c1232928e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/cli/src/flags.rs:169-173 | crates/cli/src/suppressions.rs:48-52 | crates/cli/src/trace_chain.rs:80-86 | crates/cli/src/trace_error.rs:61-67 | crates/cli/src/trace_path.rs:53-59 \u2014 before extracting anything, compare \u0060crates/cli/src/flags.rs\u0060 and \u0060crates/cli/src/suppressions.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/cli/src/flags.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea12e77e1c0588a2d31084885dd5cdd9bfabd568deaa435d979203936db4f3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/core/src/analyze/unused_component_emit.rs:51-55 | crates/core/src/analyze/unused_component_input.rs:60-64 | crates/core/src/analyze/unused_component_output.rs:57-61 | crates/core/src/analyze/unused_svelte_event.rs:53-59 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/unused_component_input.rs\u0060 and \u0060crates/core/src/analyze/unused_component_output.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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":"crates/core/src/analyze/unused_component_emit.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"021f9b2626e7aa04e183643218c6df2a250cf3e38913afae20290d22d4f5686f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/extract/src/template_complexity/engine.rs:381-385 | crates/extract/src/template_complexity/engine.rs:573-577 | crates/extract/src/template_complexity/engine.rs:693-697 | crates/extract/src/template_complexity/svelte.rs:477-481 \u2014 before extracting anything, compare \u0060crates/extract/src/template_complexity/engine.rs\u0060 and \u0060crates/extract/src/template_complexity/svelte.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6376b85bcfdd61e220747d4e5d0666b62fb4591626dde285c2687c765843a59f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/cli/src/report/human/check.rs:2555-2559 | crates/cli/src/report/human/check.rs:3334-3338 | crates/cli/src/report/human/check.rs:3372-3376 \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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90595d1a55a7b409f48122148c7ae966d96b84e4cab0d01e3d55669a41be001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/lsp/src/diagnostics/structural.rs:463-467 | crates/lsp/src/diagnostics/structural.rs:489-493 | crates/lsp/src/diagnostics/structural.rs:515-519 \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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d465ea060cc1a9696a6b26e3ea5d288e1a72de4a48c1f815e153e30398cd67d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/lsp/src/diagnostics/structural.rs:484-488 | crates/lsp/src/diagnostics/structural.rs:510-514 | crates/lsp/src/diagnostics/structural.rs:545-549 \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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9ef18a4a806fa92d52647bbcc72445c295b74fdf9614f4e3caf0804def9315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/lsp/src/diagnostics/unused.rs:337-341 | crates/lsp/src/diagnostics/unused.rs:361-365 | crates/lsp/src/diagnostics/unused.rs:385-389 \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":"crates/lsp/src/diagnostics/unused.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f7ce132718695af67f71d7457fcb6c2479f95dd6f07aaf14a48f021446b92d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/api/src/mutation/scheduler/mod.rs:669-673 | crates/api/src/mutation/scheduler/mod.rs:945-950 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b89dfa96576bf595bc93a98519b21db84f903959475ffceefb7d105a545a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/cli/src/regression/baseline.rs:780-784 | crates/engine/src/clock.rs:235-239 | crates/engine/src/vital_signs.rs:707-711 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/regression/baseline.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2a258bd9b900af3eca8d0f83d82144997d4270bd9d7e244876609c7a7151f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/config_writer.rs:177-182 | crates/config/src/config_writer.rs:226-230 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/config_writer.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4325259aeb14f3b5ddc48ac4d0e53c321efee5e6352fb0e744df9398c72431fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/workspace/diagnostics.rs:218-222 | crates/core/src/scripts/ci.rs:137-141 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/diagnostics.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"820d9a184a98887a9ab64c62c33529cb3548a088adf8c04b2f46e59e626ba287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/workspace/package_json.rs:297-301 | crates/config/src/workspace/package_json.rs:313-317 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/workspace/package_json.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60319001ba16af511f85049266cb81dde12d512ea0514e1134b60cd2ffb4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/plugins/nuxt.rs:928-932 | crates/core/src/plugins/nuxt.rs:1622-1626 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a85928795681a7b0014b5c2eeb5fc99b3e0c0dae0d48c4151e9a63c3e73fc0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/plugins/trace_provenance.rs:107-111 | crates/core/src/plugins/trace_provenance.rs:200-204 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/trace_provenance.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca53e1693dc0200be542e39f12d9dc85f4b7a7b6aab975aad91f19c5ee6fc560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/scripts/vite_plus.rs:173-177 | crates/core/src/scripts/vite_plus.rs:198-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/vite_plus.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62c33159756e82ab360f7d93ba624193fd24bf967a93431751ef111c8bdeb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/dead_code.rs:717-722 | crates/engine/src/diff_scope.rs:206-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/dead_code.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe349400abd06382bd9c01edb0738bd4084e3784c01b506918cb1b755563bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/vital_signs.rs:381-385 | crates/engine/src/vital_signs.rs:412-416 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/vital_signs.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2964c6a5430d7fa9e89abc6617ec1ffcd27db2b4a967b8ff9a9eeb1b0cabe13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/extract/src/css_in_js/tokens.rs:1059-1063 | crates/extract/src/visitor/visit_impl_object_bindings.rs:2051-2055 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/css_in_js/tokens.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"343c07a70730b1182f81c0712c4e130a45caacfa147c7122664daa69eb341dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/extract/src/sfc_props.rs:309-313 | crates/extract/src/sfc_props.rs:485-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_props.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71585ab3f95697c1a2f5d973cee35885fc6e70da08dae5d7af2b013a8d258cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/graph/src/resolve/fallbacks.rs:80-84 | crates/graph/src/resolve/specifier.rs:1195-1199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab5f281a1cd8e73768817a130beefd05f0bd7777cbb961d8aa0bfa4dadd148b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/lsp/src/diagnostics/structural.rs:81-85 | crates/lsp/src/diagnostics/structural.rs:172-176 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce4621fccfb5a3999a66afa3fd8a482cbdd9e70f0ba0b584f2240ce3207d0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/lsp/src/diagnostics/unused.rs:111-115 | crates/lsp/src/diagnostics/unused.rs:758-762 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/diagnostics/unused.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb626b7b8858c3a6a7aa5ccc7b521969311d42ab21ffba30def9fd6b35da00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp/src/tools/code_mode_tools.rs:628-632 | crates/mcp/src/tools/mod.rs:231-235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/code_mode_tools.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3b2c98f90b7b3119de5bd0c69510dd2359ed3fa0fb1713fc67e90ee919ec1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/api/src/analysis_context.rs:753-759 | crates/cli/src/check/filtering.rs:168-174 | crates/engine/src/workspace_scope.rs:275-281 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/analysis_context.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcae03769ec79dea856803761306b275f20daad3bcf7b9eb6cc9ed0d04c9d7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/api/src/health_codeclimate.rs:286-301 | crates/output/src/analysis_sarif.rs:658-673 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/health_codeclimate.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2580f2c0e388fbfda39b73969ecf7827929d17d83214aa87d059db86c251065f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/json_output.rs:459-466 | crates/cli/src/report/json.rs:990-997 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/json_output.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabd1c507b7f22a14f29e69be6ce484cba968c29abf60e29af7d9452cb5f0286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/api/src/lib.rs:1442-1450 | crates/engine/src/health/mod.rs:683-691 \u2014 before extracting anything, compare \u0060crates/api/src/lib.rs\u0060 and \u0060crates/engine/src/health/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 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":"crates/api/src/lib.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b003e1945b284796d564046b486896e0d865afccc78890722e144b893bcbf572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/lib.rs:1454-1461 | crates/cli/src/dispatch.rs:3242-3249 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/lib.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"23805ae56bc6c9ccb8d035f27e5f5e32fe3df3bf98489f6bcd3f464dc7e219c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/markdown_output.rs:2377-2386 | crates/cli/src/report/human/health.rs:2368-2377 \u2014 before extracting anything, compare \u0060crates/api/src/markdown_output.rs\u0060 and \u0060crates/cli/src/report/human/health.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"crates/api/src/markdown_output.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a77542e3e1bd50eb8a43b27fec1ea7205b92b539e731f149106fdcb3ef2cca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/api/src/markdown_output.rs:2997-3005 | crates/cli/src/report/human/walkthrough.rs:317-325 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/markdown_output.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c10387491fc000465213db9ec963af6a3a100aa151c155ac31fd06c19ba6efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/mutation/verdicts.rs:31-38 | crates/cli/src/mutation_inspect.rs:128-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/verdicts.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af9b46d81acd17333d66e183e87b17bc147ab2687132d3d2087a4420e679aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/runtime/dead_code.rs:1058-1065 | crates/engine/src/dead_code.rs:563-570 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/runtime/dead_code.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f182ce791e82099d0846e9bd144cc93881c513b82960e87397ebbc56c421d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/api/src/runtime_json.rs:639-647 | crates/cli/src/cli_report.rs:946-954 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/runtime_json.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ef8ab04f18b688462707ea074f67c19b4515c20c7583abd44e65c64d444694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/src/cli_production.rs:18-24 | crates/engine/src/project_config.rs:64-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/cli_production.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fd7a717d6dea5b7f49267b4dacfe0c2efa4e9f9965cd99e77e61ea5b59d030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cli/src/dispatch.rs:3092-3096 | crates/mcp/src/tools/api_runtime.rs:140-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/dispatch.rs"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5d9119cc636659ba2a32c8a072ea8e92a3a1a824ea1635f41953dc3d49afd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): crates/cli/src/lib.rs:971-1035 | crates/cli/src/similar_code_help.rs:150-201 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"559eaba4ba4dbd02aa15cab7a25dfadbda1a77ccd89a469970f8023f46516d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/report/baseline_advisory_text.rs:126-136 | crates/mcp/src/tools/gate_verdicts.rs:298-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/baseline_advisory_text.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"404f1a88a32d3038ec9b8e870dcca4aaab6250cc05e706fb844b330d4038c77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/src/report/gate_outcome_text.rs:220-226 | crates/cli/src/report/request_outcome_text.rs:169-175 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/gate_outcome_text.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbf2e3babc0038a8a19b8c62414c0281ec4a7f1c8bb02ac2dc9d8974266b24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/src/report/github_annotations.rs:275-280 | crates/cli/src/report/github_summary.rs:818-823 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/github_annotations.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"434a6ff148d1f8008220f9808286ac95b3e6008319dcedb3abe2d1e178e18dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/report/github_annotations.rs:1248-1255 | crates/cli/src/report/github_summary.rs:169-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/github_annotations.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e1c00a2e517aa062ae78e2820fbdf28e70dbfb04ef7ddec7ba54e0de21dd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/cli/src/rule_pack/list.rs:127-135 | crates/cli/src/rule_pack/test.rs:266-274 | crates/engine/src/guard.rs:295-303 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/rule_pack/list.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd3e982c99bb3e62bc1ce5e04ab7d9f716934818fc6b17f743a9a105039521a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/config/src/workspace/deno_json.rs:258-263 | crates/engine/src/health/targets.rs:370-375 | crates/engine/src/viz.rs:2098-2103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/deno_json.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded67e2cd8ab8ca55e65616090bb629d8839e2da184c8710a4819be9eb072490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/analyze/dynamic_segment_name_conflict.rs:147-152 | crates/core/src/analyze/route_collision.rs:128-133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/dynamic_segment_name_conflict.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dc55682d303203fe6d04bbd5a0db75f5c59d3c1307fe42af237fffa85dcb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/analyze/invalid_client_exports.rs:116-122 | crates/core/src/analyze/misplaced_directive.rs:95-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/invalid_client_exports.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"73797f67f1e644920f57601931e251e76daf6be4f6a902c323a5f59bed06f6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/analyze/mod.rs:380-392 | crates/engine/src/public_api.rs:107-119 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/mod.rs\u0060 and \u0060crates/engine/src/public_api.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae82b039234eb59bf233ed7d978c4127eaf47aad545850bd75593cb6f1c5717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/analyze/policy/mod.rs:72-80 | crates/engine/src/guard.rs:252-258 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/policy/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4696630310057b5d5f6509f55798e7c5da541ff3eeeca31bac891b5b75fcb67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/core/src/analyze/security/hardcoded_secret.rs:372-392 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:235-255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/security/hardcoded_secret.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e977b787da5315b929ab686f2cb66dc232b205141c59ed0871302e0502c0f150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/analyze/unused_component_input.rs:173-179 | crates/core/src/analyze/unused_component_output.rs:202-208 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/unused_component_input.rs\u0060 and \u0060crates/core/src/analyze/unused_component_output.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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":"crates/core/src/analyze/unused_component_input.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccfa5c03a8d1b91d5e8c0fc7cf0d3f4e34ec3b477338f88d0e69c451d9a71d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/analyze/unused_load_data_key.rs:509-518 | crates/extract/src/parse.rs:246-255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_load_data_key.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a44d225c3bc41c5be06f1868790c623b272420ad82629fb622396bcaf45e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/discover/mod.rs:123-128 | crates/engine/src/discover.rs:443-448 \u2014 before extracting anything, compare \u0060crates/core/src/discover/mod.rs\u0060 and \u0060crates/engine/src/discover.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f720165775be12ccefe56daa9f15d2ec3bdbfb3af452fe661242c8927d1803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/discover/mod.rs:292-297 | crates/engine/src/discover.rs:520-525 \u2014 before extracting anything, compare \u0060crates/core/src/discover/mod.rs\u0060 and \u0060crates/engine/src/discover.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/mod.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b754073a0bc433fecab39b9e28ab4ecfce514dab17476ecc098962f827c1188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/core/src/discover/walk.rs:281-288 | crates/types/src/cache_rejection.rs:133-140 | crates/types/src/workspace.rs:1136-1143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d5b7a355c1804d7318301097543d37da1816455d15b98104c5c662f1328d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/lib.rs:2167-2176 | crates/engine/src/session.rs:1741-1750 \u2014 before extracting anything, compare \u0060crates/core/src/lib.rs\u0060 and \u0060crates/engine/src/session.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"crates/core/src/lib.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdb4c3d3e89be1ccabfb4beedc364e79974400caa5797fe8781ed76b699a9f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/plugins/config_parser.rs:2902-2908 | crates/core/src/plugins/module_federation.rs:1300-1306 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/config_parser.rs"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f0c0cf9e7d55ee7aef3c36df0956a9aa39592d04be938974d691c3800b9bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/plugins/contentlayer.rs:241-247 | crates/core/src/plugins/fumadocs.rs:193-199 | crates/core/src/plugins/velite.rs:202-208 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/contentlayer.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"435d48926f34a7c5a49dd7701362121c6463d27d187f4bd6ec6a538514654cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/core/src/plugins/ember.rs:276-282 | crates/core/src/plugins/lexical.rs:50-56 | crates/core/src/plugins/lit.rs:67-73 | crates/core/src/plugins/obsidian.rs:85-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/ember.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0028980f31c8620c088774257401ba6eab5cc2339daf2ff22101f5a202c8aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/plugins/nestjs.rs:82-88 | crates/core/src/plugins/nestjs_trpc.rs:24-30 | crates/core/src/plugins/vscode.rs:57-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/nestjs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d60bfd214a831a5a758d8fe8773caf37b0df507358c4cee57c31e672969206b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/plugins/nuxt.rs:1870-1876 | crates/extract/src/effect_facts.rs:725-731 | crates/extract/src/federation_runtime.rs:372-378 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e386575991ad7964b00d408f055e2b047350e3f41cf6e2633e86913286fe40cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/src/scripts/hooks.rs:224-234 | crates/core/src/scripts/workspace_selection.rs:346-356 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/hooks.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5bf2a9e6b79bc5e61c28f7026527a0fcc84ea1347dc8180a036abb41841f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/scripts/mod.rs:2852-2857 | crates/engine/src/discover.rs:790-795 \u2014 before extracting anything, compare \u0060crates/core/src/scripts/mod.rs\u0060 and \u0060crates/engine/src/discover.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"5465aaf8745262be50acac3d585872e50b8e2b85e3c5b9e829a1ce0c245b1ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/duplication_detector/token_visitor.rs:817-822 | crates/extract/src/visitor/visit_impl.rs:5170-5175 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/duplication_detector/token_visitor.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b42ffa8d6d3fca2342d8baf59a826e4253efee12431f40f3644549f951d4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/flag_vendor.rs:332-338 | crates/engine/src/health/package_json.rs:133-138 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/flag_vendor.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe0e16e6092af10e9ba877f6e4b12fc5d86891335c6e916ff325b9aa8789918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/trace_chain_impl.rs:397-404 | crates/graph/src/graph/mod.rs:1578-1585 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/trace_chain_impl.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c55a782a18d143c0fcec494f25a7273308031d0a1afbb3826ce0c1410a2045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/extract/src/complexity.rs:1023-1027 | crates/extract/src/visitor/react.rs:1335-1339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/complexity.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f12fcf1b49422fce205295b68719152ff04e366a812ab6c7877961d4d917123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/extract/src/template_usage.rs:352-356 | crates/extract/src/visitor/visit_impl.rs:6044-6048 | crates/extract/src/visitor/visit_impl_security_sinks.rs:317-321 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_usage.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"902ef98ed506cd7a9c1c6fb403d97f3d4301c030cf8ae35c8f1c88bc47b4a2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/lsp/src/code_actions/quick_fix.rs:574-586 | crates/lsp/src/diagnostics/unused.rs:428-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/code_actions/quick_fix.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a9899aee976d790e778db92eb9930dba845c8a6e5bd0b1026e1eeeabeff65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/api/src/type_aware/transport/mod.rs:74-80 | crates/config/src/config/parsing.rs:421-427 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/type_aware/transport/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16c1ddc3441e6acb0339a9e84392ca2c8d5360f37b48a348634d5f3ca814e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/external_plugin/mod.rs:706-710 | crates/extract/src/iconify.rs:61-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b6c4f49a72f02ee7a0ec885c4a75d80a38a7d0ba26f2a47b0abe2dfbaa8205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/config/src/workspace/pnpm_catalog.rs:331-336 | crates/config/src/workspace/pnpm_overrides.rs:300-305 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/pnpm_catalog.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3821f7ca9606f7e69733ae71650042ad1b5cd80c0ff5146897e99edf2fb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/analyze/mod.rs:1511-1517 | crates/engine/src/public_api.rs:92-98 \u2014 before extracting anything, compare \u0060crates/core/src/analyze/mod.rs\u0060 and \u0060crates/engine/src/public_api.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3544d308adca3c85b0a792661a7671d4b55ea49496176952152f189de117cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/analyze/policy/mod.rs:683-689 | crates/engine/src/effective_severity.rs:57-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/policy/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbdc536fabef6d516f39b3fcde38c60fb1adaf54dd8ce89f091d172bd900c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/analyze/unused_exports.rs:775-783 | crates/core/src/plugins/k6.rs:53-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_exports.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"36901573950997a2f7e120c18fc2ec12019827bdbf490fe38c0a13f76586a741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/plugins/tanstack_router.rs:551-558 | crates/core/src/plugins/wuchale.rs:116-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/tanstack_router.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8abd6d843956a92042e694b5ee51e45efc94028d33bdbf23475d2331e3930ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/extract/src/cache/store.rs:482-488 | crates/graph/src/cache/store.rs:145-151 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/cache/store.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"51734cdf6af8ce502e6b2cc3a79644829b97ad3c3ca233698702b3127780c82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/extract/src/sfc_props.rs:462-468 | crates/extract/src/visitor/react.rs:1311-1318 | crates/extract/src/visitor/visit_impl_helpers.rs:1162-1168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_props.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2767f9519e80ace74193a39211fe44cabff64bcd4dfdf0ffc877f4a610adb4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/extract/src/template_usage.rs:425-432 | crates/extract/src/visitor/visit_impl_security_sinks.rs:426-433 | crates/extract/src/visitor/visit_impl_security_sinks.rs:511-518 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_usage.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee04b04a24e3d4549d968367a6b6290c725fbc23e2962a02439f1e93c14fec57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/extract/src/template_usage.rs:434-440 | crates/extract/src/visitor/visit_impl_security_sinks.rs:435-441 | crates/extract/src/visitor/visit_impl_security_sinks.rs:520-526 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/template_usage.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedecce917f12e528d445a892362e1c37a1c16f66fab5910d9dfbe9c91f8bee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/extract/src/visitor/helpers.rs:1702-1708 | crates/extract/src/visitor/visit_impl.rs:5759-5765 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb23ef079264f6c4591ec07fcc5bed343aee982d11a75aeada6116b173c874be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp/src/tools/list_boundaries.rs:42-49 | crates/mcp/src/tools/project_info.rs:42-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/list_boundaries.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9ea2b1c8dcc62ab1f736e941b95529141d1b1e4143878a80e6d11eb203eb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/cli/src/dispatch.rs:1085-1104 | crates/cli/src/dispatch.rs:1307-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/dispatch.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3efc71341d69c4802801804a1bc245c03928848714f90d75cad9a6d751a7e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/types/src/output_dead_code.rs:1315-1330 | crates/types/src/output_dead_code.rs:1410-1427 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/output_dead_code.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbe5da90a7e8a251bbd27bc9724afa5a3a2081e27cc7a4a4791db86e0bba70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1765-1781 | crates/api/src/dead_code_codeclimate.rs:1850-1864 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ced92edfccabc6713ffa016c19366ccb98cd6660ece678a9fd3464ef36974bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 17): crates/api/src/dead_code_codeclimate.rs:952-967 | crates/api/src/dead_code_codeclimate.rs:992-1007 | crates/api/src/dead_code_codeclimate.rs:1032-1047 | crates/api/src/dead_code_codeclimate.rs:1072-1087 | crates/api/src/dead_code_codeclimate.rs:1112-1127 | crates/api/src/dead_code_codeclimate.rs:1187-1202 | crates/api/src/dead_code_codeclimate.rs:1227-1242 | crates/api/src/dead_code_codeclimate.rs:1265-1280 | crates/api/src/dead_code_codeclimate.rs:1302-1317 | crates/api/src/dead_code_codeclimate.rs:1340-1355 | crates/api/src/dead_code_codeclimate.rs:1380-1395 | crates/api/src/dead_code_codeclimate.rs:1420-1435 | crates/api/src/dead_code_codeclimate.rs:1460-1475 | crates/api/src/dead_code_codeclimate.rs:1500-1515 | crates/api/src/dead_code_codeclimate.rs:1540-1555 | crates/api/src/dead_code_codeclimate.rs:1576-1591 | crates/api/src/dead_code_codeclimate.rs:1616-1631 \u2014 all 17 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"401eb9d9153a9bc3316c56e25786de1c359b937523b92ee9ca5719df65fe2824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7): crates/types/src/output_dead_code.rs:530-544 | crates/types/src/output_dead_code.rs:686-700 | crates/types/src/output_dead_code.rs:757-771 | crates/types/src/output_dead_code.rs:1001-1015 | crates/types/src/output_dead_code.rs:1539-1553 | crates/types/src/output_dead_code.rs:1614-1628 | crates/types/src/output_dead_code.rs:1689-1703 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/output_dead_code.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fc645d2982a4dcc09169e4204fdd325cd2f1ec96c833b9be40fef7d2cc6075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/types/src/output_dead_code.rs:3836-3850 | crates/types/src/output_dead_code.rs:3913-3927 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/output_dead_code.rs"},"region":{"startLine":3836}}}],"partialFingerprints":{"codehealthFindingId/v1":"399fe3fec730e141f8d358c3484cd6055a75c14e9de69de8268174fa6d0366c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/types/src/output_dead_code.rs:1333-1347 | crates/types/src/output_dead_code.rs:1430-1444 \u2014 both copies are in the same file, so extract the block 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":"crates/types/src/output_dead_code.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2179a5217849a00fb3c2b34cfc8b9fcf18485080f886b0a4bbc01af376a1bf9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/types/src/output_dead_code.rs:1329-1342 | crates/types/src/output_dead_code.rs:1426-1439 | crates/types/src/output_dead_code.rs:2976-2989 \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":"crates/types/src/output_dead_code.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"062e6fcd453bc66bab55b394470fc8bf49c3830383ca9ad987e5de7340427a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7): crates/types/src/output_dead_code.rs:528-541 | crates/types/src/output_dead_code.rs:755-768 | crates/types/src/output_dead_code.rs:999-1012 | crates/types/src/output_dead_code.rs:1537-1550 | crates/types/src/output_dead_code.rs:1612-1625 | crates/types/src/output_dead_code.rs:1687-1700 | crates/types/src/output_dead_code.rs:2885-2898 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/types/src/output_dead_code.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb3dae628f4e9b4d6648a9e52b29c27ff1f0a7d507350ef2df8c991014f00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/src/report/human/check.rs:1524-1537 | crates/cli/src/report/human/check.rs:1572-1585 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f57f4f1b2429db07ddbf131eeae4a72d9930160ea5297e5aaf65b8ebfd41afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/plugins/registry/helpers.rs:650-663 | crates/core/src/plugins/registry/helpers.rs:665-678 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffa4fc8c67e31c4df0bb461827e71b415ad3892c9dd64072d96b19376ffb586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/src/report/github_summary.rs:3271-3284 | crates/cli/src/report/github_summary.rs:3348-3361 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d3c6d36e558931b0e32e86a3d78659436134d753009c9cbfd21ecd8bed7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/report/mod.rs:894-906 | crates/cli/src/report/mod.rs:1277-1290 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/mod.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"d015443225c1aef860eddff68c0d63b4a1a4eab805fc5a1eaacb60a1714d18b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/impact.rs:2492-2504 | crates/cli/src/impact.rs:2648-2659 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/impact.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65bdfcb596cb8a474666589a966a8e4e9c6854cc223a79e27a9988f0271f64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/plugins/postcss.rs:72-84 | crates/core/src/plugins/sveltekit.rs:209-221 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/postcss.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"57447757483286ae3c4c00d90003b9cc4e5a71e280aaf3f60a2d178403672b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/report/github_summary.rs:2527-2539 | crates/cli/src/report/github_summary.rs:2678-2690 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1355281e1306dce6224aae4bc61f7fcb50469a8aca974a0b0b46ba0ec7229bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/analyze/security/mod.rs:604-616 | crates/core/src/analyze/security/mod.rs:713-721 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/analyze/security/mod.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fc4bce6e360f3e05d952009b4337c0f9285d00135ed5b49c61aa021234973d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/config/src/rule_pack.rs:592-604 | crates/config/src/rule_pack.rs:631-640 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/rule_pack.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"3429403fd1c40bbd27df6e672078667c6a8d6ffbc5bdaea19a8dee3747869fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/report/json.rs:1033-1045 | crates/cli/src/report/json.rs:1065-1077 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/json.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ee68ca42b58310fb4c0cfcb7a2e343abcabe55ab1e4fd76591fab5c8142224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/base_worktree.rs:55-67 | crates/cli/src/base_worktree.rs:129-141 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/base_worktree.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c0b062e8885d72fdd8769e297ad94ca1a8338e19c10d966f430dd4e716b197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/report/human/dupes.rs:304-315 | crates/cli/src/report/human/dupes.rs:374-385 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/human/dupes.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"698f01a75c6ba3462157c4492c8b0d4ea65cdc158d2c1dbc265ad59513def693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp/src/tools/cloud_reads.rs:94-105 | crates/mcp/src/tools/cloud_reads.rs:176-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/cloud_reads.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e061445f88e0142fbacc4c7f3ba34a2dac0441e6096dd6b6909b1560ee4c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/api/src/markdown_output.rs:2029-2040 | crates/api/src/markdown_output.rs:2059-2070 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/markdown_output.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc355472cb6e5bf49c6840ab9d144c25c9af0e63f4c6fcdfdb6938add0ef4586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): crates/engine/src/health/result.rs:676-687 | crates/engine/src/health/result.rs:757-768 | crates/engine/src/health/result.rs:790-801 | crates/engine/src/health/result.rs:823-834 | crates/engine/src/health/result.rs:862-873 \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":"crates/engine/src/health/result.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a50b173ee2f10866bb3bbad6483c88a8e9f5e499dcbe6ad42fdfa9b301e8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/check/mod.rs:2280-2291 | crates/cli/src/dupes.rs:617-628 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/check/mod.rs"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"35640ca5241d3866999401136cfd4baa12ba4a24b4200763779952055419f876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/health/result.rs:518-529 | crates/engine/src/health/result.rs:557-568 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/result.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"7871b6813b1f10c23b768191111511b21c8832cf722e3700337cdbe5eadf59d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/src/agent_install/status.rs:148-159 | crates/cli/src/setup_hooks.rs:242-253 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/agent_install/status.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba041dfa5a21bddc73d3d7d0bbfcae0ddef6b05c3c722e1389e8bf6f1496d315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/cli/src/bin/stub_sidecar.rs:200-210 | crates/cli/src/bin/stub_sidecar.rs:275-285 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/bin/stub_sidecar.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba99d2378e83ed47773f6837c4c78820c7fbff7b8f807f9122ae11fdfa2d0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/lsp/src/lib.rs:1466-1476 | crates/mcp/src/lib.rs:50-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/lib.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8604e63452a711bff8d7f4478a62237e24dfa2980833c703d4bf2a01591608f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/engine/src/health/result.rs:652-662 | crates/engine/src/health/result.rs:775-785 | crates/engine/src/health/result.rs:808-818 \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":"crates/engine/src/health/result.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a994d405b03d24c186b46c44a31991a4ddb1c6972089785069f76fd82777c9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/src/audit_output.rs:339-348 | crates/cli/src/audit_output.rs:349-358 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/audit_output.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"792f2105dc8928f9565009733c6ada11f126f34c9134d4be9db0ff0cb5f95b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/engine/src/health/result.rs:293-302 | crates/engine/src/health/result.rs:326-335 | crates/engine/src/health/result.rs:365-374 | crates/engine/src/health/result.rs:452-461 \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":"crates/engine/src/health/result.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"988d908bf691d2c3a9241a59ba38af0f02fc932083ff736af836cb9be55eb123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/api/src/markdown_output.rs:1292-1301 | crates/cli/src/report/human/dupes.rs:593-602 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/markdown_output.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb59afa2c2327a0cb239b348e4dd574854994e50aa0e2faccbd05265c11de1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/health/result.rs:710-719 | crates/engine/src/health/result.rs:743-752 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/result.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b890945c31b45234af4829446ed217d3fe6f2d08667b63c8df7c82573228d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/security/src/lib.rs:849-858 | crates/security/src/lib.rs:935-944 \u2014 both copies are in the same file, so extract the block 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":"crates/security/src/lib.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a15e4917a85296bd7745e5be0a629a9b256d72b058305a7074d13108ce9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/changed_files.rs:171-180 | crates/engine/src/changed_files.rs:200-209 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/changed_files.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc6f3992b76bf55b5a73f403f62db7b2a930c8cf6742d15861c171fe6adf603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/src/health/coverage.rs:1788-1797 | editors/zed/src/fallow.rs:319-328 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/health/coverage.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd7e496c22d0d2e04f1cde764a469294b88d357e5a998ed12bb44bc53c700b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:676-685 | crates/api/src/dead_code_codeclimate.rs:836-841 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"961f86ac200948eae3475dbfeb21682c3ccdc8ef46aa397e7a7f856a77c961f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/mutation_human.rs:501-509 | crates/cli/src/mutation_human.rs:787-794 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/mutation_human.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb29f0e34c222bd08092e97e117fbc947312e2817ff2d9c700e2082b8d7f885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1686-1694 | crates/api/src/dead_code_codeclimate.rs:1735-1743 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf7230816a8f64d3e6f855aeab1968dfcd655fb920c0ee7d013d5fd2cd9d337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/health/result.rs:897-905 | crates/engine/src/health/result.rs:930-938 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/health/result.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a6dccaf3fd7f41169373ca5be0825bef4599fb1723ec1951dfd561f4736016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1254-1261 | crates/api/src/dead_code_codeclimate.rs:1292-1299 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0592f8c2a4e1623c72856b0c25955b20f5014ecd054ce02e77ce48dafe1bd6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/extract/src/similar_code.rs:347-354 | crates/extract/src/similar_code.rs:381-388 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/similar_code.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"683fac6ddfb7cd128566198742456a9381b6ef30a4e7f7c43a28988481bede11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/plugins/contentlayer.rs:134-141 | crates/core/src/plugins/fumadocs.rs:180-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/contentlayer.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ecb9acd134c8e0b642369879336e5c5af2610eea6909275aeeac965e20799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/repo_refs.rs:1350-1357 | crates/engine/src/repo_refs.rs:1365-1372 \u2014 both copies are in the same file, so extract the block 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":"crates/engine/src/repo_refs.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac43f4b8f8ed0119eb7f64f6f8f8d3f1978795683ad088face63c30c650d6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/lsp/src/diagnostics/structural.rs:78-85 | crates/lsp/src/diagnostics/structural.rs:285-291 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"73111a20b174d1f4b823d79c938aa392eb30979ad77c0f056c3380c8456f6175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/cli/src/report/human/check.rs:3162-3169 | crates/cli/src/report/human/check.rs:3283-3290 | crates/cli/src/report/human/check.rs:3330-3337 | crates/cli/src/report/human/check.rs:3368-3375 | crates/cli/src/report/human/check.rs:3412-3419 \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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe495928037497443cc3379323eb364826100fe57e7070907e505bc94296b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/report/gate_outcome_text.rs:44-51 | crates/cli/src/report/gate_outcome_text.rs:91-98 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/gate_outcome_text.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd25c6149c4ef1946d9758743160623ecb6f8d1bc6023655318b6b1e49a510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp/src/tools/audit.rs:94-101 | crates/mcp/src/tools/health.rs:86-93 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp/src/tools/audit.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb695099d6be45e2d59a96336c8a1919420486e371e245311eb77f9d6e757703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/plugins/react_router.rs:353-360 | crates/core/src/plugins/react_router.rs:366-373 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/plugins/react_router.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12e93747e00a62ce3f5fea12a4b01ec766028cae0675330c8810d95922be2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/report/github_summary.rs:2327-2334 | crates/cli/src/report/github_summary.rs:2340-2347 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"182d5443fae7258e5fe9cd549b3f94121c133162f3bffce8f78766b1f06a5e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:297-304 | crates/api/src/dead_code_codeclimate.rs:334-341 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4f2f5018431166f9c863cbfb268511af0fbe37b92a018b22f583db29b261fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/migrate/jscpd.rs:292-299 | crates/cli/src/migrate/knip_fields.rs:266-273 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/migrate/jscpd.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"caffbe58e3a1220796c1cb344a2eb1defbcc30183153bcf811f6cbf60eebbd48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/graph/src/resolve/specifier.rs:870-877 | crates/graph/src/resolve/specifier.rs:887-894 \u2014 both copies are in the same file, so extract the block 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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1151febeefddd496c62b0ebf0eee86a37e5ad21406f73b9c188e84cb9bc1a202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp/src/tools/mod.rs:437-444 | crates/mcp/src/tools/mod.rs:445-452 \u2014 both copies are in the same file, so extract the block 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":"crates/mcp/src/tools/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f9e2de7dba75aedcfed05915adb232b8b160bf5b6275ca91ccc17e4c4f337a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/ci_pr_comment_post.rs:279-286 | crates/cli/src/ci_pr_comment_post.rs:315-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":"crates/cli/src/ci_pr_comment_post.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc98fee9896dbc0f2a42208baad6550560d7f28bfc7be72109326534e00ed51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:1062-1069 | crates/api/src/dead_code_codeclimate.rs:1530-1537 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"70570b86553a3f6889076f51996299d9af044748aaef9f80b877a4b533bbe9b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/src/ci_pr_comment_post.rs:270-277 | crates/cli/src/ci_pr_comment_post.rs:306-313 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci_pr_comment_post.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a74c5e8d2777925e75798a5c9a475560aa6d98a1190ed6b4211c8dd92cbf8eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/api/src/markdown_output.rs:1981-1987 | crates/api/src/markdown_output.rs:2009-2015 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/markdown_output.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d004196b669856c2255b6b482bd57e848c238267e206289a89e8cde929c750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/discover/walk.rs:382-388 | crates/core/src/discover/walk.rs:453-459 \u2014 both copies are in the same file, so extract the block 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":"crates/core/src/discover/walk.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d49ce6794fcb52a776b9ba27663d43a069fa2f4f7b612cc8899b6d5a6a38812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/api/src/compact_output.rs:805-810 | crates/cli/src/report/human/health.rs:2334-2340 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/compact_output.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae8ce53c1e2a860eb067d849bc8128cbdcac6f309a8ebe4af48a7ec0c03fd2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/src/ci.rs:1403-1408 | crates/cli/src/ci.rs:1907-1912 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880ea45bc30e9450173c8a5d3e820e34d43dc4ceeb1e5e70ed45b688cece5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/lsp/src/diagnostics/structural.rs:597-602 | crates/lsp/src/diagnostics/structural.rs:671-676 \u2014 both copies are in the same file, so extract the block 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":"crates/lsp/src/diagnostics/structural.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b06284e880f545f179592f8e232a41304a80a1bb7cb741b591d2d8216724a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/api/src/dead_code_codeclimate.rs:572-577 | crates/api/src/dead_code_codeclimate.rs:630-635 \u2014 both copies are in the same file, so extract the block 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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cdf57fd82d476c63c0ebb551a5d1af8ee99521646f280f8157f96ae869aed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/api/src/similar_code/transport.rs:494-499 | crates/api/src/type_aware/transport/process.rs:194-199 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/similar_code/transport.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b69848ab71c7a4a0683e71ac8b561a2931fd374ead8e9ff45d4bf572fa96132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/src/report/sarif.rs:877-882 | crates/cli/src/report/sarif.rs:927-932 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/report/sarif.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea815335a0ace86e07310acd2c5b4928631533b041577916598ce7f0ef0c383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cli/src/ci_review_post.rs:123-127 | crates/cli/src/ci_review_post.rs:176-180 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/src/ci_review_post.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"60709b439184f4e3bf434a4baab039eb14343cdec5610c02ea49a4135128c7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/output/src/dead_code_sarif.rs:702-706 | crates/output/src/dead_code_sarif.rs:756-760 \u2014 both copies are in the same file, so extract the block 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":"crates/output/src/dead_code_sarif.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bf77cf4838ff0ba99a69939a4ba7916f4c99c1b0900106b303c78ecfb1e074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/src/telemetry.rs:1840-1846 | crates/cli/src/update_check.rs:235-241 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/telemetry.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"e281bd6aaea8f0cfc3686a149152112fbf5fade5a34457174e31683af41ea1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/config/src/config/parsing.rs:1683-1689 | crates/config/src/rule_pack.rs:318-324 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/parsing.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e5ecab1b0bc6cf16b6a229f296652edbc7fda7b123557420797d31572613e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/config/src/workspace/diagnostics.rs:589-596 | crates/config/src/workspace/diagnostics.rs:678-685 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/workspace/diagnostics.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782b6bcca01976bf364de2abf316c94cfa6bd2e13164e2d62b793677f306827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/workspace/tsconfig.rs:474-478 | crates/config/src/workspace/tsconfig.rs:506-510 \u2014 both copies are in the same file, so extract the block 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":"crates/config/src/workspace/tsconfig.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd55850d8baccab2a3c9532d547f2b08753355d22853923c095ac2b4a063785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/analyze/members/instance.rs:39-43 | crates/core/src/analyze/members/mod.rs:496-500 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/instance.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fbe68ecfd75f5c2412dbbd931efd5fd2d772d947736ba24168bc17d25cfec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/analyze/render_fan_in.rs:278-282 | crates/engine/src/vital_signs.rs:449-453 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/render_fan_in.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"407c775d99f74bc5ac3beaf2fd5cb74eeef8ee1890131ca00645cfcde5bfb31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/extract/src/complexity.rs:730-734 | crates/extract/src/complexity.rs:748-752 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/complexity.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"08198604f1695eaff803614a51835d37a8740df3b8bf574aefb6d35c04ef5f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/extract/src/sfc_props.rs:438-442 | crates/extract/src/sfc_props.rs:1081-1085 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8332c5c012e177320f212b8ef70269a307e3c2154a6808b30915800765cbb3b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/extract/src/sfc_props.rs:1372-1376 | crates/extract/src/sfc_props.rs:1468-1472 \u2014 both copies are in the same file, so extract the block 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":"crates/extract/src/sfc_props.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a7fff35e49accd1b0195718000e4ecab673ff999ffbd4facf57eb68709d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/extract/src/visitor/visit_impl.rs:1497-1501 | crates/extract/src/visitor/visit_impl.rs:1578-1582 | crates/extract/src/visitor/visit_impl.rs:1812-1816 | crates/extract/src/visitor/visit_impl.rs:1968-1972 \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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01ebf014bb2b1870f57095f30fbf567e1b256cda8f78fd3de1bdab87eac9b44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): scripts/public-config-corpus.py:546-560 | scripts/public-config-corpus.py:662-676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/public-config-corpus.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e6e4925c805637da009edef5fb1e159c34ed5c4dbdd6ad2bd69e6f523451b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/public-config-corpus.py:835-847 | scripts/public-config-corpus.py:852-878 \u2014 both copies are in the same file, so extract the block 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 \u0060scripts/public-config-corpus.py:835\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":"scripts/public-config-corpus.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bc3eb74ecbb5fdfec41824dbc9c4d7c335547310376d05ab02d889117e1d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/scan-hidden-unicode.py:197-202 | scripts/scan-hidden-unicode.py:223-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scan-hidden-unicode.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"542317276a23c3392e4bbfcdde9621c37caa7ad38b276605b0c52dff5c85d61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:9-55 | crates/core/src/analyze/unused_deps_tests/helpers.rs:118-173 | crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs:1187-1269 | crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs:1370-1396 \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":"crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d63cc181a7c55299fd66cec5de7e663d7c03461c7714f06e4e8d2ed6d0447e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:37-51 | crates/core/src/analyze/unused_deps_tests/helpers.rs:154-168 | crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs:1244-1258 | crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs:1380-1395 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0e47e212c54223590e6f95ce1193297219d3e3a62d72813445772096b9de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:28-36 | crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs:1235-1243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7b17c89413dd35912a509983777abbcf950e3fd551afde529b9ab086949f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/plugins/test_alias.rs:142-149 | crates/core/src/plugins/test_alias.rs:150-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/test_alias.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abb6444a9afbb91d6260875f3720e3dba3cc478a8144f997938dea1fbfa5421"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project fallow-core: fallow-core has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5730b149c7fe9c1c6ecf48181b5d2e44971ada511e3d4fee9b71d33f2153491f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project fallow-engine: fallow-engine has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e5fc96543d5cf54824a248cfe1f6a197151be5ab3bb03b6e0e18e849b7b03c49"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fallow-license: fallow-license: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1b8d2ace2d72088d3c4bbb3d800cbc068a9e6d97d3fdc83aeb0ecbde91e60f4e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fallow-mutation: fallow-mutation: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d75d8244acbfdc916e0afdb4eca93a130a8bca792cdaed63492dfe0b4bd20afa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fallow-process: fallow-process: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"020a40000159a87caeee654963a73199074d54b81bf711b59bb037fc192735b5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fallow-v8-coverage: fallow-v8-coverage: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"60d0b5030d2d7323ba3c0bb6c49427663b5e8ba8d645c0d2306306d4e265ff67"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fallow-types: fallow-types: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f108f15b644e8239e285812926dc79794e34e7d7d307b852f72b59eaf052a549"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fallow-config: fallow-config: abstractness 0.01, instability 0.11, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"61c27be76e7f9fd5ba219fe6c31038d89e3575d9f1551605084b2f5bb2d41b3b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TraceProvenance (LCOM4 5): TraceProvenance\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":"crates/types/src/trace.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"217bf29d4bea86e72dd1df076f81b4ed84ca407a76dca7ec83781707dac691aa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Collector (LCOM4 4): Collector\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":"crates/mutation/src/collect.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fa12752e5d1484919e5cf59ae544c228ffee72a0eecbec978b6f0d080a20ce"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: skipped: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/test/fixtures/vitest-basic/test/math.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c621714a0014ea01625f8023f5d0bdd42778b7529a56ef576316107b481f4bad"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: skipped: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/test/fixtures/node-basic/test/math.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b90f88061886637b6b9bd5498c5fe31bd69aa3dfdbc4ba61c153bfc9817d71c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: skipped: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/test/fixtures/bun-basic/test/math.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feb7500ab329d033a37df15cc5f05881dd953eb72f9e94d0c8fc3a3b8a66233"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: preflight accepts the sidecar\u0027s own install of each backend: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/type-aware-sidecar/test/backend-preflight.test.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1018ea68e75543d11179e8472ea4c388207141ac218ca599338515352a4a44"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: pauses: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/mutation-runner/test/fixtures/node-basic/test/faults.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c6083da1583dc28d6d41b71caef353531216947757a5079ef9b2f66c88af94"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: positive without an assertion: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/mutation-runner/test/fixtures/node-basic/test/math.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8161d7f3f51b3ca158cb5786adf139b0e90691a8843d6d79c0fc5f99017e3ca"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: noise: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/mutation-runner/test/fixtures/node-basic/test/math.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68087a3996b2dfe475d7e6763b4efa71cb871061f6798ea4eba47b6ed0eff08"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: pauses: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/mutation-runner/test/fixtures/bun-basic/test/faults.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a70d9ec7f22ec2eafc783b17e40e2bdd4867153ca4baacf78bff1ed5da2ac95"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: positive without an assertion: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/mutation-runner/test/fixtures/bun-basic/test/math.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dcf004e7e199e3d941ff238afd4f41a1a1a4beeddfba732b618939aa92304e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: noise: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"tools/mutation-runner/test/fixtures/bun-basic/test/math.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"23be6f82651bc57c46294e108a4c21627a547ed058f79204f51700ec49bb5002"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): placeholder: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts/src/placeholder.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cdf3b2e894d43ed1146faef812896805823ba451d09e6743de2d59f228d9e0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: renders the page many times: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/render-fan-in/src/__tests__/Button.test.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"06393679eb0e07e5b122fd357a5abdeebba3d6a52b932b3c32a4edc496d98d11"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: opens a report: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-test-subpath-import/tests/example.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2647e7b141f43c37d15ac2c56f3690b4e3cafe1f6375cf78ba0f65830092e03"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: chained access reaches admin page: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-pom-fixtures-nested/tests/chained.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc645211266266c28653a7e351f6272e4850ab8ea350f98e2fbbb1e77fbbf269"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: nested destructure reaches user page: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-pom-fixtures-nested/tests/destructured.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f856f722554130b9bfe9344776c62333cac2a1944949a203f1fb6d5a6b5cc307"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: admin and user: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-pom-fixtures/tests/example.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf97da6de8119ce9d37d420b8cd7832d6d545a79fa61774dc85daa1c90cc2419"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on one member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/bun-target.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f87072cc492998d1808da616e78e48856982aefb0c1db8d95ebe24e0f35f8"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on one member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/context-target.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cc44d7b133ebdc5be27088070f4cdb18a82580fed48cc389247740bd8b78cb"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on a computed member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/dynamic-target.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f59f6a7e6360a5a811a518371d2f6ee4e4b6d43a183f55f7504dc85fe68c13"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on one member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/global-target.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fabdc00b76f6271549232009394ad6a6007d496bf81ec730d96131a3d118698"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on one member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/jest-target.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"016ed756ddac133962afb83988764c7e3b86523a97a66e1686d517322343b10e"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: passes the namespace to a local helper: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/local-target.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93650088247a2ffb5a928e54b06f62f96284d496026ea713da20b4f02841c5"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on one member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/node-target.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4631a1dbd40e3698217b743c87f5e3a3f6cebc32166d4546633f2896d36523c2"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: spies on one member: No conventional assertion call was detected, and 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/vitest-target.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"923d20d0cb02fb3d2d8a5533b006b65de4684fcfa8d6bca091862dbe19e901cf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: helper: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-951-bun-test-discovery/test/unit/example.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d753d5ba64a0527c76f26af2d317db491d15ef315cd601c628af95c377dff5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: smoke: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-951-bun-test-discovery/test/unit/smoke_spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbda2c7bed20c5570305628400d78762994387cf1a5b9f7c50a79053783f2657"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: outside: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-951-bun-test-discovery/test/outside/outside.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c8dd8f5d015e63cecf4577da3447bca3971c2d01057f8b6904d8e0ddcb64f9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: opens a report: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-3462-playwright-mergetests-chained-extend/tests/example.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b04ace8e904fe656454b3846d7d3b4a3b61a44d77ce46e47a2a947d7b58fb7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: login: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-1785-playwright-fixture-interface/tests/login.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1e6ca537054fc3bb2a3a93400f51bf542b3b5929b98203a615e18e100ca43"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: the lint and format scripts use the same scope list: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"scripts/js-lint-scopes.test.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4befa59e1dc2528bb0bfffc8216c3b5f6b54a1f58db68005872a52c88b864cc6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: keeps each envelope independently and narrowly versioned: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"editors/vscode/test/generated-types.test.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f214ceb2d782d729af7a1f96b353a116a4e5f3a522b9a7d254a78f574e8f4"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/issue-1785-playwright-fixture-interface: No conventional assertion call was detected in 1 of 1 tests in \u0060tests/fixtures/issue-1785-playwright-fixture-interface\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-1785-playwright-fixture-interface/tests/login.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9490cc2fd744fb09bc4280514665828d312d48b0f027a5d8449f30d16d83fe5"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/issue-3462-playwright-mergetests-chained-extend: No conventional assertion call was detected in 1 of 1 tests in \u0060tests/fixtures/issue-3462-playwright-mergetests-chained-extend\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-3462-playwright-mergetests-chained-extend/tests/example.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd75bceb84c5e211210c8e4e484f1b696e1fd6e1bd99b61a03f164bb0c54161"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/issue-951-bun-test-discovery: No conventional assertion call was detected in 3 of 3 tests in \u0060tests/fixtures/issue-951-bun-test-discovery\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/issue-951-bun-test-discovery/test/unit/example.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"55baed2c2e8b76efbcda9d61893eab1cdbcca6a559781d5960c0734f3f07e039"}},{"ruleId":"D10","level":"note","message":{"text":"Test project verifies nothing: tests/fixtures/namespace-spy-call-member: No conventional assertion call was detected in 8 of 8 tests in \u0060tests/fixtures/namespace-spy-call-member\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/namespace-spy-call-member/src/bun-target.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae472c651946806e37b3ad84939a4576d5328735847ea5d64b06003db4439143"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/playwright-pom-fixtures: No conventional assertion call was detected in 1 of 1 tests in \u0060tests/fixtures/playwright-pom-fixtures\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-pom-fixtures/tests/example.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf10a9bb3faec9eff3b0fda907baf5262c31e798292b676c58e28b2189a34e3"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/playwright-pom-fixtures-nested: No conventional assertion call was detected in 2 of 2 tests in \u0060tests/fixtures/playwright-pom-fixtures-nested\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-pom-fixtures-nested/tests/chained.spec.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38d74c4557f028fa70acd0e02f7f9f9f4a4965686d097e73dcc434eaf0a4bc"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/playwright-test-subpath-import: No conventional assertion call was detected in 1 of 1 tests in \u0060tests/fixtures/playwright-test-subpath-import\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/playwright-test-subpath-import/tests/example.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ca4ffe7f29f1e9c6833201d00df330a7c8bbca6df41e0426dcec2c9684878e"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/render-fan-in: No conventional assertion call was detected in 1 of 1 tests in \u0060tests/fixtures/render-fan-in\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/render-fan-in/src/__tests__/Button.test.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d5d42bc0407caa16592cf65509f32423af3c6d4cb34823b3e224373bae780"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts: No conventional assertion call was detected in 1 of 1 tests in \u0060tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts/src/placeholder.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"71caea046a3ba64d14f2d432b2847bfcd9cc2d8b7a0dd39ad9bb89f85cfa1b1e"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: serializes two concurrent holders: This test starts work it did not wait for (\u0060a\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":"editors/vscode/test/download-lock.test.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"727dab098caffbc9cbe5c6f6feb84f687ee27aceb0110b538c1d71ac2ba73c9d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: response shaping: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/mutation-plan-response/src/response.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3f8de2bc9b892d41c980788702bc47ff4de48aea3c9f45a904d34c0ced204d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: fires each unique provider once to re-pull open documents: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/test/client.test.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46acc42dee3517a72758b5841a673fb44f0d2ef9bb6f8826fc04d1d143a2ec6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: skips non-file documents (output channels, git, etc.): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/test/client.test.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c613b0f08bdd0154f4f1a5fc05541931b7545b30af0b739ac07ad665f84060a"}},{"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":"b1869571bf35f8abd84dd3784a2ecf16447e4fd21142d6c99cdb636c236ef588"},"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":"0e560ff29ec921d97fe287029d705d86193ce2a17b6f5ea0cf0d075c0332ee98"},"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":"e67fbf7ab007ac06fb65b91d81293be8791f66d68262eb85072da7119d4f62a9"},"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":"2b1b7689b5f6ffabfc7da1bba1a4f38f7f25ef623acfc184c041a4785947ef9e"},"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":"3e4f86e73e93abd23c5cd0f1060ff5d893340352ab39ed4bde9096229d8e4970"},"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":"df6c48d8d901624f32c5eb9a7b72ebaa384c56e5e4474dff0bb12638b5de15bc"},"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":"151cbafb958e10d1f3b622e70745bcaddc49b34f64fb2f8c3f95fced7b3de061"},"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: crates/types/src/workspace.rs: crates/types/src/workspace.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in fallow_types::workspace::render_message at line 1542. 23 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/types/src/workspace.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":"crates/types/src/workspace.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"95475417d561bd4eb77d6c4e269585ada052423fb117b8a8db5bd5df8c65d8a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/check/mod.rs: crates/cli/src/check/mod.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in IssueFilters::enable_cli_filter_flag at line 124. 29 of those changes were fix/bug commits, and the other 30 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/check/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":"crates/cli/src/check/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5820765626e35a008f8a2659cc7cc35420056039ede3768ed74db3c6d9373df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/lib.rs: crates/api/src/lib.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in DeadCodeFilters::enable_cli_filter_flag at line 587. 18 of those changes were fix/bug commits, and the other 35 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/lib.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":"crates/api/src/lib.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5950a1629fa498d58773f4043ceadbd708c3672215150682ebc05b487fcea8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/visit_impl.rs: crates/extract/src/visitor/visit_impl.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ModuleInfoExtractor::record_factory_return_function at line 188. 53 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl.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":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a399cd8214552fce4d42b1577aba7d70977b80328f0ef0969e82780f2691c31f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/audit_keys.rs: crates/api/src/audit_keys.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in DeadCodeAuditLedger::annotate_results at line 146. 15 of those changes were fix/bug commits, and the other 17 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/audit_keys.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":"crates/api/src/audit_keys.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69508d51e43f13e62fa847514919bd2a3e1c0b945867d0f1209358075ded94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/lib.rs: crates/cli/src/lib.rs changed 98 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::run_command at line 453. 35 of those changes were fix/bug commits, and the other 63 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/lib.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":"crates/cli/src/lib.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb92026022020abe9126474e0f245e99de124523e00323905ac167a07ea90f7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/config/rules.rs: crates/config/src/config/rules.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in RulesConfig::severity_for_kind at line 593. 4 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/config/rules.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":"crates/config/src/config/rules.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a62df0bde690184894a400b66a886a1b87d5ea54d55889b212e4350feb4e072"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/mod.rs: crates/extract/src/visitor/mod.rs changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ModuleInfoExtractor::subclass_reference_candidates at line 1339. 46 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/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":"crates/extract/src/visitor/mod.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f95e0012361098531f8b13133d97028ee8fe418fcdfc7088d1565b4cdba9ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/cli_startup.rs: crates/cli/src/cli_startup.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in fallow_cli::cli_startup::command_without_global_baseline at line 685. 11 of those changes were fix/bug commits, and the other 13 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/cli_startup.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":"crates/cli/src/cli_startup.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5cae89ad6b0e349af30a6cf4cf46c589f835c68059efeb0a869d454c3ac4ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/output/src/dead_code_sarif.rs: crates/output/src/dead_code_sarif.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in fallow_output::dead_code_sarif::dead_code_rule_severity at line 1214. 9 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/dead_code_sarif.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":"crates/output/src/dead_code_sarif.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6843759563b35fa32ada102895b0091176f2e8fdd8737009671717b6ccd12c90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/output/src/check.rs: crates/output/src/check.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in fallow_output::check::suppression_kind_rank at line 1194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/check.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":"crates/output/src/check.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6b4eb41991827d1d27e6159581fde9d399a35c7d63d15a5c9bf29b02dd3b95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/analyze/unused_deps.rs: crates/core/src/analyze/unused_deps.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_core::analyze::unused_deps::add_source_package_manifests at line 2252. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_deps.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":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5332f07adb49a14f7a7eabfc44ce38cc22354b06a8765bb240f80e0979d47cf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/explain.rs: crates/api/src/explain.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in fallow_api::explain::member_import_rule_guide at line 770. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/explain.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":"crates/api/src/explain.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d02ca3b2be06e2cf69350f8099c550d42bcc483a1d9576f94fbadb7991bea4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/types/src/suppress.rs: crates/types/src/suppress.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in IssueKind::from_discriminant at line 388. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/types/src/suppress.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":"crates/types/src/suppress.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0deba4167dfe64573235678677d9afcc0d297cd3aee8cc799639bc6aa132e0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/health/mod.rs: crates/cli/src/health/mod.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::health::run_health at line 399. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/health/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":"crates/cli/src/health/mod.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"18005d06ddee872417130b8be4ce4378e8cb6b1a4a7c14cf1d6feb255ab725b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/report/github_summary.rs: crates/cli/src/report/github_summary.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::report::github_summary::render_fix_summary at line 3011. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/github_summary.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":"crates/cli/src/report/github_summary.rs"},"region":{"startLine":3011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b25b123a77e65af2d07114f07b8c949f45f40c8d722bf6d8134d582d6ff4a24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/health/scoring.rs: crates/engine/src/health/scoring.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in IstanbulFileCoverage::lookup at line 1370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/scoring.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":"crates/engine/src/health/scoring.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9277d30f77c5fdc95b08856470d1d7493f686c98c34a9c93ceae24544868f2c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editors/vscode/src/extension.ts: editors/vscode/src/extension.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in extension.activate at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- editors/vscode/src/extension.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/extension.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dfd240a607129419562f6c6ec71bfc5cc0d238397636f67de02c4ff194b7e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp/src/tools/code_mode_tools.rs: crates/mcp/src/tools/code_mode_tools.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CodeModeTool::from_name at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/code_mode_tools.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":"crates/mcp/src/tools/code_mode_tools.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7311f2b19391c0519464b2b189be9466ea1dda7d3ae96362c49e3aebe41ce43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/report/human/mod.rs: crates/cli/src/report/human/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in fallow_cli::report::human::section_issue_kind 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/human/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":"crates/cli/src/report/human/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f660525e6104c4f01ffd3403c3cbb1f4b767db7ae6d4369a05f94ca69baeb10d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/parse.rs: crates/extract/src/parse.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_extract::parse::subclass_reference_spans at line 1669. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/parse.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":"crates/extract/src/parse.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a823bc253db90a3980b27112d92ff936a300a585f8b70c211c41eca9306088d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/report/human/check.rs: crates/cli/src/report/human/check.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_cli::report::human::check::collect_framework_rules at line 3544. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/human/check.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":"crates/cli/src/report/human/check.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"99afd221bc83797410e819b000e96b3030f069cd83290900ccbfff1f2029ed47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/audit_brief.rs: crates/cli/src/audit_brief.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_cli::audit_brief::decision_surface_lines at line 1802. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/audit_brief.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":"crates/cli/src/audit_brief.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c1efc5dd56565281e4102591a2bbc341474c803d88fe4c9e9560028ed0a4f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/dead_code.rs: crates/engine/src/dead_code.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_engine::dead_code::apply_base_collection_rules at line 850. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/dead_code.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":"crates/engine/src/dead_code.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea443d33134793aa0165042de1eceb35f92e5620f0d0d149faaaf65bc31ef54f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/check/output.rs: crates/cli/src/check/output.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::check::output::handle_type_aware_trace_output at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/check/output.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":"crates/cli/src/check/output.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d2e0d979dfe7894ba5c3d1286e71b899ea3b76b879fc095ef92db9e3f0ca64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ship-wait-checks.mjs: scripts/ship-wait-checks.mjs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ship-wait-checks.currentRollupChecks 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- scripts/ship-wait-checks.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/ship-wait-checks.mjs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"70824846f27334bd6e0c2726b1638e87802cdc4bf2cd59940e2dd4412c0ef633"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/mutation/scheduler/mod.rs: crates/api/src/mutation/scheduler/mod.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Worker::attempt at line 666. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/mutation/scheduler/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":"crates/api/src/mutation/scheduler/mod.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cbfa2afed47b0e4e3c3de5d6ab8126379c5fd004259ab0195bcbbe18980265"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/report/sarif.rs: crates/cli/src/report/sarif.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in fallow_cli::report::sarif::native_rule_id at line 764. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/sarif.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":"crates/cli/src/report/sarif.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2540053b420bfe01905bb88e5811f5a21f8e27d973753536f4bbe6f3f952ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/runtime/dead_code.rs: crates/api/src/runtime/dead_code.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_api::runtime::dead_code::apply_dead_code_component_filters at line 1067. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime/dead_code.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":"crates/api/src/runtime/dead_code.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d9f736647a6b09af7dcc5b377e3ace27f749eeb3e522bb7c6039f090b98777"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/runtime/similar_code.rs: crates/api/src/runtime/similar_code.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in fallow_api::runtime::similar_code::review_similar_code at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime/similar_code.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":"crates/api/src/runtime/similar_code.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9222b4c53adb34bf62aedc9815311ef8211346cc5c09a360ae24600c6ad9cd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/analyze/unused_overrides.rs: crates/core/src/analyze/unused_overrides.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in fallow_core::analyze::unused_overrides::collect_lockfile_packages at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_overrides.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":"crates/core/src/analyze/unused_overrides.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"357e5a1b25081cb8abde1610e57cdcfd31a290a58ddf88752469d1a5183357bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/cli_report.rs: crates/cli/src/cli_report.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_cli::cli_report::run_report at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/cli_report.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":"crates/cli/src/cli_report.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94fb1d3cae869e439b0370981ab603b552de53c91478bb4f2b89254a6a8502e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/main.ts: viz-frontend/src/main.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in main.init at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/main.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":"viz-frontend/src/main.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f97cd8c5532475aaf5bbe11b72ac708261a5b2e568a0e839b1bcbd512c27c58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/declarations.rs: crates/extract/src/visitor/declarations.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ModuleInfoExtractor::extract_declaration_exports at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/declarations.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":"crates/extract/src/visitor/declarations.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f757887a7e16727bf382398e661718c27b56a09a80b95d408bcbfc724bf4bd45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/graph/src/graph/narrowing.rs: crates/graph/src/graph/narrowing.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_graph::graph::narrowing::attach_symbol_reference at line 754. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/narrowing.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":"crates/graph/src/graph/narrowing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb83a97fff7ab021198bd1f828a5bb202b07685ed831bded1fa49f41fe17606"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/plugins/module_federation.rs: crates/core/src/plugins/module_federation.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in FederationCallCollector::merge at line 669. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/module_federation.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":"crates/core/src/plugins/module_federation.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a58c299974a6bcd89def6f1e44290013ee10e009dda45335b7bc683cc07b43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/cli_telemetry.rs: crates/cli/src/cli_telemetry.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_cli::cli_telemetry::telemetry_workflow_for_command at line 244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/cli_telemetry.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":"crates/cli/src/cli_telemetry.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4d985597191fe31e721fbb9f88fdab560f4d3cc070073416610ec24c3412f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/flags.rs: crates/cli/src/flags.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_cli::flags::run_flags at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/flags.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":"crates/cli/src/flags.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f502f5ac684bbcd30b4d40be13a4dbecfa244633d5ebd592d5631a69307195c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editors/vscode/src/treeView.ts: editors/vscode/src/treeView.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in DeadCodeTreeProvider.getChildren at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- editors/vscode/src/treeView.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":"editors/vscode/src/treeView.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"74db6e4becdfae7f6dc524a2fddb833ff4983331e2d07d672fd30a44aa6df085"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/visit_impl_object_bindings.rs: crates/extract/src/visitor/visit_impl_object_bindings.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ModuleInfoExtractor::complete_binding_producer_calls at line 968. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_object_bindings.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":"crates/extract/src/visitor/visit_impl_object_bindings.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff21ec65736c7459dc4a0461f461711569a43eb4874985a754c6a48b69e1227"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/visit_impl_scope_bindings.rs: crates/extract/src/visitor/visit_impl_scope_bindings.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ModuleInfoExtractor::static_sink_literal_value at line 419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_scope_bindings.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":"crates/extract/src/visitor/visit_impl_scope_bindings.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e0b771dccb8f4cfa6f4dee755ff3cb8be801813aa8af3bc9df273fb42e5430"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/generate-all.mjs: scripts/generate-all.mjs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in generate-all.generateTypeAwareProtocol at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- scripts/generate-all.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/generate-all.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"493bfb9d9f0c8df53ee3a2aa3064bea87849400bf8d36b82c41f9b41ad2e720f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/analyze/members/mod.rs: crates/core/src/analyze/members/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_core::analyze::members::collect_direct_member_accesses at line 1726. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/members/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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2cc107428387157853c459372ec1441758975e2798c9d469ff886975fd8927"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/mutation/report.rs: crates/api/src/mutation/report.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_api::mutation::report::completion at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/mutation/report.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":"crates/api/src/mutation/report.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb29815898e2fd5c7d5fd2c91012c3716694ecb752872f5c123052bb7bb725b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/report/gate_outcome_text.rs: crates/cli/src/report/gate_outcome_text.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_cli::report::gate_outcome_text::known_gate_label at line 493. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/gate_outcome_text.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":"crates/cli/src/report/gate_outcome_text.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c19adf44746ef39a8c4e4995d3d0be6acdf47db6f24ea536c699ad1ab3cc17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editors/vscode/src/analysis-utils.ts: editors/vscode/src/analysis-utils.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in analysis-utils.buildAnalysisArgs at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- editors/vscode/src/analysis-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":"editors/vscode/src/analysis-utils.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3fcb4dc5351768b12655620555c382e347022eb002448b57b260648b902436"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/output/src/gate_outcomes.rs: crates/output/src/gate_outcomes.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in GateName::as_str at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/gate_outcomes.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":"crates/output/src/gate_outcomes.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"817c314fcc3b2816887680776775f7f9f282db64759fb63ed4bdcb3ae882ba8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mutation/src/collect.rs: crates/mutation/src/collect.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Collector::visit_binary_expression at line 1549. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mutation/src/collect.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":"crates/mutation/src/collect.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba661afa66d52f7556f38da9017a5debe177f3e7e9120aa7da4c752457b291e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editors/vscode/src/download.ts: editors/vscode/src/download.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in download.downloadBinary at line 1107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- editors/vscode/src/download.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":"editors/vscode/src/download.ts"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e6e931336c3c090cfbcc60b703dd5d75c08297e0e039099a9925a046bc37d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/discover/parse_scripts.rs: crates/core/src/discover/parse_scripts.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_core::discover::parse_scripts::collect_script_file_refs at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/discover/parse_scripts.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":"crates/core/src/discover/parse_scripts.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dc9b36226c1664795128112d56c54e9cca5f8de2839372e5f31e5077316ca5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/base_worktree.rs: crates/cli/src/base_worktree.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SweepDisposition::reason at line 833. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/base_worktree.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":"crates/cli/src/base_worktree.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd05b2624d2ee022428083dd7cd43d7ae07fc37a6e83df1422c5310b7b096fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/mutation_cli.rs: crates/cli/src/mutation_cli.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_cli::mutation_cli::run_inner at line 526. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/mutation_cli.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":"crates/cli/src/mutation_cli.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc4af9dac1eaee15e94cb0e0adb543c8632cb239a85c6a0dbe5afcf42cf3474"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/type_aware/client/mod.rs: crates/api/src/type_aware/client/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_api::type_aware::client::record_candidate_decision at line 2100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/type_aware/client/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":"crates/api/src/type_aware/client/mod.rs"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"772378bf5868be91d3daef6c65c43b7f503a50d5b7bf691ad330173092499fe8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/visit_impl_chain_names.rs: crates/extract/src/visitor/visit_impl_chain_names.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in fallow_extract::visitor::visit_impl_chain_names::static_member_object_name at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_chain_names.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":"crates/extract/src/visitor/visit_impl_chain_names.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"def1a1f5609ce84ff5c4aca2f05ae2210242dd9f2f0e6fe4494797aef8f6f3c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/health/css_analytics/classes.rs: crates/engine/src/health/css_analytics/classes.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in fallow_engine::health::css_analytics::classes::css_class_inventory at line 534. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/css_analytics/classes.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":"crates/engine/src/health/css_analytics/classes.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6583c23eb5dd2794f8c6a7211ec37bc43d23df6a0f9df7d9145c7048f299140b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/chrome.ts: viz-frontend/src/chrome.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in chrome.buildChrome at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/chrome.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":"viz-frontend/src/chrome.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"350832db1ddc721d6db7bae925feeed1289f3b61dfa2f6533cf384e4daa790e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/mutation_human.rs: crates/cli/src/mutation_human.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::mutation_human::render_status_lines at line 589. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/mutation_human.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":"crates/cli/src/mutation_human.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6d71c026c7e1301357eee9596a4b56ea076cc6762e5905b972d1155cd0b75f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/plugins/typescript.rs: crates/core/src/plugins/typescript.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_core::plugins::typescript::parse_tsconfig_references at line 422. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/typescript.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":"crates/core/src/plugins/typescript.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121242e71879f3a10a5b310a81d147949fea1814fc9b291cfb1ff4c6add3f4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/graph/src/resolve/upgrades.rs: crates/graph/src/resolve/upgrades.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_graph::resolve::upgrades::apply_specifier_upgrades at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/upgrades.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":"crates/graph/src/resolve/upgrades.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc013ea3403dcfecec0cd591f5e534befa0042406751d05e328677f015c6caa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/visitor/visit_impl_projections.rs: crates/extract/src/visitor/visit_impl_projections.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ModuleInfoExtractor::record_projection_source at line 287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_projections.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":"crates/extract/src/visitor/visit_impl_projections.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f240340fd4e8bc05d787a4043cfb19b91c9183f2536904827eca0dc2cf5e0f01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/audit_cache_prune.rs: crates/cli/src/audit_cache_prune.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in fallow_cli::audit_cache_prune::entry_row at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/audit_cache_prune.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":"crates/cli/src/audit_cache_prune.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f620361c3dc19790553561b844868b84d963c1bd01f240c6c06858a1718834a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/generate-agent-adapters.mjs: scripts/generate-agent-adapters.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in generate-agent-adapters.generateSkillAdapters at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- scripts/generate-agent-adapters.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/generate-agent-adapters.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de403a3d3d684af1e6a8b5d884438148d43f18d7144277afa3837cfdd326aa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/sfc_template/component_contracts.rs: crates/extract/src/sfc_template/component_contracts.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in fallow_extract::sfc_template::component_contracts::collect at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/sfc_template/component_contracts.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":"crates/extract/src/sfc_template/component_contracts.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a09ae44ba526c571a3a475c252e3b71ef5c65eaf5630e3e2f1a5d6f66d6ba92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/api/src/diff_risk/mod.rs: crates/api/src/diff_risk/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in fallow_api::diff_risk::detect_file at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/diff_risk/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":"crates/api/src/diff_risk/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3a5c5aa3e98a5487e4f67807f652651be97e36fc902e8c8adeb2e1b3742202"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/panel.ts: viz-frontend/src/panel.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in panel.rankRowsForLens at line 1652. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/panel.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":"viz-frontend/src/panel.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf6699121fcf7ef279bfdff490ab6be921b39cb0d0b25b389d431c1ed4cd7d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/extract/src/template_complexity/engine.rs: crates/extract/src/template_complexity/engine.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TemplateComplexity::scan_expression_without_ternary at line 366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/template_complexity/engine.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":"crates/extract/src/template_complexity/engine.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"270b5c77dc997aff3f279154a51bd5a08df51f0bb4ea309d4f3f95476e7bab79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/graph/render.ts: viz-frontend/src/graph/render.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in render.drawNodes at line 462. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/graph/render.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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddc6d2d5686c8fa1527a90caff6a80a934aa60f60ae93a8d55a0309390ee430"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/plugins/gatsby.rs: crates/core/src/plugins/gatsby.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/gatsby.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":"crates/core/src/plugins/gatsby.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d38c4d39466539c22e0bd33e8638d5282c79fef2ee018c2d7cd1243ac17b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/analyze/members/factory.rs: crates/core/src/analyze/members/factory.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fallow_core::analyze::members::factory::factory_return_object_property_classes at line 308. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/members/factory.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":"crates/core/src/analyze/members/factory.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ea3a9f6209c952aaa39285974e88eb3db1968bba59dcace0f755bb559a2135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/data.ts: viz-frontend/src/data.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in data.lensFindingLevel at line 794. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/data.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":"viz-frontend/src/data.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"d521f1039c1d04d6b205b64ca908d213470b7ebcb01a023c1429c09cd086dac2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/discover/infrastructure.rs: crates/core/src/discover/infrastructure.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_core::discover::infrastructure::collect_flag_value_file_refs at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/discover/infrastructure.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":"crates/core/src/discover/infrastructure.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f838eae9676c56daaa8f6bb82aff521612296af1841c48981a15f4810dc007"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/graph/ego.ts: viz-frontend/src/graph/ego.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ego.buildColumn at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/graph/ego.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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b283a42b33233996b88e351941cf6dc775b5832041b69ba6f0335b2aa72158b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/graph/src/graph/namespace_indexes.rs: crates/graph/src/graph/namespace_indexes.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NamespacePropagationIndexes::new at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/namespace_indexes.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":"crates/graph/src/graph/namespace_indexes.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9395a0d62252f299d041905ace64d99f15a4d6d98367bbb33e4d7c1dbcfb14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/treemap.ts: viz-frontend/src/treemap.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in treemap.renderTreemap at line 428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/treemap.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":"viz-frontend/src/treemap.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e396d853fde63012c6ecb799c1935341775b11224793ff6b203f83a6c10447e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/bin/stub_sidecar.rs: crates/cli/src/bin/stub_sidecar.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::bin::stub_sidecar::main at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/bin/stub_sidecar.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":"crates/cli/src/bin/stub_sidecar.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0b091ebaecb317c486e652bc9a74b04b2c3c3282a73d4f5372ae230122c735"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/graph/build.ts: viz-frontend/src/graph/build.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in build.louvainCluster at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/graph/build.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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf0a36b513221a1bf0afc41e18a3fb45c9fd87ab3793dbbfa6bbfdbdeb87017"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viz-frontend/src/tooltip.ts: viz-frontend/src/tooltip.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in tooltip.lensLine at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- viz-frontend/src/tooltip.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":"viz-frontend/src/tooltip.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fa9b012024ed02104a516c56d6840e0b0e48d0a60e131d83ee8399773cde22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/similar-code-sidecar/src/protocol.rs: tools/similar-code-sidecar/src/protocol.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_similar_code_sidecar::protocol::process_request at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- tools/similar-code-sidecar/src/protocol.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":"tools/similar-code-sidecar/src/protocol.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569d6b8a8d3e5bd2461f97eee00a2226a5a5c5b058e80fc194632c6690cc842"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editors/vscode/scripts/package-type-aware.mjs: editors/vscode/scripts/package-type-aware.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in package-type-aware.packageTypeAware at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- editors/vscode/scripts/package-type-aware.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":"editors/vscode/scripts/package-type-aware.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"954ea2d0f2dac4c9e717957e1e84e031ddbcba15f6760bd75bc86051d789ddfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/cache/types.rs: crates/extract/src/cache/types.rs changed 128 times in last 90 days and 97 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 CachedModule::source_fingerprint at line 366), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): credit members on the return type of a method called through this (#3971)\u201D; \u201Cfix(extract): credit members on the declared return type of a method (#3927)\u201D; \u201Cfix(security): trust module-relative path bases and check every path segment (#3926)\u201D; \u201Cfix(extract): resolve store aliases declared inside a function body (#3938)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/cache/types.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":"crates/extract/src/cache/types.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9ac18447c7974f436f00cc5a8a3e050da540ba30a0f4bf650855d7f3add790"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/cache/mod.rs: crates/graph/src/cache/mod.rs changed 73 times in last 90 days and 55 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 CachedResolveResult::from_resolve_result at line 85), 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(resolve): map dist/src workspace exports to source when the build output exists (#3832)\u201D; \u201Cfix(vite): credit Sass files loaded by additionalData, aliases and Vuetify (#3833)\u201D; \u201Cfix(resolve): credit workspace package.json imports and function-scoped createRequire (#3700)\u201D; \u201Cfix(extract): keep component invocations after a \u003C in template text (#3581)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/cache/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":"crates/graph/src/cache/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb2cd9913c804acd2a93bae8eb485dcbae906a0af1f32c7ba5755a72625beac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/types/src/extract.rs: crates/types/src/extract.rs changed 59 times in last 90 days and 33 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 FileBranching::from_units at line 1195), 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(audit): match styling findings without the line number (#3972)\u201D; \u201Cfix(health): retain top-level runtime statements in coverage gaps (#3578)\u201D; \u201Cfix(graph): apply negative import.meta.glob entries and escape literal pattern text (#3537)\u201D; \u201Cfix: credit fixtures of an extend on an imported Playwright test (#3529)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/types/src/extract.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":"crates/types/src/extract.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f00e3e8f14de9f96583fb140f20c5cdcba45367ae595fb725143772adb96ff1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/lib.rs: crates/core/src/lib.rs changed 49 times in last 90 days and 33 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 fallow_core::update_cache at line 230), 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(scripts): credit the npm alias that installs a script binary (#3846)\u201D; \u201Cfix(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix(scripts): resolve workspace binaries and CI working directories (#3718)\u201D; \u201Cfix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/lib.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":"crates/core/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"10270b9d5bff03c9c6f94cf2d1fdc1c3fb12fc52e6163df73b2f66e958d0552b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/mod.rs: crates/core/src/plugins/mod.rs changed 56 times in last 90 days and 30 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 fallow_core::plugins::federation_trace_provenance at line 346), 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(exports): credit CommonJS config keys through the default export (#3931)\u201D; \u201Cfix(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix(plugins): credit the export that a Serverless handler names (#3741)\u201D; \u201Cfix(plugins): credit the exports that tools read from their config files (#3730)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/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":"crates/core/src/plugins/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f260cc774208c5c7f4302034f4fb3a53a4190aeaa5ea93822e761d77216716c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/mod.rs: crates/core/src/analyze/mod.rs changed 53 times in last 90 days and 29 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 fallow_core::analyze::populate_pnpm_catalog_findings at line 2141), 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(core): keep production-only class and store member suppressions out of the stale list (#3975)\u201D; \u201Cfix(security): apply per-path overrides to the dead-code note (#3925)\u201D; \u201Cfix: keep semantic evidence within analysis scope (#3907)\u201D; \u201Cfix: enforce explicit error policies for advisory rules (#3906)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/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":"crates/core/src/analyze/mod.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0183aa9fc6f3835b57385471b59a29d34f707c77f1e95732468f5d892ecb429"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unused_exports.rs: crates/core/src/analyze/unused_exports.rs changed 35 times in last 90 days and 25 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 fallow_core::analyze::unused_exports::partition_by_common_importer at line 1032), 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(exports): credit CommonJS config keys through the default export (#3931)\u201D; \u201Cfix(extract): size the parse stack from the source (#3809)\u201D; \u201Cfix: credit peers of script-used hosts and skip adapter duplicate exports (#3735)\u201D; \u201Cfix(plugins): credit the exports that tools read from their config files (#3730)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_exports.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":"crates/core/src/analyze/unused_exports.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb7e2f1352c31287c24363f233c3a15a08c8693d6c4b376dede9588a9c418b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/scripts/mod.rs: crates/core/src/scripts/mod.rs changed 29 times in last 90 days and 23 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 fallow_core::scripts::referenced_package_scripts at line 1555), 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(scripts): read local shell helpers that package scripts and CI run (#3935)\u201D; \u201Cfix(scripts): credit the npm alias that installs a script binary (#3846)\u201D; \u201Cfix(scripts): resolve workspace binaries and CI working directories (#3718)\u201D; \u201Cfix: credit test runner directory and default patterns (#3380)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/scripts/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":"crates/core/src/scripts/mod.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9811408b2638fb1198d29b283ddd6e23f83ee95e8b3c9ff030aefcd56026e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/registry/mod.rs: crates/core/src/plugins/registry/mod.rs changed 28 times in last 90 days and 21 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 PluginRegistry::resolve_script_config_files at line 941), 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(plugins): credit the export that a Serverless handler names (#3741)\u201D; \u201Cfix(plugins): credit the exports that tools read from their config files (#3730)\u201D; \u201Cfix(plugins): credit the default export of plugin config files (#3715)\u201D; \u201Cfix(vitest): keep includes of script configs and named vite configs (#3713)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/registry/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":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e466f794a60f9357496f05e004399c4b5c6605a60c5b7283a66e474275c9eb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/specifier.rs: crates/graph/src/resolve/specifier.rs changed 28 times in last 90 days and 20 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 fallow_graph::resolve::specifier::try_tsconfig_alias_target at line 996), 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(resolve): escape the tsconfig directory in include globs (#3951)\u201D; \u201Cfix(resolve): match tsconfig include patterns that start with ./ (#3947)\u201D; \u201Cfix(resolve): map dist/src workspace exports to source when the build output exists (#3832)\u201D; \u201Cfix(resolve): credit the target package of tsconfig paths into node_modules (#3789)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/specifier.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":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"41597c9a918a1bbce30ae6b11a9826f341a04a45b8d82ef47f977a3beb38fcc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/markdown_output.rs: crates/api/src/markdown_output.rs changed 37 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 12 (its worst body is fallow_api::markdown_output::walkthrough_markdown_badges at line 2912), 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(audit): match styling findings without the line number (#3972)\u201D; \u201Cfix(health): honor complexity suppressions in CRAP scoring (#3334)\u201D; \u201Cfix: use workspaces.patterns in audit base and credit config-string packages (#3312)\u201D; \u201Cfix(output): show the workspaces that declare and import a root dependency (#3224)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/markdown_output.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":"crates/api/src/markdown_output.rs"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c170881799ba80141964c8c4a540fddb72c634ee73330c0d2c0cf7146ab05e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/mod.rs: crates/graph/src/resolve/mod.rs changed 29 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 4 (its worst body is fallow_graph::resolve::resolve_all_imports_with_session at line 197), 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(resolve): escape the tsconfig directory in include globs (#3951)\u201D; \u201Cfix(resolve): credit the target package of tsconfig paths into node_modules (#3789)\u201D; \u201Cfix(workspace): skip gitignored members in dependency findings and resolve workspace aliases (#3788)\u201D; \u201Cfix(graph): resolve dynamic import patterns that start with ../ (#3558)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/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":"crates/graph/src/resolve/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd0be059313ee28543f5125473a412b6e8fa44f020740416974d6776a7d1eac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/fallbacks.rs: crates/graph/src/resolve/fallbacks.rs changed 23 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is fallow_graph::resolve::fallbacks::try_path_alias_fallback at line 56), 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(resolve): map dist/src workspace exports to source when the build output exists (#3832)\u201D; \u201Cfix(vite): credit Sass files loaded by additionalData, aliases and Vuetify (#3833)\u201D; \u201Cfix(resolve): credit the target package of tsconfig paths into node_modules (#3789)\u201D; \u201Cfix(resolve): credit workspace package.json imports and function-scoped createRequire (#3700)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/fallbacks.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":"crates/graph/src/resolve/fallbacks.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cea1f37210b1c4a012295aa8bc99b6d49f9b3f2c1202350a9448daa9d358db1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/session.rs: crates/engine/src/session.rs changed 31 times in last 90 days and 17 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 fallow_engine::session::update_parse_cache at line 1558), 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(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D; \u201Cfix(cache): write cache files through unique temp files and evict by last-seen scope (#3484)\u201D; \u201Cfix(analysis): preserve callback-produced class members (#3345)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/session.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":"crates/engine/src/session.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c04778aa1ca7b6b483a0b2d73c426d7c47b172ebc2360618f659ea357268d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/report/human/health.rs: crates/cli/src/report/human/health.rs changed 27 times in last 90 days and 17 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 fallow_cli::report::human::health::print_health_human at line 45), 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(health): honor complexity suppressions in CRAP scoring (#3334)\u201D; \u201Cfix(health): count thresholded hotspots and guard score trends\u201D; \u201Cfix: link to the docs on fallow.tools/docs (#3090)\u201D; \u201Cfix(cli): pluralize count labels in human output (#3040)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/human/health.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":"crates/cli/src/report/human/health.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2bb0d07251b245c35665c31b088892c66e111a2f4570e952d4fbee84dc35dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/core_backend.rs: crates/engine/src/core_backend.rs changed 28 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is fallow_engine::core_backend::discover_files_config_candidates_and_diagnostics at line 174), 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: credit peers of script-used hosts and skip adapter duplicate exports (#3735)\u201D; \u201Cfix(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix(mutation): prune the config object of always-used plugin config files (#3511)\u201D; \u201Cfix(mutation): prune the config object of tool config files (#3500)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/core_backend.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":"crates/engine/src/core_backend.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a5845ee5c35d5817fab768cb078e7d55550056b4f1e2161dbb5f07986914d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/registry/helpers.rs: crates/core/src/plugins/registry/helpers.rs changed 20 times in last 90 days and 16 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 fallow_core::plugins::registry::helpers::discover_config_files at line 428), 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(plugins): credit the export that a Serverless handler names (#3741)\u201D; \u201Cfix(plugins): credit the exports that tools read from their config files (#3730)\u201D; \u201Cfix(plugins): credit the default export of plugin config files (#3715)\u201D; \u201Cfix(vitest): keep bench entries, scope nested includes, credit reporter files (#3695)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/registry/helpers.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":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0f5cdaf3698554284db4089ff307c1e83a8c9861adec352233f0bb10c9a85f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/types/src/trace.rs: crates/types/src/trace.rs changed 25 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 6 (its worst body is ExportTrace::apply_plugin_credits at line 547), 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: credit peers of script-used hosts and skip adapter duplicate exports (#3735)\u201D; \u201Cfix(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix(trace): count forwarding re-exports as found in search visibility (#3385)\u201D; \u201Cfix(trace): list each dependency importer once (#3283)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/types/src/trace.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":"crates/types/src/trace.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91e713ce5320cb4c991450865122ae125bf892732d1f0bebb0d9f6862a718aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/output/src/health_scores.rs: crates/output/src/health_scores.rs changed 27 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ExceededThreshold::from_bools at line 822), 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(audit): report growth of an exceeded metric as worsened (#3750)\u201D; \u201Cfix(audit): do not gate new-only on estimated CRAP alone (#3747)\u201D; \u201Cfix(health): honor complexity suppressions in CRAP scoring (#3334)\u201D; \u201Cfix(health): count thresholded hotspots and guard score trends\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/health_scores.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":"crates/output/src/health_scores.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a458e826475f97ff35eaff087cd8395d57f8e7abde7a3de9f7467bb326dd2172"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/combined/output.rs: crates/cli/src/combined/output.rs changed 27 times in last 90 days and 14 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 fallow_cli::combined::output::print_machine_combined_report at line 158), 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): name the unenforced failing gates of a bare machine run (#3875)\u201D; \u201Cfix(cli): apply the coverage-gaps rule on bare fallow (#3830)\u201D; \u201Cfix(cli): name the failed gate on stderr when a run exits 1 (#3115)\u201D; \u201Cfix(dupes): fail on clone groups with --fail-on-issues and --ci (#3057)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/combined/output.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":"crates/cli/src/combined/output.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf36f0ff4d465ae926faf48dbf449ef125d1a664568f1785623c38fbe2533e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/cache/conversion.rs: crates/extract/src/cache/conversion.rs changed 25 times in last 90 days and 14 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 fallow_extract::cache::conversion::cached_exports_to_module at line 48), 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(graph): apply negative import.meta.glob entries and escape literal pattern text (#3537)\u201D; \u201Cfix(cache): write cache files through unique temp files and evict by last-seen scope (#3484)\u201D; \u201Cfix(extract): credit the whole module when a dynamic import value escapes (#3412)\u201D; \u201Cfix(analysis): credit class members that override a package or global base (#3373)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/cache/conversion.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":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfb7cbd0ae3f77a16ced5f84d373a5265d8ea74370ca8997af2d18ac16f3447"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/workspace/mod.rs: crates/config/src/workspace/mod.rs changed 23 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is fallow_config::workspace::collect_declared_patterns at line 412), 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(workspace): skip gitignored members in dependency findings and resolve workspace aliases (#3788)\u201D; \u201Cfix(workspace): report missing pattern dirs and nested pnpm projects (#3710)\u201D; \u201Cfix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D; \u201Cfix(workspace): skip workspace globs that can leave the project root (#3574)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/workspace/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":"crates/config/src/workspace/mod.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2b24e29d9376a37aef17d30e449188a04d4040c19b81fa8eedf295ecbeaf9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/mod.rs: crates/mcp/src/tools/mod.rs changed 21 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is fallow_mcp::tools::collect_semantic_completeness at line 895), 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): stop Code Mode runs when the client cancels the request (#3501)\u201D; \u201Cfix(mcp): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix(mcp): run the CLI for trace_export when type-aware analysis is on (#3403)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/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":"crates/mcp/src/tools/mod.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8dde5283b4c7977efbbf721f14bb2667f5f2a78695aa89e19a54f71647389e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/audit_cache.rs: crates/cli/src/audit_cache.rs changed 19 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_cli::audit_cache::complexity_from_cached at line 265), 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(audit): match styling findings without the line number (#3972)\u201D; \u201Cfix: enforce explicit error policies for advisory rules (#3906)\u201D; \u201Cfix(workspace): report missing pattern dirs and nested pnpm projects (#3710)\u201D; \u201Cfix(audit): report growth of an exceeded metric as worsened (#3750)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/audit_cache.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":"crates/cli/src/audit_cache.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"814d1cb5c04ab7e65a746689b88bc9a81e21b23f83259aa65ebf776dc24c2542"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/audit.rs: crates/mcp/src/tools/audit.rs changed 18 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 9 (its worst body is fallow_mcp::tools::audit::build_audit_args at line 104), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(audit): do not gate new-only on estimated CRAP alone (#3747)\u201D; \u201Cfix(mcp): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix(api): let an explicit type_aware choice win over the config (#3401)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/audit.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":"crates/mcp/src/tools/audit.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd931c51383bc16221794eb1d1c5d7410be7c60f0710e4e5c787f06449822ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unused_deps_tests/collect_unused.rs: crates/core/src/analyze/unused_deps_tests/collect_unused.rs changed 14 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 2 (its worst body is fallow_core::analyze::unused_deps_tests::collect_unused::is_package_listed_for_file_as at line 327), 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: preserve SSR export usage and production runtime peers (#3352)\u201D; \u201Cfix(deps): read the esbuild packages external signal only from build files (#3230)\u201D; \u201Cfix(deps): skip peer-only declarations in the ancestor manifest walk (#3228)\u201D; \u201Cfix(output): show the workspaces that declare and import a root dependency (#3224)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_deps_tests/collect_unused.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":"crates/core/src/analyze/unused_deps_tests/collect_unused.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"19094d951c0b038ce2b194016ce96b8605b2fe866d187af3176f9e3b32926221"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/coverage/analyze.rs: crates/cli/src/coverage/analyze.rs changed 18 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 9 (its worst body is fallow_cli::coverage::analyze::nearest_cloud_candidate at line 1669), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(extract): cap source_hash by nested function height (#3812)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix(health): name Effect callback bodies in complexity findings (#3365)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/coverage/analyze.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":"crates/cli/src/coverage/analyze.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"09abe11af3bc71d85f79b42fc186632a071cad63771c90f58ea82d253817f567"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/graph/reachability.rs: crates/graph/src/graph/reachability.rs changed 18 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 14 (its worst body is ProfileWorklist::run at line 246), 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(graph): apply negative import.meta.glob entries and escape literal pattern text (#3537)\u201D; \u201Cfix(health): skip type-only edges in test reachability (#3521)\u201D; \u201Cfix(health): count only value references as test reach (#3391)\u201D; \u201Cfix(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/reachability.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":"crates/graph/src/graph/reachability.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a030c4545238a6fabddffa40e10da2a790630e9a3d13155a367b5d42df6df787"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/runtime/duplication.rs: crates/api/src/runtime/duplication.rs changed 18 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 4 (its worst body is fallow_api::runtime::duplication::duplication_mode_to_config at line 233), 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: start no child process in the CLI instruction count benchmarks (#2935)\u201D; \u201Ctest: clean up engine, api, output and mcp tests; fix programmatic dupes production mode (#2889)\u201D; \u201Cfix: publish request outcomes on the typed MCP route (#2864)\u201D; \u201Cfix(cli): say on every artefact when a baseline went stale or cannot be judged (#2705)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime/duplication.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":"crates/api/src/runtime/duplication.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52911b5186cb0469c83ffcf840019ff883af00179dbbafe09715694a30e5f31"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/repo_refs.rs: crates/engine/src/repo_refs.rs changed 13 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 9 (its worst body is MaterializationScope::should_materialize at line 722), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(audit): refuse symlinked context files on Linux arm64 (#3539)\u201D; \u201Cfix(audit): treat code from a merged default branch as inherited (#3542)\u201D; \u201Cfix: use workspaces.patterns in audit base and credit config-string packages (#3312)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/repo_refs.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":"crates/engine/src/repo_refs.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3953b3408c5f18971ceefbf55a3d1ecb580db99a2271a9f4e145c32546cef7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/runtime/mutation.rs: crates/api/src/runtime/mutation.rs changed 16 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 11 (its worst body is fallow_api::runtime::mutation::schedule_error at line 530), 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(mutation): run mapped test files in dot directories for node-test and bun-test (#3742)\u201D; \u201Cfix(mutation): report undiscovered tests as partial, select Vitest config, show progress (#3608)\u201D; \u201Cfix(mutation): check the run path before a zero-test error counts as a kill (#3555)\u201D; \u201Cfix(mutation): require Bun 1.4.0 and test the runner floors in CI (#3554)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime/mutation.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":"crates/api/src/runtime/mutation.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"439e27659b4f62696741daaea84c9a73a87e90400e346e86f6ea545ffba9e9c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/report/human/traces.rs: crates/cli/src/report/human/traces.rs changed 15 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 13 (its worst body is fallow_cli::report::human::traces::build_dependency_usage_human_lines at line 548), 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(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix(trace): give --trace-dependency the same credits as the dependency report (#3223)\u201D; \u201Cfix(deps): credit catalogue command-line tools only with a reference or config (#3196)\u201D; \u201Cfix(deps): credit @types devDependencies only with a target or ambient globals (#3195)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/human/traces.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":"crates/cli/src/report/human/traces.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"83602220ef6407278349fd9655f7738e55464f0f1f78d4994c2845bef49927f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/code_mode.rs: crates/mcp/src/tools/code_mode.rs changed 15 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 10 (its worst body is fallow_mcp::tools::code_mode::classify_host_error at line 1373), 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): stop Code Mode runs when the client cancels the request (#3501)\u201D; \u201Cfix(mcp): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix: honor FALLOW_CACHE_DIR in the language server, MCP server and Node bindings (#2999)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/code_mode.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":"crates/mcp/src/tools/code_mode.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ea78b81964ec3239c303576a5826535b94af6a8e1ea038c14a2c77086a5157"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/types.rs: crates/graph/src/resolve/types.rs changed 14 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 ResolveResult::into_commonjs_require at line 90), 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(core): keep a production-only enum member suppression out of the stale list (#3970)\u201D; \u201Cfix: map missing lib/ package entries back to src/ (#3219)\u201D; \u201Cfix(resolve): preserve module precedence across resolution routes\u201D; \u201Cfix(resolve): resolve relative imports into a tsconfig outDir to source (#3146)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/types.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":"crates/graph/src/resolve/types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c6e0fbe3d511e3f3f7a748ae8af7bff5e772348178e164ebccd5c6eef4e42"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/nuxt.rs: crates/core/src/plugins/nuxt.rs changed 13 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 12 (its worst body is fallow_core::plugins::nuxt::collect_component_auto_imports at line 1132), 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(nuxt): credit plugins, middleware and modules one level deep (#3557)\u201D; \u201Cfix(plugins): recognize callback arrays and more Nuxt config extensions (#3328)\u201D; \u201Cfix(nuxt): detect modules that a package layer registers (#2869)\u201D; \u201Cfix(nuxt): credit OG image templates that a string names (#2868)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/nuxt.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":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ca494d6173f8e2f3a5fba12bf2a6c26941ebca9e77400fb67f65ee9ab3592"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/output/src/dupes.rs: crates/output/src/dupes.rs changed 13 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 2 (its worst body is fallow_output::dupes::clone_family_actions at line 317), 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(dupes): fail on clone groups with --fail-on-issues and --ci (#3057)\u201D; \u201Cfix: apply combined baselines and state the verdict in every JSON envelope (#2810)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D; \u201Cfix(action): surface baseline staleness and propagate the stale-baseline gate in CI (#2674)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/dupes.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":"crates/output/src/dupes.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f7fd14f10a1a771470868a8af7b7df5dd0322d58140966b880c2ee933ed29a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/vite.rs: crates/core/src/plugins/vite.rs changed 12 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 fallow_core::plugins::vite::add_css_implementation_dependency at line 100), 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(vite): credit exports of alias replacements that the resolver never reaches (#3974)\u201D; \u201Cfix(vite): credit Sass files loaded by additionalData, aliases and Vuetify (#3833)\u201D; \u201Cfix: use workspaces.patterns in audit base and credit config-string packages (#3312)\u201D; \u201Cfix(plugins): read the Vite root option and re-base the default entries (#3183)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/vite.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":"crates/core/src/plugins/vite.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aa3bc11bf02663584af6b91763f48fabb7017dcfb57d0ca8b7bdf4555045e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/type-aware-sidecar/src/semantic.mjs: tools/type-aware-sidecar/src/semantic.mjs changed 12 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 14 (its worst body is semantic.resolveSymbolQuery at line 1019), 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(type-aware): read type arguments only from type references (#3921)\u201D; \u201Cfix: isolate unsupported semantic source queries (#3908)\u201D; \u201Cfix(type-aware): abstain for exports behind namespace object uses (#3787)\u201D; \u201Cfix(type-aware): credit class members and exports that shorthand names read (#3754)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- tools/type-aware-sidecar/src/semantic.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":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ced8d097b7df3c4286a41d373124fdff501fcdf360508a1e899d1dbc923de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/dynamic_imports.rs: crates/graph/src/resolve/dynamic_imports.rs changed 11 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 8 (its worst body is fallow_graph::resolve::dynamic_imports::resolve_single_dynamic_import at line 44), 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(graph): resolve dynamic import patterns that start with ../ (#3558)\u201D; \u201Cfix(graph): apply negative import.meta.glob entries and escape literal pattern text (#3537)\u201D; \u201Cfix(graph): match extglob groups in import.meta.glob patterns (#3514)\u201D; \u201Cfix(extract): credit the whole module when a dynamic import value escapes (#3412)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/dynamic_imports.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":"crates/graph/src/resolve/dynamic_imports.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e643e3fbd81983becf547edfc5608993ed53e32cd65e324c02bf45a8624ffdb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/scripts/ci.rs: crates/core/src/scripts/ci.rs 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 12 (its worst body is fallow_core::scripts::ci::rewrite_anchors at line 349), 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(scripts): read local shell helpers that package scripts and CI run (#3935)\u201D; \u201Cfix: credit napi-rs loaders in subdirectories and CI scripts outside run values (#3785)\u201D; \u201Cfix(scripts): resolve workspace binaries and CI working directories (#3718)\u201D; \u201Cfix: treat node --test file arguments as test entry points (#3366)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/scripts/ci.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":"crates/core/src/scripts/ci.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6ea4cfe909bc62407153bc666d019af46dac02900fb8d66956be576ccc57e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/vital_signs.rs: crates/engine/src/vital_signs.rs changed 15 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is fallow_engine::vital_signs::load_snapshots_with_paths at line 775), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(health): name Effect callback bodies in complexity findings (#3365)\u201D; \u201Cfix(health): count thresholded hotspots and guard score trends\u201D; \u201Cfix: confine report files and the cache like the save paths (#2873)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/vital_signs.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":"crates/engine/src/vital_signs.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30d7f88074d626119beae700e218c6c80fc2995fd3f763a0a2d1e5b8a0ad1a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/dead_code_codeclimate.rs: crates/api/src/dead_code_codeclimate.rs changed 14 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 6 (its worst body is fallow_api::dead_code_codeclimate::push_re_export_cycle_issues at line 706), 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: enforce explicit error policies for advisory rules (#3906)\u201D; \u201Cfix(output): show the workspaces that declare and import a root dependency (#3224)\u201D; \u201Cfix(codeclimate): derive dead-code fingerprints from the finding id (#2981)\u201D; \u201Cfix(boundaries): follow re-export chains to the origin module (#2947)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/dead_code_codeclimate.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":"crates/api/src/dead_code_codeclimate.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fcdb080df6fde211bfbe74c41a8902115885189d1aae8a3575ab13929d3225"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/visitor/visit_impl_helpers.rs: crates/extract/src/visitor/visit_impl_helpers.rs changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_extract::visitor::visit_impl_helpers::normalize_module_file_relative_path at line 816), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): credit fixtures of a chained mergeTests(...).extend(...) (#3516)\u201D; \u201Cfix(analysis): track awaited, Map and subclass member usage (#3335)\u201D; \u201Cfix(extract): do not report a missing file for a new URL path passed to a filesystem call (#3145)\u201D; \u201Cfix: preserve type-guard members and package entrypoints\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_helpers.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":"crates/extract/src/visitor/visit_impl_helpers.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"af103140cc619aeb6e4f633171386374ca5571037d4620736066cd8a3464ffc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/runtime_json.rs: crates/api/src/runtime_json.rs changed 14 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 5 (its worst body is fallow_api::runtime_json::group_by_mode_from_label at line 639), 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: publish request outcomes on the typed MCP route (#2864)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D; \u201Cfix(action): surface baseline staleness and propagate the stale-baseline gate in CI (#2674)\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime_json.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":"crates/api/src/runtime_json.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d148a3362bc678e62e968f86ad8d7249052db3ed4878a6274b54b5b126aac9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/health.rs: crates/mcp/src/tools/health.rs changed 13 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 6 (its worst body is HealthArgsBuilder::push_thresholds at line 159), 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): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix(api): let an explicit type_aware choice win over the config (#3401)\u201D; \u201Cfix(mcp): run the CLI when the config turns on type-aware analysis (#3386)\u201D; \u201Cfix: publish request outcomes on the typed MCP route (#2864)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/health.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":"crates/mcp/src/tools/health.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776f8f8b22e1e135c3f79b857549e48e5d3e32c9e77ed99d2bdc7e2c4ecbe2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/init.rs: crates/cli/src/init.rs changed 12 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 13 (its worst body is fallow_cli::init::print_detection_summary at line 615), 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): validate the detected default branch in hooks install (#3945)\u201D; \u201Cfix: name the next step on the first run and show the checked review loop (#3638)\u201D; \u201Cfix(impact): leave a newer-schema store unchanged on every write (#3607)\u201D; \u201Cfix: link to the docs on fallow.tools/docs (#3090)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/init.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":"crates/cli/src/init.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"16430e66c331a9bb24a7e1d70d5c238d1b47f18e2e26450cb67e8d4ace8dc2b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unused_catalog/mod.rs: crates/core/src/analyze/unused_catalog/mod.rs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is fallow_core::analyze::unused_catalog::brace_delta_outside_strings at line 763), 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(workspace): report missing pattern dirs and nested pnpm projects (#3710)\u201D; \u201Cfix(overrides): skip pnpm-workspace.yaml overrides before pnpm 10.5.1 (#3108)\u201D; \u201Cfix(overrides): skip pnpm-workspace.yaml overrides that pnpm 10 ignores (#3104)\u201D; \u201Cfix(overrides): skip package.json pnpm.overrides on pnpm 11 and later (#3102)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_catalog/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":"crates/core/src/analyze/unused_catalog/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6b01af804914f9753781bffb87dacb477749cfd59085ba4ac3a17a8d863585"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/ci.rs: crates/cli/src/ci.rs changed 10 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 12 (its worst body is fallow_cli::ci::collect_gitlab_discussion_fingerprints at line 1569), 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(codeclimate): derive dead-code fingerprints from the finding id (#2981)\u201D; \u201Cfix(ci): follow GitLab x-next-page past filtered short pages (#2912)\u201D; \u201Cfix(cli): isolate reconcile failures per fingerprint so every stale thread resolves (#2562)\u201D; \u201Cfix(cli): stop mutating the process environment from tests (#2510)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/ci.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":"crates/cli/src/ci.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"999cb9ac1f66b9f493bff2311f9d3f491e7acd3b9e71cca642c16063327d3ff3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/runtime/trace.rs: crates/api/src/runtime/trace.rs changed 13 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 4 (its worst body is fallow_api::runtime::trace::run_trace_import_path at line 127), 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(trace): name the plugin that marks an export as used (#3757)\u201D; \u201Cfix(mcp): run the CLI for trace_export when type-aware analysis is on (#3403)\u201D; \u201Cfix(deps): expand optional peers only when the project lists them (#3231)\u201D; \u201Cfix(trace): give --trace-dependency the same credits as the dependency report (#3223)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime/trace.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":"crates/api/src/runtime/trace.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee4baddbc67cbcb0d8a4427032c0ca7020457ffd76a00aa52ba391560edec4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/hotspots.rs: crates/engine/src/health/hotspots.rs changed 13 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 9 (its worst body is fallow_engine::health::hotspots::fetch_churn_data at line 155), 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(health): honor complexity suppressions in CRAP scoring (#3334)\u201D; \u201Cfix: review follow-ups for the test-path predicate, entry weight and optimization targets (#2932)\u201D; \u201Cfix: share the git helpers and report hotspots on a branch without commits (#2816)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/hotspots.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":"crates/engine/src/health/hotspots.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c934965ff55d0e62bc92796cef737e8c60a9f7d9da8300b62f30e41786f60c6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/output/src/health.rs: crates/output/src/health.rs changed 13 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 2 (its worst body is fallow_output::health::serialize_health_json_output at line 169), 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: apply combined baselines and state the verdict in every JSON envelope (#2810)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D; \u201Cfix(output): carry analysis-stage workspace diagnostics on every envelope that can hold them\u201D; \u201Cfix(type-aware): bound generic scans and identify Svelte host gaps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/health.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":"crates/output/src/health.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c565a9c91fa0224988322173248cfd21459150aa8a02ecf504b6cf32988583"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/api_runtime.rs: crates/mcp/src/tools/api_runtime.rs changed 11 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 4 (its worst body is fallow_mcp::tools::api_runtime::run_api_call at line 65), 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): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix(api): let an explicit type_aware choice win over the config (#3401)\u201D; \u201Cfix(mcp): run the CLI when the config turns on type-aware analysis (#3386)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/api_runtime.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":"crates/mcp/src/tools/api_runtime.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0954e047198d2344c34a4cd2f6ce0f86269139967a21b83ff2f32505167431"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/graph/re_exports/mod.rs: crates/graph/src/graph/re_exports/mod.rs changed 9 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 14 (its worst body is ExposedNameSearch::reaches_exposure at line 433), 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: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D; \u201Cfix(graph): credit importers through export default and export = forwards (#3524)\u201D; \u201Cfix: close remaining analysis consistency gaps\u201D; \u201Cfix(graph): credit star and namespace chains behind whole-module consumers and entry namespaces\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/re_exports/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":"crates/graph/src/graph/re_exports/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fef9e5e4425528bea2771aa7a3d648262553f4341fa19459bdd78e9c698d3ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/coverage/mod.rs: crates/cli/src/coverage/mod.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is fallow_cli::coverage::detect_framework at line 1547), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(coverage): keep every source map and warn on unresolvable sources (#3310)\u201D; \u201Cfix: link to the docs on fallow.tools/docs (#3090)\u201D; \u201Cfix(cli): keep every human section footer inside eighty columns (#2989)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/coverage/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":"crates/cli/src/coverage/mod.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfd0bedeb93d3f81cd528258eb3b015b69e2365ccc86243846025b97e60fae8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/churn.rs: crates/engine/src/churn.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is fallow_engine::churn::parse_since at line 262), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix: scope churn git log to the project root (#2885)\u201D; \u201Ctest: clean up engine, api, output and mcp tests; fix programmatic dupes production mode (#2889)\u201D; \u201Cfix: share the git helpers and report hotspots on a branch without commits (#2816)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/churn.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":"crates/engine/src/churn.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba1fe2d086c2ced638f73d17fa3d49766dad2837fb57d1a531a4b4527ccfdb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/graph/namespace_re_exports.rs: crates/graph/src/graph/namespace_re_exports.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is fallow_graph::graph::namespace_re_exports::propagate_namespace_re_exports at line 82), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix(graph): credit star and namespace chains behind whole-module consumers and entry namespaces\u201D; \u201Cfix(extract): credit ambient-module star re-exports without a file-level surface\u201D; \u201Cfix(graph): resolve effective barrel exports (#2210)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/namespace_re_exports.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":"crates/graph/src/graph/namespace_re_exports.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e76222934f2dfd76c00f1907e1714b7c537622cc873c2eae1a4c54b4baeeff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/audit_run/mod.rs: crates/api/src/audit_run/mod.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is fallow_api::audit_run::attribute at line 486), 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(audit): match styling findings without the line number (#3972)\u201D; \u201Cfix(workspace): report missing pattern dirs and nested pnpm projects (#3710)\u201D; \u201Cfix(audit): do not gate on complexity findings in test files (#3753)\u201D; \u201Cfix(audit): do not gate new-only on estimated CRAP alone (#3747)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/audit_run/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":"crates/api/src/audit_run/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bba2efa5347bd9a8606ca60f5976c0ae54d411f02f055855be66e56401000e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/coverage/upload_inventory.rs: crates/cli/src/coverage/upload_inventory.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_cli::coverage::upload_inventory::collect_caller_edges at line 728), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): cap source_hash by nested function height (#3812)\u201D; \u201Cfix(coverage): index instrumenter-named callbacks and object members for the cloud join\u201D; \u201Cfix(coverage): point the post-upload dashboard link at the repository route\u201D; \u201Cfix: align capability contracts and agent guidance\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/coverage/upload_inventory.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":"crates/cli/src/coverage/upload_inventory.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c182478063ff10e80529c7e8bd086bcd2985843469bea66377d79bef9006ca21"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/baseline_gate.rs: crates/cli/src/baseline_gate.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is fallow_cli::baseline_gate::report_gate at line 301), 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: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D; \u201Cfix(action): baseline health and duplication on the default run (#3316)\u201D; \u201Cfix(dupes): give unparseable clone fragments their own fingerprint (#3292)\u201D; \u201Cfix(baseline): use line-free canonical keys for dead-code baselines and audit (#2983)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/baseline_gate.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":"crates/cli/src/baseline_gate.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"98956f0df08aaec70b9462d845a040cdf82e5252f20701fa380b83e128ff5727"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/mutation/mod.rs: crates/engine/src/mutation/mod.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is fallow_engine::mutation::config_file_globs at line 598), 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(mutation): prune functions that write through an ORM or a query builder (#3664)\u201D; \u201Cfix(mutation): prune the config object of always-used plugin config files (#3511)\u201D; \u201Cfix(mutation): prune the config object of tool config files (#3500)\u201D; \u201Cfix(mutation): install run dirs atomically and key on config imports (#3478)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/mutation/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":"crates/engine/src/mutation/mod.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1241a0c8e821758e48c39f24d9025044e8e87cc6f98ba742a9c9664e941532"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/coverage/upload_source_maps.rs: crates/cli/src/coverage/upload_source_maps.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is fallow_cli::coverage::upload_source_maps::prepare_source_map_with_open at line 523), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix(coverage): keep every source map and warn on unresolvable sources (#3310)\u201D; \u201Cfix: share the git helpers and report hotspots on a branch without commits (#2816)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/coverage/upload_source_maps.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":"crates/cli/src/coverage/upload_source_maps.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9523528b00749b58b4e991eeefec9bcc7bd2d3dc568d60f8a465272c070112e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/visitor/visit_impl_playwright.rs: crates/extract/src/visitor/visit_impl_playwright.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ModuleInfoExtractor::record_playwright_fixture_definitions at line 217), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): read Playwright fixtures from the playwright/test import (#3534)\u201D; \u201Cfix: credit fixtures of an extend on an imported Playwright test (#3529)\u201D; \u201Cfix(extract): credit fixtures of a chained mergeTests(...).extend(...) (#3516)\u201D; \u201Cfix(extract): credit the whole module when a dynamic import value escapes (#3412)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_playwright.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":"crates/extract/src/visitor/visit_impl_playwright.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb964d4ed3fee6c5c1267298923d1a210c4e7811776e1df446adcfb43509900"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/analysis_context.rs: crates/api/src/analysis_context.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is fallow_api::analysis_context::map_workspace_scope_error at line 676), 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(api): place explicit diffs before filtering findings (#3332)\u201D; \u201Cfix: use workspaces.patterns in audit base and credit config-string packages (#3312)\u201D; \u201Ctest: clean up engine, api, output and mcp tests; fix programmatic dupes production mode (#2889)\u201D; \u201Cfix: publish request outcomes on the typed MCP route (#2864)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/analysis_context.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":"crates/api/src/analysis_context.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"842876495753fe532e6d7b5282b35f69528ee5a09f33db0951d402241d0c6670"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/setup_hooks.rs: crates/cli/src/setup_hooks.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is fallow_cli::setup_hooks::strip_fallow_handlers at line 1085), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hooks): audit the work tree that a git write targets in the agent gate (#3321)\u201D; \u201Cfix(hooks): audit the session tree in the agent gate (#3289)\u201D; \u201Cfix(agent): show hook status paths with forward slashes on Windows (#3237)\u201D; \u201Cfix(cli): resolve a project-local Fallow from the standalone commit gate (#2492)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/setup_hooks.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":"crates/cli/src/setup_hooks.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0f72d762a6d6a99a37f1b46f61c025a7cf44a64663cb840d4e7f9a65ba7ad7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/fix/mod.rs: crates/cli/src/fix/mod.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is fallow_cli::fix::emit_residual_skip_warnings at line 940), 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): write the complete report to a non-blocking stdout (#3280)\u201D; \u201Cfix: stop reading a jq filter as an entry glob, and print forward slashes\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D; \u201Cfix(cli): keep syntactic findings when type-aware analysis cannot run (#2514)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/fix/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":"crates/cli/src/fix/mod.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"638cccf66bc9ec380f455f5f97fb7d97fed9710c6579271a2b59d3bd1599cefb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/inventory.rs: crates/extract/src/inventory.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is InventoryVisitor::line_col_utf16 at line 310), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): name inventory functions like the coverage instrumenter (#3965)\u201D; \u201Cfix(extract): cap source_hash by nested function height (#3812)\u201D; \u201Cfix(extract): size the parse stack from the source (#3809)\u201D; \u201Cfix(extract): stop deeply nested brackets from aborting the run (#3790)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/inventory.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":"crates/extract/src/inventory.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b68b379bf0f2bbc1a0de3a1be79d58cd0694ede0eb564ac800c4162a3c5ade"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/mutation-runner/src/adapters/vitest.mjs: tools/mutation-runner/src/adapters/vitest.mjs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is vitest.overlayPlugin at line 100), 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(mutation): allow the companion directory in Vite for client environments (#3930)\u201D; \u201Cfix(mutation): stop a Vitest inline project at the first failure (#3756)\u201D; \u201Cfix(mutation): keep the test error of a failed control run (#3749)\u201D; \u201Cfix(mutation): serve instrumented files to a native require under Vitest (#3672)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- tools/mutation-runner/src/adapters/vitest.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":"tools/mutation-runner/src/adapters/vitest.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a1338ec26971066ea8a683d88ad8c4320b541ba03e270419e750b8b2f2ca0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/visitor/visit_impl_structural.rs: crates/extract/src/visitor/visit_impl_structural.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is ModuleInfoExtractor::record_local_structural_function_from_variable_declarator at line 274), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): resolve store aliases declared inside a function body (#3938)\u201D; \u201Cfix(extract): resolve imported and later-declared store ReturnType aliases (#3522)\u201D; \u201Cfix(analysis): track awaited, Map and subclass member usage (#3335)\u201D; \u201Cfix(pinia): credit store members read by typed helpers and the setup body (#3355)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_structural.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":"crates/extract/src/visitor/visit_impl_structural.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bebd92d8c74ca32f483a740cf9fdd073155f531a20ea80d477b0b0aad212c7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/ci_review_post.rs: crates/cli/src/ci_review_post.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_cli::ci_review_post::post_gitlab_review at line 156), 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(review): reconcile stale threads after posting failures (#3333)\u201D; \u201Cfix(codeclimate): derive dead-code fingerprints from the finding id (#2981)\u201D; \u201Cfix(cli): isolate reconcile failures per fingerprint so every stale thread resolves (#2562)\u201D; \u201Cfix(ci): complete provider lifecycle reconciliation\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/ci_review_post.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":"crates/cli/src/ci_review_post.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6f159c333536fd037550c7a5e29c699b2596651b550b764dce0a79db23c552"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/audit_complexity.rs: crates/api/src/audit_complexity.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_api::audit_complexity::classify_complexity_attribution at line 457), 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(audit): match same-named findings on structure before line order (#3836)\u201D; \u201Cfix(audit): do not gate on complexity findings in test files (#3753)\u201D; \u201Cfix(audit): report growth of an exceeded metric as worsened (#3750)\u201D; \u201Cfix(audit): do not gate new-only on estimated CRAP alone (#3747)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/audit_complexity.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":"crates/api/src/audit_complexity.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bc6e600a80e49f30b90b0a65cfd6798de98851248765803fcb70d61aa23b9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/report/ci/review.rs: crates/cli/src/report/ci/review.rs changed 9 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 4 (its worst body is fallow_cli::report::ci::review::render_review_envelope_with_diff at line 66), 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(report): carry unmatched config patterns in the review body (#2991)\u201D; \u201Cfix(codeclimate): derive dead-code fingerprints from the finding id (#2981)\u201D; \u201Cfix(output): title CI comments by content and drop provider jargon (#2561)\u201D; \u201Cfix(ci): show clone evidence in inline reviews\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/ci/review.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":"crates/cli/src/report/ci/review.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"431e84864a68ef2f1fde3d049fc72460632b6b93763028f2cba30eca069135d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/threshold_overrides.rs: crates/engine/src/health/threshold_overrides.rs changed 8 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 ThresholdOverrideStateTracker::record_complexity at line 314), 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(config): keep a single * in every config path glob within one segment (#3541)\u201D; \u201Cfix(health): honor thresholdOverrides and maxCrap in file scores and refactoring targets (#2257)\u201D; \u201Cfix(health): explain override rows a reader could not act on (#2230)\u201D; \u201Cfix(health): make threshold-override rows agree with their findings (#2207)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/threshold_overrides.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":"crates/engine/src/health/threshold_overrides.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6230edd83410768630107473c23d3a6c2115be3fbf7d35208dadd41a0d855370"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/oxlint.rs: crates/core/src/plugins/oxlint.rs changed 8 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 14 (its worst body is fallow_core::plugins::oxlint::extract_ultracite_selected_js_plugin_dependencies at line 113), 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(oxlint): credit the default export of directory jsPlugins entries (#3968)\u201D; \u201Cfix(oxlint): credit the default export of local jsPlugins files (#3922)\u201D; \u201Cfix(oxlint): read .oxlintrc.jsonc and oxlint.config.mts (#3567)\u201D; \u201Cfix(plugins): credit oxlint jsPlugins declared inside overrides (#3169)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/oxlint.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":"crates/core/src/plugins/oxlint.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c395a6f27535e3682556dc1c8046fb8c4744eb0755e9a7f505f350eb7b7c48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/security/rank.rs: crates/core/src/analyze/security/rank.rs changed 8 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 UntrustedSourceIndex::build at line 591), 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): apply per-path overrides to the dead-code note (#3925)\u201D; \u201Cfix(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D; \u201Cfix(graph): treat path and asset references as edges that do not run (#2994)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/security/rank.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":"crates/core/src/analyze/security/rank.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5157bfbdf539e1a2b37a6b69b5a6f6c40f99d535d2119e70727b8af795ef181a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/scripts/resolve.rs: crates/core/src/scripts/resolve.rs changed 8 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 fallow_core::scripts::resolve::resolve_known_dependency_binary at line 237), 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(scripts): credit the npm alias that installs a script binary (#3846)\u201D; \u201Cfix(scripts): resolve workspace binaries and CI working directories (#3718)\u201D; \u201Cfix(deps): map script binaries to the package that installs them (#3222)\u201D; \u201Cfix(deps): credit @types devDependencies only with a target or ambient globals (#3195)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/scripts/resolve.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":"crates/core/src/scripts/resolve.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"313f42c83a2765f904235902ec572661546a901b73eb2265db5084b82d76970b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/mutation/plan.rs: crates/engine/src/mutation/plan.rs changed 8 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 fallow_engine::mutation::plan::plan_file at line 300), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): size the parse stack from the source (#3809)\u201D; \u201Cfix(mutation): prune functions that write through an ORM or a query builder (#3664)\u201D; \u201Cfix(mutation): prune the config object of tool config files (#3500)\u201D; \u201Cfix(mutation): do not treat type tests as test files of the plan (#3488)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/mutation/plan.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":"crates/engine/src/mutation/plan.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb56d0881f9bce509e1b918e9db66623bb2a4e44e8e42ca00c6dbfc2ce09339"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/lib.rs: crates/config/src/lib.rs changed 8 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 1 (its worst body is fallow_config::walkthrough_state_path at line 65), 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(workspace): skip gitignored members in dependency findings and resolve workspace aliases (#3788)\u201D; \u201Cfix(config): escape the project root in on-disk glob expansion (#3589)\u201D; \u201Cfix(config): respect .gitignore for link targets and resolve jest project rootDir (#3117)\u201D; \u201Cfix(lsp): reload a kept session when a plugin file or rule pack changes (#2926)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/lib.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":"crates/config/src/lib.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce44d6ec4c7ee5f4311b6231b33040f9d78cfd07bb571aaec86e85cb4dc9cb4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs: crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs changed 8 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 3 (its worst body is fallow_core::analyze::unused_deps_tests::unlisted_deps::build_workspace_case at line 1187), 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(deps): accept an ancestor manifest declaration for unlisted dependencies (#3188)\u201D; \u201Cfix(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix(analyze): align jest/vitest __mocks__ manual-mock semantics (#2250)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_deps_tests/unlisted_deps.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":"crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebb17f74eb774e27d7670440ef562bc68ab7a34f70031b8df37fc6fd5a16cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/graph/cycles.rs: crates/graph/src/graph/cycles.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is fallow_graph::graph::cycles::dfs_find_cycles_from at line 338), 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(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D; \u201Cfix(graph): treat path and asset references as edges that do not run (#2994)\u201D; \u201Cfix(resolve): resolve webpack inline loader imports to their resource (#2974)\u201D; \u201Cfix(extract): count relative require.resolve calls as file references (#2968)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/cycles.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":"crates/graph/src/graph/cycles.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aa0714dd546acd3d525bfc766c6725403bf0dd056e62ef6ec78204d6bd8632"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/duplication_detector/tokenize/mod.rs: crates/engine/src/duplication_detector/tokenize/mod.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is fallow_engine::duplication_detector::tokenize::tokenize_sfc at line 96), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): size the parse stack from the source (#3809)\u201D; \u201Cfix(extract): stop deeply nested brackets from aborting the run (#3790)\u201D; \u201Cfix(dupes): report clones inside an object passed to defineComponent() (#3517)\u201D; \u201Cfix(dupes): give unparseable clone fragments their own fingerprint (#3292)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/duplication_detector/tokenize/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":"crates/engine/src/duplication_detector/tokenize/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9339f2bf4ef200d27c119776f660b69ddf5553facda7986a7c40f5748e49b9c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/duplication_detector/cache.rs: crates/engine/src/duplication_detector/cache.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is TokenCache::get_by_fingerprint at line 172), 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(dupes): report clones inside an object passed to defineComponent() (#3517)\u201D; \u201Cfix(cache): trust file metadata only after the timestamps settle (#3273)\u201D; \u201Cfix(dupes): let content settle a cache lookup the timestamps cannot\u201D; \u201Cfix(dupes): fall back to content when the fingerprint cannot be trusted\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/duplication_detector/cache.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":"crates/engine/src/duplication_detector/cache.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc1d47e7c1c61df908802e121ec72acfb4cff03cd57f8ffe6497a13914df126"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/boundary.rs: crates/core/src/analyze/boundary.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_core::analyze::boundary::chain_origin_edges at line 145), 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(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D; \u201Cfix(graph): treat path and asset references as edges that do not run (#2994)\u201D; \u201Cfix(boundaries): follow re-export chains to the origin module (#2947)\u201D; \u201Cfix(boundaries): check files that no entry point reaches (#2946)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/boundary.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":"crates/core/src/analyze/boundary.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b390761f051b18d2b2ddb8e1b2ba6d25a9f7bd4c8aef27290a3780c9b6d70e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/report/ci/diff_filter.rs: crates/cli/src/report/ci/diff_filter.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_cli::report::ci::diff_filter::resolve_diff_source at line 118), 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(codeclimate): derive dead-code fingerprints from the finding id (#2981)\u201D; \u201Cfix: publish request outcomes on the typed MCP route (#2864)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D; \u201Cfix(ci): show clone evidence in inline reviews\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/ci/diff_filter.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":"crates/cli/src/report/ci/diff_filter.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a25ace922aba24296b3cf11e9825851133bc9052eba63d5584dcbb92ae7470d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/coverage/upload_common.rs: crates/cli/src/coverage/upload_common.rs 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 8 (its worst body is UploadError::into_exit at line 42), 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(api): deregister the programmatic base snapshot before analysis (#3941)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix: share the git helpers and report hotspots on a branch without commits (#2816)\u201D; \u201Cfix(coverage): point the post-upload dashboard link at the repository route\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/coverage/upload_common.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":"crates/cli/src/coverage/upload_common.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"728a7d0a5240eb6de5e4a2c978cfc8f2cf0cbe9bb458485acbdf530ea70522e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/report/human/health_hotspots.rs: crates/cli/src/report/human/health_hotspots.rs 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 13 (its worst body is fallow_cli::report::human::health_hotspots::render_ownership_line at line 75), 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): use the singular noun for one owned hotspot (#3044)\u201D; \u201Cfix(cli): keep every human section footer inside eighty columns (#2989)\u201D; \u201Cfix: use the singular in health headers for one file (#2817)\u201D; \u201Cfix(cli): print forward slashes in the check and health human output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/human/health_hotspots.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":"crates/cli/src/report/human/health_hotspots.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1072e5d3e4fa1942e03f86c0dce5ecf37b89c1decf34d7526b355eb6b3cbf82a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/registry/tooling_evidence.rs: crates/core/src/plugins/registry/tooling_evidence.rs 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 8 (its worst body is fallow_core::plugins::registry::tooling_evidence::record_plugin_tooling at line 48), 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(config): escape the project root in on-disk glob expansion (#3589)\u201D; \u201Ctest(fuzz): fuzz untrusted-input parsers and fix dot-wildcard glob escape (#3548)\u201D; \u201Cfix(config): keep a single * in every config path glob within one segment (#3541)\u201D; \u201Cfix(deps): count a tool config in a workspace as evidence for a root tool (#3225)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/registry/tooling_evidence.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":"crates/core/src/plugins/registry/tooling_evidence.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"41659be0208e768f655f8d94f5f21d782fc8b932c4d89f63e65134ee51b8f23d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/tsdown.rs: crates/core/src/plugins/tsdown.rs 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 5 (its worst body is fallow_core::plugins::tsdown::collect_workspace_globs at line 81), 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(plugins): read tsdown and tsup JSON configs and package.json keys (#3217)\u201D; \u201Cfix(plugins): treat tsdown configs in root workspace globs as used (#3157)\u201D; \u201Cfix(plugins): read entry from every config in a tsup or tsdown config array (#3155)\u201D; \u201Cfix(plugins): resolve tsdown and tsup entries from the config file directory (#3154)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/tsdown.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":"crates/core/src/plugins/tsdown.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"03211f99de6674436dfa12176414accc21b011419b695e279bf0f000efec5878"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/search_visibility.rs: crates/engine/src/search_visibility.rs changed 7 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 14 (its worst body is fallow_engine::search_visibility::is_literal_value at line 846), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): size the parse stack from the source (#3809)\u201D; \u201Cfix(extract): stop deeply nested brackets from aborting the run (#3790)\u201D; \u201Cfix(graph): credit importers through export default and export = forwards (#3524)\u201D; \u201Cfix(trace): count forwarding re-exports as found in search visibility (#3385)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/search_visibility.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":"crates/engine/src/search_visibility.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"5948087e8b349b2d101dc887290e100302bb93159e3685ef180847eeaeb446e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/runtime/decision_surface.rs: crates/api/src/runtime/decision_surface.rs changed 7 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 4 (its worst body is fallow_api::runtime::decision_surface::boundary_anchors at line 397), 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(lsp,mcp): run analysis on threads with the worker stack (#3806)\u201D; \u201Cfix: use workspaces.patterns in audit base and credit config-string packages (#3312)\u201D; \u201Cfix(mcp): auto-detect the audit base ref on the typed audit and decision_surface routes (#2703)\u201D; \u201Cfix(engine): resolve rule severity on every surface and watch every config file name (#2640)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/runtime/decision_surface.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":"crates/api/src/runtime/decision_surface.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"127cfd17da9f07fd0bd91ee264e320a6f917e78a75462da55f62380cbdfb44d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/code_mode_subprocess.rs: crates/mcp/src/tools/code_mode_subprocess.rs changed 7 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 10 (its worst body is fallow_mcp::tools::code_mode_subprocess::run_fallow_sync at line 20), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): stop Code Mode runs when the client cancels the request (#3501)\u201D; \u201Cfix(mcp): apply the same exit, size and stdin rules on every route (#3476)\u201D; \u201Cfix(mcp): keep Code Mode refusals free of process-cleanup noise\u201D; \u201Cfix(process): wait out an executable that is busy at spawn (#2496)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/code_mode_subprocess.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":"crates/mcp/src/tools/code_mode_subprocess.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1769d85a180adfc7917f4a37f5646a528913108219f1292705087a7f1e4f6cf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/mutation/result_cache/mod.rs: crates/api/src/mutation/result_cache/mod.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ResultCache::record at line 386), 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(mutation): report undiscovered tests as partial, select Vitest config, show progress (#3608)\u201D; \u201Cfix(mutation): run Vitest tests under NODE_ENV=test (#3535)\u201D; \u201Cfix(mutation): install run dirs atomically and key on config imports (#3478)\u201D; \u201Cfix(mutation): key the result cache on bun preload files and the runner (#3473)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/mutation/result_cache/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":"crates/api/src/mutation/result_cache/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec5b0d31fd22c3d98c89a63e7b63053e8a2cb10d08c3556c230978570e516d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/file_scores.rs: crates/engine/src/health/file_scores.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is fallow_engine::health::file_scores::compute_filtered_file_scores at line 130), 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(health): credit test files in production runtime coverage evidence (#3842)\u201D; \u201Cfix(health): estimate CRAP with test files in production mode (#3838)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D; \u201Cfix(health): honor thresholdOverrides and maxCrap in file scores and refactoring targets (#2257)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/file_scores.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":"crates/engine/src/health/file_scores.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2986be3a662a1ca05fd59cd6357241b030e44c67fbcd7c9ddc65c08d1fb11d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/coverage_gaps.rs: crates/engine/src/health/coverage_gaps.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is fallow_engine::health::coverage_gaps::scan_runtime_files at line 132), 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(health): estimate CRAP with test files in production mode (#3838)\u201D; \u201Cfix(health): retain top-level runtime statements in coverage gaps (#3578)\u201D; \u201Cfix(health): skip type-only edges in test reachability (#3521)\u201D; \u201Cfix(health): respect mocked modules in test reachability (#2068)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/coverage_gaps.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":"crates/engine/src/health/coverage_gaps.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05eaf81434a548ab3675ccdbdc74f1bf2f5f30777b439b67aa47be94572636c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/graph_confidence.rs: crates/core/src/analyze/graph_confidence.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is GraphConfidenceContext::annotate at line 269), 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: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D; \u201Cfix(output): show the workspaces that declare and import a root dependency (#3224)\u201D; \u201Cfix(discover): report source files excluded by a built-in ignore pattern (#2641)\u201D; \u201Cfix: make the caveat reach every surface, and the gates that guard it fail\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/graph_confidence.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":"crates/core/src/analyze/graph_confidence.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993df489559ab8020cc7c10fe994692c17d1da31d82de73a9612bfaa3c3407f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/workspace/deno_json.rs: crates/config/src/workspace/deno_json.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is DenoJson::load_from_dir at line 59), 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(workspace): report missing pattern dirs and nested pnpm projects (#3710)\u201D; \u201Cfix(config): read deno.json like Deno and report malformed tsconfig parents (#3103)\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D; \u201Cfix: harden Deno workspace support follow-ups (#2091)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/workspace/deno_json.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":"crates/config/src/workspace/deno_json.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d5d7c7350c9e46dc120d377390f80e59b1c6c8ac383d07ccd2d69825877fb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/fix/deps.rs: crates/cli/src/fix/deps.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is fallow_cli::fix::deps::process_package_dependency_removals at line 103), 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: preserve package.json formatting during dependency removal (#3337)\u201D; \u201Cfix(output): show the workspaces that declare and import a root dependency (#3224)\u201D; \u201Cfix: stop reading a jq filter as an entry glob, and print forward slashes\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/fix/deps.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":"crates/cli/src/fix/deps.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c4acd35d36c46f5c0385d89bf1ab6feb9553e3d125bb33eb10c93d20b30d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/grouping.rs: crates/engine/src/health/grouping.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is fallow_engine::health::grouping::apply_group_trends at line 662), 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(health): count thresholded hotspots and guard score trends\u201D; \u201Cfix(health): count cross-team clones in each group that holds an instance (#3128)\u201D; \u201Cfix(health): keep score-only group output consistent with the project (#3119)\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/grouping.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":"crates/engine/src/health/grouping.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"544a0a54b278190a7f7cdda1d2eab4f266e66deaeaf0fc932fd7f95276be6d62"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs: crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is fallow_core::analyze::unused_deps_tests::unresolved_imports::unresolved_import at line 3), 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(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D; \u201Cfix(core): do not report a relative import of a missing gitignored path as unresolved (#3141)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_deps_tests/unresolved_imports.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":"crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0845e2a5b90a37b5fe91ff86fd702cc40f750cbfd11ae48a7486fcba2030e933"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/api.rs: crates/cli/src/api.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is fallow_cli::api::redact_header_token at line 405), 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: let license refresh fall back to a full-access API key\u201D; \u201Cfix(cli): stop mutating the process environment from tests (#2510)\u201D; \u201Cfix: align capability contracts and agent guidance\u201D; \u201Cfix(ci): reconcile inline review lifecycles\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/api.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":"crates/cli/src/api.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2c392b36a1c26ceefe73d7dacff5840d1c95cb721a4790f0c6942c4fc17d40"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/coverage/upload_static_findings.rs: crates/cli/src/coverage/upload_static_findings.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is fallow_cli::coverage::upload_static_findings::classify_upload_error at line 306), 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(coverage): point the post-upload dashboard link at the repository route\u201D; \u201Cfix: align capability contracts and agent guidance\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D; \u201Cfix: harden Deno workspace support follow-ups (#2091)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/coverage/upload_static_findings.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":"crates/cli/src/coverage/upload_static_findings.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa988c5db6a03908752bcd5f516649451d97266eb76c2a837f122f8aab0760"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/codeowners.rs: crates/engine/src/codeowners.rs 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 9 (its worst body is fallow_engine::codeowners::parse_codeowners_line at line 446), 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: bound CODEOWNERS regex fallback cost with matcher batches (#3879)\u201D; \u201Cfix(codeowners): keep an escaped space in a CODEOWNERS pattern (#3860)\u201D; \u201Cfix(codeowners): bound the wildcards in a CODEOWNERS file (#3859)\u201D; \u201Cfix(codeowners): let a pattern without a trailing slash own a directory (#3112)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/codeowners.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":"crates/engine/src/codeowners.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"569e195bef85bcae33f7709d83fc3fbdfff3604eea6e8973353adc8ce94c1a86"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/visitor/visit_impl_member_destructuring.rs: crates/extract/src/visitor/visit_impl_member_destructuring.rs 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 13 (its worst body is ModuleInfoExtractor::record_typed_member_destructuring at line 427), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): credit class members through array patterns and held getters (#3936)\u201D; \u201Cfix(extract): credit class members read by destructures of imported instances and fields (#3803)\u201D; \u201Cfix(extract): credit class members read by loop, default and typeof destructures (#3794)\u201D; \u201Cfix(extract): credit class members read by nested destructures (#3786)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_member_destructuring.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":"crates/extract/src/visitor/visit_impl_member_destructuring.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15d268cacfd1cc179ab13435a91ef1d38539971a3c372d4b62133fea4258b36"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/mutation-runner/src/adapters/common.mjs: tools/mutation-runner/src/adapters/common.mjs 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 common.testErrorText at line 196), 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(mutation): keep the test error of a failed control run (#3749)\u201D; \u201Cfix(mutation): run mapped test files in dot directories for node-test and bun-test (#3742)\u201D; \u201Cfix(mutation): check the run path before a zero-test error counts as a kill (#3555)\u201D; \u201Cfix(mutation): refuse Vitest 4.0 instead of reporting false kills (#3536)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- tools/mutation-runner/src/adapters/common.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":"tools/mutation-runner/src/adapters/common.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c4d857648822e6221ed9344540eaaff2e8e585df3805a82e9461678640c4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/decision_surface.rs: crates/mcp/src/tools/decision_surface.rs 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 1 (its worst body is fallow_mcp::tools::decision_surface::run_decision_surface at line 19), 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): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix: publish request outcomes on the typed MCP route (#2864)\u201D; \u201Cfix(mcp): auto-detect the audit base ref on the typed audit and decision_surface routes (#2703)\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/decision_surface.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":"crates/mcp/src/tools/decision_surface.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a54fb3e308e820b07b78c9b6dcda421735d383338f7d18f903f391bdd5e50b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs: crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs 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 1 (its worst body is fallow_core::analyze::unused_deps_tests::dev_dep_in_prod::graph_with_import_from at line 5), 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(graph): do not report a package subpath that maps to a missing gitignored path (#3144)\u201D; \u201Cfix(scripts): stop treating formatter and linter targets as entry points (#2957)\u201D; \u201Cfix(deps): stop telling a project to promote its own framework (#2493)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.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":"crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6e392142814d355bb5c3881234591153b6becf270a90d9234c5ccdab170992"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/serverless_framework.rs: crates/core/src/plugins/serverless_framework.rs 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 10 (its worst body is fallow_core::plugins::serverless_framework::yaml_references at line 295), 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(plugins): read a nested Serverless script config only in a service directory (#3744)\u201D; \u201Cfix(plugins): credit the export that a Serverless handler names (#3741)\u201D; \u201Cfix(plugins): credit the exports that tools read from their config files (#3730)\u201D; \u201Cfix(plugins): credit the default export of plugin config files (#3715)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/serverless_framework.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":"crates/core/src/plugins/serverless_framework.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d3dc945cc093c9e9c9a551f06f55b6f9262b31ba80378711677ef4506ddf0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/electron.rs: crates/core/src/plugins/electron.rs 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 8 (its worst body is fallow_core::plugins::electron::classify_section_object at line 109), 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(plugins): credit the exports that tools read from their config files (#3730)\u201D; \u201Cfix(plugins): use the electron-vite default renderer entry (#3432)\u201D; \u201Cfix(plugins): keep the default electron-builder JS and TS config files (#3177)\u201D; \u201Cfix(plugins): use electron-vite entries instead of broad main and preload globs (#3176)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/electron.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":"crates/core/src/plugins/electron.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9b01ccf8565bd278c3fe2ee90bad09e9a00ad49acaee2d0968166e3c8de2a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/coverage_settings.rs: crates/engine/src/health/coverage_settings.rs 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 8 (its worst body is fallow_engine::health::coverage_settings::load_health_coverage at line 37), 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(health): accept a coverage map with a negative hit count (#3568)\u201D; \u201Cfix(output): report what a run was asked to do and whether it did it (#2704)\u201D; \u201Cfix(health): attribute Istanbul coverage to the function that owns the position (#2449)\u201D; \u201Cfix(audit): score the base attribution pass with the supplied Istanbul coverage\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/coverage_settings.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":"crates/engine/src/health/coverage_settings.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"db12d36a81caa5ade279af66e154ff08fef2f446d42d5db34e7f8704e9b0767f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/cache/store.rs: crates/graph/src/cache/store.rs 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 5 (its worst body is GraphCacheStore::save at line 104), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cache): write cache files through unique temp files and evict by last-seen scope (#3484)\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D; \u201Cfix: report degraded parses, harden caches, and stop contradictory counts\u201D; \u201Cfix(health): respect mocked modules in test reachability (#2068)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/cache/store.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":"crates/graph/src/cache/store.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e627caee5f186c94340bcb11df12a85592cc590033f8ec5ca90eca3fbb0bb5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/server_only.rs: crates/core/src/analyze/server_only.rs 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 3 (its worst body is fallow_core::analyze::server_only::imports_server_only_code at line 83), 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): stop the client cone at Server Action modules (#2944)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D; \u201Cfix(security): stop treating \u0022use server\u0022 as a server-only marker (#2088)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/server_only.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":"crates/core/src/analyze/server_only.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aaa85cbfd28594cb069ec984c1a4a9e84ba5a798b4b0b295dc9a98dbdd6a20"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/mutation/protocol.rs: crates/api/src/mutation/protocol.rs 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 11 (its worst body is fallow_api::mutation::protocol::decode_response at line 293), 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(mutation): keep the test error of a failed control run (#3749)\u201D; \u201Cfix(mutation): run mapped test files in dot directories for node-test and bun-test (#3742)\u201D; \u201Cfix(mutation): check the run path before a zero-test error counts as a kill (#3555)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/mutation/protocol.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":"crates/api/src/mutation/protocol.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bcbaf7546882e2a2df8124a1286def59d774e016a94e48b324419e5eb100cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/manifest_entries.rs: crates/core/src/plugins/manifest_entries.rs 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 11 (its worst body is fallow_core::plugins::manifest_entries::build_rule_report at line 235), 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(plugins): credit the exports that tools read from their config files (#3730)\u201D; \u201Cfix(config): keep a single * in every config path glob within one segment (#3541)\u201D; \u201Cfix(config): respect .gitignore for link targets and resolve jest project rootDir (#3117)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/manifest_entries.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":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fd4201e48bace64e191dea572812fa3e5b2b454903f822b054722d6f8452cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/config/boundaries.rs: crates/config/src/config/boundaries.rs 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 9 (its worst body is BoundaryConfig::validate_zone_references at line 939), 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(config): keep a single * in every config path glob within one segment (#3541)\u201D; \u201Cfix(boundaries): check files that no entry point reaches (#2946)\u201D; \u201Cfix(lsp): reload a kept session when a plugin file or rule pack changes (#2926)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/config/boundaries.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":"crates/config/src/config/boundaries.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"51231bff9181e08866e4d2e914bcc7837980654f98ba0725c4b4653f1d233485"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp/src/tools/flags.rs: crates/mcp/src/tools/flags.rs 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 8 (its worst body is fallow_mcp::tools::flags::retirement_options_from_params at line 91), 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): stop direct tool calls on cancel and share typed options (#3492)\u201D; \u201Cfix: publish request outcomes on the typed MCP route (#2864)\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp/src/tools/flags.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":"crates/mcp/src/tools/flags.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9c2088d23dd209067861ac96a70c7dfcf7fa4cebb38a55aa660a20859aa01d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/output_runtime.rs: crates/cli/src/output_runtime.rs 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 3 (its worst body is fallow_cli::output_runtime::reset_run_state at line 62), 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: use workspaces.patterns in audit base and credit config-string packages (#3312)\u201D; \u201Cfix: share the git helpers and report hotspots on a branch without commits (#2816)\u201D; \u201Cfix(cli): say on every artefact when a baseline went stale or cannot be judged (#2705)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/output_runtime.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":"crates/cli/src/output_runtime.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b890a8e53a37d4b1d09cdfbdc8761f63d2baca4c97a87f41acce4cb9643c005"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/html.rs: crates/extract/src/html.rs 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 13 (its worst body is fallow_extract::html::collect_asset_refs at line 100), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): skip asset refs inside inline script bodies in HTML (#3162)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/html.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":"crates/extract/src/html.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de34dec452a846860277fb2838f21c6a506b4f79e7542188e1e2b67be8a20d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/fix/plan.rs: crates/cli/src/fix/plan.rs 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 10 (its worst body is FixPlan::commit at line 223), 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: harden failure cleanup and simplify owned analysis state\u201D; \u201Cfix: stop reading a jq filter as an entry glob, and print forward slashes\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/fix/plan.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":"crates/cli/src/fix/plan.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7535f1282a64e549786deb6f8e9b806e6b6b946ed3b81c95f2a749002eb3c087"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/visitor/visit_impl_pinia.rs: crates/extract/src/visitor/visit_impl_pinia.rs 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 14 (its worst body is fallow_extract::visitor::visit_impl_pinia::setup_store_members_read_in_body at line 51), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): resolve store aliases declared inside a function body (#3938)\u201D; \u201Cfix(analysis): credit class members that override a package or global base (#3373)\u201D; \u201Cfix(pinia): credit store members read by typed helpers and the setup body (#3355)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/visitor/visit_impl_pinia.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":"crates/extract/src/visitor/visit_impl_pinia.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba0f2929af697b6e35a082039b5d3308afebdcd370912357fca20b3a1f5187b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/extract/src/nesting.rs: crates/extract/src/nesting.rs 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 14 (its worst body is Scanner::scan at line 169), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): bound stylesheet nesting before the CSS parser (#3811)\u201D; \u201Cfix(extract): cap source_hash by nested function height (#3812)\u201D; \u201Cfix(extract): size the parse stack from the source (#3809)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/extract/src/nesting.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":"crates/extract/src/nesting.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffb8b38a77bbbabe60fab45bcfd88ab320db35504225433c6cd0bc32fdb0442"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/config/finding_ignore.rs: crates/config/src/config/finding_ignore.rs 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 4 (its worst body is FindingIgnoreMatcher::is_ignored at line 129), 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(config): strip the root before the absolute check in ignored paths (#3761)\u201D; \u201Cfix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)\u201D; \u201Cfix(config): keep a single * in every config path glob within one segment (#3541)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/config/finding_ignore.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":"crates/config/src/config/finding_ignore.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17a9917150e552f32daf246d8f35b88874f092dc97e687f9506b59d0e50356f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/audit_run/snapshot.rs: crates/api/src/audit_run/snapshot.rs 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 5 (its worst body is fallow_api::audit_run::snapshot::type_aware_attribution_degrade_reason at line 253), 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(workspace): report missing pattern dirs and nested pnpm projects (#3710)\u201D; \u201Cfix(audit): treat code from a merged default branch as inherited (#3542)\u201D; \u201Cfix(audit): compare complexity values in the new-only gate (#3279)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/audit_run/snapshot.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":"crates/api/src/audit_run/snapshot.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e947dbead887210a70a40950035e7fb54e85e99046cb35c10906f543b405660"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/playwright.rs: crates/core/src/plugins/playwright.rs 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 fallow_core::plugins::playwright::test_entry_patterns at line 176), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): read Playwright fixtures from the playwright/test import (#3534)\u201D; \u201Cfix(plugins): read every defineConfig argument and the default testDir in the Playwright plugin (#3226)\u201D; \u201Cfix(plugins): respect Playwright test directories and matchers (#3207)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/playwright.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":"crates/core/src/plugins/playwright.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2744870feac80b508db189dba7c8ed95d4f4738b3643fb1f87e5e64577b6274"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/audit_base_ref.rs: crates/cli/src/audit_base_ref.rs 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 4 (its worst body is fallow_cli::audit_base_ref::base_ref_error_message at line 23), 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(audit): treat code from a merged default branch as inherited (#3542)\u201D; \u201Cfix: run one audit implementation for the CLI, MCP and API (#2792)\u201D; \u201Cfix(mcp): auto-detect the audit base ref on the typed audit and decision_surface routes (#2703)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/audit_base_ref.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":"crates/cli/src/audit_base_ref.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a13ca3347100024c18984f6308f982a3d117397afcd7d77632f9c2fe879cd65"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/external_style_usage.rs: crates/core/src/external_style_usage.rs 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 fallow_core::external_style_usage::augment_external_style_package_usage at line 16), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(graph): resolve root-relative HTML assets against a static directory (#2489)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix(health): respect mocked modules in test reachability (#2068)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/external_style_usage.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":"crates/core/src/external_style_usage.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc7c58d99ad62f98afae577a491065b39f29e9bbfe5cd3ee4b354cec5a33659"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/list_inventory.rs: crates/engine/src/list_inventory.rs 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 2 (its worst body is fallow_engine::list_inventory::collect_entry_points at line 80), 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(scripts): select the root package and resolve every selection form (#3004)\u201D; \u201Cfix: list entry points from the same plugin run as the analysis (#2867)\u201D; \u201Crefactor: remove redundant state and strengthen regression tests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/list_inventory.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":"crates/engine/src/list_inventory.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ebdf1bef534d8693c4b1d4807cd95712d3e83d696bf73adf7b97b4834774f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/report/human/health_runtime.rs: crates/cli/src/report/human/health_runtime.rs 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 8 (its worst body is fallow_cli::report::human::health_runtime::render_runtime_summary at line 27), 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): pluralize count labels in human output (#3040)\u201D; \u201Cfix: review follow-ups for the test-path predicate, entry weight and optimization targets (#2932)\u201D; \u201Cfix(cli): print forward slashes in the check and health human output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/report/human/health_runtime.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":"crates/cli/src/report/human/health_runtime.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e8bfc2f98e2ec96346f6439fa89421197f093dd4095c7e22713792bf224e06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/doctor.rs: crates/cli/src/doctor.rs 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 8 (its worst body is fallow_cli::doctor::check_id at line 119), 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: honor FALLOW_CACHE_DIR in the language server, MCP server and Node bindings (#2999)\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D; \u201Cfix: report degraded parses, harden caches, and stop contradictory counts\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/doctor.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":"crates/cli/src/doctor.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c88d36b0559f437811c82b7cb85b42db438d83bc5361bca3fd0e2aa55b84d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/ci_pr_comment_post.rs: crates/cli/src/ci_pr_comment_post.rs 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 fallow_cli::ci_pr_comment_post::post_github_pr_comment at line 42), 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(ci): follow GitLab x-next-page past filtered short pages (#2912)\u201D; \u201Cfix(ci): complete provider lifecycle reconciliation\u201D; \u201Cfix(ci): reconcile inline review lifecycles\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/ci_pr_comment_post.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":"crates/cli/src/ci_pr_comment_post.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff76d8f8d16413525dad90a6275e03cf54e04cc6c1d2c1dd9056adb17db4fedc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/require_imports.rs: crates/graph/src/resolve/require_imports.rs 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 2 (its worst body is fallow_graph::resolve::require_imports::resolve_single_require at line 37), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix(extract): record import X = require as a CommonJS import edge\u201D; \u201Cfix(health): respect mocked modules in test reachability (#2068)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/require_imports.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":"crates/graph/src/resolve/require_imports.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc82e039ce1cfc5b684a5331a0105b61f885f3e9704cfcef15abd2cf0bb3a9c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/trace_chain.rs: crates/cli/src/trace_chain.rs 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 fallow_cli::trace_chain::print_human at line 145), 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: report degraded parses, harden caches, and stop contradictory counts\u201D; \u201Cfix: surface star-export ambiguity instead of blaming the sources (#2268)\u201D; \u201Cfix: harden Deno workspace support follow-ups (#2091)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/trace_chain.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":"crates/cli/src/trace_chain.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"207ca3b1be15c1c7079521b3b6e6ae837ad53b3e59f5d5d94dfdaba60f13b7ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/eslint.rs: crates/core/src/plugins/eslint.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is fallow_core::plugins::eslint::resolve_package_entry at line 495), 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(vite): credit exports of alias replacements that the resolver never reaches (#3974)\u201D; \u201Cfix(config): read JSON configs that end with a line comment (#3580)\u201D; \u201Cfix: resolve ESLint workspace export patterns (#3343)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/eslint.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":"crates/core/src/plugins/eslint.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84fad85ab9d2ce5a5f2ca21cb430729f5cc4f58b60ef3ec2f7cc3f0f42aa15f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/wxt.rs: crates/core/src/plugins/wxt.rs 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 3 (its worst body is WxtPlugin::is_enabled_with_deps at line 53), 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(config): read config values that a same-file constant holds (#3929)\u201D; \u201Cfix: honor inline suppressions for component event findings, trim duplicate core tests (#2881)\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/wxt.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":"crates/core/src/plugins/wxt.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a3eba6c0e3d0d508cb20d88545938b60c92999b4c5cecd5c372b97dfa33ec4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/used_export_rule.rs: crates/core/src/plugins/used_export_rule.rs 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 fallow_core::plugins::used_export_rule::is_export_ignored at line 182), 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(exports): credit CommonJS config keys through the default export (#3931)\u201D; \u201Cfix(plugins): credit the export that a Serverless handler names (#3741)\u201D; \u201Cfix(plugins): credit the exports that tools read from their config files (#3730)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/used_export_rule.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":"crates/core/src/plugins/used_export_rule.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814d3ed80945f0151ae1e892562e39d284ea2ee650aaa27aa8407325c2cfbb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/rayon_pool.rs: crates/cli/src/rayon_pool.rs 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 3 (its worst body is fallow_cli::rayon_pool::configure_global_pool at line 8), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): size the parse stack from the source (#3809)\u201D; \u201Cfix(lsp,mcp): run analysis on threads with the worker stack (#3806)\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/rayon_pool.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":"crates/cli/src/rayon_pool.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837f83060d00dc650bd4b9e0247acd038ef49830c8063128e9349fc30a22b13"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/output/src/audit_worsened.rs: crates/output/src/audit_worsened.rs 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 WorsenedMetricKind::label at line 60), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(audit): do not gate on complexity findings in test files (#3753)\u201D; \u201Cfix(audit): report growth of an exceeded metric as worsened (#3750)\u201D; \u201Cfix(audit): do not gate new-only on estimated CRAP alone (#3747)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/output/src/audit_worsened.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":"crates/output/src/audit_worsened.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e36e1c239998011dfc2d3cdcabee9619ca7c6f2c262ba1a90aaa9084769969e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/plugins/vercel.rs: crates/core/src/plugins/vercel.rs 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 2 (its worst body is VercelPlugin::is_enabled_with_files at line 54), 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(plugins): credit the exports that tools read from their config files (#3730)\u201D; \u201Cfix(plugins): credit the default export of plugin config files (#3715)\u201D; \u201Cfix(plugins): treat Vercel api directory functions as entry points (#3180)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/plugins/vercel.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":"crates/core/src/plugins/vercel.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fafb51b6d5a77102d1562a2c2ea73a14995debd23e0f7b18ea217e1ec9905a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/process/src/lib.rs: crates/process/src/lib.rs 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 fallow_process::drain_and_kill at line 28), 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(mutation): close gaps in the worktree guard and companion cleanup (#3480)\u201D; \u201Cfix(process): count zombies as exited when the signal drain waits (#2997)\u201D; \u201Cfix(process): wait out an executable that is busy at spawn (#2496)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/process/src/lib.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":"crates/process/src/lib.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43f8af6c4abb5db1f789804901a8ee0d977ab90cf8db0167108362649347836"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/health/react_hooks.rs: crates/engine/src/health/react_hooks.rs 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 7 (its worst body is ProfileAccumulator::add at line 38), 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(health): name Effect callback bodies in complexity findings (#3365)\u201D; \u201Cfix(health): attribute Istanbul coverage to the function that owns the position (#2449)\u201D; \u201Cfix: resolver false positives, LSP dispatch blocking, and config silent drops (#2148)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/engine/src/health/react_hooks.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":"crates/engine/src/health/react_hooks.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"078d16f4af79d012ff5699c05f68f673520b5a6086be4fb282dcc9a6ab3ec4ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: npm/fallow/scripts/run-binary.js: npm/fallow/scripts/run-binary.js 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 9 (its worst body is run-binary.runBinary at line 211), 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(npm): keep the output of the binary complete under Bun (#3278)\u201D; \u201Cfix: start type-aware reliably on Windows\u201D; \u201Cfix(api): report truthful type-aware discovery sources (#2113)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- npm/fallow/scripts/run-binary.js\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":"npm/fallow/scripts/run-binary.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c8fb96c57db4a0ca1a928b4376dc1ce43b02337206ce5fdf9a39f2624f8e6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/graph/entry_load.rs: crates/graph/src/graph/entry_load.rs 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 9 (its worst body is EagerSubgraph::new at line 208), 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(graph): treat path and asset references as edges that do not run (#2994)\u201D; \u201Cfix(resolve): resolve webpack inline loader imports to their resource (#2974)\u201D; \u201Cfix(extract): count relative require.resolve calls as file references (#2968)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/graph/entry_load.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":"crates/graph/src/graph/entry_load.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65520fee5d97b93612bfd3aa41ee28573f0fa0a16862d3c9ccb59f22c0462f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/api/src/doctor.rs: crates/api/src/doctor.rs 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 9 (its worst body is fallow_api::doctor::effective_type_aware_config at line 608), 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: honor FALLOW_CACHE_DIR in the language server, MCP server and Node bindings (#2999)\u201D; \u201Cfix: withhold every mutation the run lacks evidence for\u201D; \u201Cfix: report degraded parses, harden caches, and stop contradictory counts\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/api/src/doctor.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":"crates/api/src/doctor.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e748687c7b6edfa7fa74143dc63408a30b903e291cc8905becb567df4fcc4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/graph/src/resolve/react_native.rs: crates/graph/src/resolve/react_native.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is fallow_graph::resolve::react_native::synthesize_platform_family_edges at line 203), 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(dead-code): collapse React Native platform families in duplicate-exports (#2416)\u201D; \u201Cfix(extract): route ambient export type * through a type-only whole-module import\u201D; \u201Cfix(graph): credit the whole React Native platform-extension family (#2087)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/graph/src/resolve/react_native.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":"crates/graph/src/resolve/react_native.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"42839563f83b570f332fdc8eecff678a1d1b478b77467333178296985010b88b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/analyze/unprovided_inject.rs: crates/core/src/analyze/unprovided_inject.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is fallow_core::analyze::unprovided_inject::inject_site_has_unprovided_key at line 229), 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: close analysis and audit follow-ups\u201D; \u201Cfix: surface star-export ambiguity instead of blaming the sources (#2268)\u201D; \u201Cfix(graph): resolve effective barrel exports (#2210)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:15:57 \u002B00:00\u0027 --until=\u00272026-10-28 12:15:57 \u002B00:00\u0027 --full-history --no-merges -- crates/core/src/analyze/unprovided_inject.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":"crates/core/src/analyze/unprovided_inject.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda01336ad091bc1c80cbcbf6e0865c0aed6cfb84346df11b616ac8804da7727"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 8 of 27 project(s) overshoot their size bounds, lowering Project Cohesion to 4.1/10. The most over is \u0060crates/cli\u0060 (176550 LoC, 485 module-visible types across 18 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":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7fddc43bf2daab5d3b770a0e0439b10d1a433c23e6e550be67fd9a154356f27"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2df5ed99552dd0347687e68dac3ca0fc7f17170f285b469e0b1af537f1b190de"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19a78a29e8bec9d1fff001d992b1847727244ba23cda354755ec6b543cfadcb6"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b388c9d83f56ae8de1c52447ec05f878a7f6640d49737a0fc7d2611ccd7d06f3"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de73db4722f4a75449812872b686fb649b1b3850a069632f6fedfef2c84af367"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abd22eacead2b34bfc49fc87ef8d309a783f3c8f320d2de8cdde126702d86bb8"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"faf7d55b956daf683c82018854ece0315572d4d38f71609419703536b7624095"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"575408b049853fdb6e9501d3718a390affc493557689aab03e5fe28a77ba226c"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a20a2e5637279b8343347173d32d545ddc59ac89d55098b655da3fb66be2ebc"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47a1058e02a5dc127ed888f38f9f26776776381ae850f657a8214d0346c4f672"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f748be50b33eec96e0688cf3ed532da81ba6212b8d148f81b6072fed57b9228"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b1de1b86921b551198faf2e4ec3b53895607b07ef968a2199bcaf710d6d9542"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c648b03e6ebde517bb624d6fbddfe255f9864420fded42beb61d78c1924f8d37"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36fa0e4f49b8b644cc21e6785935527c23913c9f7ebfe7e29603688559db8536"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85611b95d3319c6cde550e3646af6ba7b648d9280aba2f70156ff00f72b33c8b"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"215450b613c79c7ba2f64bf7e30f56bf509632c558104c89ed04d8cac5a5e84f"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bef62234fa93da3633b0546c4efc2ca403066576a9eecf2db68445295c73e7c"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af2c167885b75b811010849d3a21633141533308c0e948b4dccf4bd7de9f80ac"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33ea4a379a91fa65335a2ef8ff37fb9ec4ba4bd4a294c3aa9eba118e45c43b99"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dabe17b80bff87dcaa8667d56d2a8d9aa77bc720d2ac61a3786dacb0acb92feb"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2848601c5ef2d520fd50fdeb7ede48a2136912ec282336cd9547ead5a332d307"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1f97a5958d7277809928d2d2c2fed02fcfe15d625fff582fe07f46e2503998"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2dfa830fcd1fecb15560b117d9c4437eb48763b639205ad76d204648487a568"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8576194625c6ea70874b45d71003f92aa78e989e1e6d1f71b70109b31254498"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1ec51d64717ef99f48c0cd9df071ee4c77f1cecd2ce315535940b0d194b889e"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8de36ab83744443b100efb1ea0902f3b72d8b35e7b1ee655c2348c4f26ff44c7"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47f6c2898af61ed0f8dbd1ee88440708129d50d1f24dcb38944432924a16987a"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e34e3fc0a89de7829e1f32da24317a36ddf215067127f651fbf99bc015f6c0c0"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"772026bc5bcede3aa10b8169fffd73f29da32a47b4ed32c6d6118b2336760149"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de8734c352dd3e2d08362f4833c1b46c5a54087330cafc0d5770c28747221cce"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b71884feca3be056b86756b3b76b52b0f28abcffe82093cff17fad639125681"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f9f3c0dcc00da20d413114e435126c73a68810066f5ca0d5d36cf59314ec7ab"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca33052b3bc9751fb62e45d789834ee16c97eca613748aaeb38ccec500d5af9d"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5f797c728e3a1af72365ce16561bb525618442052f1437b0bb423e6a9cc7a06"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4e6289ad8be30283f7b54b268cdc91ea18a123b80e8c75670b5064048d07df7"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d81a46590ec375fb2d0b5c5c79dcf24b6abaae6d4e4f04372973585220513bc"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3f94c969cb2c401cbbed6190f1cbaeffa91674e2cacefb730f45ef02c0072fe"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f7e3fc0b714cb6b9a44f81d0e639c74dfd6a6f5364e2898a9aa1315af576727"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8175e8bd81f4f55e9a542f7db3c7ed7124969e2b0bc33c2b88c574b8f8d1a672"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea931d6380568395643c6f686bbcfb302581da9e01f551c1f86a9ca5a508383d"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39ce1bc9fffb84a1bd54e730f1f46bded21dafe3dc664df7ab4636c4ee4baf8e"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bd3e21c84a5e332089e2e9857a3074e86bcca1138795c4df1f4e4acd924a2af"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f194b7de0fd4949c97dbc6b8aa705bc985daeb2a6857f287f6275982a5681c2"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fe9e5c5dfbe06734dc56a081aa6acde6318096716baa4c377a001d8553db513"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"971f71ecb4b802d6fc466dfaf50ed6bb239a78f4fd17620cb44d99e09afceff5"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5da2ed890b50288a03d4f26e618ecab30f25d62876c514ad06d87c9d118a9f75"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a503075d6117af2608af3148c4137c5d48cdcf068e9e970207e84c90b84edb4"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b1d5c2e90604880d7a615fd56c69d18bb3f3dcde0557b25182bee7f3eefb859"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"854c41a258b4dad5fc32ea4fff90ca5b5769ef2e23b82b671e622706f8b78fdb"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3976a41d5aa08bb40b5bf47e3b2b66508ad49df3bb971a8ede2c22734ce151b9"},"properties":{"commitSha":"20972d541b1deadad79108d780ffae6fd9c48163"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39930ef06e11718b4215e489d2c73ddc88f62bacbe939832385fdf6eb577a2e9"},"properties":{"commitSha":"198962f3fc2623e2ffed318023d14c5efbf057f6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fae6bed0026079cc8de9850a389b47063092307c4b569ecf5c4b218ef08c733"},"properties":{"commitSha":"dac2cd4506c107f7778bcc261004357ebe70d2fe"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77df72d06f7291bd244ab4286c4dfc22edf39b1a381f374ef76c1c11cf0cc914"},"properties":{"commitSha":"90ca4d4da44ebf9f0a0b7576df619ddbb02575c1"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"517ca6a2eaa2008007def85bd7634b24c79ae446752230dd106f40d7ab2f0b8b"},"properties":{"commitSha":"885dee43a93584f51ebfb4a05ac7462dce976a2f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d36862d3f56ed6546615268b5001ea273ac33c3e5192933ba4ffb2711d99805a"},"properties":{"commitSha":"83f4a84813d43e6a983246bb2d50f68cb64154b7"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a08df73f5a4c4de26ca125e18c54377c9a3e3a990cfcc0de9aa8370420834b28"},"properties":{"commitSha":"b21c854a57d0395fa07680fe5e9e84880487f9fb"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27dcc45b4a00148e16f9c95bc350ee65950e32ac6ce239fdf8f4e89502fffde9"},"properties":{"commitSha":"c7ba166d96934a3588db315d244ba7efaffad72a"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78c0f2f5b08e1dfd58d142b6f7636c2e20f61cff3b599940513e3f5c2f7d7b0c"},"properties":{"commitSha":"58c8e95f3de16d8cdac85ad48bc208750df0ce2c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15809c7f345ae8ac107b4011889f7ae048e83e58e9bd4f57b69ed6a15a91dafd"},"properties":{"commitSha":"f0f3dc1e3edd58ca26aad331f118f34237102d2e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e70410b231aaa3663e473baf7a7a842f5bf9c767480c2c4fd66d0a56c4768b8"},"properties":{"commitSha":"122586e26d718bed3363113d0b8096df1217e66c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"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":"3e7fd1b7440affe253920fbf6d4aae4d6346bebeb03af6019545178aa26f13e3"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"1c39c4cfcfeccaecd97b30719483b8ce96a06ec6ae3f69ca0cf4e7f2d1ffce2e"},"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":"58a9692c2bacfbe59d34fecc7d45bd4c908a2133f9845d4490049b6ee9e8aedf"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"0d264c4b071b0eabdf4911961502d95506131e17ab3c1efe02da87c1ba42a2f5"},"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":"667a4d095b15eda6ff851390b5c098da0ec5bd0d4e0e50f21f119626df00be8f"},"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":"99e49eb7d0a3eaaa149febc9a1c524813e149c9f0d5d4c33e58eb5a290bdaeb4"},"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":"7922b75f1a4d03a050e0fedcbd58bf95fb94d050f368db04fd1392170e4cf580"},"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":"16be30883e50225c4903232e9b78e5d2325bc72d6b0371daf592643e9fb10672"},"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":"24df3c6347b3a3e1d0c43bfd56e02ee1767e2da6eabed31e5e8198356d02ddc5"},"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":"0d005fb5988fb9f02b5a82b54eb484034258853332b3240a1d748671daeda900"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"8dbd9217402499b866e95492fc0a7894d3f2219ef6a7fcc442c98e856feb7470"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"b40b2e29bd7fb601134ca189cc630f993fbbd41fc7b4e408e6e7a2bbd092dbfe"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"f2b0d980bf2a6f76507f8b936f51330df22e2257e278466c319a771fcb854b25"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"86e7738330583f86d41dc527e7a78b9dba97aa037a53b4ca6b6605e287f47ea2"},"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":"e213f14ab3237cdcf345e43168f5fe2b12ce26f2930590e9f89db81a41f0580a"},"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":"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":"713a2f1ba33ab1dff27c1c7fb329c8a907e1b83ae93563f88f07450588a1a12d"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0b38d12dafd19a1e114a0c1ad64b0feff964dbd62922d27c574a2711eaedd0c"},"properties":{"dependency":{"package":"qs","version":"6.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bae33ef1516849df95550e60504ed3384e430c4e992e383da9159721ed1facfa"},"properties":{"dependency":{"package":"block-buffer","version":"0.10.4","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"782210a2756ae057524e350eba7ac2004100819992816981a48e54a27c1902e8"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35bd835fcf003cf3a7b49b86bdff9a197a4b7f04ac962e67f6482102c80b3d29"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"420dc9c3c3ecb7b2d85467b872b3c453b74292a6e384d0719ba6dda8d8660c48"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/adonis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e099e1bfd5ced12182a4c3c076819ec4841e326b0bac99412eac9c9def4889cb"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/sfc_template/glimmer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3acea2131749cd0d80994b2c4131aed425fab785f0ef6278e8d8db89bb532e9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: types.rs \u2192 html.rs, parse.rs, sfc.rs, angular.rs, vue.rs, template_usage.rs, declarations.rs, helpers.rs, mod.rs, visit_impl.rs, visit_impl_helpers.rs: \u0060crates/extract/src/cache/types.rs\u0060 changes together with 11 other files \u2014 \u0060crates/extract/src/html.rs\u0060, \u0060crates/extract/src/parse.rs\u0060, \u0060crates/extract/src/sfc.rs\u0060, \u0060crates/extract/src/sfc_template/angular.rs\u0060, \u0060crates/extract/src/sfc_template/vue.rs\u0060, \u0060crates/extract/src/template_usage.rs\u0060, \u0060crates/extract/src/visitor/declarations.rs\u0060, \u0060crates/extract/src/visitor/helpers.rs\u0060, \u0060crates/extract/src/visitor/mod.rs\u0060, \u0060crates/extract/src/visitor/visit_impl.rs\u0060, \u0060crates/extract/src/visitor/visit_impl_helpers.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 11 separate couplings, not 11 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 11."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/cache/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7deac3a1e25d2b15bba02686656ed22f25c9608aa280241632a3204cea1bb4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: health.rs \u2192 compact.rs, markdown.rs, sarif.rs, assembly.rs, grouping.rs, targets.rs: \u0060crates/cli/src/report/human/health.rs\u0060 changes together with 6 other files \u2014 \u0060crates/cli/src/report/compact.rs\u0060, \u0060crates/cli/src/report/markdown.rs\u0060, \u0060crates/cli/src/report/sarif.rs\u0060, \u0060crates/engine/src/health/assembly.rs\u0060, \u0060crates/engine/src/health/grouping.rs\u0060, \u0060crates/engine/src/health/targets.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 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 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/human/health.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad40f5ca8210c4f22c9f144fde08ceb60657707b1283d829450376911cda4f71"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: audit.rs \u2194 mod.rs: \u0060crates/cli/src/audit.rs\u0060 and \u0060crates/cli/src/combined/mod.rs\u0060 change together 73% of the time (16 of the 22 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u0060f4121c21\u0060 fix(action): baseline health and duplication on the default run (#3316); \u00602186bd6b\u0060 fix(cli): reject --dupes-* overrides where dupes does not run (#3084); \u0060773d4393\u0060 fix(dupes): fail on clone groups with --fail-on-issues and --ci (#3057) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1de617d2f22a227d6ad9b93232441c4a488ef1ac5f8511e94e725ec8a6302b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: results.rs \u2194 main.rs: \u0060crates/core/src/results.rs\u0060 and \u0060crates/lsp/src/main.rs\u0060 change together 71% of the time (10 of the 14 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006032499248\u0060 feat(security): surface severity tiers; \u00605dc83a4c\u0060 feat(security): structure findings as agent-actionable candidate records; \u00602e1d6f5b\u0060 feat(lsp): surface security candidates as opt-in diagnostics (#891) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/results.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a797948e020d617586f0fcfb8fdd27a3336f0d87eb5fba67e4460054b2179e50"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: commands.ts \u2192 client.ts, statusBar.ts, treeView.ts: \u0060editors/vscode/src/commands.ts\u0060 changes together with 3 other files \u2014 \u0060editors/vscode/src/client.ts\u0060, \u0060editors/vscode/src/statusBar.ts\u0060, \u0060editors/vscode/src/treeView.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 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 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e4bf1539d7377bc3c71486dddc974f095ce95ffa81670300d2abcde453740a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: mod.rs \u2192 compact.rs, markdown.rs, sarif.rs, grouping.rs, health_css.rs: \u0060crates/cli/src/health/mod.rs\u0060 changes together with 5 other files \u2014 \u0060crates/cli/src/report/compact.rs\u0060, \u0060crates/cli/src/report/markdown.rs\u0060, \u0060crates/cli/src/report/sarif.rs\u0060, \u0060crates/engine/src/health/grouping.rs\u0060, \u0060crates/output/src/health_css.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 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 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/health/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b435e2020d4226382eeb66f63a66d5b632e53ff691935247e3d14074a01c16"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: analysis-utils.ts \u2194 config.ts: \u0060editors/vscode/src/analysis-utils.ts\u0060 and \u0060editors/vscode/src/config.ts\u0060 change together 65% of the time (13 of the 20 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 13 shared commits counted here, the most recent 3 are \u0060a6324bd1\u0060 feat(vscode): add the fallow.audit.worsened setting (#3714); \u006024dd2b0d\u0060 feat(lsp): add ignoreSymlinks to the duplication init options (#3083); \u00606c5bf5db\u0060 fix(cli): keep syntactic findings when type-aware analysis cannot run\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/analysis-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5793678d42254e8be65aca84cef7e2a9680c0b49923282f1f2c683375011b3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: markdown.rs \u2194 sarif.rs: \u0060crates/cli/src/report/markdown.rs\u0060 and \u0060crates/cli/src/report/sarif.rs\u0060 change together 64% of the time (27 of the 42 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 27 shared commits counted here, the most recent 3 are \u00605a664dea\u0060 feat(coverage): mirror cloud trust-output contract on local analyze r\u2026; \u0060312ce906\u0060 test: cover health and dead-code rendering branches in report formatters; \u0060c187b94f\u0060 feat: add health threshold overrides \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/markdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49360d109fc467af9723902e2180c674fece11d3b8ff210dd0640664cdb0a6c1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mdx.rs \u2194 sfc.rs: \u0060crates/extract/src/mdx.rs\u0060 and \u0060crates/extract/src/sfc.rs\u0060 change together 64% of the time (9 of the 14 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 \u0060bd359f71\u0060 fix(extract): preserve container source positions; \u00600bf57c0b\u0060 fix: gate entire sfc/astro/mdx test modules under Miri; \u00609a10769a\u0060 fix: gate parser-invoking extract tests with #[cfg(not(miri))] \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/mdx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23692161257c9ed8fa6fbd3b7f2e7d538c8be10406f8b611093eaa04f1a61427"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mdx.rs: \u0060crates/extract/src/astro/mod.rs\u0060 and \u0060crates/extract/src/mdx.rs\u0060 change together 64% of the time (9 of the 14 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, 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 \u0060bd359f71\u0060 fix(extract): preserve container source positions (at that commit the file was still \u0060crates/extract/src/astro.rs\u0060); \u00600bf57c0b\u0060 fix: gate entire sfc/astro/mdx test modules under Miri (at that commit the file was still \u0060crates/extract/src/astro.rs\u0060); \u00609a10769a\u0060 fix: gate parser-invoking extract tests with #[cfg(not(miri))] (at that commit the file was still \u0060crates/extract/src/astro.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/astro/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aea9ccf6fdb6cc2910a65ee4f2bf93777d7367a0b8659166844642dbfc0911"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: security.rs \u2194 rank.rs: \u0060crates/cli/src/security.rs\u0060 and \u0060crates/core/src/analyze/security/rank.rs\u0060 change together 60% of the time (9 of the 15 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, 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 \u006018c70b76\u0060 fix(security): classify fixed-origin URL sinks; \u006032499248\u0060 feat(security): surface severity tiers; \u00601d26ae1c\u0060 feat(security): secret-to-network exfil category with destination signal \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/security.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcac20d22b96f4f28c4e5f7e3a54a6eb0b404ccd877495264f79412a41f45fa0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: health_css.rs \u2194 health_grouped.rs: \u0060crates/output/src/health_css.rs\u0060 and \u0060crates/output/src/health_grouped.rs\u0060 change together 60% of the time (6 of the 10 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 6 shared commits counted here, the most recent 3 are \u00607cd0a865\u0060 chore(types): align schemars optional fields with serde(default) \u002B ad\u2026 (at that commit the files were still \u0060crates/cli/src/health_types/mod.rs\u0060 and \u0060crates/cli/src/health_types/grouped.rs\u0060); \u0060c7df139a\u0060 feat(schema): typed dupes wrappers \u002B derived CoverageAnalyzeOutput (#\u2026 (at that commit the files were still \u0060crates/cli/src/health_types/mod.rs\u0060 and \u0060crates/cli/src/health_types/grouped.rs\u0060); \u00606b6a89bb\u0060 refactor(health): typed HealthFinding wrapper retires findings post-p\u2026 (at that commit the files were still \u0060crates/cli/src/health_types/mod.rs\u0060 and \u0060crates/cli/src/health_types/grouped.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/output/src/health_css.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"146929264397161166df5efe768ba4caab90a91dc01853d99ee99b8d452d75d0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: vite.rs \u2194 webpack.rs: \u0060crates/core/src/plugins/vite.rs\u0060 and \u0060crates/core/src/plugins/webpack.rs\u0060 change together 60% of the time (6 of the 10 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 6 shared commits counted here, the most recent 3 are \u0060bb13ec8b\u0060 fix: read an absolute config path under the project root as absolute \u2026; \u00605a64644d\u0060 fix: read bundler and Module Federation config options through indire\u2026; \u00603f82ed02\u0060 feat(plugins): read Module Federation exposes and remotes from config\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/vite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbd6bb26e9295dd7d92c1a51ef41364b0e64c7a7bc547d42f7c9ec27a2b5d65"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 dynamic_imports.rs: \u0060crates/graph/src/cache/mod.rs\u0060 and \u0060crates/graph/src/resolve/dynamic_imports.rs\u0060 change together 60% of the time (6 of the 10 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060647aac26\u0060 fix(graph): resolve dynamic import patterns that start with ../ (#3558); \u0060bc7978c9\u0060 refactor: share one extglob rewrite between the graph and the plugins\u2026; \u00608c3ce1eb\u0060 fix(graph): apply negative import.meta.glob entries and escape litera\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/cache/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf851a719f9766aab09b0b5c0be320846fb91014a11cf29c287142e6ca5627cf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: conversion.rs \u2194 mod.rs: \u0060crates/extract/src/cache/conversion.rs\u0060 and \u0060crates/extract/src/visitor/mod.rs\u0060 change together 54% of the time (14 of the 26 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060c9b8dc6b\u0060 refactor: group semantic reference candidates; \u0060832651ce\u0060 fix(dead-code): report an unlisted package that only a resolve call r\u2026; \u00608b023e80\u0060 fix(dead-code): credit the package behind a node_modules/.bin path in\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/cache/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f3ea74b24532890ee9088c5fe17590122c88ee7375215b48e6fbf0d631311f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: rank.rs \u2194 tainted_sink.rs: \u0060crates/core/src/analyze/security/rank.rs\u0060 and \u0060crates/core/src/analyze/security/tainted_sink.rs\u0060 change together 53% of the time (8 of the 15 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 8 shared commits counted here, the most recent 3 are \u006018c70b76\u0060 fix(security): classify fixed-origin URL sinks; \u0060bac297f6\u0060 feat(security): configure request receivers; \u006032499248\u0060 feat(security): surface severity tiers \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/security/rank.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e2b6b966fa4d6cb04b2604cc7b78d61aadca44d6ab1c0063668f1782ecd2d4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: compact.rs \u2192 markdown.rs, sarif.rs, health_runtime_coverage.rs: \u0060crates/cli/src/report/compact.rs\u0060 changes together with 3 other files \u2014 \u0060crates/cli/src/report/markdown.rs\u0060, \u0060crates/cli/src/report/sarif.rs\u0060, \u0060crates/output/src/health_runtime_coverage.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 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 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/report/compact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a702917854a391b9a5d269562565a0866046d11c6be74cca05060a336398b880"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tainted_sink.rs \u2194 visit_impl.rs: \u0060crates/core/src/analyze/security/tainted_sink.rs\u0060 and \u0060crates/extract/src/visitor/visit_impl.rs\u0060 change together 50% of the time (14 of the 28 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u006018c70b76\u0060 fix(security): classify fixed-origin URL sinks; \u00606a1dd0a7\u0060 fix: trust local sanitizer flows; \u00601d26ae1c\u0060 feat(security): secret-to-network exfil category with destination signal \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/security/tainted_sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0818ec7208e2b0219ef139be82f4980ecbcb01ffd069aad13f5bc710e5e4b3b8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: config.ts \u2194 treeView.ts: \u0060editors/vscode/src/config.ts\u0060 and \u0060editors/vscode/src/treeView.ts\u0060 change together 50% of the time (7 of the 14 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 7 shared commits counted here, the most recent 3 are \u006016aa6a90\u0060 fix(vscode): gate DIAGNOSTIC_CATEGORIES drift and wire policy-violati\u2026; \u0060543a32ab\u0060 fix: extend IssueKind drift gates and close the surface gaps they fou\u2026; \u00602f636206\u0060 fix: wire post-2.96.0 IssueKinds through LSP severity, VS Code, and C\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2222ed2ef16d00da9e3e704e44c62e07af0364391eaef4d7c22ef1ef40fd028"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: visit_impl.rs \u2194 lib.rs: \u0060crates/extract/src/visitor/visit_impl.rs\u0060 and \u0060crates/security/src/lib.rs\u0060 change together 50% of the time (6 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00601d26ae1c\u0060 feat(security): secret-to-network exfil category with destination signal (at that commit the file was still \u0060crates/core/src/analyze/security/catalogue.rs\u0060); \u0060171d49a4\u0060 feat(security): expand source-backed entry inputs (at that commit the file was still \u0060crates/core/src/analyze/security/catalogue.rs\u0060); \u006071394a24\u0060 fix(security): add issue 901 literal rows (at that commit the file was still \u0060crates/core/src/analyze/security/catalogue.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/visitor/visit_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e36483e2df326d4ee17819833531296b114182b2c88c633ab651dd284585522"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: unused_deps.rs \u2194 unused_files.rs: \u0060crates/core/src/analyze/unused_deps.rs\u0060 and \u0060crates/core/src/analyze/unused_files.rs\u0060 change together 50% of the time (5 of the 10 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 5 shared commits counted here, the most recent 3 are \u00605b4201a7\u0060 docs: keep core migration warnings self-contained; \u0060836920e6\u0060 feat(core): deprecate fallow_core public surface per ADR-008 phase 1; \u0060c24638fe\u0060 refactor: replace wildcard imports with explicit names \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"301628249c7e6c228c2b26c0035456d597c92362ae0b3e3642b79c3794a17320"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: knip_tables.rs \u2194 builtin.rs: \u0060crates/cli/src/migrate/knip_tables.rs\u0060 and \u0060crates/core/src/plugins/registry/builtin.rs\u0060 change together 50% of the time (5 of the 10 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e692f852\u0060 feat(plugins): add dotenv plugin including dotenvx support (#3771); \u0060ec4a6982\u0060 feat(plugins): read GitHub Action manifest entries and the VitePress \u2026; \u006047c82b2c\u0060 feat(plugins): add a release-it plugin that credits its config file a\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/migrate/knip_tables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae7dec7bd1ca9b9aa19c28b5625491f0b90709f9fee5a26c5364b8dbdd250dc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 reachability.rs: \u0060crates/graph/src/cache/mod.rs\u0060 and \u0060crates/graph/src/graph/reachability.rs\u0060 change together 50% of the time (5 of the 10 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00608c3ce1eb\u0060 fix(graph): apply negative import.meta.glob entries and escape litera\u2026; \u0060170c3769\u0060 fix(health): skip type-only edges in test reachability (#3521); \u00601b138850\u0060 fix(graph): treat path and asset references as edges that do not run \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/cache/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df23931450061045fe07ac257c55e526173cf442b242916a7138335aceb5a96c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#canvas:focus-visible\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3881363c7e370209f8d2de47dc4c1f33e4a9950b8644d5e44a55f700ec081c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#panel .rank-table td.col-file button:focus-visible\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e72daf189e2c8e367229c1a07a08e767ee6748525d5c374b2956aba3dc241b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#canvas:focus-visible\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e130f59367f5caf402727854e768acfc183eabbc398ce9f2445b4c143281f7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#panel .rank-table td.col-file button:focus-visible\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"8171c986f8ca6e425e6f65c9876c6df8614bf9bcc0ed65ff5229a5fd3d0dd81f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.lens-menu\u0060 moves (\u0060animation: pop-in var(--dur-base) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e9439b7180a793fbac43b401477508775f623fd5bef5ff1cb6a0a9c3406303"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#panel.open \u003E *\u0060 moves (\u0060animation: settle-in var(--dur-slow) var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf916bc3a8a299c7debd19887d0214e35549e5f1cb8f56e7c5fa04f9e6d0d26"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#panel .rank-table tbody tr\u0060 moves (\u0060animation: settle-in var(--dur-slow) var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"be99645939191c79507609e04996e5806b4362dc3599555ab34088b67c7f1ae1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hint-tip\u0060 moves (\u0060animation: pop-in var(--dur-fast) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9d30f21257a4321a71ba18b29f8e0d843953c645a50d823c7bbe1722d802cb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#panel .bar-fill\u0060 moves (\u0060animation: bar-grow 640ms var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b7e2863dd2b15221216b85b72f82d1b260d286e2baf8e28489a528054fe62"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sev-seg\u0060 moves (\u0060animation: strip-grow var(--dur-slow) var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb47099605c3a88920a831bb0c8631aa7d6963c5e96cba0148a3e5f924a04c07"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#tooltip\u0060 moves (\u0060animation: pop-in var(--dur-fast) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9205ea8780c419ecc7bfde966c1fe94a538935d265d43913647b1724eb4ca81"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#help-overlay.open .help-box\u0060 moves (\u0060animation: help-in var(--dur-slow) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/styles.css"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"198d7b00b1f29d69e39e8c91394aab62303db6975a9b16c254e264bbc81b6aa1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.lens-menu\u0060 moves (\u0060animation: pop-in var(--dur-base) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53076f4d3387ff2e43fb4c335f5f345700a0651c12fb75631230935a4196801"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#panel.open \u003E *\u0060 moves (\u0060animation: settle-in var(--dur-slow) var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf073f2b37f4c2b269f916a1046c7687b90f97a8088b78dbfbe66b51a34517f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#panel .rank-table tbody tr\u0060 moves (\u0060animation: settle-in var(--dur-slow) var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"150e53cf9c087496a6ca8977c20f7481ae8493b7c9e22fd0a6278ed51a6dc909"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hint-tip\u0060 moves (\u0060animation: pop-in var(--dur-fast) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"19df2366641478dec8b1faef823d23757892b59665013d68795d5cbb1e440bff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#panel .bar-fill\u0060 moves (\u0060animation: bar-grow 640ms var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"44842fda67646303bcfe2536e7fec328569fe8eb4bab357ae381bc551a48655f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sev-seg\u0060 moves (\u0060animation: strip-grow var(--dur-slow) var(--ease-out) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04880996616abc24ae26440c7b32712f3dc2b2b383f1518492367921abae0c3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#tooltip\u0060 moves (\u0060animation: pop-in var(--dur-fast) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"0356ec07c6e9122334ffe593e0bc9746caeb82872dc933a870d05e207686770f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#help-overlay.open .help-box\u0060 moves (\u0060animation: help-in var(--dur-slow) var(--ease-out)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/viz-assets/viz.css"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b96fb8f4c88ce5ab1cf0dfd1d32a12067d4b84ae598924d15c3eacb8f98423"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 your oxlint config does not list the \u0060jsx-a11y\u0060 plugin (its a11y rules are off until it does) and there\u0027s no axe/pa11y/Lighthouse in tests or CI. Start by enabling that plugin to catch issues at author time. What was searched, so you can tell an absence from a miss: the 4 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: unused_deps$module.find_unresolved_imports: \u0060unused_deps$module.find_unresolved_imports\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_deps.rs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baaa258cc2650936d1647e2e41ae3faa64da53c59487433a3e42269888b108b"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/environment-variables.md names TypeScript 7, but the manifest declares \u0060typescript\u0060 ^5.4.0. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/environment-variables.md"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7006cf9c122dd12f036e4708b540d8c256ff3591ffa4a5197e75117bb4838cc1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/development/quality-gates.md names Vitest 4, but the manifest declares \u0060vitest\u0060 5.0.5. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/development/quality-gates.md"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2abe935576c9f0b8488f5f90393c8296d4dcd322d608631fca2a1a0ca5bf91"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 9/10 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/multicall\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060accessSync\u0060 in \u0060packageVsixVariants\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":"editors/vscode/scripts/package-vsix-variants.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"378833a98d43b652cd50ec3adbcb1779fb87ceed2dbb004c8d0b0a09dc90df19"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060accessSync\u0060 in \u0060packageVsixVariants\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":"editors/vscode/scripts/package-vsix-variants.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a947a5cdf32fe59d7a5f199944165fae3e777cd604f088405e946f2ecab57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060packageVsixVariants\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":"editors/vscode/scripts/package-vsix-variants.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d444558f222759262866f045c792fdde4d440ea778ab696fed7a61605ac39b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060packageVsixVariants\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":"editors/vscode/scripts/package-vsix-variants.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d511a25247931bb0547cfd81868a23ca6016d8923800014f97b4934b83de0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060verifyPackagedTypeAware\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":"editors/vscode/scripts/verify-packaged-type-aware.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3f589b2b546996075a26efaee5faa5f00dcdcf442086eb946fb7b1a93eb46c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060verifyPackagedTypeAware\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":"editors/vscode/scripts/verify-packaged-type-aware.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdf71824d1c05fcd2c05ad7a40891d4a5243d0ba365823cf5d1cf8f04164ea4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060verifyPackagedTypeAware\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":"editors/vscode/scripts/verify-packaged-type-aware.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37752325188e4ac31cac1ce193b23c410d6527c2eb7b60ce00d0205f6aa2995"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060verifyPackagedTypeAware\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":"editors/vscode/scripts/verify-packaged-type-aware.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c641861d321d06a2cb5e4568441a1ec9c630596beba45a2adc806cbaf8d8eaec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to backends.map\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":"editors/vscode/scripts/verify-packaged-type-aware.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"42edc45d526a12940c495f97ecf7ce1801490c82b6a8f5ee1baae58d82847d17"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060inspectVsixArchive\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":"editors/vscode/scripts/vsix-archive.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ef39c0b07c33c9b92d529f993362e1beeb04d7ea50a043480b7213c13212d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a7d21d080e8bab69cee2bd6bf05ad555db1bbd23ecad5782edc0ae08b3368b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f3f7e3d432c533c854d009ab9d9ccdabf8d47de6e6d019ece8d2ce86e1a49"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fac0ed2421720026d7f48f2f2135a627bf6629ebae2da48c9345a1307237a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f28b4030f0be827e08cb64e618b047699d1d0c283e817fe6452a21114ff359e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f1af22e109288d09b98adef853f1e8ae5e9451cff1edf6e57066423532650f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"41884ea46cd5b6e668dc420cbced7eb3e7a784799029d4344a44fb845e138e1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f630201dbdc84cc21054fa99575e253834bcf2152b5316a8ed15a6a8cd7ee4f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060downloadAsset\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":"editors/vscode/src/download.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eec57c4dd0c705e943d67713af5eb681eae8c7de93b167be41925f2fe247167"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060recordRow\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"414050841be9c25ea05215c54b81ab4c076828c85cffb8bfd5c4e50c3e9387d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb60824edfcfd27a1230b8b3d4913094047e89919fdfb35c7894124d1247e18"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ccb4a8d861d784e662aa0039aa5b527bc860f625794dcc87984b34acad2d0b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdbeeac4f03bea7c94459a57cce84b539d195aaace94b09c0da6941b75931e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d62b5af7b89ba5c50e6d8db2c95429a78bcdee21f873ce36786277104e4cd1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa17d974fb5847ce7069955d39a2989834d72cb8995ac57a6d74f8c594c955"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8125dc817a2a8e8ad7d14748829315c420b10590dc124be21aa0e0301b1afe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee15d0676ebc8cfba24a7ced5d396b463d0ad6f0b4611b4da8e4e1c260f63eb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fef169a13bcf8e938d10dd1a180dd9380ed6ab1bd65db43d5d7efd1e18ceb63"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to map\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"00db936f9849f880594b608c663d6af95e585d11ab6eddd16800246fbe012b3b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab28525974d111cfd1f41ebb7c0c8e0851384b34386e533ad0e72ceaffabb76c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"73be0c610d0dfa02fb7a3608f3f4f7e642f7ab42186526f6e751dc5877fc2354"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db3563e8fcbb6fbc2e55eaf5724df413dc9a9cc6a23cb7148b57659f83d4936"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ab76fe76038a06cc1e0962a34d0eb23e4c83698ed2bdea514feb58ea587466"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1c3f919e5fe8b007e55bb5a4ac3d5a5838b875f4ddd0f61712537362e664e1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to files.map\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":"scripts/semantic-clone-model-evidence.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b1996c5e91e7a5701d457d48fbb57c8d73b02a9b83b25abe555a0a4b82cdd7"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 177 typed \u00B7 240 plain JS \u2014 the untyped files are action/scripts/verify-installed.mjs, action/tests/install-verification-timeout.test.mjs, crates/napi/loader.js, crates/napi/scripts/write-dts-entry.mjs, crates/napi/test.mjs, crates/napi/type-aware-command.js (\u002B234 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): action/scripts/verify-installed.mjs:58 \u00B7 npm/fallow-similar-code/scripts/run-binary.js:99 \u2014 the two spans are one implementation copied and then locally edited \u2014 360 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":"action/scripts/verify-installed.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6b328f5c6cac48833059bc4397366ffbaf578b2dff51070b7a155270b26bb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): scripts/generate-agent-adapters.mjs:106 \u00B7 scripts/generate-agent-adapters.mjs:310 \u2014 the two spans are one implementation copied and then locally edited \u2014 420 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/generate-agent-adapters.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2ec60612567de3af0b66e82c3f757b9272a7a94a542efe94980ad0a753e26c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): editors/vscode/src/diagnosticMute.ts:206 \u00B7 editors/vscode/src/findingId.ts:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 253 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":"editors/vscode/src/diagnosticMute.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"669afd560ab2ede9e36e95015ab615c440fef2e35e644dd7e579331e90889537"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): scripts/styling-corpus-smoke.mjs:204 \u00B7 scripts/styling-pr-smoke.mjs:130 \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/styling-corpus-smoke.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9480f956fb4a1e9770cef391e5baae37eb618899bf19022f2c72ec37c6bc9d1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): editors/vscode/src/treeView.ts:685 \u00B7 editors/vscode/src/treeView.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":"editors/vscode/src/treeView.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"f484ea9d97591e78d95891418f95f88021918cdb9fbfee3658f4a5627e5a5262"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): viz-frontend/src/chrome.ts:656 \u00B7 viz-frontend/src/chrome.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":"viz-frontend/src/chrome.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d9bb6f45e1ef9bf643dd0b20068589258695abb1bfa79b7a968ba77a00351"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): scripts/generate-agent-docs.mjs:999 \u00B7 scripts/generate-agent-docs.mjs:1031 \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/generate-agent-docs.mjs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1d5437394abac49f2f53e8766ac5dd4928ae414a0ee55bd0aed758b42ede83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): tools/type-aware-sidecar/src/project-state.mjs:129 \u00B7 tools/type-aware-sidecar/src/project-state.mjs:176 \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":"tools/type-aware-sidecar/src/project-state.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ab9e085f88ee0dcb59108e6fc559370d39b45ed1c97e973da6d73bf853a5c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/signing-migration-receipt.mjs:12 \u00B7 scripts/signing-migration-receipt.mjs:70 \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/signing-migration-receipt.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"930109b67d71c9bd19e8a930bc26a90cfd3efd1285a2e59f9fe30ffc3aaf27d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): viz-frontend/src/dom.ts:46 \u00B7 viz-frontend/src/dom.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"viz-frontend/src/dom.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcc56f10e88819b0d7daa7dbbc51a2c63e7cb1ab97b17c829f491e85cc33d5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): viz-frontend/src/graph/interact.ts:257 \u00B7 viz-frontend/src/graph/interact.ts:331 \u2014 the two spans are one implementation copied and then locally edited \u2014 168 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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4493299932753787ce10322e04d7f861fa32108dbe12905eb30328cc47ef5894"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/fallow/scripts/verify-binary.js:479 \u00B7 npm/fallow/scripts/verify-binary.js:622 \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":"npm/fallow/scripts/verify-binary.js"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"672704c220d997701f6b538f37ee1d1b3003c43b29cc06fe665817fad07185b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/coverage-producer-conformance.mjs:112 \u00B7 scripts/semantic-clone-candle-conformance.mjs:47 \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/coverage-producer-conformance.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d8026e49d1a111b9e30c4c1f2d936aec3b476546ebb1102b98411ee2c7546d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/generate-agent-adapters.mjs:204 \u00B7 scripts/generate-agent-adapters.mjs:361 \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/generate-agent-adapters.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a69a194fcccea35bfc39127eab5e909e73bab73df9c30d83314d18dbbd3c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/type-aware-corpus.mjs:970 \u00B7 scripts/type-aware-corpus.mjs:1094 \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/type-aware-corpus.mjs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"d825690ae86aaaf9c16b91b89f7de575cd7284e04818e66394b2f312b0e957fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): editors/vscode/src/commands.ts:168 \u00B7 editors/vscode/src/license.ts:47 \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":"editors/vscode/src/commands.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d40675cf0ed80dd27e41a3151fa4a5e32bf5f62240fb8c0dfc589e04c9dc017"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): editors/vscode/src/audit-utils.ts:320 \u00B7 editors/vscode/src/workspacePicker-utils.ts:53 \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":"editors/vscode/src/audit-utils.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa69fb13e345ed89d61aec96b6282d9dcfea6fd61dc9581276544d80e02c842"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): scripts/check-osv-ignores.mjs:75 \u00B7 scripts/generate-vex.mjs:12 \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":"scripts/check-osv-ignores.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab6683e41a14454c3316980cbd766fe0319c9d2bc3ddb08f1af2be532bb73f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): editors/vscode/src/commands.ts:204 \u00B7 editors/vscode/src/commands.ts:217 \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":"editors/vscode/src/commands.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a341a309d2490a87e882e8646230837e5453a98e2768bc355321ec86b4574ef6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): editors/vscode/src/extension.ts:387 \u00B7 editors/vscode/src/extension.ts:399 \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":"editors/vscode/src/extension.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0226e954e26c83795832faf3a9c928dc14dd2ac932d4fb5de346b6657c0ec71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): editors/vscode/src/health-utils.ts:138 \u00B7 editors/vscode/src/health-utils.ts:158 \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":"editors/vscode/src/health-utils.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7ee4a4a3eb5e785001ea0485dbad9b60ecdb0af1648b5bb3bfbb38bfdf8088"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): scripts/check-crate-boundaries.mjs:188 \u00B7 scripts/check-miri-cfg.mjs:286 \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":"scripts/check-crate-boundaries.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fda23dbb3a3b7c122a8a1ee574927ac00630529ca2ac0b0d315657dcbd6280"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): scripts/check-miri-cfg.mjs:286 \u00B7 scripts/check-parse-sites.mjs:130 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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/check-miri-cfg.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0593ed4a8f51e21b022ed8a26abc40ccd83964f3fd9deafd8a384360d366372"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/generate-agent-adapters.mjs:182 \u00B7 scripts/generate-agent-adapters.mjs:259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-agent-adapters.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf4d42229415b684ed187e335ed7b0271e7a5127f191a7086845dd4f572dfc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/ship-git.mjs:850 \u00B7 scripts/ship-wait-checks.mjs:1350 \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/ship-git.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e643eab5f9adad0e4742a9cba402624e154d145ac2acffa328868ee658b945"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): viz-frontend/src/graph/build.ts:892 \u00B7 viz-frontend/src/graph/interact.ts:209 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9587dd1895a8bf2b149fc05d7440939c907252b539e869b19715f7bbd88049fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): editors/vscode/src/commands.ts:1195 \u00B7 editors/vscode/src/commands.ts:1275 \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":"editors/vscode/src/commands.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b8067584beede88d5138e07f59c0e044628d228ea4f50bd41960b0d789f472"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): editors/vscode/src/download.ts:1000 \u00B7 editors/vscode/src/download.ts:1108 \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":"editors/vscode/src/download.ts"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5821aecdcc92d579cc5147a09f13c4fdc3d9fcf80376ca18bf9b7ff60acd432"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/fallow-similar-code/scripts/run-binary.js:23 \u00B7 npm/fallow/scripts/run-binary.js:20 \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":"npm/fallow-similar-code/scripts/run-binary.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b013c640f6f91e841267568adf32029f2ce20904fb93954f52959a574eff2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): npm/fallow/scripts/verify-binary.js:69 \u00B7 npm/fallow/scripts/verify-binary.js:84 \u00B7 npm/fallow/scripts/verify-binary.js:153 \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":"npm/fallow/scripts/verify-binary.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7f061c44c4213ff49dc18967b130dacc5cef9071ae72d22a8b28264355853d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/check-crate-boundaries.mjs:118 \u00B7 scripts/check-crate-boundaries.mjs:130 \u2014 both copies are in the same file, so extract the block 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/check-crate-boundaries.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1ce3ee6bbe435b7027e28c6878174bf7471475472848c72e44e9b727a78001"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/ci-metrics.mjs:225 \u00B7 scripts/scaffold-analyzer-plan.mjs:137 \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/ci-metrics.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60b67dfb41fa33d55699738f8a914ea4bc27476303099ef9ee07478046189fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/coverage-producer-conformance.mjs:523 \u00B7 scripts/coverage-producer-conformance.mjs:584 \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/coverage-producer-conformance.mjs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9191b9c8b9852f22382a8be454e233a5b292c402292b0ed6ea88d8769872f021"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/styling-corpus-smoke.mjs:190 \u00B7 scripts/styling-pr-smoke.mjs: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":"scripts/styling-corpus-smoke.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"632978d501a3f49387200be06744ef3031ee192fb12eedf344114b4b222db327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): viz-frontend/src/panel.ts:2528 \u00B7 viz-frontend/src/panel.ts:2544 \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":"viz-frontend/src/panel.ts"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"22401dd2ebbd28e44f087c327433961122a33e3b5ee326ea6f9ff70f10066cb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/napi/test.mjs:261 \u00B7 crates/napi/test.mjs:302 \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":"crates/napi/test.mjs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1df17cb425122681e1cbcbec88f59f1b19862bca2d7534a02f27ea5eb6065"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): editors/vscode/src/commands.ts:881 \u00B7 editors/vscode/src/coverageCommand.ts:47 \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":"editors/vscode/src/commands.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ebf0b1103b585d6e6786124a2bd121ed4b73e1e7897879ac0083a2d54339cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): editors/vscode/src/license.ts:378 \u00B7 editors/vscode/src/license.ts:393 \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":"editors/vscode/src/license.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52d45af2122e4ab044907ab9fc811fbbab02e7259b7be189bbe9748f37b8ac5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): editors/vscode/src/workspacePicker-utils.ts:154 \u00B7 editors/vscode/src/workspacePicker-utils.ts:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"editors/vscode/src/workspacePicker-utils.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b625dfa55058862c13e2bc9892a519019d642dbf07714f784d2b467476407b28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/fallow/scripts/verify-binary.js:462 \u00B7 npm/fallow/scripts/verify-binary.js:613 \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":"npm/fallow/scripts/verify-binary.js"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7bb4273c8513ee6594a1146c6b50d8ccd12f064b36316acc841d954cb5c2f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/coverage-producer-conformance.mjs:182 \u00B7 scripts/coverage-producer-conformance.mjs:208 \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/coverage-producer-conformance.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dc5c87c9f5b0ef1613393b972d68d38419fdca93b120c95d6f0fc65f898593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): scripts/generate-agent-adapters.mjs:411 \u00B7 scripts/generate-agent-docs.mjs:1065 \u00B7 scripts/generate-all.mjs:475 \u00B7 scripts/vendor-skills.mjs:263 \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":"scripts/generate-agent-adapters.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ad6eab48101db6f6d034f404e0edafa47b6239e835dd4b8ecdcacde1d7f8e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/semantic-clone-candle-conformance.mjs:316 \u00B7 scripts/semantic-clone-conformance.mjs:457 \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/semantic-clone-candle-conformance.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb9bc0107a9f0af68629289ffb65aba507bb3130fbb7b7fd946f8fb211beb74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/styling-corpus-smoke.mjs:359 \u00B7 scripts/styling-pr-smoke.mjs: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":"scripts/styling-corpus-smoke.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"72685fd342ac925c626bb7e08f22f732ef2d69f453f95e38f0fb660f8c822682"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): viz-frontend/src/graph/interact.ts:377 \u00B7 viz-frontend/src/graph/minimap.ts:133 \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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f10774bf155bafca852c474d3d8c89afa219fd0f33fb16cae684aa89e1f8eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): editors/vscode/src/extension.ts:1034 \u00B7 editors/vscode/src/extension.ts:1044 \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":"editors/vscode/src/extension.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae2f52ea221579320151b5d37349f011ef030401129a275958d679465fdb378"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/check-knowledge-architecture.mjs:602 \u00B7 scripts/verify-repo.mjs:378 \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":"scripts/check-knowledge-architecture.mjs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f939a56313ae0225a08ac9296338e7d0d14eb71d1255184cb378a74120f9653"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/compare-binaries.mjs:302 \u00B7 scripts/styling-pr-smoke.mjs:578 \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/compare-binaries.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6cee841fa25d1f83234f2503f3816cedc1f709169a069d466c2e25f023b04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/coverage-producer-conformance.mjs:141 \u00B7 scripts/coverage-producer-conformance.mjs:178 \u00B7 scripts/coverage-producer-conformance.mjs:204 \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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e42a78a3b0f40aa0668e47a91115363e1d4cea4ae9c65b6591992e2f4141b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/coverage-producer-conformance.mjs:972 \u00B7 scripts/semantic-clone-model-evidence.mjs:379 \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":"scripts/coverage-producer-conformance.mjs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f37d45a080924b2d4b903bcd3291dc7b1935bd3df88d90bfb10c323555d5b2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/ship-git.mjs:802 \u00B7 scripts/ship-wait-checks.mjs:1055 \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/ship-git.mjs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef29dcf9be18ef7b4392bbb625111001e611d0f90b5acfa28b015c35fd053d55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/type-aware-corpus/validation.mjs:298 \u00B7 scripts/type-aware-corpus/validation.mjs:327 \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/type-aware-corpus/validation.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74ae3ccffe3727bca2049e9df853aa586912298d446e7dad9de118a6ea11219"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/type-aware-windows-candidate-smoke.mjs:199 \u00B7 scripts/verify-release-ci.mjs:462 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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/type-aware-windows-candidate-smoke.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3393e144c208265fde6213d72434d49671d3cf8169771a43ac2531531e9fcb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/type-aware-windows-candidate-smoke.mjs:199 \u00B7 scripts/verify-release-metadata.mjs:336 \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":"scripts/type-aware-windows-candidate-smoke.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7a1e949a315f3514c32462318a7e746ee6e2f0fc5e8558d1d13526a2709e6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): tools/type-aware-sidecar/src/protocol.mjs:333 \u00B7 tools/type-aware-sidecar/src/protocol.mjs:343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/type-aware-sidecar/src/protocol.mjs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a34bfc6100a97583aaaeaa986e66a4534ce7c8f67151a1d7ac7b13a20f24d4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): viz-frontend/src/graph/render.ts:44 \u00B7 viz-frontend/src/treemap.ts:428 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"546889e81b755dfa3ed2e3debb0492dfc69d5d48388e321d3588f282130c91e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): editors/vscode/src/license.ts:391 \u00B7 editors/vscode/src/license.ts:411 \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":"editors/vscode/src/license.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a62c8ad3f4063d0e180df527a99887844b6b7c8bca81598a4aa2475ce2ffd0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/check-knowledge-architecture.mjs:140 \u00B7 scripts/check-knowledge-architecture.mjs:170 \u2014 both copies are in the same file, so extract the block 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/check-knowledge-architecture.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"304569033ca4fe8012a04baffcca09f4f39bc582bc61d315530467db513002cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): tools/mutation-runner/src/adapters/bun-test.mjs:266 \u00B7 tools/mutation-runner/src/adapters/node-test.mjs:321 \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":"tools/mutation-runner/src/adapters/bun-test.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea27086ceb2c2c24e3930c4b0825ebbb46446c2281259816e57e6443c0a344b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): viz-frontend/src/graph/build.ts:355 \u00B7 viz-frontend/src/graph/build.ts:431 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8df9fafcaba55cfda47d308a9c904e87e7eac34e5c6ab43c3c1744a9e879fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): viz-frontend/src/hint.ts:96 \u00B7 viz-frontend/src/hint.ts:105 \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":"viz-frontend/src/hint.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3e993c11ec12eb4a456afe38d4fb2650598dd240b31fbbbe69eaf73f74621"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): viz-frontend/src/lenses.ts:194 \u00B7 viz-frontend/src/lenses.ts:264 \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":"viz-frontend/src/lenses.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"521e223050ea82cfccbdee44ae62a69b0cf96a1e46ee353a322892f841a7a5ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): viz-frontend/src/tooltip.ts:228 \u00B7 viz-frontend/src/tooltip.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":"viz-frontend/src/tooltip.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b7e18f50e74898c77a6590e2c758c0dcdbe8563e3748730fd07c6056c486c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/napi/test.mjs:618 \u00B7 crates/napi/test.mjs:626 \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":"crates/napi/test.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8c353f2da04d61cb14321a86c9df7ef152663ca0f29ed17a4f623b8f36339f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): editors/vscode/src/binary-utils.ts:94 \u00B7 editors/vscode/src/binary-utils.ts:129 \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":"editors/vscode/src/binary-utils.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eed1721c429bce60eb15c34c5017602ee05ee7eaca6a6b2a095b1aceeeeba4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/coverage-producer-conformance.mjs:108 \u00B7 scripts/semantic-clone-conformance.mjs:25 \u00B7 scripts/sync-emitted-versions.mjs:320 \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/coverage-producer-conformance.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f469b1d50273c2fc49ea9dd308854b7f001925ae56f63a26770d9412e9c3387"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/coverage-producer-refresh.mjs:409 \u00B7 scripts/semantic-clone-model-evidence.mjs:382 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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/coverage-producer-refresh.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca67e2e9720e548cecd76f4bea0dc981db098164e6150bb224299c8d6be5e12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/ship-wait-checks.mjs:558 \u00B7 scripts/ship-wait-checks.mjs:639 \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/ship-wait-checks.mjs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46d125dda3bd5d0494d4aa4f79e39153c4d9e3feff73680f0d88ab849347076"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): tools/type-aware-sidecar/src/semantic-identity.mjs:316 \u00B7 tools/type-aware-sidecar/src/semantic.mjs:1330 \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":"tools/type-aware-sidecar/src/semantic-identity.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"081becdfd9fb62e80b57a6b279292297dfa8e43960c93aa42c06090f83e01710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): tools/type-aware-sidecar/src/semantic-identity.mjs:241 \u00B7 tools/type-aware-sidecar/src/symbol-targets.mjs:41 \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":"tools/type-aware-sidecar/src/semantic-identity.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79ae39dc458f8cf213fd0c3b0d8d65f4eae0a3b08100f5a2b940743b63102a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): viz-frontend/src/panel.ts:1677 \u00B7 viz-frontend/src/panel.ts:1694 \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":"viz-frontend/src/panel.ts"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eea417ace032f253dc31eed87b572eac5e300d92ca1a60d50a1bbbc94ee4974"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): editors/vscode/scripts/codegen-contracts.mjs:18 \u00B7 scripts/compare-binaries.mjs:4 \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":"editors/vscode/scripts/codegen-contracts.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe507570e1dfbe272ce45666078fc017c391d02d3d2df22ef4e828245fd5e527"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/check-comment-quality.mjs:301 \u00B7 scripts/check-comment-quality.mjs:308 \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/check-comment-quality.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"078902feb2a1a1c4720355e7fb578e70acc79782e10ef6129f644c1117f61a9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): scripts/generate-agent-adapters.mjs:412 \u00B7 scripts/generate-agent-docs.mjs:1066 \u00B7 scripts/generate-all.mjs:476 \u00B7 scripts/sync-skills-companion.mjs:453 \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":"scripts/generate-agent-adapters.mjs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2133f6153a3b4a007a8769f7898fa6f8afcb0072aaa6af0276555ae587124029"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/select-heavy-runner.mjs:164 \u00B7 scripts/select-miri-runner.mjs:86 \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/select-heavy-runner.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"403d2b570605b50f4cd4161e02fde736bd8f0b5312906d4d1064494bc47c3898"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): scripts/type-aware-corpus.mjs:325 \u00B7 scripts/type-aware-corpus.mjs:1539 \u00B7 scripts/type-aware-corpus.mjs:1553 \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/type-aware-corpus.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"963e3cddf17c420cae68868964222de7eff3c90f79ec5a8858dddd72d1e8fd24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/verify-release-ci.mjs:265 \u00B7 scripts/verify-release-ci.mjs:344 \u2014 both copies are in the same file, so extract the block 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/verify-release-ci.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2399e060465d53a0b98942ff44a1f8598adeb6fa74dfc0aef26d9c59e7820fa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/vscode-public-verify.mjs:249 \u00B7 scripts/vscode-public-verify.mjs:295 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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/vscode-public-verify.mjs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2094611c1624ed0c2ace5e8b43493c00c22ac18a2d4b3370a9ffe15951d900af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tools/type-aware-sidecar/src/semantic.mjs:499 \u00B7 tools/type-aware-sidecar/src/symbol-impact.mjs:32 \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":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1716dccc969d9c0f007db2b6fc0e04b28aa8e1414500041286d5c8f7e13d4a7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): viz-frontend/src/chrome.ts:323 \u00B7 viz-frontend/src/chrome.ts:437 \u2014 both copies are in the same file, so extract the block 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":"viz-frontend/src/chrome.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de9df2cf719811780ee3e4eb265f11fb169cb2aea261eb3eacc1a2a16aeb9cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): viz-frontend/src/graph/minimap.ts:81 \u00B7 viz-frontend/src/treemap.ts:661 \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":"viz-frontend/src/graph/minimap.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e4fec710f3a51ab24bbefaf2dcfcdf6b10749abd8ea08cbf0e5b97fc7aff6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): viz-frontend/src/graph/render.ts:525 \u00B7 viz-frontend/src/graph/render.ts:557 \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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8230801fba214ac25886d9979cd71baa31ce5d9dfe9a98b4572fc36a65fb1d28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): viz-frontend/src/graph/shared.ts:551 \u00B7 viz-frontend/src/treemap.ts:1086 \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":"viz-frontend/src/graph/shared.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fde04cf03b0666707429e46a2f4fa2246908a48983e2db266372a7f98637566"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): viz-frontend/src/panel.ts:1968 \u00B7 viz-frontend/src/panel.ts:2591 \u2014 both copies are in the same file, so extract the block 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":"viz-frontend/src/panel.ts"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"9339d0b2fb3f0d7a8cc0d86f527661808931e9afa6ef11a94a4820c97bf06e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): viz-frontend/src/treemap.ts:669 \u00B7 viz-frontend/src/treemap.ts:946 \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":"viz-frontend/src/treemap.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c575f79f532f6337f4b097e50dde216d47b249ca3b31594f0d90ecfe53db341d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): editors/vscode/scripts/package-type-aware.mjs:13 \u00B7 editors/vscode/scripts/verify-packaged-type-aware.mjs:12 \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":"editors/vscode/scripts/package-type-aware.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bb47c35231b5c3b79c9813818e1a05421f4d11e98fdd475d4c0272cfee7c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/ship-rebase.mjs:280 \u00B7 scripts/version-constants.mjs:27 \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":"scripts/ship-rebase.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1050b70ddf4cf88480bf09444c71ab9343ccb66f16fc66cce893ef9fb593f2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/type-aware-corpus.mjs:1537 \u00B7 scripts/type-aware-corpus.mjs:1551 \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/type-aware-corpus.mjs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eaa32353522a2fa7398a22f413ebe81b87527c01383ff7c363174333fc2f7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): viz-frontend/src/graph/annotations.ts:1004 \u00B7 viz-frontend/src/graph/annotations.ts:1027 \u2014 both copies are in the same file, so extract the block 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c3735bba46f459a637a7a287d028a1e2d5358455dc6c2c0bf760904b29a715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): viz-frontend/src/graph/render.ts:563 \u00B7 viz-frontend/src/graph/render.ts:570 \u00B7 viz-frontend/src/graph/render.ts:584 \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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7df71b3ad0cbaa5169d5781d33501389ad43e8954a61b3e5d8d076eec423db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): viz-frontend/src/lenses.ts:41 \u00B7 viz-frontend/src/lenses.ts:47 \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":"viz-frontend/src/lenses.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d42494130f186048ee277921798b7b5e2d47c6e58dfc82e6fd36e1ee246a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/vscode-public-verify.mjs:21 reaches into another package with a relative path (../editors/vscode/scripts/vsix-targets.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/vscode-public-verify.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2052f5751aee2ffadf129fb7c797dc48d624cbe2832aecaf03a795c4fb027ab7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: viz-frontend/build-css.mjs:33 reaches into another package with a relative path (../crates/cli/viz-assets/viz.css) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/build-css.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7968e05b88e81270b00d58d7141afea21196825e984d249dd4f4f8b85415ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 58, cognitive 96): (anonymous) has cyclomatic complexity 58 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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a677246fb6d414f66b49baaa58948b2819e05c07809220a7bbdc6ae34e276cf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 36, cognitive 56): main has cyclomatic complexity 36 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":"scripts/coverage-producer-refresh.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d98a656cba520c49e8286dadd74483c48db2c9957768908648e9dbf4de1e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 59): (anonymous) has cyclomatic complexity 35 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d7b01fdf9e41e6d178da9c6560c36c8f0013bb46df7debb7962cd5802b2dbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 37): (anonymous) has cyclomatic complexity 34 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":"viz-frontend/src/panel.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf23c69bd6b99f32bd7b2334a1ea9e742b11fd67fbbd3db61df2f19997391dd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 43): (anonymous) has cyclomatic complexity 32 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":"viz-frontend/src/panel.ts"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f13d8cfc9eb15e7f8428b5502817e8020b34fe67a84df8608440724b694f17d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 68): (anonymous) has cyclomatic complexity 31 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":"viz-frontend/src/chrome.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21283d4184ce229a651a188ba9f5cd60f45803e67e820fd02d0824cf1759f37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supersededCancellations (cyclomatic 31, cognitive 43): supersededCancellations has cyclomatic complexity 31 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"793bed2dbc0b5b2e6766395b89e172cb75cc87ad133a4d43b1bdffb244d7a482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 32): (anonymous) has cyclomatic complexity 31 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":"scripts/check-miri-cfg.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b880b789f2b3dac2133fad0aa340cca720419a15bffeede1a891fd3b60ce317"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 26): (anonymous) has cyclomatic complexity 29 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":"editors/vscode/src/statusBar-utils.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03e09c8f604ff6ffdfd34791534bd5c90c1005af4b469cd41d8cec930b4b71d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEntry (cyclomatic 29, cognitive 23): validateEntry has cyclomatic complexity 29 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":"editors/vscode/scripts/vsix-inventory.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"78476729d69e74371944639051a090e6804a1c489490e86c46a00d37dac98136"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentRollupChecks (cyclomatic 25, cognitive 44): currentRollupChecks 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":"scripts/ship-wait-checks.mjs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77427704f309ce431c561e00bf24a389e5f0da62fad6b40a116b38c869064fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 36): (anonymous) has cyclomatic complexity 25 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"150aa8e8bb57062d8253a718ffb50aef439b0f9ce908528a5d574e5ae8806e72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 30): (anonymous) has cyclomatic complexity 25 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d032973b0257a621bf197b77fbe797734a5e744589a68b685ca42c0fca8e0c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFallowReport (cyclomatic 25, cognitive 27): validateFallowReport 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":"scripts/semantic-clone-conformance.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae8f0920b14643ba2f95bf7703e0f0b8b0aacf8bb88d245cc5576847c9d8fa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 50): (anonymous) has cyclomatic complexity 23 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":"viz-frontend/src/panel.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d612cbd6b99c80f3f3eddadbaf03cd9471a8ecb1d9d68abc28eefc6ea6a9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 22): (anonymous) has cyclomatic complexity 23 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 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":"viz-frontend/src/data.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f82f7c260a94541147157dcb02d48494a90042ff1ee876af231807a8c16b7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 26): (anonymous) 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":"editors/vscode/src/extension.ts"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea88ab4476ceeb4913246966fa2368fdccdbd83ae047026b4840d39f677e6a77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 26): (anonymous) 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":"viz-frontend/src/graph/interact.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb41fdbdf0965b098b13e87bb68b9722eb804888c49a36fdb37d2eea57729f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 21): (anonymous) 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ca89ae090a921db293206c7ec868daa838e90f7751c53625a6fba82375907a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAllocation (cyclomatic 22, cognitive 12): parseAllocation has cyclomatic complexity 22 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":"scripts/select-miri-runner.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8a999b966b804538da34e1cf3e228cdbb3caa03fec8e4feca9e769a813abdf"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/panel.ts: 2636 lines of code: viz-frontend/src/panel.ts has 2636 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":"viz-frontend/src/panel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1f63b2a7621152c371abdc9f32f9e6ca06e191d58ebc5a42170cfc6502615"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/type-aware-sidecar/src/semantic.mjs: 2018 lines of code: tools/type-aware-sidecar/src/semantic.mjs has 2018 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":"tools/type-aware-sidecar/src/semantic.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a09130d270232225b074b2169795aa0e788f3787ea28b72f2798f809141406"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/extension.ts: 1184 lines of code: editors/vscode/src/extension.ts has 1184 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":"editors/vscode/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4230c5f8b977e31a43ef0721a940f7bb523cc1b7ec335a1423e126592afbda31"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/commands.ts: 1180 lines of code: editors/vscode/src/commands.ts has 1180 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":"editors/vscode/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b41a08d38166af1bf0b414405ac4800f40292218cdc788d7a61ff7aacbf144"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/download.ts: 1144 lines of code: editors/vscode/src/download.ts has 1144 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":"editors/vscode/src/download.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"109e1d43bffec00e250bcfea421eb0e732a84a54bc17be3dee4f56dc42681242"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/treemap.ts: 1074 lines of code: viz-frontend/src/treemap.ts has 1074 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":"viz-frontend/src/treemap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34b021bda77e0392de3a85f74c0ba6e1551f34f0aecccf167e95f99b0d98d6d"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/graph/annotations.ts: 1050 lines of code: viz-frontend/src/graph/annotations.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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e924d59cac8f3139fefd181aa8688b880644b415add40049274959da44a62f"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/graph/build.ts: 953 lines of code: viz-frontend/src/graph/build.ts has 953 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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d8a67d3048922ae32a2eec7b1c4624ff4ca3b55827711ea6e88546abda3fee"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/data.ts: 876 lines of code: viz-frontend/src/data.ts has 876 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":"viz-frontend/src/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9542ec1a8efed7ffeb6fd5ee81a8cf8871ad94804bec20ea8bc6989ac3511e1"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/napi/test.mjs: 874 lines of code: crates/napi/test.mjs has 874 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":"crates/napi/test.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2e97e602c72a5fc1329059193de1727c9ae07616d7e121529fe5b11fddc7a8"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/graph/render.ts: 829 lines of code: viz-frontend/src/graph/render.ts has 829 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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7936ec7f9e8128ea2a308288f62d2a8ce517bb94ce1dd2d0072f7c6c273b988e"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/treeView.ts: 826 lines of code: editors/vscode/src/treeView.ts has 826 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":"editors/vscode/src/treeView.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be399282d450d2dad72d4b6d220b0c0ab11b895120bd7b2b94341a9037d4ace"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/chrome.ts: 751 lines of code: viz-frontend/src/chrome.ts has 751 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":"viz-frontend/src/chrome.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7721d432e02376619338bd9f31a13c537a16a803c0013caf87d1969a492b1e61"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/graph/shared.ts: 693 lines of code: viz-frontend/src/graph/shared.ts has 693 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":"viz-frontend/src/graph/shared.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eede32beb9a6676ccdaf912aec924be024fd6ca38a1047a730a58fdc38e41d8c"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/main.ts: 663 lines of code: viz-frontend/src/main.ts has 663 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":"viz-frontend/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a1da612d830562874753d24a0da443d1c585ee993493013becaccdd94f23ba"}},{"ruleId":"R3","level":"warning","message":{"text":"viz-frontend/src/graph/ego.ts: 622 lines of code: viz-frontend/src/graph/ego.ts has 622 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":"viz-frontend/src/graph/ego.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a39156f9a93464ac1124d93d7e6140f1da81ef5e088b268b6fac8f1d718a3"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/mutation-runner/src/adapters/vitest.mjs: 611 lines of code: tools/mutation-runner/src/adapters/vitest.mjs has 611 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":"tools/mutation-runner/src/adapters/vitest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e5403b14541396eab826f72fc262fca0ace9fa17011643a5ca475d399ddf98"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/complexityDecorations.ts: 481 lines of code: editors/vscode/src/complexityDecorations.ts has 481 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":"editors/vscode/src/complexityDecorations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b40ed58f155af1cd072b64a1aacad3ad2ff0224e912cb8efc6850c28103cc0f"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/type-aware-sidecar/src/protocol.mjs: 466 lines of code: tools/type-aware-sidecar/src/protocol.mjs has 466 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":"tools/type-aware-sidecar/src/protocol.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331695e441cd7c7cfd83ea254f650f993e5dd4e37fe6c3331ea35e03351f6576"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/analysis-utils.ts: 465 lines of code: editors/vscode/src/analysis-utils.ts has 465 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":"editors/vscode/src/analysis-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b1f64d577e8cb8d11d4e2a7935e7c1fa498606b48cd5aa428c1ca195ad6cf5"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/client.ts: 445 lines of code: editors/vscode/src/client.ts has 445 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":"editors/vscode/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c81cc03f5b944d7ed01adb75e0c8f5104ad2faaa8a47acb9155ba387f8a8479"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/type-aware-sidecar/src/namespace-uses.mjs: 439 lines of code: tools/type-aware-sidecar/src/namespace-uses.mjs has 439 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":"tools/type-aware-sidecar/src/namespace-uses.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeeeaa200740ddd45d2ee75191218806776a21393c2b53e85f031d4be8ef8367"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/diagnosticFilter.ts: 432 lines of code: editors/vscode/src/diagnosticFilter.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":"editors/vscode/src/diagnosticFilter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0845413078925e64ea243760d3c750ab026dbb31495cf76b9336acb846ab7cf0"}},{"ruleId":"R3","level":"warning","message":{"text":"editors/vscode/src/license.ts: 407 lines of code: editors/vscode/src/license.ts has 407 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":"editors/vscode/src/license.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ead9740aa2304c38fe3336ad83b577ca8b524305f5d1c6c11123133d0818230"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: scripts/verify-release-ci.test.mjs:385 imports \u0027../.github/workflows/\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. 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":"scripts/verify-release-ci.test.mjs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec1c4e95da5e0fc04789f08361add2260d65ccd5c98b81c78bb85a0fb4d5bb1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/conformance/fixtures/basic/src/unresolved.ts:2 imports \u0027./does-not-exist\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. 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/conformance/fixtures/basic/src/unresolved.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbdbdbb24160640a639a0ef4004ba171a119b154a117530f09ea3c9cb4cc955"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/dynamic-import-literals/src/index.ts:3 imports \u0027./missing\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. 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/dynamic-import-literals/src/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace966047d6e5b0e2eea870a62d86208bb4e60cdbe1ddc6b6b44486239b5382a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/external-override-class-members/src/unresolved.ts:1 imports \u0027./generated/base\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. 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/external-override-class-members/src/unresolved.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba3089a7ff8cb96d3a19081728a864b7d8bf662e015c325ee484f9733b13c1f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/issue-2395-css-module-credit/src/index.tsx:7 imports \u0027./extensionless.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 (1 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/issue-2395-css-module-credit/src/index.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"403a76d215a8c5667ec1f69ae53324748fa6415e0425c498dcad0810e5fdd7a2"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/issue-3208-lib-output-source/packages/consumer/src/relative.ts:1 imports \u0027../lib/helper.js\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. 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/issue-3208-lib-output-source/packages/consumer/src/relative.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a1dc60217c4adb52d873c4d071b1707bda6ce2e87bbdf8c6f674f77ffcc633"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/issue-399-new-url/vite.config.ts:6 imports \u0027./\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. 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/issue-399-new-url/vite.config.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3849b496735a6d958ea20dd24546ca9ecdda37cca998aad042e9580271f53122"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/issue-840-new-url-directory/entry.js:7 imports \u0027./services\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 (1 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/issue-840-new-url-directory/entry.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52dafc82e154272fc60bb444c326c374152f1c7d26a4d2aeefc138c3c994de7"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/new-url-filesystem-path/src/index.ts:12 imports \u0027./missing-worker.js\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. 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/new-url-filesystem-path/src/index.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5615b36a6af3847ecf7f7d904662d1741c51286d9ba40375cbcc58f96e29ed3e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/react-router-conventions/app/root.tsx:2 imports \u0027./\u002Btypes/runtime\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. 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/react-router-conventions/app/root.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2ccf307a2bb10332f5d14af20299842a4b5959207d04902136a2b96539dfc1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/require-resolve-relative/src/index.js:6 imports \u0027../dist/built-worker.js\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. 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/require-resolve-relative/src/index.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d91426420f8c80838951117551f958f7bcd0aa84be9459e3348aff46397ab8"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/tanstack-router-generated-route-tree-import/src/router.tsx:2 imports \u0027./routeTree.gen\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 (1 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/tanstack-router-generated-route-tree-import/src/router.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74f2cc4f5e3572cd81bd550a499f3948825ba11722b41bfc6b5d02bce1fb0dc"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/unresolved-gitignored-target/src/index.ts:3 imports \u0027./missing\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. 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/unresolved-gitignored-target/src/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca7091443536132989250686d7d493d1c392e233d9b399dbf59a3dbdcc5ed8a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/unresolved-imports/src/index.ts:1 imports \u0027./nonexistent\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 (2 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/unresolved-imports/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"899f3c90922f5fa103ea96d2ff1689a1f0436f1311475c760555cd3ad8a4a528"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/fixtures/vite-alias-project/vite.config.ts:7 imports \u0027./src\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. 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/vite-alias-project/vite.config.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94f63227f7373cc1414d3df71005eebb65d3dfabcdf7c39dbd6609b9dff2cd9"}},{"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":"crates/napi/test.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94602a9852fa548e425f2611ac5c5c45debbdb5c1cc8c7021391b12d58a6835c"}},{"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":"action/scripts/verify-installed.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6e26356688ba24aef70aa76f421cd9cbac3fbcac14309a11a8ad91eb819045"}},{"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":"scripts/generate-vex.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc2c9d2018c56b3c0b52ad2792872fb6ee3196b37b62b105745541ed90b50ac"}},{"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":"viz-frontend/build-css.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dd3a28723f4c5671237d291a800b3fa0a01a3140b4240438135d5e037390d3"}},{"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":"assets/demo-project/src/components/Modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeea6d9121ce8dab8b00a7b752a9ef47022885960cf5fb9cba7b05603cf7a5c"}},{"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":"assets/demo-project/src/utils/validate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5131c961ecd7ea8c546a7514a4a465cb616ae0e999f029d5774338969fcc5ef3"}},{"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":"editors/vscode/scripts/copy-license.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0f420e16104d31660a249d1779bc0c4c2be25692882cde58d8baec4c506c1b"}},{"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 scripts/verify-release-ci.test.mjs and 14 other test file(s) in this workspace 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":"scripts/verify-release-ci.test.mjs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e403d6a82f87cd2921723a86a71e428fc1c8fe59af8a109cc9bec2094d8d60b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027deprecated\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":"assets/demo-project/src/components/Button.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b83d64afcfc09e9cd3905a83a94d49792f3c5f95a0b59eb585d8654ed6a339"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027check\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":"assets/demo-project/src/components/Button.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e101cbc6e2198940530bf75977f28bc742ac1c811838db221c4b316a5ccbb16b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-builtin-array-control-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"42797264894d71a34ae739a76a02c99d70c1d79ad2374c73b8e87fb36add2363"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-builtin-readonly-array-control-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"108bcd092a66f4bd7cd017399d2b2c15ae16bdfbd4dcd0b8707893818fa102b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-conditional-alternate-read-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bfed9c1dda4fbf78a5cd71dce42bbeeaffeb71fe9ec78f2aaa5ae8dadff631"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-conditional-postjoin-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a91485ac6b18ddf4e85507c522f05aa91a261bf9c45921b37475e7e99370d76"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-conditional-untouched-control-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b114e876695a368a29f7e297e2ff31993cc86bbb94a910863d1b20dcf07d6dc2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-ordinary-alias-untouched-control-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b635f7c20e8e43ddbebefa232b71a662c2bdba044293315aeeaa67bcff5c619f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-ordinary-alias-write-control-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c726b16ff3e83917989e772c8ba85591886b3466c6d23abc9d68f163e08487"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-shadow-array-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6963aabe25b14d4e40c154470935342b4d406368dd434d1e3e0795a9dc69cfd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-shadow-readonly-array-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1381ccb038aea99aaab226b116203b0a0937e54fc4e35d4a6fda25b04af03ced"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-typed-alias-untouched-control-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"078b0bcd51c239ce25e4de3d5c644592a5b3f3cceb8942f0443b228724c850d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CaptureMarker\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":"tests/fixtures/class-value-review-typed-alias-write-capture-on/src/index.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97d0c87241ca5344fc5d28d0b8e73db92e89e4c8519cae161425d5471aa7aa6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027loadDrawer\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":"tests/fixtures/dynamic-import-local-loader/src/index.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ff6001a12ba988c163e9e3a2fd0fd6b6d3f4b3cfa9d99b0a4abf2802a45abd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ActiveOnly\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":"tests/fixtures/enum-type-level/src/index.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a601e57f09ab7400b5a66e12741e56bd4816cbccc090b9705d860420ce7a800a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027links\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":"tests/fixtures/issue-955-nuxt-ui-iconify-script/app/layouts/default.vue"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0200b423b080d2e435ea7ca7909dcab3b9dd582800013e17d59fdee6407fd308"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DeadEl\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":"tests/fixtures/lit-unrendered-element/src/dead-el.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c271619a0aa784a40158c0a011340bea593fab7a7a549077e4e37d5458b7be5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027HtmlEl\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":"tests/fixtures/lit-unrendered-element/src/html-el.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"044abce440180cbf86b87ba5ae99958a4494c52ecc081074d522d9b950216ece"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyApp\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":"tests/fixtures/lit-unrendered-element/src/my-app.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0779eb1c7f51a687ff7d8e6541ec33b11e034a034153c8df983e6e1384ef68a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptEl\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":"tests/fixtures/lit-unrendered-element/src/opt-el.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acc4a87dc2fee7f99b7213c3435290d3a723cf7e310d1bf6fbf11439eea07af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UsedEl\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":"tests/fixtures/lit-unrendered-element/src/used-el.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6970d1e7c4d6c76b8d96161b4b4a4738f16248fb0c6abbd5d30fff48ddcf6bea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Local\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":"tests/fixtures/nuxt-script-auto-imports/pages/index.vue"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c070921197dc8fa53e096466f9872234cc64c0caaec185dfe22831a937f1c5"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027typescript\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/napi/test.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bf2aee9b07a9a934267874f1590dbb880f4c9b5587b11045f210bb61372461"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@faker-js/faker\u0027: Declared in assets/demo-project/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":"fad48368caff08217039489f5fd87fbee4f34663b15b512c034790898833e646"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): assets/demo-project/src/services/auth.ts \u2192 assets/demo-project/src/services/user.ts \u2192 assets/demo-project/src/services/auth.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/demo-project/src/services/auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b01ebb59233b55cda8c0bcb4f45d4cf292c7a6d385e1a9a83925e06fe8341b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(opts.timeoutMs) || opts.timeoutMs \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/compare-binaries.mjs, scripts/styling-corpus-smoke.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/compare-binaries.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e35aa28f5e8f7fb6adbb499e2bf4705c385c5713e1b76534c43aff49f96ae57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!manifest || typeof manifest !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 npm/fallow-similar-code/scripts/verify-binary.js, npm/fallow/scripts/verify-binary.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":"npm/fallow-similar-code/scripts/verify-binary.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd73eb6dd0c63b1473a691a4dec4582ec14eae70aef43db60bec67e2b9950be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node || node.x == null || node.y == null\u0060 appears character-identically in 5 files \u2014 viz-frontend/src/graph/annotations.ts, viz-frontend/src/graph/ego.ts, viz-frontend/src/graph/interact.ts, viz-frontend/src/graph/render.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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9962b80814e5d357486da9e5110af7483e635e401fe24bbf8cf60b50f9c290"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 3 files \u2014 scripts/select-heavy-runner.mjs, scripts/select-miri-runner.mjs, tools/mutation-runner/src/adapters/common.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/select-heavy-runner.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a91f5fd93c9a1d856531898b54d62ebd66744dabb53af9d22aa7d6250010d7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060argv.includes(\u0022--help\u0022) || argv.includes(\u0022-h\u0022)\u0060 appears character-identically in 2 files \u2014 scripts/generate-all.mjs, scripts/vendor-skills.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/generate-all.mjs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9f6ee0410039bab5af1fcb38ab602b29edecad414193b6f803902c99e36c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.exitCode !== null || child.signalCode !== null\u0060 appears character-identically in 2 files \u2014 action/scripts/verify-installed.mjs, npm/fallow-similar-code/scripts/run-binary.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":"action/scripts/verify-installed.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c9a23e25c3ade49a66ce0881cd1033591240a37622a5305a4e02c7d303e7e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cluster.isolated \u0026\u0026 anyConnected \u0026\u0026 !gvs.standaloneOpen\u0060 appears character-identically in 2 files \u2014 viz-frontend/src/graph/build.ts, viz-frontend/src/graph/interact.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":"viz-frontend/src/graph/build.ts"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd4371cff7d04fafea0b7d7287ff0687ddd8a6d2342b2b3121c8778315ca743"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clusters[node.cluster].isolated \u0026\u0026 !gvs.standaloneOpen\u0060 appears character-identically in 2 files \u2014 viz-frontend/src/graph/render.ts, viz-frontend/src/graph/shared.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":"viz-frontend/src/graph/render.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da8400da3eaa434fcad5b7dd9dec326c8f84eef21769eab876b12b51bba1ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isFile() \u0026\u0026 entry.name.endsWith(\u0022.rs\u0022)\u0060 appears character-identically in 2 files \u2014 scripts/check-crate-boundaries.mjs, scripts/check-miri-cfg.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/check-crate-boundaries.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdb3811fccbe872b33634fa87bb1aac1227209aacd5ac6fa9c2c45bed21c97a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.status === \u0022unused\u0022 || file.unused_export_count \u003E 0\u0060 appears character-identically in 2 files \u2014 viz-frontend/src/data.ts, viz-frontend/src/lenses.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":"viz-frontend/src/data.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e574d3ce60c2a0c9c6f68925c9ee3dfcdd94c569c9b0a9e280307a2ffa021831"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node \u0026\u0026 node.x != null \u0026\u0026 node.y != null\u0060 appears character-identically in 2 files \u2014 viz-frontend/src/graph/annotations.ts, viz-frontend/src/graph/build.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":"viz-frontend/src/graph/annotations.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be91942eda72b67b0284d4170a11c75140e7cebd33175137dade99f29f74ded"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proc.error \u0026\u0026 proc.error.code === \u0022ETIMEDOUT\u0022\u0060 appears character-identically in 2 files \u2014 scripts/styling-corpus-smoke.mjs, scripts/styling-pr-smoke.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/styling-corpus-smoke.mjs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec2ed1bb47827f34729aa469b671cfaf1f8d9bf0b591e89c7b4c55e819374c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.argv[1] \u0026\u0026 resolve(process.argv[1]) === resolve(scriptPath)\u0060 appears character-identically in 3 files \u2014 editors/vscode/scripts/package-type-aware.mjs, editors/vscode/scripts/package-vsix-variants.mjs, editors/vscode/scripts/verify-packaged-type-aware.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":"editors/vscode/scripts/package-type-aware.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e371403d2508b4ddc736abd6e7357fd28139c0c274694f53d18ab4e98b3ec9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060query.operation === \u0022api-surface\u0022 || query.operation === \u0022type-coupling\u0022\u0060 appears character-identically in 2 files \u2014 tools/type-aware-sidecar/src/protocol.mjs, tools/type-aware-sidecar/src/semantic.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":"tools/type-aware-sidecar/src/protocol.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a1078ab664d4366333eb4477cd75c367aafed3e671e452fa42ea9e7b7ab82c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative.startsWith(\u0022..\u0022) || path.isAbsolute(relative)\u0060 appears character-identically in 2 files \u2014 editors/vscode/src/commands.ts, scripts/scaffold-analyzer-plan.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":"editors/vscode/src/commands.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b198eef77fc32dfb8fde4cb0147a90856d8e058552af768a9548587729d662"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.status !== 0 \u0026\u0026 result.status !== 1\u0060 appears character-identically in 2 files \u2014 scripts/coverage-producer-conformance.mjs, scripts/coverage-producer-refresh.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/coverage-producer-conformance.mjs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"d202348bc6ad84d9d8cacd9f8d3da705d7429fc8f202c4794d18da2cd47883a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed !== \u0022object\u0022 || parsed === null\u0060 appears character-identically in 3 files \u2014 editors/vscode/src/audit-utils.ts, editors/vscode/src/license-utils.ts, editors/vscode/src/workspacePicker-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":"editors/vscode/src/audit-utils.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"151978820b8aa989d6c78867c330ba54ed858851f96f4f101e997ed0bddc86ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof platformPkgDir !== \u0022string\u0022 || platformPkgDir.length === 0\u0060 appears character-identically in 2 files \u2014 npm/fallow/scripts/lazy-verify.js, npm/fallow/scripts/sentinel-path.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":"npm/fallow/scripts/lazy-verify.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f21cd4bd2190998d3c46cb762f06e9557f82752e84ca387488f17e930d1e64b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022object\u0022 || value === null\u0060 appears character-identically in 2 files \u2014 editors/vscode/src/diagnosticFilter.ts, viz-frontend/src/lenses.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":"editors/vscode/src/diagnosticFilter.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c533f8c0ac1e189b2e1663aeaf46bfe0602145c3364a50e798d67f27820d366"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 tools/type-aware-sidecar/src/protocol.mjs, viz-frontend/src/data.ts, viz-frontend/src/payload.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":"tools/type-aware-sidecar/src/protocol.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"898ea0f754c69ddccd73bffec588e93532fec7393952ab39caad2c01e635b978"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.length \u003E 0\u0060 appears character-identically in 3 files \u2014 editors/vscode/src/openFileCommand.ts, scripts/generate-all.mjs, tools/mutation-runner/src/runtime/child.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":"editors/vscode/src/openFileCommand.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"706529e7c1517954420636e5103ef08f68bbb517658f15cc1babb73e1f0c6325"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 scripts/select-heavy-runner.mjs, scripts/type-aware-corpus.mjs, tools/mutation-runner/src/protocol.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/select-heavy-runner.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"879e4fc855e71de8cc9cf16eacb564d488d5a0caf8f46d9a36654b3a0ebc080d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 scripts/compare-binaries.mjs, scripts/generate-all.mjs, tools/type-aware-sidecar/src/semantic.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/compare-binaries.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d39decf0f7ca630a18be62d96f8e8175fbd870b853cb99756623938974f539"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!function.r#async \u0026\u0026 !function.generator\u0060 appears character-identically in 4 files \u2014 crates/extract/src/visitor/helpers.rs, crates/extract/src/visitor/visit_impl_callback_properties.rs, crates/extract/src/visitor/visit_impl_factory_properties.rs, crates/extract/src/visitor/visit_impl_projections.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":"crates/extract/src/visitor/helpers.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9ae23ce023f14af914f729d3742c37299ae45ed731999d07e01516d7c712ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!member.contains(\u0027*\u0027) \u0026\u0026 !member.contains(\u0027?\u0027)\u0060 appears character-identically in 2 files \u2014 crates/core/src/analyze/members/mod.rs, crates/core/src/plugins/ionic.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":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5886197e955f8e558b1d9d0b9db7ed45be3cb9dd96883029550bd1b1e1d6ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060decodeTables\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 50 (\u0060decodeTables\u0060) with a piece of \u0060value\u0060 (and at line 57) \u2014 and nowhere in \u0060decodeTables\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060decodeTables\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/payload.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb06329f9efc9fa5116b867cc23c6e082921bed7aedfe0869dd0fed48d5f7e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/state.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"961dfe133f3bb067d819347f011a6ffaa40afeb054325934c439c901179a4884"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viz-frontend/src/graph/shared.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0cfd86e4dcce1d2b1751254c67122901f5545f57846c8b14524b8285e7ce65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/src/companion.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"acef145e2180264841d432e31e1a837db1b9b1c983eb67b0621362e6f6eef57a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/src/companion.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3a36e6f3ef48a288c2723cb8ec0ec844894a60b028f14c0cddcba12715a978"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/src/runtime/global.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c717ef1396cd7e06e46b93860dab91d6809a62b3c4cdb6b54b4d05eb0e9fe3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mutation-runner/src/runtime/vitest-setup.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb82969666c3d9848479c7d634b89aebe0f00fbd302b4ba85d11e29361660cdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assert-local-resolution.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2507be395bf1cc48e46577eff22fef4b8af0e795c3dedbb8097ddcdaa0db7270"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-parse-sites.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72cbe914e7dc3c2f4e49fec8e92f7d761d3c46a46043170067ebb334e62c93f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-vex.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6befd9c475fb3b09e58e06e2fd88e917864224a906f0150757f8874ffbcd90b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/type-aware-corpus.mjs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bf0de8849c52c50030dc07424b7d14bfb0e6626fb685f8c7cf068e50ab0c44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/vendor-skills.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab67ff4738b95439f22aaf1244ad972a7287ce31cc47caa78ca5e65874f2303"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/fallow/scripts/lazy-verify.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"293cdb6e4963bcb77fedf224b81616edcc5dd0143e678ab45db6eeb648567026"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/fallow/scripts/lazy-verify.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a54d30799380f27de15599b89e36af6fbfe9de617c45c32423c6f78404f169"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/fallow/scripts/lazy-verify.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"931f0b21c767646dfb1203d84c0c54ce21b79a041ceb784b1444a5cfb575cd62"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/fallow/scripts/sentinel-path.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f2c0dfa074ad37c42355b2f9a6658331638e5abaee727f181fb8bf64ae87d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/analysis-utils.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5837efeead272b2c4ba50e27e04e6d18397b160da572172c01473262ffca902"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/client.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cb89d720e0b4176f4dc8e363e82590fa8d2056afd86527cf0da1eba10f4ec3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c63a41deede15372831c83f60ee75d349ba4f869ddc3fba2852ac9753753101"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1784f0feeac5586feca1f98c47834098e1a2a82368acd5c40526339357bd6cbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e9e781c849299865aab925aa2fe447e80faa6b6f3592bf907715db8238ea3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9f65402cf1ea2d6af152e2cb1f60212b814bcb5dd7f308f0b460062250ff8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"81695deeb64f1760b8ebb1a221bfe3b2673e815c5144d7447fa57340728c9d15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8a2c510b76bfc12cd0d1826a013b896ffddda7ffa0cba4c0b018a6541b6777"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"57700f91bc354b71285386e44a7112d9fbda7646286ef42ca4c4e7c6d1b413ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"7579dd98632d453ae52167394953a6e5e7937c10e7e6c22412a277880e4a725a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2de4f5fe95debe7ca6fc6591e6ef74d4364361b57ff67ef91cf9895de42f905"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/download.ts"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fd7a62f02f763cf0ce53ff7525b773835944993b99460fdaf4d3eb23cd1db0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editors/vscode/src/process-registry.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d862bd5db8875c02a4c2b37e05ff57ccc3cef380c5cd7e2b9c591a9037fc19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 234 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/dynamic_imports.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"061a7475aedc6d7f25a514910359728f6a88f29e5ef93a6d0905aefa65245fb1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 316 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/specifier.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c16a0f698d10057c977dc2cb9c487b2659076df13dc97065ff0d2b18007058a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 560 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/resolve/types.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"124ab4b52490030e22f0403ddbfeed9dea96f2bec39e6cc44a8598278a271689"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/cache/store.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1152bb3bb05ff4cd5157f6bb2c990b1d30e668d9273d9c79e8b364ca2537bdd8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 110 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/cache/store.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787b04896935c06503d9ab2e04a0ff6d42e6be24ff58256dfc55ad31950359c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 117 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/cache/store.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0a878fa0c79c171d471329cf6d8eef46273d58ae626f24c4518408da100e83"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 124 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/graph/src/cache/store.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad38eedbc3e0f9f8847d2be2deed41704a8ad5de0df73bd662a9c36ef3a3eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1016 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/churn.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"761818a485f7a147d6a62cace6e84500ba5d090b64745394002136e56339d81b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1023 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/churn.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5d7c1bec8e6a0ff56f1bb30be427978524a6f2cf7a4e9c42930db9f86cdee1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 188 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/clock.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c63d97108add5d4679b9c53397990f5423db17bc3dbcc7653d00a0f0ff353bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 403 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/discover.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"39190da6611686caa5f4653356109912876e61bf0f1a4a862e99260853558e78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1550 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a970906a41edecdb91328dc6283b3adbe3a04d0741e107d141041542e556d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 177 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/hotspots.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d91a27abb1bc241a0df48e6bcddb5e5ca4b4f50562afb3686158656b7bf8a89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 224 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/hotspots.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"be16c2738b13e9ca526a1b630c70ce2d7bbd73c1565df2f1ece8968699ec596d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 231 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/hotspots.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9a979d66502d0dc3af6ca4e882e3f5407830821ccec356e63f89e0d9327cfb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 524 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/duplication_detector/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"567fd83667fcb751f9f09b33122486299cc125f25460ae587eaf6e80e01e63e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 382 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"940f921225e29468e43ebfb98076d0ba6760d4a17f006899a029635e5bb4dc1a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1270 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dceef574345562d6e3f55158cd2d7bf3fd0da7ff895224ed176c48feadcff7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf28dd3bc48ccbdba04d54ad70dce964e9fd0f588bbf4b175ac2dffb218cfdd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1723 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d984a7d79e8e397b8b6d70fdcdb4ed4873f3c1b801bfcf4340f36374db1521b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca652b4398bcde7cb360543c186b7f295d4b3fd832ae7e6f6d3b31118f0d6e5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 405 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/suppress.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7243aa7fca5049ce0f20f44e7a3aac57938787c7a8f3ed10535c10448d979be7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 469 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc6b482330abfed2e67e40c6046af720abdf0c73751c476cc2382ad679407d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 474 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e32236d16635245f57a77cd5c0f159b7b3fceff99378364142f1ea5900ebd7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 479 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae71a4186e1c986fddefffa9e12db49456b23cb7123ced495d5bad2ac4bb8930"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 485 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e5c7079835550a18a4d8961cc534110d9abae67183a153c13a62f9153f8b5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 496 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5e5bc9cbeaec6112c0b3d845b6b620a5f93474f7b5e7191bee54def7c4450b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 506 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef24356788f75fd715e630e1434d370f8ca04b8534c7d4886be659a64efbca0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 511 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aacf1f8f02c8496986b260d839cfd6d68d77b517c5d6e49d433f0079fd2ee26"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 516 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/manifest_entries.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bdcd11cdeaa33cf4da3231e5a59a5ee3268e8302b1a8cf80f92f11e069e53e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/mod.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f682a53fef5add5bd6f9be93ac54c7b6ea769d964e25c01626cf9997dc3c048"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1202 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/mod.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00ffab718f529c7102c9d52f3535348c12e6d1316f1e16688b390d4ffa1bb59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1225 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/mod.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa9e64db1cad74331d22ca922423767a5053743b771b2eb7e0cb21cc38738ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1247 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/mod.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0f51beac406b131bfb2a6cb8119cc3925f715e1643b8be8d7fe3c913c4e386"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 49 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/project_glob.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0222afc1c8543109cdec5a829a5dd433245aaa81e8b26bfacadbbb043fc0ccd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 992 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"39877243718def8067da8f90d97d0751d9f0ad73f47afc8fc8f9d0abde0beb61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1573 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb63139f59128a0e454d6457ee9833ec89ebe883f37cb203355ebfcc29b9895"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1592 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bcc0375bb2abef2b2f3795e8d0c81252c365e07e3fd0c84bb59039ac419e03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1702 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/mod.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f0c521fcbfaa959da213f6a71d0d0bd294126bed71edb90553b480684432d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 64 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabc1c257a321b937328bd5909945ff26dafc972986498c8d0fa955941c034de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 286 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4223518841823ddec756b802fe3c898e330557c9e262b54e9980d1b3054f66"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1638 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ce34166559cb7a4dc2067e01c283a50dbf91f676bd83327e7de1c4ffdddef9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc386a2421b264a823343172da6cff4333edc5826fe2825899b1b3dd263a332"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 352 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dba8c58d5838f36e2726e31be828a89e18c7d3edbd8e55fc80f1a4b8c838b5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"302f57f4ed1da2ab31c93ac27c903114e444a10c35ef9a694b8b6a0d80278b9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 421 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f56ecf80601f39c31aa4bc3bf474160095069b224593fab2d87bf9baa169ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 461 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a40cbe609498989df408cffff7ba9a1d0495c34ee96cfd99f9756a92ce62e39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 792 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29ba4a316f68e3ef738e452682c1b67ddca9c29fd62cc515debd79152bb9fe9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 886 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/walk.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b254d2c740b4a72c4cadff4694d2c247baa1f45e80d34498fb3a84b5bbf783"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 388 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/boundary.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5059882c7762949d0a6998a1bda828a50ba3de1d10c5f55dc437acb2c305c637"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 419 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/boundary.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c217eb6319cd9ab84ce6816a4c17eac258416b28dc73955b7b7f0b0671dd10fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 197 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/policy/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e089c54be077d0353b72d052af559ae39f2d29712911a20c3afa59ff44b9f917"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 246 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52c6c1b27a50819e805308800819583e5db437c61814b2950cd4ab484695ab4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"946906b13cf8159121c8cb915c0f15e93107c175fd2d5d9fae665fc344de9d97"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 391 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/members/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"83afb192b9602f023ed701495309dcc4707f18d60e77032e77c4779d2d91d4e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 151 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/boundary_calls/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"84350a6af89bebe71b80149c8e50aae4925a2176766cba5d1212f36f569d7f99"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/diagnostics.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b6d22448994f2dbf620461513b50ff4310c8f746b6b1013eea168986f1f613"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 231 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/parsers.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4212b7cfdcf8d4bf54b55f9ed3c77065b2ef2dfe0db0d1853c75c6ad39d8f9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 280 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/parsers.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8f19d6417b398da9cf0d7f9f8ec42b52eb9e94b969408a5b162f5c607dce5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 415 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/parsers.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c159df206216c03091c308a7bd79ebcad0ad813116a28e9c24cf5ca3e827fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 718 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e64d745152fc79ace5d3990628b5e25fd541ccd7fc3ec20f5903cbbb713621"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 725 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da63b25389fdd5395795bd3c97816d420166aaf2b0a26a8b95225755469f142"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 732 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92f4fb7b2b1b0d658838a8fa512a3e2df15bb3965ec0f20f5a92223f4423b51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 929 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdee7002436c322e1dd897b64e986270c0cbb03bd177d18764426b107ca08e53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1070 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8434b7cef9689bcf0d3a754a39b8f2827f00ac1113a7d80400f242e6608ba59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1078 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bcdc036c1b224dc7935e31dfe532e543f732e9a6a7e75ecd1e1c987baf1ab3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1098 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ceda0730d1ed99cc1a421620efe623757fbf0b7287239e20992aa791618968"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1114 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"04052baa838278157efb71b8b4b9e12d9b91ad3504f605c121e96c8c8fe83f9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1124 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"62007202b54fd9071966bf63021c3275467fbbaff03c3e2e94da916901a5e7a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 558 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/boundaries.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c03458f46085c070f49130383079e8dbf0fc615a73be42669f24ad864cf61bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 578 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/boundaries.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb36c984e11ba90237bfcaae1aaf36660c1fa16b77520ddf289a954c56cf25fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 755 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/boundaries.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"788dd23e9a89671aad9f4f7dce84a6bdf4613811a70c8d94c1a09173e056f7ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1283 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/boundaries.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd8380c4fa8bce3d8f7fa0e4580e00ae3e097fb7cc90f1bfff7e698ad2744cb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1298 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/boundaries.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9486e70902690dfdc5444125e1f4cb45f2b8e02ede89fc0a442be06a26225f3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1127 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/parsing.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc7da4080bf56ecdf114421cafd5fec912c5c380b832a8dd1da30560607ac19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1135 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/parsing.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"914a2b2a5821505a5d5eec18b162803dc64f4b24964f038580c9bbea28a76869"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1241 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/parsing.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd609af940b7c8d45fc5edca65a12c0b99f306e634d60a4389b5c7f466c4b2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 711 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/resolution.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b3077241462288c0366d73b16b4af65a4d3c022b53d631c7ae66779430805b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 739 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/resolution.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"383de38626aa175243f6fbc57f95b6760ae5a9b1ff09cf8c64e47be89f875d34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 747 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/resolution.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"741300827a5d9c18ae27d6cc21110b96a1ad607d8f2723d48ade417f16da72f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 881 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/resolution.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34b58b5e452b7cb935e7513c6ae98419de63f093d694be7407589e8c9201911"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1889 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bb0268575fc38e80c1da9dc467132fc356cc812ca6be5925926fb58fe39ff6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 540 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14b0e71099943d6588dd03bf263814c5e2f0a3b05ce256915618f069e590d4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 551 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eea60528cf14d5d97048aad92891977c9bfd5601bac0440dd616033a3952bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 553 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"378e21f50718f49d31ff5d3dbe46517fc6d0c3db6203f34fa1caa0d582f208bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1031 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdb20af970d1d009dafa2a5f1c3e3c59ea894e39e689cf33bb9242b7a3c0db6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1102 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc56271960060e06076839c4669bc45b0d1ff15ed35e33aac108bef73634091"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/runtime_support.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f749322cf94ebea9327031cace8d90dedb4c971ea0a83c825587f67d146688"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/runtime_support.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4e8d75ca541a1bf940b29bb7e2f1c1fc0c84b422603f676c8b707dd58aefdc"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 173/200 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-audit-schema-doc-sync.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e74a718c9f963cc4970d930c1cf691661c0f14fabb7a059a20206d01f7f296"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-audit-schema-doc-sync.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3edc02b244b571567ae682c4ee3857d62bde10fac94c24a5d6f2ce22a55c58"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060main\u0060 returns \u00600\u0060 when \u0060json.JSONDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/hooks/pre-bash-guard.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5164066230578700865b1abdb472d703db9b7b63d2cd9aa160d3b4b3d33bbad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060stderr_tail\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/transport.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8e27ab57f32194f478a00ce9dafe4b5183c9e0f162b83fdc9ca03b2af86edd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect\u0060 turns every \u0060Err\u0060 into \u0060DiffRiskReport::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/diff_risk/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c87787bf5813e3e265c8e06935033d231f8e45ae9ab0f526de12f88cb2209b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060node_test_args\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/node_args.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2121a0c22189050240d30433656bee85e5bff3cb84e7a068f4810c8274c0a421"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extends_of\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/mutation/result_cache/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec5b9ca3061be2119455db8c19ece2ed05d64190cc6f60903872e650cdb6d2d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compute_routing_from_churn\u0060 turns every \u0060Err\u0060 into \u0060RoutingFacts::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/api/src/routing.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"76be2d85734fb4c9c0e3b663dd9d530019135353ff0e2b4d932832241df7a1bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compute_brief_diff_evidence\u0060 turns every \u0060Err\u0060 into \u0060BriefDiffEvidence::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6ce4e9862435bb870543888f0b48be1a8613df92f6b835d46385edd7479b0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_snapshot_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/audit_cache.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e6b9e28f684c4a40a4a326c6101da4de39c4b1d9eb3c2555d1e64d324979a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_all_reusable_cache_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/base_worktree.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eef3aee7c3087dd2efff690e4565c415b99801af6773ec2c319a711f6843264"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_cache_paths_with_hex_suffix\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/base_worktree.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93c733c4255f3a88ef6b0797ff0587b445862b6f54900e71486960a8eb9d1a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060instrumenter_functions_for_file\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/coverage/analyze.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"172199603eea236774453c0ef2465d299bd81f5619b489456842a2d206e395e2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_deploy_workflows\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/coverage/setup_cloud.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca917af6cf9d2eaf7eb5bec75f9fa5242afd0c9f742aba96182b5cb4f637f49"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_churn\u0060 turns every \u0060Err\u0060 into \u0060BTreeMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/coverage/upload_inventory.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1580712fc3a66a625cc0259bad27c55706ebb19207b6a8fcc2229542123977a5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sidecar_package_version_key\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/health/coverage.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fbe4625cccc4b5a37da5cb45feb20ba6735278afbb130a83d869f0248b5d9d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_sidecar_version_key\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/health/coverage.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5e8952f2803e9600a3405af2ee7bf6937afbb837a812ac1f4954aba8e6563b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060migrate_legacy_store\u0060 turns every \u0060Err\u0060 into \u0060ImpactStore::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5848ad179d9201d77cd61cd74c44b0696d36174c943a1627da6faa58f9143cd7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_json_with_style\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022error\\\u0022:\\\u0022failed to serialize impact report\\\u0022}\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"57282dd710d942c2502321c4db38e6775f1eae7d0295578c87ff7a463a946a78"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_cross_repo_json_with_style\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022error\\\u0022:\\\u0022failed to serialize cross-repo impact report\\\u0022}\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/impact.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd85c27065db689f78f8db2d0d0d8856dd794067d1803b5b6366d5f0321035f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_pnpm_workspace_patterns\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/init.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5862408a151bfa444810ed6ffec74a3691fc789f547fc5ce7b1ac2f10e104389"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_display\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cunprintable\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/inspect.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caca55daa6234e639c1709edb5a850f63d0ccb341636230d76a66d98897f9f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_security_github\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/security.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec88261152114840856405ed88e9c4c83d47fd06b673f6d2d5c6da8b104f802"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_sarif\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022error\\\u0022:\\\u0022failed to serialize sarif\\\u0022}\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/security.rs"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab21e1a115d0f3762dfefd4e13f231c563ad822df0b183be89f263643ea83652"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_viewed_state\u0060 turns every \u0060Err\u0060 into \u0060ViewedState::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/walkthrough_state.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee773d28cc1c9a0aaca1da00092d2d7ff5365edbe9bf84acd261eed3f9a8fe68"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ineffective\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config/entry_effect.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f928ab7dfdbfe449b9ab4fcce1e189230bbd7a559ba69b4c09bfb46ae5b8a9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060root_plugin_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30816cb9f94c2665dc062abc44993681bea5c26c4462b26e8444ab1f4264561"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060plugin_files_in_dir\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/external_plugin/mod.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"650b076eda5f623e6b942839a692d396d345c6eba8ca3aed96956f3b34d72d60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060link_only_workspace_dependencies\u0060 turns every \u0060Err\u0060 into \u0060rustc_hash::FxHashSet::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"28daf7e6fb99cb4ac8f821056dcab81e3e9dc98f4ce7cc7344142a974ce7d3b5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_link_dependency_workspaces\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2f7399244804cd1aeff4a6385b4f04e89ca777e726b3dbfef5d238222d449c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_dirs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/nested_project.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dcf3e00051c40343a666b7546418c5501cadaf222946f118f96e966078d5a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_npm_package_json_overrides\u0060 turns every \u0060Err\u0060 into \u0060PnpmOverrideData::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/npm_overrides.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d03a6ea63a82ed80ad30050af94e139b84571ee6508a76ed36a3ff05cf028d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_bun_package_json_resolutions\u0060 turns every \u0060Err\u0060 into \u0060PnpmOverrideData::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/npm_overrides.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"55be020842aee3ad58cc5930f5a388670c1d7c0fb7d392aabed44c05ff9a6409"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recover_nested_packages\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/parsers.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e713b08d1f373d15653aa63fc1e537e2fbc24db9fda46b9012d8118c6fcb726d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_package_json_catalog_data\u0060 turns every \u0060Err\u0060 into \u0060PnpmCatalogData::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/pnpm_catalog.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e079fddeb2cedeb5e7cf462308853bfb2c49a7f00143658e5f103009c6a553"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_pnpm_package_json_overrides\u0060 turns every \u0060Err\u0060 into \u0060PnpmOverrideData::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/pnpm_overrides.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed07cf03bda2ca7d1adcccae23c2f72ea2035541ee460eec11166de783a70d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_undeclared_workspaces_with_ignores\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/workspace/undeclared.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a021bc7ad3f0df512f73e6ea7e2ba18d8b7568325d8e1bbd01d24e352e59cfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060resolve_config\u0060 turns every \u0060Err\u0060 into \u0060PluginResult::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/mise.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"409232caeae3d78a72624fbeb362cf74106b822ded1e8e13b85936a1a55c6ff0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060suppressed_yaml_catalog_entries\u0060 turns every \u0060Err\u0060 into \u0060FxHashSet::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/analyze/unused_catalog/suppressions.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8046e7343500fe79c64e350cf2ee0da226e7b9d1d94b7c92309ced9cc2019ab7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060discover_dynamically_loaded_entry_points\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/entry_points.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41911dd5033bbad39ce597d3ecc13e0201ff5e5fb403cdaf5db599011ee2dbc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060package_type_targets\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/orphan_declarations.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4fc1d1185bd89f30e0b2d9f970c8eebc5b10d3f289312cc83f54d76bf17d0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060directory_tsconfig_scopes\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/orphan_declarations.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5ec3019a4811ac25e9790be2322b4216ce059b3509fd561d4e67b0c118c79"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_raw_scope\u0060 turns every \u0060Err\u0060 into \u0060Some(RawScope::default())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/discover/orphan_declarations.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ea824a9c3056e0dd4335c42beb2a264f524ff4ba7057c54bedc33c1d96289e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_source_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/egg.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aa9275735f3e78ea497158a2f20192a42ba629e3248190ea2e670c1cee807d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060node_action_entries\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/github_action.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69e74fc388b336d2f069448841f0923ed1efe4e85e76870a0ec8c116e2701cb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060loaders_in\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/napi_rs.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0364d5d851458b907404af0d7038bbccbee17789f248c331a339bd48905c7f37"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060auto_registered_layer_dirs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/nuxt.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1990db0d02ff656c648cec71aebf93e69148c21d3eae602ccc41dd8654e71c8a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_opencode_plugin_dependencies\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/opencode.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"714940bb2fd808ad05352d431d9e6f5ca13bf6a22f9bd71ef6d69a611647b833"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060match_pattern_in_index\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7aab7400b192ae248c56988c7dc3975f7744c62304f671bf62013b1cf27a20"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_dir_for_pattern\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/registry/helpers.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"f183272fa665d5c122efaac7b44483654e3ab3daedd26485a3a916cf91f67faf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060yaml_references\u0060 turns every \u0060Err\u0060 into \u0060References::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/serverless_framework.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2100f8abd3a6b9e63cc96d26c1be373a4b9615c846e2adfc38a43d706d6a5388"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_inline_virtual_route_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/tanstack_router.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4f97af51bf7499627aa25bb0afb6dc32e5062a895ab94eccb42a1cb1fb0d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_yaml_modules\u0060 turns every \u0060Err\u0060 into \u0060TextlintModules::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/textlint.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0153d4b80e410fdca8dd51c6a22e8b3b8c7e53679efad94972f72c271e118e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_toml_main_entries\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/plugins/wrangler.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a3605bfcf9744b2b31d065c9018144461b1dd88c360c7cedecc404219554c6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060root_level_tsconfigs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/resolution_inputs.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaa642518afdcb4ede4a172d696e11ca15115e6a6b2833f7a0126b498aa28ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_commands_scripts\u0060 turns every \u0060Err\u0060 into \u0060FxHashMap::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/scripts/nx_targets.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25dacf702771fb1a3787455f832bdd32445e3861b5f136bb7579c3055c5b974"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_non_reusable_orphan_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/base_worktree_orphans.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"482b2db9dbd63ae4200a0befe5a00f05af5ee28eaf43e3a03732cdac3e738e1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060discovered_regular_sources\u0060 turns every \u0060Err\u0060 into \u0060rustc_hash::FxHashSet::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/health/coverage_settings.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85da961d992692591c947b1df539c074c096df2db75cf430463df1f78bbcdfc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060forwarded_import_bindings\u0060 turns every \u0060Err\u0060 into \u0060FxHashSet::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/search_visibility.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b768e5323f1d1ce710b913a100a7f55d1bc5b8a8324998a0035a24c39fae52"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_alchemy_mains\u0060 turns every \u0060Err\u0060 into \u0060AlchemyMains::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extract/src/alchemy.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d030425338b88256f03b48e5e224c60d1692711756b40246fa58b188ed2e076b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseFallowCycles\u0060 swallows every exception into \u0060return \u0022?\u0022\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":"benchmarks/bench-circular.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4551caf05685fe789cde86287db74b1735ab1017641d25e95df618afd86afd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseMadgeCycles\u0060 swallows every exception into \u0060return \u0022?\u0022\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":"benchmarks/bench-circular.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ef65f9e7bdd78e8f51d219a776ea0a4b9b711b4abceea72e7ddae2f032138e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseDpdmCycles\u0060 swallows every exception into \u0060return \u0022?\u0022\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":"benchmarks/bench-circular.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f8c5fef88182288ad226c8e3631c2d8da1f82730415ab89ac0ec5582019c75"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060crateDirectories\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":"scripts/check-miri-cfg.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de84a47a1d7cc55de4664cbb0b9ed699a2c0b99117f7b88829b6ba68f0a6208"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060subjectsBetween\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":"scripts/sync-skills-companion.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d307e635b47ff6c68e3400b6d705c0fb84d57df458276ec6df38386a3b845387"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060math.instrumented_code.contains(\u0022return a \u002B b\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060math.instrumented_code.contains(\u0022return a \u002B b\u0022)\u0060 also satisfies \u0060math.instrumented_code.contains(\u0022a \u002B b\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":"crates/engine/src/mutation/tests.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eafefe17b949c5f79ca23599ca61df38807cccf46aaf44326bca1a532a9a2ba"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060deps.contains(\u0022preact\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060deps.contains(\u0022preact\u0022)\u0060 also satisfies \u0060deps.contains(\u0022react\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":"crates/engine/src/health/framework_health.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8b1de8e273696f745870c838af41e24569324d46f721584b89c60276db5ee5"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060deps.contains(\u0022@vue/runtime-core\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060deps.contains(\u0022@vue/runtime-core\u0022)\u0060 also satisfies \u0060deps.contains(\u0022vue\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":"crates/engine/src/health/framework_health.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cb4a159f2becf66504045afc4fdf03c79497e27fea0949f60edfb230633794"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060deps.contains(\u0022@sveltejs/kit\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060deps.contains(\u0022@sveltejs/kit\u0022)\u0060 also satisfies \u0060deps.contains(\u0022svelte\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":"crates/engine/src/health/framework_health.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fd589e20762f3edcf91ca9c86b65bd7732d3c0fec4e6e9acee053fb2efbd6a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060msg.contains(\u0022\u0027..\u0027\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060msg.contains(\u0022\u0027..\u0027\u0022)\u0060 also satisfies \u0060msg.contains(\u0022..\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":"crates/core/tests/integration_test/issue_463_glob_validation.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44398be9caa22bbaac5ca511b60f0ad43ddfdb61999f1feed520a4a59e06008"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060input.declared_deps.contains(\u0022@vue/runtime-core\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060input.declared_deps.contains(\u0022@vue/runtime-core\u0022)\u0060 also satisfies \u0060input.declared_deps.contains(\u0022vue\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":"crates/core/src/analyze/unprovided_inject.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8101bd42b9d78c8dc1e4463f8ddad59110e5da967eac306e6f33b1ce1404dbc4"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060declared_deps.contains(\u0022@sveltejs/kit\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060declared_deps.contains(\u0022@sveltejs/kit\u0022)\u0060 also satisfies \u0060declared_deps.contains(\u0022svelte\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":"crates/core/src/analyze/unrendered_component.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f373109c5e215a5883382b85caf9103a1c3d21ec78776db51c84899b685dc232"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.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-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-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-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]}],"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":91,"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."]}]}