{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"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":"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"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":"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":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"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":"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":"cli.runReviewStatus (cyclomatic 284): cli.runReviewStatus has cyclomatic complexity 284 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b861856062973f67eed3bf0292a7bee76887894c1adf50c305342504d5919d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.confirmSelection (cyclomatic 230): Model.confirmSelection has cyclomatic complexity 230 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d52ac48eb27d55717ff747fe1d45540717987712e7e78e4550ecf991fbeadb"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewNextTransition.Validate (cyclomatic 167): ReviewNextTransition.Validate has cyclomatic complexity 167 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed71c204597fd5d90504b2be4c808199d8d7269f3b721f1657a184d08a5c7b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateWithCompactAuthority (cyclomatic 145): ReviewTargetStatusResult.validateWithCompactAuthority has cyclomatic complexity 145 (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":"internal/cli/review_status_contract.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1202df10c50794e385f5ddf39a15937f3f23dfd07bbcf1d21df4d02ad95278b"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.handleKeyPress (cyclomatic 124): Model.handleKeyPress has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11d18663db6cd337d7541ab7e731765811a450301ec97300464c52953e3f905"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.validateReviewTransitionExecution (cyclomatic 122): cli.validateReviewTransitionExecution has cyclomatic complexity 122 (threshold 15). Of this number, 113 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1447c7ca894029e2bde40a52b0b953c35bebd40970512c2700f39fbb06948e"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewRecover (cyclomatic 113): cli.RunReviewRecover has cyclomatic complexity 113 (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":"internal/cli/review_facade.go"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"022f7e93e0c976e1c2d0ab475dea9b38e551b76989c5b7acde135a713d3ffade"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userRunInstall (cyclomatic 112): shellinstaller.userRunInstall has cyclomatic complexity 112 (threshold 15). Of this number, 110 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b1771123f17e83d81acd0de4acbed6d7dc11bb8a4d7c2a60e31ffde5d2e61d"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateSuccessor (cyclomatic 109): reviewtransaction.validateSuccessor has cyclomatic complexity 109 (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":"internal/reviewtransaction/store.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dff17fe5177dc958dd0a485fc8f023070ceb8585c7853e4f2bed504395ffcce"}},{"ruleId":"D1","level":"warning","message":{"text":"persona.injectInternal (cyclomatic 106): persona.injectInternal has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/persona/inject.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"572911b6f46b54aa9b66d76eba6a7aaae6658fee47565bb1fd31451d3c25952b"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewIntegrationStartResult.Validate (cyclomatic 104): ReviewIntegrationStartResult.Validate has cyclomatic complexity 104 (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":"internal/cli/review_start_contract.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2bf84a7b4d7bac7ae161db537d78c97a7b764413e5b70a839c64b8b379c0fa"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactSuccessor (cyclomatic 100): reviewtransaction.validateCompactSuccessor has cyclomatic complexity 100 (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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8f971a6a549fccd17c4647e5fbd565f048e8ea79afa2196f4196641eb20489"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactState.CompactReviewView (cyclomatic 99): CompactState.CompactReviewView has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"338dc35242aa2a7e3a70694ef3697f974ccf4441b3f6dc5f78688f0ee9c0b198"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewIntegrationFailure.Validate (cyclomatic 95): ReviewIntegrationFailure.Validate has cyclomatic complexity 95 (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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aa31e63193ccf833985da6f51aa733b5ccec177f3740e9a4dfe6d502d2b3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactCorrection (cyclomatic 90): reviewtransaction.validateCompactCorrection has cyclomatic complexity 90 (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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"210760d4ffd722628db62b438a7ba8423936f773eb4d3d5bb1c7a816ab82e332"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.Update (cyclomatic 89): Model.Update has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28dab1cffae629d8f2e72a413843e763053403c722d92a0692ffbd0260c4161"}},{"ruleId":"D1","level":"warning","message":{"text":"componentApplyStep.Run (cyclomatic 86): componentApplyStep.Run has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d94ce0c45d2c8f71b61b5de30b7b5b7e72b64e558c7aed082f1f768479678b4"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactState.Validate (cyclomatic 84): CompactState.Validate has cyclomatic complexity 84 (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":"internal/reviewtransaction/compact.go"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7fd0c3a0c5f6fee77706284c286711a76ab22234288e8010cc1650db78fcec"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewCaptureResult (cyclomatic 83): cli.RunReviewCaptureResult has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8aa88695e448185a16fd366eb4b94a546e6ed9b414b2a5946b3d41c5653dab"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runReviewFacadeStart (cyclomatic 82): cli.runReviewFacadeStart has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d268670ca079ae20d8a4324838f5c1de32e0c1535726fdcfebd26f0ac36207c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewRepairResult.Validate (cyclomatic 80): ReviewRepairResult.Validate has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_repair.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10cc84d2bc33aed682de9e87a85bd43b3aee3a5865d81e06c814b3acf7b4632"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateNextTransitionTargets (cyclomatic 76): ReviewTargetStatusResult.validateNextTransitionTargets has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace675d722ea00ae5b9ae8363494afa58ded9994e0584d8912b57b34121f0831"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.validateFindingState (cyclomatic 76): Transaction.validateFindingState has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"516227e34aee0960e90f166d94beb5f081fdd845ed8abd1c5360143533612940"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.syncBackupTargetsScoped (cyclomatic 74): cli.syncBackupTargetsScoped has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0b4216bbec04068f526089a0b8c78de6238a2ade9c5424b894b851dd935157"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.assessTargetStatusSnapshot (cyclomatic 73): reviewtransaction.assessTargetStatusSnapshot has cyclomatic complexity 73 (threshold 15). Of this number, 72 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be7b6d7dd9f657c34ab46b92d744bd8f0b3dafaa6fcc7ab0f97a0cd74e43c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"app.RunArgs (cyclomatic 68): app.RunArgs has cyclomatic complexity 68 (threshold 15). Of this number, 67 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":"internal/app/app.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f9e154fac20fc770e30ec3af0dfc898116dae26995edd23c40702b92273c44"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.resolveReviewNextTransition (cyclomatic 68): cli.resolveReviewNextTransition has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_next_transition.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"862d2dd7a1de4b79fbe349064406e8d03510db00525216a259b34e2763193f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.componentPathsWithWorkspaceScoped (cyclomatic 67): cli.componentPathsWithWorkspaceScoped has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd9080c12daddd12ab386fcbc516d75a297ef0a9a1d33a021d8cd4176340dba"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.validate (cyclomatic 67): Transaction.validate has cyclomatic complexity 67 (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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e6bb48a0e2a4100c3e32bee4374de917896c5891c458d2c913a1b63a954c93"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.View (cyclomatic 67): Model.View has cyclomatic complexity 67 (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":"internal/tui/model.go"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"0330a4f6fb278a9a77e5d6504a35ac4a05167bcff04849e20eeec80c53807a31"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateSubmissionDescriptors (cyclomatic 65): ReviewTargetStatusResult.validateSubmissionDescriptors has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca761f1d713df8c50102faaeecfc3792f754e4bd5f981aed40f8d50fea7b9dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.buildPlan (cyclomatic 65): Service.buildPlan has cyclomatic complexity 65 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4d98341905b23a801c97a5650b2fb4a79277d3515775eef9e4b7339b2157a1"}},{"ruleId":"D1","level":"warning","message":{"text":"releasepolicy.validateArtifacts (cyclomatic 65): releasepolicy.validateArtifacts has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/releasepolicy/policy.go"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3286f2305561062230c6eee146ea5cd6fd00808a1fa081ca9989dd45f90e76b3"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.newReviewIntegrationFailure (cyclomatic 63): cli.newReviewIntegrationFailure has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_operation_contract.go"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"da419a5337002d235476bb4a61a6579429314882e7415764d517b39094321418"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.optionCount (cyclomatic 63): Model.optionCount has cyclomatic complexity 63 (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":"internal/tui/model.go"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"385599f6224aba3f8e3ad3c8cc90f856d68b22cc3979369e555994a74d3df835"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.RecoverCompactAuthority (cyclomatic 61): reviewtransaction.RecoverCompactAuthority has cyclomatic complexity 61 (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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"52aa2ee4d63cb03fa8d7cee9ac2667208bdf7ae53a08f03150cc4d544116d2e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.configureShellExperience (cyclomatic 61): Model.configureShellExperience has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_experience.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ef788f564ab9077a0651e64582ef5d2dfb720f8cce13cebb90c2c6ff5b5913"}},{"ruleId":"D1","level":"warning","message":{"text":"engram.injectWithOptions (cyclomatic 60): engram.injectWithOptions has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07c6a79ebf220f7616a2f1066f664968f4fd18d234ada3732f49ebf85a1437d"}},{"ruleId":"D1","level":"warning","message":{"text":"agentRoutingGuidanceStep.Run (cyclomatic 58): agentRoutingGuidanceStep.Run has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36fefe5828529a982f88f248130b5fb373d84a4de23cf011283a12f12bcb989"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.goBack (cyclomatic 58): Model.goBack has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":3685}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d802ef41032774414f5b1e16fac8af4e823064cca9ddd93766f6f10744581"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.installBackupTargets (cyclomatic 57): cli.installBackupTargets has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4066}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f035b61061f233a8d915730e7ca4f205f3e1a9ad5aad89e8966ce6cc9a3a2cc"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunSync (cyclomatic 55): cli.RunSync has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"95973d83898f70e965654863ce4b6c68607e41f1477ef3c9ee3dfe231630dab6"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.validateReviewStartRiskReasons (cyclomatic 54): cli.validateReviewStartRiskReasons has cyclomatic complexity 54 (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":"internal/cli/review_start_contract.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89759900bd1541999e06d238c13ccb06c565c42ffd3b55458f08b6c9a8bddd1"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runReviewRepair (cyclomatic 53): cli.runReviewRepair has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_repair.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"64009d13b15ad054162b1ae41e1487ae508f2a728a9d13dc6f9ddb2dd10badcd"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.AdmitArtifact (cyclomatic 53): reviewtransaction.AdmitArtifact has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b87690f5e8ad6588e3f2233d1c458f73ddef23cdab1a8370cc2ab10477693e"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateSelectorNextTransition (cyclomatic 52): ReviewTargetStatusResult.validateSelectorNextTransition has cyclomatic complexity 52 (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":"internal/cli/review_status_contract.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aba8fa92cee157689a34118d6ed3495ebd6c896d6dfb8ec9ca64031637f19cc"}},{"ruleId":"D1","level":"warning","message":{"text":"communitytool.InstallWithOptions (cyclomatic 51): communitytool.InstallWithOptions has cyclomatic complexity 51 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/tool.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc9357b0b282c0b90b42afdc942f27940d8ca1332339edc557f16411f1de9f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.componentOperations (cyclomatic 51): Service.componentOperations has cyclomatic complexity 51 (threshold 15). Of this number, 50 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":"internal/components/uninstall/service.go"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4492d44c6c4761c51e2a2c0a665854e7e60a99f504661678df60d2a7961211d5"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthorityRepairAssessment.Validate (cyclomatic 50): AuthorityRepairAssessment.Validate has cyclomatic complexity 50 (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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"b169b5c5eb0d5cccc6bfc1789d5587e54806053e1a191648a58e656af316982c"}},{"ruleId":"D1","level":"warning","message":{"text":"componentSyncStep.Run (cyclomatic 49): componentSyncStep.Run has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"267fc1aded115f62a381471c91470d5bed094f6e11719c02ce0f042d5cfce4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.append (cyclomatic 49): Store.append has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d355f0db79ca5bd0add3a7e3ef6df6a6833cdeb21b67008df56c1aeeee9aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runReviewInspectCandidate (cyclomatic 48): cli.runReviewInspectCandidate has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_inspect_candidate.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b591064659b1ea79a763b3f156752fed38cb267c2ba4d07cd515c7516d8bd559"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.build (cyclomatic 46): SnapshotBuilder.build has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f73d94ee2a3c09d131a17c363adb796e3ae79321fbb555d169c007854bd68b6"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.StageNativePNPMInstallation (cyclomatic 46): shellinstaller.StageNativePNPMInstallation has cyclomatic complexity 46 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 24 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf03de1414bdd7e0dc81b3c2814d501c94ca82973c52c104dc71b5306f03ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userValidateInstall (cyclomatic 45): shellinstaller.userValidateInstall has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea20179e936d2e5bae36ecad1fb4a82edf33f30ca09caf708cdbe392558218b"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.removeJSONCMember (cyclomatic 43): filemerge.removeJSONCMember has cyclomatic complexity 43 (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":"internal/components/filemerge/jsonc_members.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed7e42732571b36f17642833d153a6810d658cf35dc570e94c3462fb5b69022"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactRecoveryEdge (cyclomatic 43): reviewtransaction.validateCompactRecoveryEdge has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97b73f455c47041b68e242e7f2ee8d9bf6a311546d0c8639ca1931da46f5bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateChainBundle (cyclomatic 42): reviewtransaction.validateChainBundle has cyclomatic complexity 42 (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":"internal/reviewtransaction/bundle.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daa6dc455b581c5b3eae3f2203be1b2793d2aed4d5bf6c63dc8e0de77b1e6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userUnixOverlaySelectSDK (cyclomatic 42): shellinstaller.userUnixOverlaySelectSDK has cyclomatic complexity 42 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef28c6d3d6afc22aed575ccd72b26fdcd3b6d650159567e365787d11d19a2fb"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.validateReviewStartBinding (cyclomatic 41): cli.validateReviewStartBinding has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"790faaef15fb8c53f65beb3993ecdad4e9c7ecfb28842033f1da12e96f5bb988"}},{"ruleId":"D1","level":"warning","message":{"text":"communitytool.ReconcilePiCodeGraph (cyclomatic 41): communitytool.ReconcilePiCodeGraph has cyclomatic complexity 41 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5443f6c0e820bf182e1fdfcd287b0ac8858312d495b5cf8ef63fa12f3f31c33"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewassets.InstallNativeAgents (cyclomatic 41): reviewassets.InstallNativeAgents has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/reviewassets/install.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dda547b687e409a77e9fbb1931574a0370a038ca316c0fa8ac531b43daf7d7"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.SetCloneLocalRDDMode (cyclomatic 40): reviewtransaction.SetCloneLocalRDDMode has cyclomatic complexity 40 (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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f3d40513c4b9b620db91ed998612a5e391f5df9dfb97d4dce62fc1b0450044"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ParseGateContext (cyclomatic 40): reviewtransaction.ParseGateContext has cyclomatic complexity 40 (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":"internal/reviewtransaction/receipt.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f9e6b003b02cd6afbe9cce35436d0e041cd5d4727a3892d6ac5de06d5ba378"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactAdmittedRoleResults (cyclomatic 39): reviewtransaction.validateCompactAdmittedRoleResults has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c5c5bfdc9d572f18e6f432ddc2aca69c789531f01c84022f5bd811e256a1c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.buildCurrentChanges (cyclomatic 39): SnapshotBuilder.buildCurrentChanges has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12e161e0263aec946a62cd96f4b7f053ada98f83c1e7960f8586f9404987f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.executePlan (cyclomatic 38): Service.executePlan has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d44832f69f4c9f9493f6f6c5ee1573ba18497fa995875f92570c8e78ff87c9"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.mergeAdmittedNonLensRoleResult (cyclomatic 38): CompactStore.mergeAdmittedNonLensRoleResult has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"834a51f3479656ab477baaedb5ccf184a9faa87e6aa98f3bb96363fd7b6b9928"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.validateFindingRouting (cyclomatic 38): Transaction.validateFindingRouting has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f900fae43e0fba1a48aa183ca2ae1133dee96e0cc4b4b30dec63bad840f06b94"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageJSON (cyclomatic 38): shellinstaller.userStageJSON has cyclomatic complexity 38 (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":"internal/shellinstaller/user_experience_private_unix.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd479f6fbe4d46977a93c678f75083c8a47f76ef5909d9a7ee2a7419e3af634"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userNativeCoordinate (cyclomatic 38): shellinstaller.userNativeCoordinate has cyclomatic complexity 38 (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":"internal/shellinstaller/user_native_coordinate_linux.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eec6f796dac86f4935db1e044ad65bd217012accdc97c0930fdf3241a688b1"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userSnapshotZIP (cyclomatic 38): shellinstaller.userSnapshotZIP has cyclomatic complexity 38 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_source_archive.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c2bcc20cc370096b891a157ec3ab5aab9dc84314967619c730fa9f048ef95"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.updateShellInstall (cyclomatic 38): Model.updateShellInstall has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c53811f6372f3eded0e9c72c1b7d7771d6c2c05d29e009b6abedac903012cd"}},{"ruleId":"D1","level":"warning","message":{"text":"app.persistAssignments (cyclomatic 37): app.persistAssignments has cyclomatic complexity 37 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 19 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48fc8d45f6f0128db9f6f846ce102a87b515b0fabe7c15fcecfa6c996eaacd6"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseReviewProviderRoleCapture (cyclomatic 37): cli.parseReviewProviderRoleCapture has cyclomatic complexity 37 (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":"internal/cli/review_provider_role_capture.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c760d8e19425bea2d48e6a97ef511adb5129c21a0bc127a420ff9e9ad9728d"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.RemoveLegacyOpenCodeAgentMarkers (cyclomatic 37): filemerge.RemoveLegacyOpenCodeAgentMarkers has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc2c176d1d1966ddde0d9cb8f15d68dbcfe256049691fdc823caaef65d453bf"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userCodeGraphMembers (cyclomatic 37): shellinstaller.userCodeGraphMembers has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa9045c1abb2d754470c270091668579d49a262b8e9d115ebe41108495598ec"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.NormalizeOpenCode (cyclomatic 37): telemetry.NormalizeOpenCode has cyclomatic complexity 37 (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":"internal/telemetry/runtime_opencode.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb07f4c689c1c252469843ba42d242908cf55bbfbf85b200acd895a8eb92eec"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.ReadYAMLMCPServerCommand (cyclomatic 36): filemerge.ReadYAMLMCPServerCommand has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/yaml.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ece91845c234c5dc7dd3c01a32dd4b86ef4a0e05b3a1a2b88693d752782907"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactRecoveredEvidenceEdge (cyclomatic 36): reviewtransaction.validateCompactRecoveredEvidenceEdge has cyclomatic complexity 36 (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":"internal/reviewtransaction/compact_recovered_evidence.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dcbf03c8b02e7cf98186c1ea02be04204c3939c07c2b03e96454ca9898d17a"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.mergeAdmittedLensResult (cyclomatic 36): CompactStore.mergeAdmittedLensResult has cyclomatic complexity 36 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0d27f7bafec81a7e7f42100bac0daa258fc5e9aa20ed59c980b8341d569ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userReadRecordedManifest (cyclomatic 36): shellinstaller.userReadRecordedManifest has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"174304ebb42c80bb1e8b2fc760f532f894f5ced14db92f5922328108349efcf6"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userNativeMountsData (cyclomatic 36): shellinstaller.userNativeMountsData has cyclomatic complexity 36 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 7 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":"internal/shellinstaller/user_native_guard_linux.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"624bf83f1ac094c230714882900400302adb4fbf2e711240fa75d9bdee5311ac"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.ApplyUserExperiencePreferences (cyclomatic 36): shellinstaller.ApplyUserExperiencePreferences has cyclomatic complexity 36 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_apply_unix.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174f2f1c2579054ba2352348286b40031286b3dab8cb2924d48d3711367ec9a"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.processBoundaryRiskReasons (cyclomatic 35): SnapshotBuilder.processBoundaryRiskReasons 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c048283ff5df8bf84e7f2a674a8a73af6e265e25cd0807394e29f9a45f71f7"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.CheckUserShellUpdate (cyclomatic 35): shellinstaller.CheckUserShellUpdate has cyclomatic complexity 35 (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":"internal/shellinstaller/user_shell_update_unix.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0a66e4cdcdf37a423e02beeafa9ee4acdc6c04ca3e0090d510b500eb6bf4cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.updateShellInstallRun (cyclomatic 35): Model.updateShellInstallRun 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":"internal/tui/shell_install.go"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcdc892fafb89f818a5e8fa404d03e3af0250a28863fbaa896ae523520b7714"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewCaptureUnachievable (cyclomatic 34): cli.RunReviewCaptureUnachievable 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":"internal/cli/review_capture_unachievable.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0fff0e089732eb662d447f49b2c9a8800b50fc04bb6577bcda2fa00bce1d78"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunPreparedInstall (cyclomatic 34): cli.RunPreparedInstall 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":"internal/cli/run.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"77545605352b35f8b8e627010050f62628b2436ecbbb9deaf2007a7b150bf889"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runSyncWithSelectionScope (cyclomatic 34): cli.runSyncWithSelectionScope 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":"internal/cli/sync.go"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"836f2a65ff95453198c3a6be6b57cc4e788f326b3365ac38e6cecc8c3886f689"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateClassifiedAuthorityRepairRecordShape (cyclomatic 34): reviewtransaction.validateClassifiedAuthorityRepairRecordShape has cyclomatic complexity 34 (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":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9facabf4a5384ea6cce36bad0baf59d43727bd286887e149d9dfce4725333b2"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.reopenCompactAdmittedRoleResults (cyclomatic 34): reviewtransaction.reopenCompactAdmittedRoleResults has cyclomatic complexity 34 (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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21a6b6b6c39276068833cf6b66be9bc31d0e66f37b7f98952be12fbc03b7e19"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.replaceContextGuarded (cyclomatic 34): CompactStore.replaceContextGuarded 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7d55bb255e25e82b11c5b402aee24de4e225370515e0543af14198598885ad"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.ReadNativePNPMInstallation (cyclomatic 34): shellinstaller.ReadNativePNPMInstallation has cyclomatic complexity 34 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 9 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":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"323274045994b03b203c8fee3f5715ab3688cd31d0b96751d6b656fc2a178cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsCodeGraphExtract (cyclomatic 34): shellinstaller.userWindowsCodeGraphExtract 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":"internal/shellinstaller/user_codegraph_windows.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f41f57b53b70ecc73ada4d2a449a83bf812fb76f2cd7f250df8110e4b614119"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewActionEligibility.Validate (cyclomatic 33): ReviewActionEligibility.Validate has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfea7d948ca64869e51af117cf4ea673b8c8c643f95dc4f072f1f865dae298d"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.removeOpenCodeFamilyAgents (cyclomatic 33): uninstall.removeOpenCodeFamilyAgents has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to one function literal inside it that branches (line 51). 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":"internal/components/uninstall/opencode_agents.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeba344ff13bfea207ad2c2415b1f0b30994df0f2ecea6fccd7beef57fa2d4d7"}},{"ruleId":"D1","level":"warning","message":{"text":"startupPathModel.enterBlocks (cyclomatic 33): startupPathModel.enterBlocks has cyclomatic complexity 33 (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":"internal/opencode/background_readiness.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f042ed452083fe571d4798851c8bfb2b00599000bf0f069e7a1c77f5eb51d36d"}},{"ruleId":"D1","level":"warning","message":{"text":"RARAuthorityRepository.Publish (cyclomatic 33): RARAuthorityRepository.Publish has cyclomatic complexity 33 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 8 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":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a604263790dbf6b86c4d4392d10feaa7444e82fe3994926450e7f96b27e0397"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userRecover (cyclomatic 33): shellinstaller.userRecover has cyclomatic complexity 33 (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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b8586c1427b710142e039ad9d6869f12b9e44975937e3d672b3504f55115d2"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.RenderShellInstall (cyclomatic 33): screens.RenderShellInstall has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_install.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0263dd464ae6354d5cd5a42dc63d75e35177bc38d0210c79894937a9b051943a"}},{"ruleId":"D1","level":"warning","message":{"text":"providercontractbundle.validateEntries (cyclomatic 32): providercontractbundle.validateEntries has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f73c3ad3b09f13b9d81b97c8a27fa245a4fb8ee2ed872bfea25b6f6a922cc0b"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.CaptureAdmittedReviewerResult (cyclomatic 32): CompactStore.CaptureAdmittedReviewerResult 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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f58d022bca5f356b271b4b67082402b0901f7e62f1d72d1be367d5b56923fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.RecordUnachievableLensAttempt (cyclomatic 32): CompactStore.RecordUnachievableLensAttempt 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":"internal/reviewtransaction/compact_unachievable_lens.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3e1e8c06cd46396da0e640ee1d3dfe4b6d6c1ca7634b189d5f5aec962645ab"}},{"ruleId":"D1","level":"warning","message":{"text":"VerificationApplicability.Validate (cyclomatic 32): VerificationApplicability.Validate has cyclomatic complexity 32 (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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7814c594d69a14c42c8985c72f2cf5231d366c521a1bf6b7c4871f711d247926"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runPostSyncVerificationWithState (cyclomatic 31): cli.runPostSyncVerificationWithState has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"add24a2f098f3eb2a12dbbf5f74491277a7457e695cba323a4b6aed8f1ff7218"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTransitionSubmission.validateProviderRoleCapture (cyclomatic 31): ReviewTransitionSubmission.validateProviderRoleCapture has cyclomatic complexity 31 (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":"internal/cli/review_status_contract.go"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9902d1dc52da808e25124d9f772b2b6c1be9cd197b78cc5a67c78df6b84b327"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactReviewLifecycle (cyclomatic 31): reviewtransaction.validateCompactReviewLifecycle has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"898fb9c41d211efeef56ee7ea9951ce58eb318cdf361865ae5ed504ca7be2be4"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ValidateCorrectionImpactClosure (cyclomatic 31): reviewtransaction.ValidateCorrectionImpactClosure 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf50f52f2a79e4c6e5a962c7d2d59477b49fb4598967e46495ebd9ddc5e78ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"RARAuthorityRepository.PublishPlan (cyclomatic 31): RARAuthorityRepository.PublishPlan has cyclomatic complexity 31 (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":"internal/reviewtransaction/rar_plan_authority.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089ac531d77d7ee6f5b61748e981384d3396295a17da609089ff3a71c92b5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.validateCorrectionBudget (cyclomatic 31): Transaction.validateCorrectionBudget has cyclomatic complexity 31 (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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d164a7a46c60477c2bcecf6428df432d7e0d20bed350db0bff1b5fc3b2f0af0d"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userCodeGraphReadbackWithNode (cyclomatic 31): shellinstaller.userCodeGraphReadbackWithNode 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":"internal/shellinstaller/user_codegraph_admission_unix.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2f9650cce6e22e4d35d9d12eb6aeda220f7f6f4b45f98d1701617dac164a44"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userTreeStamp (cyclomatic 31): shellinstaller.userTreeStamp has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to one function literal inside it that branches (line 69). 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":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5943c53f592c2dea4f77f0795cf6a1699e784192d904ccd8f10a1f953331244"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userRestoreAgentImages (cyclomatic 31): shellinstaller.userRestoreAgentImages has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78ea7b26d0a6d801e5b7dc70b3722885fe1e2148dac0c0c964b55d1d6330d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsIdentityBelow (cyclomatic 31): shellinstaller.userWindowsIdentityBelow has cyclomatic complexity 31 (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":"internal/shellinstaller/user_files_windows.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f17b68d0c4ec632d9601fd8b355763f857a490c67fc9e1ee8bd2bf0a02f1eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.updateShellManage (cyclomatic 31): Model.updateShellManage 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":"internal/tui/shell_install.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e213f89e70049f8f3e463b3a7558d36b222cc361c4e876571a023937e3310ad"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.renderWelcomeWithInstaller (cyclomatic 31): screens.renderWelcomeWithInstaller has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 7 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 90, 164, 84). 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":"internal/tui/screens/welcome.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b23dda0b23eae2e520febb64d34d45ee34e24f9ec8830ee805371fac14a0cc"}},{"ruleId":"D1","level":"warning","message":{"text":"shellInstallModel.Update (cyclomatic 30): shellInstallModel.Update has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install_model_other.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bae3f9f42c7a0d764f9e39beed9cb624a2db582313526dba863f6277c3491a1"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.lockedAuthorityDispositionMutation (cyclomatic 30): reviewtransaction.lockedAuthorityDispositionMutation has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d33538fd0a9ed763f5128730af9623338deb5b6ce46ebbb117685f81718130"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.repairHistoricalLegacyAlias (cyclomatic 30): reviewtransaction.repairHistoricalLegacyAlias has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"internal/reviewtransaction/legacy_alias_repair.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7ddc3547fc65893787d6a00f2bd052e3ef039adef3d882d7a4b28570369e73"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.CreateOrReplayAtomicStart (cyclomatic 30): CompactStore.CreateOrReplayAtomicStart has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"561d4cf2d480f2ecbb19c36204329e10523b6cd3038ddc92ca6b02332e2170c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.ValidateFixDeltaResult (cyclomatic 30): Transaction.ValidateFixDeltaResult has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cda29021d74ae5941cfa5726d2938cf2ff05202e0fefc0076db99892288d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userAgentPreflight (cyclomatic 30): shellinstaller.userAgentPreflight has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e124d3d4a2f346aabe180555887f85759951f598e696c7f3566d6586aca98aa"}},{"ruleId":"D1","level":"warning","message":{"text":"app.loadPersistedAssignments (cyclomatic 29): app.loadPersistedAssignments has cyclomatic complexity 29 (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":"internal/app/app.go"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"178c027dbce3c9da3a3c5637e3df6672a3bc0d1521084f651bc67d9c46dd5a66"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewBundleImport (cyclomatic 29): cli.RunReviewBundleImport 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":"internal/cli/review.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f834c0c840f6011be17b71c5aa3bf7492b3e700a2148a002f57fde18c0f6f3"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.InjectStrictTDDWithOptions (cyclomatic 29): agentguidance.InjectStrictTDDWithOptions 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":"internal/components/agentguidance/strict_tdd.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb75e787e37df79cd43038d63d31f59153c6b19be07313d9f0df902db9f09721"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.topLevelJSONCKeyCount (cyclomatic 29): filemerge.topLevelJSONCKeyCount 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71888b9886b9b987638d3e95df2e371a8474d8840d5dfae441e51e7319a488b"}},{"ruleId":"D1","level":"warning","message":{"text":"startupPathModel.expand (cyclomatic 29): startupPathModel.expand has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the 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":"internal/opencode/background_readiness.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba800e8a0cf9ef896eeb7740461cf27fef85e285b8ee9277a99a6f3fab53b72"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactResultReopens (cyclomatic 29): reviewtransaction.validateCompactResultReopens 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac0d78a4abafc1ebc52997ec22685825688456a15cd28ee2e08691f23341b33"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.classifyCompactTargetRelation (cyclomatic 29): reviewtransaction.classifyCompactTargetRelation 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":"internal/reviewtransaction/compact_target_relation.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a78ea11ac758103ee2ead5657845d98da574feba1c18aaf9bbbee576c2aae"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.projectTargetStatusDecision (cyclomatic 29): reviewtransaction.projectTargetStatusDecision 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8995243cec747abb2e4a6fdbeddb2516a6add67d1a2f175e32122e5095f7035"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.resolveAdmittedReviewerResult (cyclomatic 29): CompactStore.resolveAdmittedReviewerResult 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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11279751d392f7e3411bc242de738b2dcb5af8d0f99d343177c3e57f087c0ba"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.Opportunistic (cyclomatic 29): telemetry.Opportunistic has cyclomatic complexity 29 (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":"internal/telemetry/opportunistic.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"35734c814af9daf9137a9e596bcb9dfacbe8f7b8f937b14ecf9f84840e10a839"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.parseCodeGraphCommand (cyclomatic 28): opencode.parseCodeGraphCommand has cyclomatic complexity 28 (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":"internal/agents/opencode/adapter.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"27de2f9338a9e17d243f682a12c58fc224a90d787a4769c6a7becf0fb9b58dec"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.UpsertYAMLMCPServerBlock (cyclomatic 28): filemerge.UpsertYAMLMCPServerBlock has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/yaml.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dfe3a7219841a299f8cb40a06e8113726540b80768e2043de1dff8b11a8d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.RetireClaudeSDDPreflightHook (cyclomatic 28): legacyassets.RetireClaudeSDDPreflightHook has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/claude_hook.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a4fb4e527c88d8207f21ac0a33b911f664a6cce0eb947bdccb3b8da6299371"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.RetireOpenCodeSDDSettings (cyclomatic 28): legacyassets.RetireOpenCodeSDDSettings has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"382fc4efcb50e1b120ae2f5e3e49942b08d567db72f6fd496e0b0bd7ce199ead"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.removeOwnedFile (cyclomatic 28): opencode.removeOwnedFile has cyclomatic complexity 28 (threshold 15). 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: 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":"internal/opencode/background_remove_unix.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"acce7d66ee2b93e221c60e452799721851b88eac9fffc8db3d839c7bfb10542b"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateBundleExpectation (cyclomatic 28): reviewtransaction.validateBundleExpectation has cyclomatic complexity 28 (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":"internal/reviewtransaction/bundle.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f621c75bf3a2c76bb42c381779e17394f882e7be45691b52c4403d45fc830a4"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactRecoveredEvidenceReferenceShape (cyclomatic 28): reviewtransaction.validateCompactRecoveredEvidenceReferenceShape has cyclomatic complexity 28 (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":"internal/reviewtransaction/compact_recovered_evidence.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26715a759b475ff4a4da73b498b66802af225ed1f6a565c81aaa2f6734b0990"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactRepositoryEvidence (cyclomatic 28): reviewtransaction.validateCompactRepositoryEvidence has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c2ed25fc64f1bd7933e5fb5a924f46a17772e798a59048ec1f188a1588d8cb"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.markCompactGraph (cyclomatic 28): reviewtransaction.markCompactGraph has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/status.go"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04a360386878b1049a939fa712228f090c24a99913325920609ff4f4c8a081e"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageOwnedAgentContext7 (cyclomatic 28): shellinstaller.userStageOwnedAgentContext7 has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5befb56d7dcdcba4c9b83f726472c0cf3f5c9e8d1dfe4d1de7f8aeae7092921a"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreService.restoreCompressed (cyclomatic 27): RestoreService.restoreCompressed 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":"internal/backup/restore.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec900d996c06eddae5e33b2ffd0fc779a0fdc923925959d8d6506b751f26baa"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.newReviewActionEligibility (cyclomatic 27): cli.newReviewActionEligibility has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"10718b41add5c9fdbe3a91c4bfe5a192ce692a4768eea7290192b56c1f012ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateRepairNextTransition (cyclomatic 27): ReviewTargetStatusResult.validateRepairNextTransition has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"938c50a9f60cb53f93d0b100e8a78e9e96cf37394ae08e4987fc059a794de268"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.topLevelJSONCPropertyValueRange (cyclomatic 27): filemerge.topLevelJSONCPropertyValueRange 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaee885d6594e4d44357609d4311ca10996ad3933edf92d560039c081aa1ff6"}},{"ruleId":"D1","level":"warning","message":{"text":"geminimodules.Publish (cyclomatic 27): geminimodules.Publish 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":"internal/components/geminimodules/modules.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca36e344b2cb39c24923be207bdae73ff330b2a55f10ba4693f2b2328967b946"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenCodeSDDRegistry.Owns (cyclomatic 27): OpenCodeSDDRegistry.Owns 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":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bded85584736eecdc150714c38ee451bdcefe7a2ad6d6e6d662119eb2f3b8e9"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.discoverClassifiedAuthorityRepairRecord (cyclomatic 27): reviewtransaction.discoverClassifiedAuthorityRepairRecord 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":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c06affb032749cb89d3ebabd0fc2fef055e74c8e0ddba5ac8f967008e085e80"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateChangedPathManifestEntry (cyclomatic 27): reviewtransaction.validateChangedPathManifestEntry has cyclomatic complexity 27 (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":"internal/reviewtransaction/frozen_candidate_context.go"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca6f47765027219cefb81e4bc52040f70b5d432f800f7a933dc7c4fca26ac9a"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateGateRequest (cyclomatic 27): reviewtransaction.validateGateRequest has cyclomatic complexity 27 (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":"internal/reviewtransaction/gate.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daaf2d27f1627abc4fc129b06b34d5754f08c194a5ed8aca26bbe5c4179f14d"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userToolsAcquire (cyclomatic 27): shellinstaller.userToolsAcquire has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"2683a82f99b868935c84f6e6cdbf9edda0ab85fb76fdc015f17251d5f35589d1"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userNativeReadback (cyclomatic 27): shellinstaller.userNativeReadback has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d90e48c45f8ab28a7330d0183f91c606325dede57a3a7140500a5769eb74de"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPublishNativePNPMPrepared (cyclomatic 27): shellinstaller.userPublishNativePNPMPrepared has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_pnpm_publish_linux.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4426443f08527d6950562cc932e8f7d5ff3c819576a1a65aee2c4eb18a52e695"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsInventory (cyclomatic 27): shellinstaller.userWindowsInventory has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 423, 399, 410). 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":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"add330986bb4212a93bd671e605c67958722dd8154ef7bac2c3556edc837d828"}},{"ruleId":"D1","level":"warning","message":{"text":"upgrade.managedAgentBackupPaths (cyclomatic 27): upgrade.managedAgentBackupPaths has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/executor.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"044e2f6854b56a7b1c251e32050cf15b1a94ff0dce99d1d8b9476fd836eaccf0"}},{"ruleId":"D1","level":"warning","message":{"text":"app.runBenchModelPickerCommand (cyclomatic 26): app.runBenchModelPickerCommand 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":"internal/app/bench_model_picker.go"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"98265ed3d2198ff337c59a1044ab2891934c03d5833ed93b481aaf7543dd5e04"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewInvalidate (cyclomatic 26): cli.RunReviewInvalidate has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5058d4c8e88f64c5ad0cc4db5f5e2df108786e01eeae1066abd90b720c6bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewIntegrationConsentResult.Validate (cyclomatic 26): ReviewIntegrationConsentResult.Validate has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_consent_contract.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1508a9012531d3eeea1b86b92bacf3a73c9ebe2bc500cd0a3dc554b94502137c"}},{"ruleId":"D1","level":"warning","message":{"text":"installRuntime.stagePlan (cyclomatic 26): installRuntime.stagePlan has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bfc7f10da1471d597016a77511ab552487e83340877e89601e27993ec5afee"}},{"ruleId":"D1","level":"warning","message":{"text":"syncRuntime.stagePlan (cyclomatic 26): syncRuntime.stagePlan has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9800df6dcb4b472e84b1c9f8ff96de411d9c2f3aae4a15da427819c392cab7bf"}},{"ruleId":"D1","level":"warning","message":{"text":"openCodeModelAssignmentSyncStep.Run (cyclomatic 26): openCodeModelAssignmentSyncStep.Run 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":"internal/cli/sync.go"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ad800713ef55e376fbdf49ce70569fa4219725d8d03bb9a1fb4f722dddf0c7"}},{"ruleId":"D1","level":"warning","message":{"text":"agenthooks.installSkillRegistry (cyclomatic 26): agenthooks.installSkillRegistry has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/skill_registry.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"915e6b717f0156a43928ddf6da9aef90d5216d4f9a2f6fbaf4e7dfa01fc18c02"}},{"ruleId":"D1","level":"warning","message":{"text":"communitytool.UninstallPiCodeGraph (cyclomatic 26): communitytool.UninstallPiCodeGraph has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c34b1624d5882d07e1286c87eadf49f5aa150049d0372a4c09dcc0ab7ae7ae"}},{"ruleId":"D1","level":"warning","message":{"text":"engram.stdioHandshake (cyclomatic 26): engram.stdioHandshake has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/healthprobe.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bd53a2f052c22262d7badaab31926b149a7413689b94a5a239c5b5afa69ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.RetireSDDAssets (cyclomatic 26): legacyassets.RetireSDDAssets has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5980891dd57fedd73d8eddd5793327471ab13a69a961152605a2721200215e"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetryruntime.inspect (cyclomatic 26): telemetryruntime.inspect has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca2f1d11b12d6f12d431494fb103325ec7d3bd83854a0734fe1d6649ad30c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.removeSkillRegistryHook (cyclomatic 26): uninstall.removeSkillRegistryHook has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"772ec06224e558a21e5e905b02fb62793ba6d97659d7a0bb7fb77c9267b64b2e"}},{"ruleId":"D1","level":"warning","message":{"text":"startupPathModel.apply (cyclomatic 26): startupPathModel.apply has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_readiness.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a886f23960807221a7f5bf5c26afcac72d2c63f38d5a3abb295ec81510966f9"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.AbandonPristineCompactStore (cyclomatic 26): reviewtransaction.AbandonPristineCompactStore 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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"579283cb5f5d7061bde160abba683d356b8b86c708412b73e31e9d1e69020618"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.loadCompactTargetStatusCandidates (cyclomatic 26): reviewtransaction.loadCompactTargetStatusCandidates has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status_projection.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e83977e6e5f5db90528c96ad02d3af9106a483a2fae25fdf1d26183b4f97d"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ValidateTargetedValidationRequest (cyclomatic 26): reviewtransaction.ValidateTargetedValidationRequest has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/targeted_validation_request.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"875c78ef23cd8bb50e6d4b1a41efa90ccaf5d9a8f5b8901bf7b560f8b0bc2195"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.classifyVerificationStat (cyclomatic 26): SnapshotBuilder.classifyVerificationStat has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd09d886b9e88e4445e8670aa8228cd040d2ee26b4c8652dfe117ad16ebd3f27"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.shellInstallView (cyclomatic 26): Model.shellInstallView has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_experience.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e1910bc0c5e48188117642448e702e8fb03f3f468e86a4eb8ae9a55f782e55"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewAssess (cyclomatic 25): cli.RunReviewAssess has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/cli/review_assess.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d1cc030799cfba5640f2d6cf9523798e337fcf83c8b2188cc1e714ddf739bf"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RenderSyncReport (cyclomatic 25): cli.RenderSyncReport has cyclomatic complexity 25 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 12 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":"internal/cli/sync.go"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c638eec34d543bd567d9c534e1605680344152e302eb6a2ded44ae6367eb8df5"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.prepareDesiredOrchestratorModules (cyclomatic 25): agentguidance.prepareDesiredOrchestratorModules 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":"internal/components/agentguidance/orchestrator_module_install.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1f23c30442a88d87536c51b29cc14649ae3407f2a3fb9cc4a4a9e340cabff0"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.updateTOMLMultilineString (cyclomatic 25): filemerge.updateTOMLMultilineString 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":"internal/components/filemerge/toml.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82a54983e619e5fda9b7241240a0622177f58c867560171d694e52ce6e7359b"}},{"ruleId":"D1","level":"warning","message":{"text":"opencodeplugin.Uninstall (cyclomatic 25): opencodeplugin.Uninstall 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":"internal/components/opencodeplugin/uninstall.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd4cef5e0f9e08e4e8e83bfa5d20376953cbceb6ab133c4e3b6a0995e0f5af8"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetryruntime.sendOpenCode (cyclomatic 25): telemetryruntime.sendOpenCode 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":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae91cc3f77725ab4d9e69055f457beef4639df4bd52cb8461b5a52328e555aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.splitShellCommands (cyclomatic 25): opencode.splitShellCommands has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the 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":"internal/opencode/background_readiness.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ea5500e258e75c6c0b9e9d01c077c9bbf070e757c7282f7f0d9e7690299cc9"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.overlayConfiguredProviders (cyclomatic 25): opencode.overlayConfiguredProviders 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":"internal/opencode/config_v2.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eeb1b0ac3fd0437bc1c01d979f9426a1bc6fe649762dfec360b104e2131d45"}},{"ruleId":"D1","level":"warning","message":{"text":"providercontractbundle.VerifyArchive (cyclomatic 25): providercontractbundle.VerifyArchive 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":"internal/providercontractbundle/bundle.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6211ec4b1d521c285a628472c7e68c8aaa370c35057bbed4580b950775e36cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ensureRARDirectoryChain (cyclomatic 25): reviewtransaction.ensureRARDirectoryChain 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"185192676929592f0a17639749b3a0799b2645cd49112a371478d6e525d7690e"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.WithdrawUnachievableLensAttempt (cyclomatic 25): CompactStore.WithdrawUnachievableLensAttempt has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_unachievable_lens.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d8c223ce3587161b12e72f4b8376886dda644bcd63fc9d44d748da47b78932"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageExperience (cyclomatic 25): shellinstaller.userStageExperience 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":"internal/shellinstaller/user_experience_stage_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fde45245790a55aed8bb39d43520d08c8346b547104f4416e10b8ff2cf0884"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userSupervisorSHA (cyclomatic 25): shellinstaller.userSupervisorSHA has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d16aca812950ee2d2751dd1ca97a97ac808fc438216d549987a8030399262"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userToolMember (cyclomatic 25): shellinstaller.userToolMember has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7876ef56afd56f1305d195d86ba28d1e1269ffe1f1b438dad645ad22707a6645"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.privateNativeFile (cyclomatic 25): shellinstaller.privateNativeFile has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_primitives_unix.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4260d769a3d1c875e661ac708e12cf0dc9accc18ffeeb18ade5e50f50d979d"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.LoadUserShellExperience (cyclomatic 25): shellinstaller.LoadUserShellExperience 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":"internal/shellinstaller/user_shell_registry_unix.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"22efdebd250fb603eb982d83aaf495e4648759e1697bd51eec69b625383d37a2"}},{"ruleId":"D1","level":"warning","message":{"text":"userNativeServiceCustody.captureFiles (cyclomatic 25): userNativeServiceCustody.captureFiles has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_service_linux.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe969d6b2ead2e6de2e64ab0c9d7ed080535be8b5f1689f88d40fca4cedadc3"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.closeReviewOnLastCapturedLens (cyclomatic 24): cli.closeReviewOnLastCapturedLens 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":"internal/cli/review_last_event_closure.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"700339bc6f5a44a328b47250b45d13d6291526b553b7d43e02a6d49f0420172d"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runReviewStopHookStop (cyclomatic 24): cli.runReviewStopHookStop 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":"internal/cli/review_stop_hook.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"01625a2821452e86e95db866e651580a8f4c0e827a30ab541a5e655529847dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewCapabilitiesResult.Validate (cyclomatic 24): ReviewCapabilitiesResult.Validate has cyclomatic complexity 24 (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":"internal/cli/review_capabilities.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed87ea05a3e5853155f61f3a2fe46d08509c0d37dc21f45121833ffe431a5c92"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTransitionSubmission.validateIntendedUntrackedSelection (cyclomatic 24): ReviewTransitionSubmission.validateIntendedUntrackedSelection has cyclomatic complexity 24 (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: ReviewTransitionSubmission.validateCorrectionPlan (cyclomatic 27) 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8e8fc55b1200135135c2bc7f5434952581dcc824304e14a8ec57e2c82a2d90"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusProjection.Validate (cyclomatic 24): ReviewTargetStatusProjection.Validate has cyclomatic complexity 24 (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: ReviewTransitionSubmission.validateCorrectionPlan (cyclomatic 27) 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c098be0ecfc1d660c1493f699bde5d5e69f48d2e7d6646247444e4e69530cb"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.scanJSONCValueEnd (cyclomatic 24): filemerge.scanJSONCValueEnd 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95566eb972edad5c10ef8d6c17d95ced8a589a005e86f5e1032fb085f3f76a5"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateReceiptStructure (cyclomatic 24): reviewtransaction.validateReceiptStructure 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":"internal/reviewtransaction/receipt.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc5b3e0b821484bb26a987bc4d35729735df49444332eb2f66a8e1ad9443c05"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.runGitCapturedRangeWithTimeout (cyclomatic 24): reviewtransaction.runGitCapturedRangeWithTimeout 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a8ddb57ab4653eeb26686c9885d274ae985a7a04337c2e316a281686d14a72"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactState.EscalationEvidence (cyclomatic 24): CompactState.EscalationEvidence 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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"081ad7c1ff42fd10e8d71837167cb5ca95736df1522eb336cf3850e2eca2dd18"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.activePassiveContentPaths (cyclomatic 24): SnapshotBuilder.activePassiveContentPaths 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea12b93029f2e47a003463194a1a581d1f974ad5970878ee0eaaab643cf473b"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.renameAwareSavings (cyclomatic 24): SnapshotBuilder.renameAwareSavings has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8e691424b5b26ec238d9489a0d79a6249b03d89188c94a35ebf0592ac88b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.validateResolutionCounters (cyclomatic 24): Transaction.validateResolutionCounters 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f465005084cc8ec44be55a1f8cf588987604be970625e09217430f613867ff1"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.DecodeUserExperience (cyclomatic 24): shellinstaller.DecodeUserExperience 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":"internal/shellinstaller/user_experience.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a6911d423296611902cb080227d2fd846e526a63adb0511ebb66744dee1c04"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsVerify (cyclomatic 24): shellinstaller.userWindowsVerify 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":"internal/shellinstaller/user_launch_windows.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e07d3180c8b046326e36dd20958b5affe3aa4b4b38462a370cbb8f4fe94a9f0"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeInstallerRuntime.produceForDestination (cyclomatic 24): NativeInstallerRuntime.produceForDestination has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_install_linux.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2897b12d9ff90af57b341de7e25b8c9ec9544d9ded6fa6b45912c18077c7d2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run (cyclomatic 23): main.run has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/gentle-telemetry/main.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f93c408fe930235706a761e5c66938eeb93e2725e461360088e0d5ad0e95234"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.checkStateJSON (cyclomatic 23): cli.checkStateJSON 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":"internal/cli/doctor.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3f05d49d8ca49c906deba3c8e8c4e9dc0e3f6953438d3b7114d4b9f3a3e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewCaptureCorrectionPlan (cyclomatic 23): cli.RunReviewCaptureCorrectionPlan has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_correction_plan_capture.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a2078d5bb4599f3a5c83e5cbeebc8e081d8f87949b2d8de1798e3789f9f593"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.reviewLensContextBlock (cyclomatic 23): cli.reviewLensContextBlock has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_lens_context.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ea4fddfcfd1e1ddbe916ef489df6502d98b79cf770bbc3851197b9d99a6771"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.reviewProviderAdmitTargetedValidatorRaw (cyclomatic 23): cli.reviewProviderAdmitTargetedValidatorRaw has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_roles.go"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"5715f962691b2f8dff866db573a5fcacae98b8d1df133fd713cb472d073850a8"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.newReviewIntegrationStartResult (cyclomatic 23): cli.newReviewIntegrationStartResult 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":"internal/cli/review_start_contract.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5de0d65415a3d6989231ab15614b331f9622acc376c7c4feb31ceb3ebbb68d"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.mergeExplicitAgentInstallState (cyclomatic 23): cli.mergeExplicitAgentInstallState has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d138f729bce0bf9971caff465fd5cb4475eb659f6736e3d39c2da9dbbc5e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.decodeOrchestratorFragments (cyclomatic 23): agentguidance.decodeOrchestratorFragments 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":"internal/components/agentguidance/orchestrator_module_fragments.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0640f9fb4feb3b37f8c8729449c8a25f14cd796dcd1f1135352b32551e89fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.topLevelJSONCObjectEnd (cyclomatic 23): filemerge.topLevelJSONCObjectEnd 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8cd60a7e7e041f3f73789793cbd4ed6b64a21626c6d04bc363e359dcd54ac"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.mergeObjectScope (cyclomatic 23): filemerge.mergeObjectScope 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"980ee8e63770edc3f19a74221d436c53c22e5ec6ff1cfe77776c3c8c5a415541"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.RetireSDDAgents (cyclomatic 23): legacyassets.RetireSDDAgents 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":"internal/components/legacyassets/sdd_agents.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6d1c91c46c2703073b0bafb4c125050b51146e2cab6f6e285d47a82d47e35"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivationPlan.Apply (cyclomatic 23): ActivationPlan.Apply 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":"internal/opencode/background.go"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb43b746e977c7345351eec02bbc011a8756f9767b4fd49e23c138bbbd358f78"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.authorityRepairRoot (cyclomatic 23): reviewtransaction.authorityRepairRoot 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e3786b58fa1c58fcab8775ee8595b20181581bb38e7f3f74717467640e75d2"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.RepairClassifiedAuthority (cyclomatic 23): reviewtransaction.RepairClassifiedAuthority 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"29937effa753ed138f33e7fffa65599106bff2dfda37d19851469b08e769f652"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.RebuildCommittedBaseDiffCorrectionCandidate (cyclomatic 23): reviewtransaction.RebuildCommittedBaseDiffCorrectionCandidate has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2421ee3128cec4949423f0d7c3c5830c2b6fc1ff8944bc885f8913b4131a42"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.inventoryLineage (cyclomatic 23): reviewtransaction.inventoryLineage 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":"internal/reviewtransaction/status.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde26bfd1ac682f842fc01bd0c4087ebd9e9e963cd8b248eb7ed063ca55a4b8a"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.CaptureAdmittedTargetedValidatorResult (cyclomatic 23): CompactStore.CaptureAdmittedTargetedValidatorResult has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aefb233dad10c660e677eec63007bb850351c8736151c543b03ddac44bfd2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStore.RecordInconclusiveTargetedValidatorAttempt (cyclomatic 23): CompactStore.RecordInconclusiveTargetedValidatorAttempt has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e93c72a8cbf3b347a4471f0a1a70f08bc23ed38d07988ebdb20ea033b16cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.candidateFindingSupportsCausality (cyclomatic 23): SnapshotBuilder.candidateFindingSupportsCausality 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c02ead5b1a24eefe61e1fd290774b44017c61be1216c10202d14f45393e2f63"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageContext7 (cyclomatic 23): shellinstaller.userStageContext7 has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_context7_stage_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2960a95d3cb1244fb47d977e1687cad9f76ae90e6fd0caf9031fec8916bd199c"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPNPMRelocation (cyclomatic 23): shellinstaller.userPNPMRelocation has cyclomatic complexity 23 (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":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"14744ec2b82500da5b5cebd81cc382133c757a700a7e41a48c50994aafbb3ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageVerify (cyclomatic 23): shellinstaller.userStageVerify has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_darwin.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e915cf017a3dbaea01917abd0f796a7e5a6fb7cee9b76b79e6be77914b8c97"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.DecodeCodexHook (cyclomatic 23): telemetry.DecodeCodexHook 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":"internal/telemetry/runtime_codex.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0272f7bb94802aca033c55a9f2f9fe14534da801585270f7b7e3d001c08afa"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReview (cyclomatic 22): cli.RunReview 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":"internal/cli/review_facade.go"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fded7012d2baba026671334e5baf0dcb3e672e1211bda56b72ab8e80b4491f83"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.parseVerboseCatalog (cyclomatic 22): opencode.parseVerboseCatalog 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":"internal/opencode/catalog.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfba328fa489c4be81c908cf556d4e8f97202469ded299a3c50aaec21828810"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.configuredVariants (cyclomatic 22): opencode.configuredVariants has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 280). 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":"internal/opencode/config.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"15096c0c4f2ab3b105376660ac530d4aaf30dac7ab6950d3cb202668b9c6e0d0"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ExtractBoundedSingleJSONObject (cyclomatic 22): reviewtransaction.ExtractBoundedSingleJSONObject 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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e3965a0643343135d11c85baefe45084d688e22b4851a7787171299744c112"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.deriveAuthorityDispositionPlan (cyclomatic 22): reviewtransaction.deriveAuthorityDispositionPlan 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":"internal/reviewtransaction/authority_disposition_plan.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf45549c75b4547197df9c3d981ab99cdd961189fa164e02591a7367434d8e"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.replayCommittedCompactAbandonment (cyclomatic 22): reviewtransaction.replayCommittedCompactAbandonment 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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb3892189202706f4c52c5f75b6e3557a251d66a9e005b4012e3c54c236a257"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.isPassiveSVG (cyclomatic 22): reviewtransaction.isPassiveSVG 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a1327c4378a9e99a54aff33b573156026f955cb6af13fff733aa36baca789a"}},{"ruleId":"D1","level":"warning","message":{"text":"RARAuthorityRepository.resolve (cyclomatic 22): RARAuthorityRepository.resolve has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8a0aef1e278d22f5546cbcc9c56b3da5206dbb7d686d6a9bcb7bd1bbb01c03"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.ClassifyEvidence (cyclomatic 22): Transaction.ClassifyEvidence 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecf812ca3ad3cc323809c97c15200fa8534103978ce4f8871dff937f0ddcc5c"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userUnixChannelOverlay (cyclomatic 22): shellinstaller.userUnixChannelOverlay has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5b76d9c76c2eeb50a714448b93515d9df2bca2b3bfcb62dbb9bacc4822127d"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userServiceWithPlan (cyclomatic 22): shellinstaller.userServiceWithPlan has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 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":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b57181959d025934d493c40251b462231e47175326a94c32136a49dde6bba"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.privateColdReceive (cyclomatic 22): shellinstaller.privateColdReceive has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_runtime_primitives_unix.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb51d5ed7774317d3c0938f89b99bd90c5aca06bd37109fa0d65b32d0866e223"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.PublishUserShellLauncher (cyclomatic 22): shellinstaller.PublishUserShellLauncher 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":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d977df81ae4e66189b7eb4f3c1e71eb1325a4d76296462dde2c9a87d58c53f"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsSecurity (cyclomatic 22): shellinstaller.userWindowsSecurity has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_files_windows.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdd00fc8bc8367203d3cac81cb143776016954abce7c7ab97e94240dcdd8575"}},{"ruleId":"D1","level":"warning","message":{"text":"userPNPMInventoryReader.file (cyclomatic 22): userPNPMInventoryReader.file has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_inventory_file_linux.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486f89693f5abe2ed1ea45e0cfd0106f23d1541b97acd1ed95d4cb4ed0cedfe"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.SendRuntimeWithDeliveryID (cyclomatic 22): telemetry.SendRuntimeWithDeliveryID has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_send.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2daef8dbe7d9cfdcd77b74aba07b5f72128da03f562e398a9521ff45427470f"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.renderPhaseList (cyclomatic 22): screens.renderPhaseList 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":"internal/tui/screens/model_picker.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bf9f63a2d7cb7010467bb28eb82a7b3d99e9c278e6f12daef688643ac8d5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"upgrade.ExecuteWithOptions (cyclomatic 22): upgrade.ExecuteWithOptions 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":"internal/update/upgrade/executor.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b41b0b1069f9ffe32b9891de8ff37fa947cb5daee3831a5ee4e50188ecfa7"}},{"ruleId":"D1","level":"warning","message":{"text":"upgrade.RenderUpgradeReport (cyclomatic 22): upgrade.RenderUpgradeReport 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":"internal/update/upgrade/render.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d6943f6d92c7ff6e8b67598aa84d3a2ef69e179ee754b0b02bac33527f633c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.openCodeTransportComplete (cyclomatic 21): cli.openCodeTransportComplete 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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3222c0ccc3306cc105bd73eef05fe8418bdd884515fd4f1c406d3f3caa93ae52"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runPostApplyVerification (cyclomatic 21): cli.runPostApplyVerification has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4792}}}],"partialFingerprints":{"codehealthFindingId/v1":"8effea2cfa9e8b244a22244f5909e17cf696359cb30edc8334c99935e1f50a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.jsonValueEnd (cyclomatic 21): filemerge.jsonValueEnd has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/jsonc_members.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7c5a49d9a3c225f12cd28eff73643321ef4711a72ee33e3b2c794894f5e9f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.retiredSDDOperation (cyclomatic 21): Service.retiredSDDOperation has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/retired_sdd.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf0238154a3588a0092d7434d7ab72cf39c070378f318f78aa62110a06d42ed"}},{"ruleId":"D1","level":"warning","message":{"text":"releasepolicy.compareYAML (cyclomatic 21): releasepolicy.compareYAML 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":"internal/releasepolicy/policy.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d5a25b45add2d6664156138a110203f34b5d4d82f002acf56b315fca48afaf"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.reconcileClassifiedAuthorityRepairRecord (cyclomatic 21): reviewtransaction.reconcileClassifiedAuthorityRepairRecord has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56525f44dd951d9fead5a3adbd981855d32966a6c070308b20a84d0bf8beefb"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ResolveCorrectedCandidateInspection (cyclomatic 21): reviewtransaction.ResolveCorrectedCandidateInspection has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/corrected_inspection.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240456ff14d6da8bcc647a104f54915a7d899b7fe6ce33fdcf21094ec728783"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.BuildCorrectionPlanRequest (cyclomatic 21): reviewtransaction.BuildCorrectionPlanRequest has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/correction_plan_request.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb9ac3d790b8d6b48c26544f213fba5d19807763d2c83eaf860a14eabe2b157"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ValidateCorrectionPlanRequest (cyclomatic 21): reviewtransaction.ValidateCorrectionPlanRequest has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/correction_plan_request.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e709981cb361ac2d0d28f8c444d77e0907ffbb730be9db3c28addf0d103465bc"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.resolveAdvertisedSelector (cyclomatic 21): reviewtransaction.resolveAdvertisedSelector 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":"internal/reviewtransaction/gate.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbf1ab2819dccd041cfb991ea4e9b7a95fcb41a114fa00dc7097f49d039c7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.readPrivateRARFile (cyclomatic 21): reviewtransaction.readPrivateRARFile has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8db79307fa27898235bfc8e79cd8dcec7af96b0d2398e931dd3658e56d82d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactAdmission.Validate (cyclomatic 21): ArtifactAdmission.Validate has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54bde23af0575f3758311c7e4ebbbb223b9a3ba804a439f3dba343ca6bc4235"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactState.CompleteCorrection (cyclomatic 21): CompactState.CompleteCorrection has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edcba82fb241e85071c4b47d354a4240f9a9a1172d0fb80b744ac119f80a5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactAtomicStartBinding.Validate (cyclomatic 21): CompactAtomicStartBinding.Validate has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1f54671247406793ecb3c9fe795d1a01c83dc845f97b950a4c48ab480db73"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.DiffStats (cyclomatic 21): SnapshotBuilder.DiffStats 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6876a694bb159f2619722d4471a4140073b77017971d59c4dc36b27255543d"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.validateLensState (cyclomatic 21): Transaction.validateLensState has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.pristineReviewing (cyclomatic 22) 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"11668c7f9cbe210505d54058539d4452de696670fa0aef6f021cd269d81a33aa"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageCodeGraphLibrary (cyclomatic 21): shellinstaller.userStageCodeGraphLibrary 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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c20f22cbed97ce738f1d280d655c00e0648993738e3c0db928896c63fd9b14"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPublishManifest (cyclomatic 21): shellinstaller.userPublishManifest has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d33735c401224d1e2669e8609588a838a5e00136472639a6dee246cc842b3f8"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageMainSource (cyclomatic 21): shellinstaller.userStageMainSource 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":"internal/shellinstaller/user_main_source_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6d423ca3700788123ce4504776547c00a67ca9ca6cb8aeac01a722fadbefd1"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.newUserNativeSlice (cyclomatic 21): shellinstaller.newUserNativeSlice has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_slice_linux.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2d304873550ba6d95db4f3bea6b27a3b07705ba58bb296d726e2d0163aa489"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.privateCgroupPath (cyclomatic 21): shellinstaller.privateCgroupPath 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":"internal/shellinstaller/user_runtime_primitives_linux.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a6b933f6cab5edcce2ddbf74ce21fcec1eaa98075896631e216e981dd8d287"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsChannelOverlay (cyclomatic 21): shellinstaller.userWindowsChannelOverlay has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 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":"internal/shellinstaller/user_channel_overlay_windows.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"202b5867bfc518211601a44871ca8de0292634fbea5592997af2f8ae2abb996b"}},{"ruleId":"D1","level":"warning","message":{"text":"UserExperience.Validate (cyclomatic 21): UserExperience.Validate has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc003779547d4b3ba5e356ed9d72f93d068518798032b87491b77866651b6ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeInstallerRuntime.Prepare (cyclomatic 21): NativeInstallerRuntime.Prepare has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_bootstrap_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb8b6eb925f97cfa78d3a2e68d91ca5a8bbb8a2160f4eca28dbcce830997b12"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode-review-transport.startRelay (cyclomatic 21): opencode-review-transport.startRelay has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 118, 152, 155). 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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"706343b573f11ef9df165d09d3bc0f7bdfe7557e473a3e84d2781fd7083b1f30"}},{"ruleId":"D1","level":"warning","message":{"text":"pi.ResolvePackageBin (cyclomatic 20): pi.ResolvePackageBin 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":"internal/agents/pi/model_routing.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d433a0dcd0ac49c278453bf50da92f802a939efce38a2bdf18811f635c865"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.discoverCompactFacadeReview (cyclomatic 20): cli.discoverCompactFacadeReview 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. This is NOT this file\u0027s highest cyclomatic complexity: cli.runReviewCommand (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":"internal/cli/review_facade.go"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc8e5b1750fcd1c9324ff8412a9d6ec52485cb52ca853a8d387c6f582ee96aa"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewMode (cyclomatic 20): cli.RunReviewMode has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_mode.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f324594bd453bdc469bdac9e36f821ae1ed94b75f84b0f457ccda133646eb657"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.renderReviewStoreReset (cyclomatic 20): cli.renderReviewStoreReset 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":"internal/cli/review_store_reset.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbea461c694148fd6f508db39efa8989c03cd9e633775df946bec3dfe3dd663e"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.openCodeSDKRunApprovedManager (cyclomatic 20): cli.openCodeSDKRunApprovedManager 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":"internal/cli/run.go"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf02ad0894f77bf216453b39f3a2eda860919393f4cfc8d349785cbc5aa0252"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.NormalizeInstallFlags (cyclomatic 20): cli.NormalizeInstallFlags 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. This is NOT this file\u0027s highest cyclomatic complexity: cli.defaultAgentsFromDetection (cyclomatic 22) 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":"internal/cli/validate.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00a7afdb0ef4af34e8c83c3eda47b45a4d6b21215b2eba045d6105abbc7962b"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.ApplyOpenCodeBackgroundPolicy (cyclomatic 20): agentguidance.ApplyOpenCodeBackgroundPolicy 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":"internal/components/agentguidance/opencode_background.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e27b7f4e7ce9a89c52105251f1667e59272cc28549cd26759f453509dd93b8"}},{"ruleId":"D1","level":"warning","message":{"text":"agenthooks.InstallRetainedClaudeHooks (cyclomatic 20): agenthooks.InstallRetainedClaudeHooks 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":"internal/components/agenthooks/claude.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"084c4cf79bcc6af7109c0f482dcbf29170a4697a3051924168a049724db11b74"}},{"ruleId":"D1","level":"warning","message":{"text":"agenthooks.InstallCodexTelemetry (cyclomatic 20): agenthooks.InstallCodexTelemetry 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":"internal/components/agenthooks/codex_telemetry.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3e566474673bb78866e70c242edab5c96399e15b740fb4f3a21f216beafda0"}},{"ruleId":"D1","level":"warning","message":{"text":"engram.fetchLatestEngramVersionRequest (cyclomatic 20): engram.fetchLatestEngramVersionRequest 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":"internal/components/engram/download.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd96dd3513d8ff4cc28e3a99b962cf5cebb208d006ca50b99d33b55bb9919ac4"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetryruntime.ReconcileForMajorWithRollback (cyclomatic 20): telemetryruntime.ReconcileForMajorWithRollback has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1e38250172f660458709d660539be986f669d156c0a434b74cdb5ae365c57a"}},{"ruleId":"D1","level":"warning","message":{"text":"releasepolicy.validateSnapshotFile (cyclomatic 20): releasepolicy.validateSnapshotFile 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":"internal/releasepolicy/policy.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe65240202a45ad0d2b1bba7ea2eddcb74e8d8870d9d210fbde524e36198c46"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.parseFindingLocation (cyclomatic 20): reviewtransaction.parseFindingLocation 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b94ff1ed569cb275313d8a59de8f8f846688cf211b9537f8ea8d2a665e972"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.compactDiscardedWorkSummary (cyclomatic 20): reviewtransaction.compactDiscardedWorkSummary 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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"521197209665ea32af4b299005eecff615065b55ae51a9fd719d854c2d382d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ensurePrivateRARDirectoryTree (cyclomatic 20): reviewtransaction.ensurePrivateRARDirectoryTree 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea94f992d42334eecebd6e4e122bfad292045ff217a7b2e38a5358da54da1ac"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.canonicalLensResult (cyclomatic 20): reviewtransaction.canonicalLensResult 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. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.pristineReviewing (cyclomatic 22) 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"413345726aa63e804cc05fc0c0fd60be8f4a9e0f5d669f505ea814c68b9f8529"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCounters (cyclomatic 20): reviewtransaction.validateCounters has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.pristineReviewing (cyclomatic 22) 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa6a22364fe57fa461b6741bc7270986e59021655c0f3ac4646e66503251869"}},{"ruleId":"D1","level":"warning","message":{"text":"authorityRepairScan.scanLegacy (cyclomatic 20): authorityRepairScan.scanLegacy 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59710dfc09d5df970cc14e0b861d05a57f5d43e8ff7bf786d3a1fd908e03003"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedCandidateInspector.Inspect (cyclomatic 20): PreparedCandidateInspector.Inspect 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":"internal/reviewtransaction/frozen_candidate_context.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"28780f5029fc0c1c8bc217481415c6bc5234674b812cd172a84a918a9b09800b"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.ClassifyVerificationApplicability (cyclomatic 20): SnapshotBuilder.ClassifyVerificationApplicability 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"97427ce88536389196053627934a6722d9ea87c01543cbc2a9b079e887542b68"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userValidateStageExperience (cyclomatic 20): shellinstaller.userValidateStageExperience has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_files.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb547b5c0160be582b7b46db3af083c5cf8eba4133079548a5062d1e82ed156"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.PreviewUserInstall (cyclomatic 20): shellinstaller.PreviewUserInstall 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":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7bb6a770479278befa40e985b06e9b651bdd810a583f595c5ac652e00c68ca"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userValidateInstallStage (cyclomatic 20): shellinstaller.userValidateInstallStage 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":"internal/shellinstaller/user_install_stage_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"274ba301090dec6b36d3bbd40a9ad469500613932f355dc16ca04f5d58ad5d35"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userMainSourceFiles (cyclomatic 20): shellinstaller.userMainSourceFiles 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":"internal/shellinstaller/user_source_archive.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"776dba085566f2c42e214f33deceef6e5335d235ff15f5b3d344d35a343dcecc"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsOverlayToStable (cyclomatic 20): shellinstaller.userWindowsOverlayToStable has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_windows.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a62f72bec68bf4648740c20de9e00081864d2591d8d7e127a779f6031ec50d"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry-runtime.telemetryRuntime.event (cyclomatic 20): telemetry-runtime.telemetryRuntime.event has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/telemetry-runtime.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d49481d757423961d369fd0c61880ac3eb1bf03c7a866bfcfe034ff2251dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.validateCompatibilityDestinations (cyclomatic 19): cli.validateCompatibilityDestinations 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":"internal/cli/compatibility_skills.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd410779118f744f95ef391454c8b43b068325b258c5a923ee23290eb5689bd3"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.authorizeReviewStart (cyclomatic 19): cli.authorizeReviewStart 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":"internal/cli/review_mode.go"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"264633281d80a7de7c16db75d3c88a82dfdbca1c26d41a9e3079da872ea8014b"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.retireOpenCodeFamilyReviewAgents (cyclomatic 19): cli.retireOpenCodeFamilyReviewAgents 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":"internal/cli/run.go"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42f44a3307abda186c31607d9405bac9348e2c4d7ce01b56a4340ef24dcd3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewIntegrationOperationResult.Validate (cyclomatic 19): ReviewIntegrationOperationResult.Validate 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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3d4d5a7013d5fb4353ab16e8f8e9b39846344af6dc9d9d9b2144656e44b946"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateStartNextTransition (cyclomatic 19): ReviewTargetStatusResult.validateStartNextTransition has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: ReviewTransitionSubmission.validateCorrectionPlan (cyclomatic 27) 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec7e4a5a80c070fd450253907ba5548dcbbee018c544dcfc8fdc3cafff35df8"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.marshalPermissionOrder (cyclomatic 19): filemerge.marshalPermissionOrder 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d714355b70cd5183080a7d0693aa7068ab0c929ae90a538b27d0a618284d79"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.InjectMarkdownSection (cyclomatic 19): filemerge.InjectMarkdownSection 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":"internal/components/filemerge/section.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b906c90590f9c2d48f134b6931e4415fb63418042fc1e72df8c4725bc9ca421e"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.UpsertTOMLTableKey (cyclomatic 19): filemerge.UpsertTOMLTableKey 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":"internal/components/filemerge/toml.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee95c589caa094be5f23e88a339b5becf5a342d253b28af41640469cd43b93b"}},{"ruleId":"D1","level":"warning","message":{"text":"geminimodules.MigrateLegacyRoot (cyclomatic 19): geminimodules.MigrateLegacyRoot 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":"internal/components/geminimodules/migrate.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"968f74beeb2076268840c23b7b18e43f6b08044b33278a91cf0ce17cc771088b"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.retiredSDDAssetItems (cyclomatic 19): legacyassets.retiredSDDAssetItems 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":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeb91da4df22d63d3a9982c66d293a86826f107b0e6aedc4e75cc8154b51d61"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.SettingsFileReferences (cyclomatic 19): opencode.SettingsFileReferences has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 52). 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":"internal/opencode/file_references.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"628a3e3c8dc0ac991518cccbef1a1b9237fb430a5e47cf4834be3a24f4a46b20"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ValidateArtifactSubject (cyclomatic 19): reviewtransaction.ValidateArtifactSubject 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":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8493640c4b2733bf2aaf7d3f9cc92389010888f6b5118c0c9436effd2385e88"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.classifyCompactCorrectionTarget (cyclomatic 19): reviewtransaction.classifyCompactCorrectionTarget 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e761cb64154b222a724a5a30104549ec347cda4ae9799cdf05073fe2da3c710"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.forensicRemintedStateValid (cyclomatic 19): reviewtransaction.forensicRemintedStateValid 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a50dcec127f084810744a30ff75f06cb7d90ea0ad8055b75750dfbec097a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validatePrivateLocatorDirectory (cyclomatic 19): reviewtransaction.validatePrivateLocatorDirectory 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3894853f4518a7bbb4e1ea5bd3020b5830f83ea59398b290a9795a2be03a9a6"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.canonicalGitDirectory (cyclomatic 19): reviewtransaction.canonicalGitDirectory 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"637367f3257a0f231f51339f4fa9531af2d1e05e46951a7c8b59a9fe70101b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.buildTargetedValidationRequest (cyclomatic 19): reviewtransaction.buildTargetedValidationRequest 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":"internal/reviewtransaction/targeted_validation_request.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e2ef92ceed8edd855469acccd76986155ea7ee7a8519b0cf1f4ccf22257f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validVerificationID (cyclomatic 19): reviewtransaction.validVerificationID 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"560648601dd35d5bc2b27024e1f1e3f8daeef77bb9520a684b006afe05d6348e"}},{"ruleId":"D1","level":"warning","message":{"text":"authorityRepairScan.scanCompact (cyclomatic 19): authorityRepairScan.scanCompact 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aea5df61fda52c2e6b03de0e4c36ab0659310dfdb9c3902d6a16242d2f38052"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPlanAgentToolsRestore (cyclomatic 19): shellinstaller.userPlanAgentToolsRestore 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":"internal/shellinstaller/user_agent_tools_unix.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3179162061b84ec3ca559eb7219f94be20df9e936ce1df331dc794b4e430830f"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userEngramDecide (cyclomatic 19): shellinstaller.userEngramDecide 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":"internal/shellinstaller/user_engram_shared.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81fff8bde869e4ad814a1fc8ff6d046f7a10b720b196fde27626c5c1a6ce6a4"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userReuseComponents (cyclomatic 19): shellinstaller.userReuseComponents 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":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcae5cdc3f760c8dfcdf7ad0cc60a579156e5e44916bb1e4531bd2289ae73d31"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userReadMainArchive (cyclomatic 19): shellinstaller.userReadMainArchive 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":"internal/shellinstaller/user_main_custody_unix.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f424f4751da761ba90c4e19e6affada3e0f0b678c172ee75fefdee712ee5bc51"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userCompareMainSource (cyclomatic 19): shellinstaller.userCompareMainSource has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 114). 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":"internal/shellinstaller/user_main_source_unix.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80e2ff26389a211f7d3c0d1484466713671c48244a77179007e12ccff8a1abf"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPNPMResolve (cyclomatic 19): shellinstaller.userPNPMResolve 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":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"66882266b839cef4909f7bb556e8b9572b1cbae95859b5c08e74ff9908ef7c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userLauncherProfileState (cyclomatic 19): shellinstaller.userLauncherProfileState has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_shell_launcher_path_unix.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20e604d787bb8747a77d4de179e7560246adbb6c08fdaf01c79fccba733cec5"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsCompareMain (cyclomatic 19): shellinstaller.userWindowsCompareMain has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). 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":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb5c60b24bcd8c43c2b1711baa173b968ccadf8de4f85898c73dd15dcd134ae"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsManifestReadAs (cyclomatic 19): shellinstaller.userWindowsManifestReadAs 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":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa027c71f6c08b49d796e01f93a960d1fa52dda2369986f0f906db47a85fafe6"}},{"ruleId":"D1","level":"warning","message":{"text":"skillregistry.parseFrontmatter (cyclomatic 19): skillregistry.parseFrontmatter 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":"internal/skillregistry/registry.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b09a00c074beb3abf8ef89020c0f3e7db5d7faccf5cdab8781fddf4d1f7e61"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetrycollector.validateRuntimeStorage (cyclomatic 19): telemetrycollector.validateRuntimeStorage 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":"internal/telemetrycollector/runtime_storage.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9c4c5d9a08ae9a6ee15c72c9bc90244664a667025023278986baca88310abb"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.updateShellUpdate (cyclomatic 19): Model.updateShellUpdate 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":"internal/tui/shell_install.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb73a2259c1408d8ad468e8f5ef255cf256aa56975e924cc34b01e833d81e4"}},{"ruleId":"D1","level":"warning","message":{"text":"codex.compareSemanticVersion (cyclomatic 18): codex.compareSemanticVersion 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":"internal/agents/codex/runtime_version.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ccb983ca5a528b0ddb799519423a8ac91f513f6ebc64b9f5ec6cc32f2672eb"}},{"ruleId":"D1","level":"warning","message":{"text":"app.selfUpdate (cyclomatic 18): app.selfUpdate 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":"internal/app/selfupdate.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e07cf7355b74bf55c3734ecea92e7e7b5bf7c03ddc6d674539a5ad6e4e07b7"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.ResolveOpenCodeBackground (cyclomatic 18): cli.ResolveOpenCodeBackground 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":"internal/cli/opencode_background.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45747419f58208e6424d8c2c956b565f285662d10b9d26d43f07b1dd188973e"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.ResolvePiBackground (cyclomatic 18): cli.ResolvePiBackground 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":"internal/cli/pi_background.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"62208b1c220b1be552ff2f16c490251ebe5806e1a7cd97df6ce232156ef79e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.reviewLensContextParseNumstat (cyclomatic 18): cli.reviewLensContextParseNumstat 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":"internal/cli/review_lens_context.go"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"a018a3929a247ceaae5e71838072986df84d2854c2fb7f53784775856d265932"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.reviewRecoveryCollection (cyclomatic 18): cli.reviewRecoveryCollection has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: cli.reviewReasonDescription (cyclomatic 23) 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":"internal/cli/review_next_transition.go"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c274ba7c175e804a16ac4d6676248cd3906e9d834b373abba196bee95eabb"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runReviewOpenCodeTransportFrames (cyclomatic 18): cli.runReviewOpenCodeTransportFrames 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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8dc570966efd9c50752d97d5943e13fb1906f47b4e3f7a9e66c01335dcc286"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.openCodeTransportStartBound (cyclomatic 18): cli.openCodeTransportStartBound 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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c50b9ae6f83224620c5744acde9a43f954968cd8dd23368495b818074edbc75"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewCaptureRefuter (cyclomatic 18): cli.RunReviewCaptureRefuter 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":"internal/cli/review_provider_role_capture.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1339e4bfb652b9981061342ca006b1747307854f35a0dcf795250136421e08d8"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.reviewProviderAdmitRefuterRaw (cyclomatic 18): cli.reviewProviderAdmitRefuterRaw 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":"internal/cli/review_provider_roles.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c1f4405a1661e0fe081e746203e98b491f787d7f466c000e2df2aceeee34ae"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.migrateLegacyOpenCodeAgents (cyclomatic 18): cli.migrateLegacyOpenCodeAgents 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":"internal/cli/run.go"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae13e2263e919434b10cfbfe407c7421a0c584e1c79e5f66fea35937f30b747f"}},{"ruleId":"D1","level":"warning","message":{"text":"unixCompatibilityDirectoryWriter.Write (cyclomatic 18): unixCompatibilityDirectoryWriter.Write has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_writer_unix.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"685118f87cdf2b016f0be9ce59483a7db36c67355b4c814d3b800a9ab39bad47"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.commitPreparedOrchestratorCoreAt (cyclomatic 18): agentguidance.commitPreparedOrchestratorCoreAt has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/components/agentguidance/orchestrator_module_transaction.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75a1bbb52be930c2f2f6b86932255248ff2a5e591b8f6c1fafcadec1f79fb4a"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.splitOrchestratorModules (cyclomatic 18): agentguidance.splitOrchestratorModules 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":"internal/components/agentguidance/orchestrator_modules.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2375356eecae763202a0e0e1ba04c68f7dc754bbade306c81dd55c70311a283"}},{"ruleId":"D1","level":"warning","message":{"text":"communitytool.probePiCodeGraphMCPWithTransport (cyclomatic 18): communitytool.probePiCodeGraphMCPWithTransport has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, 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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9cec5e80eaa86c0a9a6acdb4eed2c24c72b95fe14c7733966755e12ddfa820"}},{"ruleId":"D1","level":"warning","message":{"text":"communitytool.isReadOnlyCodeGraphExploreSchema (cyclomatic 18): communitytool.isReadOnlyCodeGraphExploreSchema 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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e65cf254a3da06d563033ce3e0f9fb744e7a55d62f362e3694f8bd0b47d1683"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.referencedSDDAgents (cyclomatic 18): legacyassets.referencedSDDAgents 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":"internal/components/legacyassets/sdd_agents.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3e67dcfc09950e106f72fc1403d5dc44a8e305a0e93417abfeaa1dad53286"}},{"ruleId":"D1","level":"warning","message":{"text":"opencodeagents.Shape (cyclomatic 18): opencodeagents.Shape 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":"internal/components/opencodeagents/agents.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"576ba2e01b5020b09cff770e8824cd0db48b24f45e4fdbb061840ec33a945e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.ResolveTarget (cyclomatic 18): opencode.ResolveTarget 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":"internal/opencode/background.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"935cd81e612fbbe2b8424bc21246cb2ad41f7b5acc4296c07c0b62fcde894947"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.shellWords (cyclomatic 18): opencode.shellWords 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":"internal/opencode/background_readiness.go"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862d3b22479a816813c4dbc6cd04c56a66a2e68a3c2154f67b22cb5f29ad08d"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.parseV2ModelAPI (cyclomatic 18): opencode.parseV2ModelAPI 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":"internal/opencode/catalog.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b4f3cc8192f6cfef8279e26650047aefc1debde2f47f4ee6a545a64c801b69"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewerprovider.codexReviewerLoopbackBaseURL (cyclomatic 18): reviewerprovider.codexReviewerLoopbackBaseURL 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":"internal/reviewerprovider/codex_adapter.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec24dcfa59216932fdd1a2af7461efe793c9edee93629da55820c84bbf8522b"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.AcknowledgeApprovedCompactAuthority (cyclomatic 18): reviewtransaction.AcknowledgeApprovedCompactAuthority 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":"internal/reviewtransaction/compact_burn.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6dbe65053e140b06acbd0009593391d26dcf6dc12e68db64de2b416edad664"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.quarantineCompactStoreEntry (cyclomatic 18): reviewtransaction.quarantineCompactStoreEntry has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/reviewtransaction/compact_reclaim.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8830de93ae4aff12f99fb376a2f7eb903d6e4de57443f47cf926fb412860444a"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.acquireRARAuthorityLock (cyclomatic 18): reviewtransaction.acquireRARAuthorityLock 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2fbb71faa42a3c5b31b360b3192b04ce715178a52e315a2c50980d639d9e14"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.acquireMaintenanceLockInternal (cyclomatic 18): reviewtransaction.acquireMaintenanceLockInternal 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":"internal/reviewtransaction/store_lock.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d245d151ad2a9430d4ef1a43c537e14e87dfe7bd7948e45609a9e968c152d0"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.explicitReviewingCompactCandidate (cyclomatic 18): reviewtransaction.explicitReviewingCompactCandidate 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf7fe679847b942224e8b26d97070596d7c896fafc7de3f532592409bdba53e"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateSnapshotKinds (cyclomatic 18): reviewtransaction.validateSnapshotKinds has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.pristineReviewing (cyclomatic 22) 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7e397f5bc79ba17b2670dcac5183943e1249184b7342f4718cc0a65284b589"}},{"ruleId":"D1","level":"warning","message":{"text":"authorityRepairBudget.readKind (cyclomatic 18): authorityRepairBudget.readKind has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validateClassifiedAuthorityRepairRequest (cyclomatic 19) 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e46cb5f9cd18e212058184ff99ed9bf67acec1b9182a6164e27d6088d57767"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.installBundle (cyclomatic 18): Store.installBundle 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":"internal/reviewtransaction/bundle.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e65aee6d1c4423fd0569d1942763186a2b0dc00afc620cf7b89d7204f6400"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userAcquireCodeGraphArchives (cyclomatic 18): shellinstaller.userAcquireCodeGraphArchives 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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f273d2714bc876682cf8fd6bac7b40adbe098eb06608ca60f3b3cf1a8e0541"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userStageConfigFiles (cyclomatic 18): shellinstaller.userStageConfigFiles 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":"internal/shellinstaller/user_experience_stage_unix.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d1c36b6d49596cba45048da34d86f35678cb6201407d99c130dc2fa8e47dc"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userManagerVersion (cyclomatic 18): shellinstaller.userManagerVersion has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5456feb7be75055aa3ae1333c0a4facc0fccc8b3f75cf398920f336dea900d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userNativeExecutionCheck (cyclomatic 18): shellinstaller.userNativeExecutionCheck 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":"internal/shellinstaller/user_native_guard_linux.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20258e8566ccf3f9c49826426559981b935d4ef7b0dd479a42c6284ce99be37"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.decodeNativeInstallation (cyclomatic 18): shellinstaller.decodeNativeInstallation 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":"internal/shellinstaller/user_native_location_unix.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657ff2cb08b316f2b02558185cadb684bb1a120ada13519779f36c1b2eb7962"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.rootSystemService (cyclomatic 18): shellinstaller.rootSystemService has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, 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":"internal/shellinstaller/user_root_service_linux.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd606145d229374f9a88ab96ed6f6d25104f528c2e60e88d59a850d8db55498"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsOverlayToMain (cyclomatic 18): shellinstaller.userWindowsOverlayToMain has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_windows.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd144e2a68f6913e57111d79241fda905775cd982e51888ed41869a79a0e5910"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsReuseComponents (cyclomatic 18): shellinstaller.userWindowsReuseComponents 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":"internal/shellinstaller/user_install_scope_windows.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac56bdd104cecae2cc55d9a0e4731ea7722f4bd1449db0e388961daa4605fa"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.normalizeRuntimeRows (cyclomatic 18): telemetry.normalizeRuntimeRows 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":"internal/telemetry/runtime.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d59424465d97490d086d1a673fe633d790c9e6a4972b70acb47bff56cce5aa"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.renderUpgradeSyncResult (cyclomatic 18): screens.renderUpgradeSyncResult 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":"internal/tui/screens/upgrade_sync.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b335786712fd44cd5a74813c3f010f12cc17f65c61f790176183dff23922b3"}},{"ruleId":"D1","level":"warning","message":{"text":"styles.parseRose (cyclomatic 18): styles.parseRose 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":"internal/tui/styles/rose.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec76c3d0bc2f0789f2638b26b2f424fec0514ab436cdc2f360dad9dd2940b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"update.detectHomebrewOwnershipWith (cyclomatic 18): update.detectHomebrewOwnershipWith 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":"internal/update/homebrew.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3cf8cd70083b9e0adced019c7d97146f6fb8533a2861ed0d613e63f6428d47"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreService.restorePlain (cyclomatic 17): RestoreService.restorePlain 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":"internal/backup/restore.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"216e34a0c86e2241852afb2a1d6dd97f1ce9880d8cee6db09e8e7e2146710cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunCodeGraph (cyclomatic 17): cli.RunCodeGraph has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codegraph.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b62e142440cca4b70fa3e3bf9f52c0d450447ec00c1b802f2bc6e02cf2bc77f"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runRestoreWithHomeDir (cyclomatic 17): cli.runRestoreWithHomeDir 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":"internal/cli/restore.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0430ec7ab4a35b1533eb2ec5e67e59e9132297f7835ef4431d1da74de13d6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.prepareCompactReviewerResults (cyclomatic 17): cli.prepareCompactReviewerResults has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: cli.runReviewCommand (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":"internal/cli/review_facade.go"},"region":{"startLine":3185}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ebca94a7b5b6b2a5e6fc0ebfc65faf62bae78ac9e224bec2c5471376e6b429"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.decodeOpenCodeTaskHostOutput (cyclomatic 17): cli.decodeOpenCodeTaskHostOutput 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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b57a0725ec89984537a8d04967b974bc1d793f08e9fda4464f4f3e391ce479"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runTelemetryRuntimeInput (cyclomatic 17): cli.runTelemetryRuntimeInput 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":"internal/cli/telemetry_runtime.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aac405bd7b5b7e313b5f3e017207619df51edffc04bc8ead3420192aa785e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTargetStatusResult.validateIntendedUntrackedSelectionTransition (cyclomatic 17): ReviewTargetStatusResult.validateIntendedUntrackedSelectionTransition has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: ReviewTransitionSubmission.validateCorrectionPlan (cyclomatic 27) 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":"internal/cli/review_status_contract.go"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fa054ddceb17feaafc5cdd3c6e271963bd30faaaa8e89ee48d805b6db481b8"}},{"ruleId":"D1","level":"warning","message":{"text":"openCodePluginDependencyPreflightStep.Run (cyclomatic 17): openCodePluginDependencyPreflightStep.Run 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":"internal/cli/run.go"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3c07158effdf417f2f70ebc1bf02a982523b229e5bc4d9fc2e7012d542f86e"}},{"ruleId":"D1","level":"warning","message":{"text":"codeGraphGuidanceSyncStep.Run (cyclomatic 17): codeGraphGuidanceSyncStep.Run has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/cli/sync.go"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76f26ac804ef445537caa84b2a48324176294dd6b19dc3e644d250053211775"}},{"ruleId":"D1","level":"warning","message":{"text":"agentguidance.resolveRoutingDelivery (cyclomatic 17): agentguidance.resolveRoutingDelivery 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":"internal/components/agentguidance/inject.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f912ecd9c37eb7eca1afc5faf3e23df9e89cae6fcbad3b7f23e8840772c1a36"}},{"ruleId":"D1","level":"warning","message":{"text":"communitytool.piChildTools (cyclomatic 17): communitytool.piChildTools has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef210681dcf33921129ae9206eac990a14385cae471a1723f071460d7b58b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"engram.DownloadLatestBinary (cyclomatic 17): engram.DownloadLatestBinary 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":"internal/components/engram/download.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6deaf69ff8b2f1ffab82c21f9268ff6b54c66e2910d44e3123bd5bef689e1851"}},{"ruleId":"D1","level":"warning","message":{"text":"engram.removeManagedAntigravityGlobalEngram (cyclomatic 17): engram.removeManagedAntigravityGlobalEngram 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":"internal/components/engram/inject.go"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c14b50a40be26badbc2602c6edc0e63afcbe7abe084242c6b9117cb529b4c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.stripJSONComments (cyclomatic 17): filemerge.stripJSONComments 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e682326542729a9bd5d70270349f25859ab45114d9c8b901ba37d9867caa851"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.trailingLineCommentStart (cyclomatic 17): filemerge.trailingLineCommentStart 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eb55b9d6bccb302bbe666dfa619c3c7d46bf2a979ff2d8ddf6ed2156ecfd32"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.RemoveJSONCMembers (cyclomatic 17): filemerge.RemoveJSONCMembers 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":"internal/components/filemerge/jsonc_members.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ec4d6ec5b0f42a1ec9d497cab577be4814a2fee97d451580c59c7e3432b31b"}},{"ruleId":"D1","level":"warning","message":{"text":"gga.literalWord (cyclomatic 17): gga.literalWord 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":"internal/components/gga/provider.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a42cba467b4d23368239a34d636836c4ef86cc5ef74d3f5b4a1aa61b53351b"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.RetireOpenCodeSDDPrompts (cyclomatic 17): legacyassets.RetireOpenCodeSDDPrompts has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5134d24cf100ceaf7a36f32688ef113794ac6c2d900b7252ab658f09024313"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.removeSDDOrchestratorBlock (cyclomatic 17): legacyassets.removeSDDOrchestratorBlock 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":"internal/components/legacyassets/sdd_runtime_files.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f229cfa6ce8a83f89a198c8a5d76589ec499b3b6dc742616d6309617dd36fa8e"}},{"ruleId":"D1","level":"warning","message":{"text":"UninstallPlan.Apply (cyclomatic 17): UninstallPlan.Apply has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodedefault/ownership.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1bc96ce5ee12d4467e4597fdf21aefb0225c960d9dc315c59881bbbff8c25e"}},{"ruleId":"D1","level":"warning","message":{"text":"persona.preflightJSONCAgentCleanup (cyclomatic 17): persona.preflightJSONCAgentCleanup 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":"internal/components/persona/inject.go"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64d1d0a86e83c74d8fc59e0e8bc6ef39de4986e36f74e571dfeaadc03236ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewassets.renderNativeAgent (cyclomatic 17): reviewassets.renderNativeAgent 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":"internal/components/reviewassets/install.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bba8e0c9eb50ec861ff0d04023a05f846104e3b15690bd9d1d9716c731e2027"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetryruntime.readClaudeFile (cyclomatic 17): telemetryruntime.readClaudeFile 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":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1374c79f5303e7a9ac9639dee5066035d222d899701d048ddc00c21377550a6"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.stripJSONComments (cyclomatic 17): uninstall.stripJSONComments 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":"internal/components/uninstall/cleaners.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"952a1b4ac54f35a1a2ce8178fcc45455c48a319747bdf7b1dbc6bac65785bc0e"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.shellVariableName (cyclomatic 17): opencode.shellVariableName has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_readiness.go"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19833a74b1bb0f7db901358612687ad6e55fc6996796057d325e50dc63c8439"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.safeAdmissionLocation (cyclomatic 17): reviewtransaction.safeAdmissionLocation 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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff2a30813e53cca882fb24d96cb0ce4691ae95b9fadb58bdf3326e9eee76f5"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.artifactRepositoryPathReference (cyclomatic 17): reviewtransaction.artifactRepositoryPathReference 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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a4e96201ad0158192479ba7cb95151f357a404a2719d2218df81e32bc14480"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.newArtifactSubjectIdentity (cyclomatic 17): reviewtransaction.newArtifactSubjectIdentity has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"856ed8e28e5e2f70f08a45916b4e6fab840958509de996e9b0fce40d58531ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.discoverAuthorityDispositionRecord (cyclomatic 17): reviewtransaction.discoverAuthorityDispositionRecord 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":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae023c642fec2d50c4051852794db7376f99c4171a366752cb7c88dd12f524f"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactPostLifecycleState (cyclomatic 17): reviewtransaction.validateCompactPostLifecycleState has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validateCompactRecoveredCorrection (cyclomatic 19) 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b767fc933f4d148d508ac52bed118317d5b31a88c9937738d6d9fdef1cd6195"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.inspectHistoricalLegacyAlias (cyclomatic 17): reviewtransaction.inspectHistoricalLegacyAlias 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":"internal/reviewtransaction/legacy_alias_repair.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5cf42fbd56c771b082b34ccd09ee83c210f3cdb8fc69758365e2916297f7d8"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.publishPrivateRARImmutable (cyclomatic 17): reviewtransaction.publishPrivateRARImmutable 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd140d3ca5549d1a2813b20246eb83aeba38e81c6f54b29b93dad19886db8ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.acquirePrivateRARLocalStoreLock (cyclomatic 17): reviewtransaction.acquirePrivateRARLocalStoreLock 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"910db81e900aa9d931c4b98bb3d37a227d1a087cc4c8e596da2e776ce85c7ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.readRefuterProbeBatch (cyclomatic 17): reviewtransaction.readRefuterProbeBatch 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":"internal/reviewtransaction/refuter_probe.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deafcd680c74b763361b6e41d4249b4c2eb2a1f481c03927f9c5387ecf57e14"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.resolveSealedReviewRepositoryContextWith (cyclomatic 17): reviewtransaction.resolveSealedReviewRepositoryContextWith 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":"internal/reviewtransaction/repository_context_seal.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe03ea541f185fc6787a778bcc7b7a828e49c396730845c052b6e59b464fee6"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.resolveOpaqueReviewRepositoryContextRecord (cyclomatic 17): reviewtransaction.resolveOpaqueReviewRepositoryContextRecord 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab64f2d3060fa3da6e67610d05e77b4f6b75f89c58bf4e62b4b8c79319dc9c6"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.ValidateVerificationResultRef (cyclomatic 17): reviewtransaction.ValidateVerificationResultRef 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c46909347e0979ddb3878f8f22a6a5cc6c05486c90013d764728c9715b38154"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactState.ActiveAdmittedLensResult (cyclomatic 17): CompactState.ActiveAdmittedLensResult has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validateCompactRecoveredCorrection (cyclomatic 19) 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d9996afd6e322b5608bb8ac4afd2b969cf1a0ab2669850a312786dcd44e990"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.buildHeadWithIntended (cyclomatic 17): SnapshotBuilder.buildHeadWithIntended 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5171db2298899a7a8e81be72842f138e19b0fed34bdfd520f9ecf960101c3fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.loadChain (cyclomatic 17): Store.loadChain has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validInitialStoreRecord (cyclomatic 22) 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":"internal/reviewtransaction/store.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"915d9623eadd4c2980113e83857f42bef84085fa969568752ccd107d820f9a44"}},{"ruleId":"D1","level":"warning","message":{"text":"VerificationPlan.validateStructure (cyclomatic 17): VerificationPlan.validateStructure 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b7d24736bf812a6894ba3bc697a8eac703a3387f37d2cae7f388d3a6e931b6"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userUnixOverlayRebindManifest (cyclomatic 17): shellinstaller.userUnixOverlayRebindManifest has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a97f22804a928bd2fc843f16fa0a0a423761628a8eb46e2c8c48c1be49dbb1b"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userReadNativeReceipt (cyclomatic 17): shellinstaller.userReadNativeReceipt has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_receipt_linux.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308a9abec495aa0113261c24bd1932fec437b4e9a84f454d31d24f2b38d4b49"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPNPMSyncTree (cyclomatic 17): shellinstaller.userPNPMSyncTree has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 33, 22). 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":"internal/shellinstaller/user_pnpm_sync_tree_linux.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0abfce2e07493cda5e1b6d4b3e0ae8887ab5cfafb5b928aa3af6ce48935652a"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.privateACL (cyclomatic 17): shellinstaller.privateACL 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":"internal/shellinstaller/user_guards_darwin.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdb93c53b7057547b15cd4c2f3c4316b2dc89977fc59edf4ef73eb8f1eb9c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.NormalizeClaude (cyclomatic 17): telemetry.NormalizeClaude 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":"internal/telemetry/runtime_claude.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"da03902a72a07a41ea43aabbc50f6acdc385142fce14fb02a31c013e958e8b7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Storage.RunDailyRollup (cyclomatic 17): Storage.RunDailyRollup 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":"internal/telemetrycollector/rollup.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99e95c47790b19af1b62f4aff79ed0f8044f5f62e63259be76463421d09d20c"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.renderCustomPhaseList (cyclomatic 17): screens.renderCustomPhaseList 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":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb82180705724335341af4cae69911470669c8cb911f2b43d6b9eccfdcbf29bc"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.RenderInstalling (cyclomatic 17): screens.RenderInstalling 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":"internal/tui/screens/installing.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f04ecfb6aca2e26fe4707739b010746aa384d7f3176a60e25b9909f2c065170"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.handleModelNav (cyclomatic 17): screens.handleModelNav 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":"internal/tui/screens/model_picker.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"487f25eb50c9eaeb675fe803118d920a524b32f28cc7008c88c2a8ee6024f2af"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.shellExperienceRecommendation (cyclomatic 17): screens.shellExperienceRecommendation 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":"internal/tui/screens/shell_experience_advice.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"635f899aca2745ef4ff7d2ea8e84db4a89c144392b3e24868a3590cd79e79a98"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.RenderShellManage (cyclomatic 17): screens.RenderShellManage has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_manage.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a89593ac0bcbfae4cd5366690798d40254c73eb4a85f5063a4a9aa809baabb9"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.RenderUninstallConfirm (cyclomatic 17): screens.RenderUninstallConfirm 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":"internal/tui/screens/uninstall.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99f947890a80f69b26c188cb713aca9a4e181e909317433aa5973d069927e68"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.renderShellWelcomeMinimum (cyclomatic 17): screens.renderShellWelcomeMinimum has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/tui/screens/welcome.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3413105addf2db647cdd92cc9ccfc7a43c39f0f2416b464b60ea95bfc12ada8"}},{"ruleId":"D1","level":"warning","message":{"text":"windowsCompatibilityDirectoryWriter.Write (cyclomatic 17): windowsCompatibilityDirectoryWriter.Write has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75cd8a05439fb35a0bb1ec6cecf6f0afa78a55879640ef3ecd675c44ca71d80"}},{"ruleId":"D1","level":"warning","message":{"text":"pi.selectPackageBin (cyclomatic 16): pi.selectPackageBin 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":"internal/agents/pi/model_routing.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fda265d9a8b2325b416085234828964ec0055298aaeba45122178f43fef6999"}},{"ruleId":"D1","level":"warning","message":{"text":"app.applyOverrides (cyclomatic 16): app.applyOverrides 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":"internal/app/app.go"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"690243b7e4e779423542264baca89df862681d7dfec8789a66808f726b033351"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.excludeCodeGraphIndexLocally (cyclomatic 16): cli.excludeCodeGraphIndexLocally 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":"internal/cli/codegraph.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79220f5a0596f508d74e3fe0ee624c57310872ba7030dc8d49e48f4086a23126"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.openCodeSDKShimManagerFromPath (cyclomatic 16): cli.openCodeSDKShimManagerFromPath 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":"internal/cli/opencode_sdk_manager.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f9e072539234e6fcd42dff8c1aa87c598fa83d78f6b844d87a45d8358ff92f"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunReviewBundleExport (cyclomatic 16): cli.RunReviewBundleExport 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":"internal/cli/review.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"90604b92bee7541e55bce0e167fdb9a048fa2eb7797558f70cb3d99308342fe5"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.reviewMissingCaptureTransition (cyclomatic 16): cli.reviewMissingCaptureTransition has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: cli.reviewReasonDescription (cyclomatic 23) 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":"internal/cli/review_next_transition.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fd0b5c0d2de0d1711f1852d6a33b896e58cced2fbf5665c76bb41a8aa8ef3a"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.safeReviewIntegrationArguments (cyclomatic 16): cli.safeReviewIntegrationArguments 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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff61af13cc0325413454e1adebe80469f0e5a42c8941737b5f8ad4c596a653c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.SplitPrintedCommandWords (cyclomatic 16): cli.SplitPrintedCommandWords 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":"internal/cli/review_printed_command.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"646d17cb33d44199be62ecbd9ca5cb630c2baf7eaa4a6b09ce9d9b75a3da65bd"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.openCodePluginPackageManager (cyclomatic 16): cli.openCodePluginPackageManager 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":"internal/cli/run.go"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5096438e44bab47cc83000219b612410da8df37a50bd4a494a6d03336f69f3"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.RunShellInstallInline (cyclomatic 16): cli.RunShellInstallInline 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":"internal/cli/shell_install.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f700717c4c7800ba496806ce0d927a9e358c7c02f25045cdacfdfdbcfa26056"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.restoreSyncFiles (cyclomatic 16): cli.restoreSyncFiles 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":"internal/cli/sync.go"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9a9ce66e92f45d4d28bd3d0ccd8836ce7c797d0929d49bd878d72a65e0421e"}},{"ruleId":"D1","level":"warning","message":{"text":"prepareBackupStep.Run (cyclomatic 16): prepareBackupStep.Run 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":"internal/cli/run.go"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e60f4272a884e1c72521b282021e8f96c0cf1fea47bdf212777f18e9c41b8e"}},{"ruleId":"D1","level":"warning","message":{"text":"engram.fetchLatestEngramVersionWithAssets (cyclomatic 16): engram.fetchLatestEngramVersionWithAssets 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":"internal/components/engram/download.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"211d5541a10832c6ac8fa1aa3e1f97cfcf39692becb8512703ea1836d7e5a912"}},{"ruleId":"D1","level":"warning","message":{"text":"filemerge.stripTrailingCommas (cyclomatic 16): filemerge.stripTrailingCommas 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdc6da8de44130ff2a9f262c69721fb63762f9b5662c3002fa7819791637453"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyassets.retirePromptText (cyclomatic 16): legacyassets.retirePromptText 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":"internal/components/legacyassets/sdd_runtime_files.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"16881f7d5c5d22c42e8015525ee903dfe8c0755e2d82d2435e70db7d662e51fe"}},{"ruleId":"D1","level":"warning","message":{"text":"persona.removeJSONNestedSubKey (cyclomatic 16): persona.removeJSONNestedSubKey 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":"internal/components/persona/inject.go"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c619ba30b68c0f7899cdf475d3fb2c17fa7dfadfac54f790ee969dd44f08154"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall.stripTrailingCommas (cyclomatic 16): uninstall.stripTrailingCommas 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":"internal/components/uninstall/cleaners.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd503291cc6126262d96b6357c12bed162d8a4023bd1d8300b2260568116f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.validSemVerIdentifiers (cyclomatic 16): opencode.validSemVerIdentifiers 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":"internal/opencode/background.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b3152a524e8ad5be1ba762a913d0721f5d5c250216b99bd93d18c0cd75b50"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode.overlayConfiguredAssignments (cyclomatic 16): opencode.overlayConfiguredAssignments 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":"internal/opencode/config_v2.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa74138db95f33c5f534f2816561eb0ce6bc0ed74b3be354fa469fbdc86e09f"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.AcknowledgedBoundaryCommit (cyclomatic 16): reviewtransaction.AcknowledgedBoundaryCommit 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":"internal/reviewtransaction/acknowledged_predecessor.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4748a510212ed94960fed5bfd619a4719ab3ffb219b03e72203727e136e616"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.rejectedValidatorDispositionPlanForSelector (cyclomatic 16): reviewtransaction.rejectedValidatorDispositionPlanForSelector 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":"internal/reviewtransaction/authority_disposition_plan.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cb6f5bcb793a364d8292773a183af6c79fe2d83d8886ef08f9ca5bf8722dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.scanLegacyAuthorityRepairOnce (cyclomatic 16): reviewtransaction.scanLegacyAuthorityRepairOnce has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validateClassifiedAuthorityRepairRequest (cyclomatic 19) 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac77e063780b521ff62a89b56e02f796af362172daaba6872c221001d4f5bdf"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.validateCompactReviewInput (cyclomatic 16): reviewtransaction.validateCompactReviewInput has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validateCompactRecoveredCorrection (cyclomatic 19) 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3973bd0bb5aa8c3adb9be10626863c85c23cc1de00cbf22cdf47154c772009d"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.inspectCompactRecoveryRecordSet (cyclomatic 16): reviewtransaction.inspectCompactRecoveryRecordSet 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":"internal/reviewtransaction/compact_inspect.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"764f189494be0281fa85bd89c2e9d04dca562719ba7e70700ea77b5b33a71976"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.parseCompactRecord (cyclomatic 16): reviewtransaction.parseCompactRecord 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"7438d2af8d424ca59a6cfbee4ac4ce078d5a19979503eb189f28b7376f2a8e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.forensicHistoricalCompactRecord (cyclomatic 16): reviewtransaction.forensicHistoricalCompactRecord 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ca6871c9bba97dccb6c98ab0e7703270309fb84f519a0957a4949a30e07f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.replayCommittedLegacyAliasRepair (cyclomatic 16): reviewtransaction.replayCommittedLegacyAliasRepair 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":"internal/reviewtransaction/legacy_alias_repair.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2a2615f44ecfb0451ffd9ee1f3c3d42030a1f531e44002c26dbf71eee17f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.repairPrivateRARDirectoryNoFollow (cyclomatic 16): reviewtransaction.repairPrivateRARDirectoryNoFollow 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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"507c5dfa1b2f986d45cddb18db581c9922a359f2f5f4d06efbfaaf0e0b59d5a0"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.readReviewRepositoryControlPayload (cyclomatic 16): reviewtransaction.readReviewRepositoryControlPayload 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5421257b15c220827c4e585384ba012deb214c1ae1d942cbcbec23ec0ff7d244"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.inventoryLock (cyclomatic 16): reviewtransaction.inventoryLock has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/status.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df54e744c1b423d6ad769abafebf865ba3dcc88549ec23c96cf2af79d9d64a1"}},{"ruleId":"D1","level":"warning","message":{"text":"reviewtransaction.selectorlessCommittedBaseDiffCorrections (cyclomatic 16): reviewtransaction.selectorlessCommittedBaseDiffCorrections 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4732e822da8108b6ff6e8aeaf4b3ccd1398e9ecf257c2d91f171e4e27aa6e9da"}},{"ruleId":"D1","level":"warning","message":{"text":"authorityRepairScan.run (cyclomatic 16): authorityRepairScan.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: reviewtransaction.validateClassifiedAuthorityRepairRequest (cyclomatic 19) 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa8baf0f152cca4ff741909b170241eaf28a8f1a0912ac225a2424f9bdffe3"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction.CompleteFix (cyclomatic 16): Transaction.CompleteFix 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: reviewtransaction.pristineReviewing (cyclomatic 22) 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1cf9c9526a69280805cc371a8f12a58d3662726d90b88ce72d911305993180"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userSetAsideAgentTools (cyclomatic 16): shellinstaller.userSetAsideAgentTools has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: shellinstaller.userReadAgentToolsRecord (cyclomatic 17) 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":"internal/shellinstaller/user_agent_tools_unix.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a04cc439c42e1401128cafb5d4669523f526d69a7163ffc744396ccb5f9e9"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userExperienceSupported (cyclomatic 16): shellinstaller.userExperienceSupported 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":"internal/shellinstaller/user_experience_selection.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b71324fa008956813884d7f1de2ff4619b40ae3951ab12f79f084ddc7bbf30"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userPruneRemovedBackup (cyclomatic 16): shellinstaller.userPruneRemovedBackup 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":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6c917b131f7fc9fa534fb4b97524faaf46bdffb46b0c823597480c3e657fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userRecordUnit (cyclomatic 16): shellinstaller.userRecordUnit 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":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7c1bb6344da55cc984ed91aed7be2f77bc3beb7a3af2b95cfef870e986ab4a"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userReuseSDKState (cyclomatic 16): shellinstaller.userReuseSDKState 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":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e63ecfe382a13aedd9c10a0fa6aab5ef941f58021f93bf1aa0d507594fb8d93"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userCompareMainSourceCached (cyclomatic 16): shellinstaller.userCompareMainSourceCached 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":"internal/shellinstaller/user_main_source_cache_unix.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de37d02a8e62f7693fe7b5347a84f661aaa172c0a2a3074aac371a120629d69"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsAcquireNetwork (cyclomatic 16): shellinstaller.userWindowsAcquireNetwork has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"47870c8dc7f3ff99f52c5b491c57dee3351b9c3bfa19cf498cf9d64736a778dc"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsZIP (cyclomatic 16): shellinstaller.userWindowsZIP 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":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b924137d7fc26ed397d2fc02249cd2261892f3437f17a506ed51ec1ea8a8aa"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsPruneRemovedBackup (cyclomatic 16): shellinstaller.userWindowsPruneRemovedBackup 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":"internal/shellinstaller/user_install_cleanup_windows.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a0d6f3c7654e9ca9174e43af32fec58dd04e45b325262b9856ae7bb43ccbcd"}},{"ruleId":"D1","level":"warning","message":{"text":"shellinstaller.userWindowsJobQuiesce (cyclomatic 16): shellinstaller.userWindowsJobQuiesce has cyclomatic complexity 16 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_process_windows.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50cdcc6ab0fcb8cbee69fbb161a122eb6a19ff2944995c297ee6378687416a"}},{"ruleId":"D1","level":"warning","message":{"text":"userNativeSlice.read (cyclomatic 16): userNativeSlice.read 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":"internal/shellinstaller/user_native_slice_linux.go"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3e6ac831b50adbfea4bba33828bc9146d942461e1da926052a13338f86f41b"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.ParseClaudeTranscriptTail (cyclomatic 16): telemetry.ParseClaudeTranscriptTail 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":"internal/telemetry/runtime_claude.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d92ccaf276f3b11cc90e00c63e356fb9871f09d7ce995a6b6a52657d8dabf0"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.ResolveCodexAgentType (cyclomatic 16): telemetry.ResolveCodexAgentType 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":"internal/telemetry/runtime_codex.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb84a3e2a830a909a81e4ca56d29b9fc01d3830aed2b0ca66a9d429c4e11a683"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.codexTranscriptEvidence (cyclomatic 16): telemetry.codexTranscriptEvidence 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":"internal/telemetry/runtime_codex.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f073ffde319ae52f00581b40c5fc9d0a9b06eac549213ac1ca936c6d6099f5e6"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.RenderDetection (cyclomatic 16): screens.RenderDetection 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":"internal/tui/screens/detection.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8658ccfc014357c49036c87b3efe82b15c9f325649f3f6c71865c47c770e48cb"}},{"ruleId":"D1","level":"warning","message":{"text":"screens.RenderUserInstallDestination (cyclomatic 16): screens.RenderUserInstallDestination 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":"internal/tui/screens/user_install_destination.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da347a59532547cc6e661c15da2156e811eb230b7c7d9ef278af1eaf4343962"}},{"ruleId":"D1","level":"warning","message":{"text":"upgrade.Download (cyclomatic 16): upgrade.Download 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":"internal/update/upgrade/download.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7e1747f282ff2c816ae1c2af58a206f81ed74b1b5b8b429df7a18d1055cec7"}},{"ruleId":"D1","level":"warning","message":{"text":"opencode-review-transport.startRelay (cyclomatic 16): opencode-review-transport.startRelay has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 219, 247, 250). 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":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"61004b4b59d1f0b52ad13a0d08d2622fe5f63a7e2be0984e632ba29377221188"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runReviewStatus (cognitive 684): cli.runReviewStatus has cognitive complexity 684 (threshold 15). Drivers by points: if/else 165 (583 pts), boolean chains 75, match/switch 2 (16 pts), loops 2 (10 pts) (nesting depth added 440). 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":"internal/cli/review_facade.go"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c7d151df679275b4682f383742e8a3288e5abe6d7f940c9f8a6527361c6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.confirmSelection (cognitive 358): Model.confirmSelection has cognitive complexity 358 (threshold 15). Drivers by points: if/else 117 (284 pts), match/switch 17 (37 pts), boolean chains 26, loops 3 (11 pts) (nesting depth added 195). 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":"internal/tui/model.go"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dfa6f9053025069088f1a3cb50d4849ea18295702c133e278e97453b7d0bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.handleKeyPress (cognitive 238): Model.handleKeyPress has cognitive complexity 238 (threshold 15). Drivers by points: if/else 81 (201 pts), boolean chains 18, loops 3 (14 pts), match/switch 3 (5 pts) (nesting depth added 133). 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":"internal/tui/model.go"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f2fb11a3717440335f961765bcfab011b1831b6e63558f9d5d93092f040df1"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewNextTransition.Validate (cognitive 235): ReviewNextTransition.Validate has cognitive complexity 235 (threshold 15). Drivers by points: if/else 50 (158 pts), boolean chains 51, loops 7 (21 pts), match/switch 2 (5 pts) (nesting depth added 125). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b897a0a601f8c049b6712ce69b9b5dc0eae8f7fbfd4e5a494f0427ad95ce63"}},{"ruleId":"D2","level":"warning","message":{"text":"componentApplyStep.Run (cognitive 220): componentApplyStep.Run has cognitive complexity 220 (threshold 15). Drivers by points: if/else 68 (192 pts), loops 11 (24 pts), boolean chains 3, match/switch 1 (nesting depth added 137). 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":"internal/cli/run.go"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc8148cf27f043f901126455119b755a0f930cab8b55eaa5f83a1d4871ada9"}},{"ruleId":"D2","level":"warning","message":{"text":"persona.injectInternal (cognitive 204): persona.injectInternal has cognitive complexity 204 (threshold 15). Drivers by points: if/else 74 (174 pts), boolean chains 25, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 102). 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":"internal/components/persona/inject.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1f6a57ba9572df0e33fb98859750a9539e68b25ccd1d01ccda17f52cf4ce48"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.componentPathsWithWorkspaceScoped (cognitive 160): cli.componentPathsWithWorkspaceScoped has cognitive complexity 160 (threshold 15). Drivers by points: if/else 40 (138 pts), loops 4 (10 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 109). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af0216f14d1f6dbbd287de74862eddac5a65e8bc3ca6dcbafe918550f297d40"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userRunInstall (cognitive 155): shellinstaller.userRunInstall has cognitive complexity 155 (threshold 15). Drivers by points: if/else 96 (138 pts), boolean chains 15, loops 1 (2 pts) (nesting depth added 43). Of this number, 153 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7347d6a4b7d458ff15d78f675f173cbac368c308c150886fbef160d9c7819d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.syncBackupTargetsScoped (cognitive 144): cli.syncBackupTargetsScoped has cognitive complexity 144 (threshold 15). Drivers by points: if/else 35 (81 pts), loops 30 (56 pts), boolean chains 7 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca1d2cce09a1364f01f8e5567e249234115c6342b0a353fd83ba8f86dbd6d40"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTargetStatusResult.validateWithCompactAuthority (cognitive 129): ReviewTargetStatusResult.validateWithCompactAuthority has cognitive complexity 129 (threshold 15). Drivers by points: if/else 44 (79 pts), boolean chains 41, match/switch 6 (9 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"285e2d19092eff4aa144c1d595d1519cd6252787aa5279463a785b0356fd0e88"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.buildPlan (cognitive 129): Service.buildPlan has cognitive complexity 129 (threshold 15). Drivers by points: if/else 30 (67 pts), loops 24 (51 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 66). Of this number, 125 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4b8b61a9b5dc4a6d7ea7214289e0302a644b1144bf22af3e41da6bc23df1f3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.installBackupTargets (cognitive 117): cli.installBackupTargets has cognitive complexity 117 (threshold 15). Drivers by points: if/else 27 (63 pts), loops 26 (51 pts), boolean chains 3 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4066}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33c30d650ae344d0a308cec2579011e36c5c0acdfa9b9fdaf9a5c570a173d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.configureShellExperience (cognitive 115): Model.configureShellExperience has cognitive complexity 115 (threshold 15). Drivers by points: if/else 41 (97 pts), boolean chains 11, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_experience.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"248835ac339d07a9c8a0b24e997f89e2471ae87898ab30004b90833fdf38d58e"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.Update (cognitive 112): Model.Update has cognitive complexity 112 (threshold 15). Drivers by points: if/else 43 (91 pts), boolean chains 16, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad615399cb9e1b3957c8bc63c7514db6843f54b892fdc9ea6d9a9bff3a0715b"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewCaptureResult (cognitive 110): cli.RunReviewCaptureResult has cognitive complexity 110 (threshold 15). Drivers by points: if/else 55 (94 pts), boolean chains 16 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ded52f9525c3d0290f86887f416b5732b1bcddf3f8551931e295eb8b9631224"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewRecover (cognitive 110): cli.RunReviewRecover has cognitive complexity 110 (threshold 15). Drivers by points: if/else 55 (72 pts), boolean chains 35, match/switch 2 (3 pts) (nesting depth added 18). 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":"internal/cli/review_facade.go"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5d54d5ad98361ef097816ad5f08df29332c3dd3d24750ecbf258db76c9a082"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactState.CompactReviewView (cognitive 107): CompactState.CompactReviewView has cognitive complexity 107 (threshold 15). Drivers by points: if/else 28 (71 pts), boolean chains 24, loops 6 (8 pts), match/switch 2 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ad07f3b89e95458a371951ad12bc543341e8f930ff06c172e61df773b61db"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runReviewFacadeStart (cognitive 106): cli.runReviewFacadeStart has cognitive complexity 106 (threshold 15). Drivers by points: if/else 66 (92 pts), boolean chains 14 (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":"internal/cli/review_facade.go"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47be11b86e3f7bb916a9f39805cb3e555bb923d14cc44ed8723f6e3a3a3f659"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validateReviewTransitionExecution (cognitive 106): cli.validateReviewTransitionExecution has cognitive complexity 106 (threshold 15). Drivers by points: if/else 24 (52 pts), boolean chains 36, loops 8 (14 pts), match/switch 2 (4 pts) (nesting depth added 36). Of this number, 97 points are the body\u0027s own statements and 9 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eba206ebeff2214dfe55957140dde6ca1e72d40007ba5394fbd9640faa8b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewIntegrationStartResult.Validate (cognitive 104): ReviewIntegrationStartResult.Validate has cognitive complexity 104 (threshold 15). Drivers by points: if/else 38 (57 pts), boolean chains 40, match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_start_contract.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebf63566d0e4c8ae797cf642eb9abc27de5ec1d196df4ad051544a993e56511"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateSuccessor (cognitive 102): reviewtransaction.validateSuccessor has cognitive complexity 102 (threshold 15). Drivers by points: if/else 48 (63 pts), boolean chains 39 (nesting depth added 15). 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":"internal/reviewtransaction/store.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"865bdd50d412ca95658d9ea5214b8346370f27ae9b33427ff024a1510a6ed61e"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.resolveReviewNextTransition (cognitive 101): cli.resolveReviewNextTransition has cognitive complexity 101 (threshold 15). Drivers by points: if/else 35 (80 pts), boolean chains 18, match/switch 2 (3 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_next_transition.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac14dc63299762b87d9fc34125acf2573f81ee05caa2729bdbc9d6994f1337c7"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.assessTargetStatusSnapshot (cognitive 101): reviewtransaction.assessTargetStatusSnapshot has cognitive complexity 101 (threshold 15). Drivers by points: if/else 34 (70 pts), boolean chains 21, loops 4 (6 pts), match/switch 2 (4 pts) (nesting depth added 40). Of this number, 100 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bf07205ea703f63af7d75a852602ed526a955780119f4f995808edf945702c"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.injectWithOptions (cognitive 100): engram.injectWithOptions has cognitive complexity 100 (threshold 15). Drivers by points: if/else 39 (83 pts), boolean chains 14, match/switch 2 (3 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cefc3e6839d3e33a190cd93c86ed5c506c3484ba645b31d7ebd7504aebfdb5"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTargetStatusResult.validateNextTransitionTargets (cognitive 99): ReviewTargetStatusResult.validateNextTransitionTargets has cognitive complexity 99 (threshold 15). Drivers by points: if/else 32 (68 pts), boolean chains 25, match/switch 2 (5 pts), loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f09bd28bf7273d75e47fc69d9379923f6ba8a3b6c4a77db12f83eacc0a7c45a"}},{"ruleId":"D2","level":"warning","message":{"text":"componentSyncStep.Run (cognitive 98): componentSyncStep.Run has cognitive complexity 98 (threshold 15). Drivers by points: if/else 33 (79 pts), loops 8 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6754f035b8dab99827f03115f753ed66c410d23a4b1cb752fe471deabfd235de"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewRepairResult.Validate (cognitive 93): ReviewRepairResult.Validate has cognitive complexity 93 (threshold 15). Drivers by points: if/else 23 (63 pts), boolean chains 20, loops 2 (7 pts), match/switch 2 (3 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_repair.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd60a80e23321b0be41c9e20f6c4fe0eb8d8375938b4cf72bc847124f81b54"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTargetStatusResult.validateSubmissionDescriptors (cognitive 93): ReviewTargetStatusResult.validateSubmissionDescriptors has cognitive complexity 93 (threshold 15). Drivers by points: if/else 31 (71 pts), boolean chains 10, loops 5 (8 pts), match/switch 2 (4 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba8e140b8e58b1cb86319fae0a43aad16cfff81b46a957d37a837cc28f30fec"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.newReviewIntegrationFailure (cognitive 88): cli.newReviewIntegrationFailure has cognitive complexity 88 (threshold 15). Drivers by points: if/else 48 (76 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_operation_contract.go"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3fb6a5bd3688dc9716e8c0cde1c094140fdac2145982c26a93ab3bf39f7a56"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.validateFindingState (cognitive 84): Transaction.validateFindingState has cognitive complexity 84 (threshold 15). Drivers by points: if/else 28 (59 pts), boolean chains 17, loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f5162773d9d9d3c10ad1ca50172cbc2b533135f1928aac903026d073fdc68d"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.AdmitArtifact (cognitive 82): reviewtransaction.AdmitArtifact has cognitive complexity 82 (threshold 15). Drivers by points: if/else 36 (63 pts), loops 7 (9 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c621113ce264ed27c64e512f7a6f028ae7ba8d27061f08dbdc62399ac8f149"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactState.Validate (cognitive 81): CompactState.Validate has cognitive complexity 81 (threshold 15). Drivers by points: if/else 47 (60 pts), boolean chains 19, match/switch 1 (2 pts) (nesting depth added 14). 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"32246adee90c58c83c5336f641b780dcf89d84fd987d63b728b2c571a69be5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"app.RunArgs (cognitive 80): app.RunArgs has cognitive complexity 80 (threshold 15). Drivers by points: if/else 35 (66 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 32). Of this number, 79 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":"internal/app/app.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a25204c0e5b3ca0ca2b8ff01a091b87833246899ac9a9ed728f484532b0ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunSync (cognitive 80): cli.RunSync has cognitive complexity 80 (threshold 15). Drivers by points: if/else 35 (55 pts), boolean chains 13, loops 6 (12 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":"internal/cli/sync.go"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4375c26fe7442c5ea78b87d06a29be4ab0a0aa96b4ca6e8a5ae56ea604fa50d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewIntegrationFailure.Validate (cognitive 80): ReviewIntegrationFailure.Validate has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 30, loops 2 (4 pts), match/switch 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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e53a9d4326e9d94acf7acb6aab3d1f141edb760a0695b9ab394c0619635482"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactCorrection (cognitive 80): reviewtransaction.validateCompactCorrection has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (52 pts), boolean chains 26, loops 1 (2 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98374bd066b4fad25e20ec3778a72a797e2fb68ccf7283237065761700e87fb"}},{"ruleId":"D2","level":"warning","message":{"text":"agentRoutingGuidanceStep.Run (cognitive 78): agentRoutingGuidanceStep.Run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 42 (64 pts), boolean chains 14 (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":"internal/cli/run.go"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de5d7ea4296102a7530850e8f77d7f87c555aa55c3ed47784d93318ab306ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.append (cognitive 77): Store.append has cognitive complexity 77 (threshold 15). Drivers by points: if/else 42 (72 pts), boolean chains 5 (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":"internal/reviewtransaction/store.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"85850c52ce857dbdb3bbd6ecfbbbbe3c60925219b85f9fc1260832c6c75a163d"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.goBack (cognitive 77): Model.goBack has cognitive complexity 77 (threshold 15). Drivers by points: if/else 45 (65 pts), boolean chains 8, match/switch 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":3685}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e64c6a60ed6713f6c62a05cef70aa41643c1243b24787034c14303fe92e26c"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runPostSyncVerificationWithState (cognitive 75): cli.runPostSyncVerificationWithState has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (56 pts), loops 6 (13 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 45). Of this number, 54 points are the body\u0027s own statements and 21 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbc4576621c9d19162d17d01912708845224f353f20f317ab914591866d34be"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runReviewRepair (cognitive 74): cli.runReviewRepair has cognitive complexity 74 (threshold 15). Drivers by points: if/else 37 (60 pts), boolean chains 9, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_repair.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89481b58f8d4be6927494e8c05552fcc76725ccfb3c5b3e862211afbf51929"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactRecoveryEdge (cognitive 74): reviewtransaction.validateCompactRecoveryEdge has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (59 pts), boolean chains 12, match/switch 2 (3 pts) (nesting depth added 36). Of this number, 73 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb05589c279a66ab61477f6a28b6b845b67351cde36b508d90daa56ec560d90"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.componentOperations (cognitive 72): Service.componentOperations has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (46 pts), loops 8 (17 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 36). Of this number, 71 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":"internal/components/uninstall/service.go"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae96da85f577aabc9226262b4c934291617594c9279a28b647b58c9eb889c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.validate (cognitive 68): Transaction.validate has cognitive complexity 68 (threshold 15). Drivers by points: if/else 37 (48 pts), boolean chains 17, loops 2, match/switch 1 (nesting depth added 11). 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f412206885f94bae4ccd490c9673dead36fbcd0cc4c3f0a2a947d0935504ee"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.InstallWithOptions (cognitive 66): communitytool.InstallWithOptions has cognitive complexity 66 (threshold 15). Drivers by points: if/else 33 (51 pts), boolean chains 11, loops 2 (3 pts), match/switch 1 (nesting depth added 19). Of this number, 64 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/tool.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f48e47471809b6fb4b49165ee5470995fa7c9f92d37c27c9cdf6be3fb984198"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.ReadYAMLMCPServerCommand (cognitive 66): filemerge.ReadYAMLMCPServerCommand has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (49 pts), boolean chains 10, loops 5 (7 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/yaml.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcc992b7a03013888646a7a6c5b3d589236064fc4052aa90126934f82b1225b"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactSuccessor (cognitive 66): reviewtransaction.validateCompactSuccessor has cognitive complexity 66 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 23, match/switch 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f27192f2bf348e076bacf14e475af222a7f18e631fe132e2ac34edb8be07f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.updateShellInstallRun (cognitive 66): Model.updateShellInstallRun has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 2 (7 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bf1b241ffbbe5fae836aecccf6c647aefe1ae6e6d136eefc6b0fda8e859036"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.RecoverCompactAuthority (cognitive 64): reviewtransaction.RecoverCompactAuthority has cognitive complexity 64 (threshold 15). Drivers by points: if/else 40 (50 pts), boolean chains 13, loops 1 (nesting depth added 10). 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd04a5af08c3a941fb2d68a287fcb5ce8eda3fb200cacefae38a1879b8f73f"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.ReconcilePiCodeGraph (cognitive 63): communitytool.ReconcilePiCodeGraph has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (55 pts), boolean chains 6, loops 2 (nesting depth added 22). Of this number, 60 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aba4628aab2f3449dd009bcacac28cd2edc7d3cafc276367281bcb22cfe31f"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.executePlan (cognitive 62): Service.executePlan has cognitive complexity 62 (threshold 15). Drivers by points: if/else 32 (56 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eaf04ecd64ea06b68c50b31c1424a33b89131a9448e0f66f1ac7b8e73ebd13"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.overlayConfiguredProviders (cognitive 62): opencode.overlayConfiguredProviders has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/config_v2.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc1bd6679b20892b43a9a2bf2d2fa5b3fd065d448ed0baa3ccbc7fdce9b2a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactState.EscalationEvidence (cognitive 62): CompactState.EscalationEvidence has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (53 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7704b420b0e6f12b1a8b9b665732ab6c601d29b2df053079497f92c5edad3e"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.processBoundaryRiskReasons (cognitive 62): SnapshotBuilder.processBoundaryRiskReasons has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 8 (14 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"211eaad3d04854d6cd7d745ab39cf84487be90c67cc58f929372ad54803d24c0"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.StageNativePNPMInstallation (cognitive 62): shellinstaller.StageNativePNPMInstallation has cognitive complexity 62 (threshold 15). Drivers by points: if/else 30 (55 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 26). Of this number, 17 points are the body\u0027s own statements and 45 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e20d0cf8b225790d7e8800c6829e35e3f3db0ed590c7788962488a84db4e63"}},{"ruleId":"D2","level":"warning","message":{"text":"releasepolicy.validateArtifacts (cognitive 60): releasepolicy.validateArtifacts has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 11, loops 5 (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":"internal/releasepolicy/policy.go"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6790c02cf4b1311f2d046052bebeda4208afcf5c40ea0f3121960260d0bea297"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.buildCurrentChanges (cognitive 59): SnapshotBuilder.buildCurrentChanges has cognitive complexity 59 (threshold 15). Drivers by points: if/else 32 (52 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa89991d8e55b96e5af6b9d0e81ab285cb5488c5441f43da92689c7ec63ac2df"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.RemoveLegacyOpenCodeAgentMarkers (cognitive 58): filemerge.RemoveLegacyOpenCodeAgentMarkers has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (37 pts), loops 7 (13 pts), boolean chains 8 (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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe44fa8047f415ad02d537a2094f676d3487b0d55cf6842f3d12c3db8791205"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewassets.InstallNativeAgents (cognitive 58): reviewassets.InstallNativeAgents has cognitive complexity 58 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 8, loops 5 (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":"internal/components/reviewassets/install.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a8fd8518439413c3cdb3bc13590913357e1fbf58d815c9980af1eaf1658639"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.loadCompactTargetStatusCandidates (cognitive 58): reviewtransaction.loadCompactTargetStatusCandidates has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status_projection.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f98d6d434eb7daa7965be2659b8a09d60634ce3cf605af95a2bea32a612d14"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.build (cognitive 57): SnapshotBuilder.build has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (46 pts), boolean chains 10, match/switch 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f24bc832c6106296b650c859d36b3d9e1ddcc1b8d4027e2e14ddb6a84d9e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userValidateInstall (cognitive 55): shellinstaller.userValidateInstall has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 14, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1b1f71a4271e7761a28affd05bc854f49556c0c0bffc2458eb60827f551d72"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreService.restoreCompressed (cognitive 54): RestoreService.restoreCompressed has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (45 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5283113035f14db2c8b5a4a2f1a241c6cb6ce8247420b55529220f9309def3"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.topLevelJSONCPropertyValueRange (cognitive 54): filemerge.topLevelJSONCPropertyValueRange has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 7, loops 2 (6 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd7ef4346df2907b22dac9d61413899649e495ffda76c8ae8a140c7fabed8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userAgentPreflight (cognitive 54): shellinstaller.userAgentPreflight has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (42 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d0a1b2310e02dd2b0f1ff21fbfe934ed446515ed145a4af462f6ec054da753"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.topLevelJSONCKeyCount (cognitive 51): filemerge.topLevelJSONCKeyCount has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (42 pts), boolean chains 8, loops 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec33c7275b2be7cc756b60dcd247108df12df536b92a10c08f27e54466fb480"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.removeOpenCodeFamilyAgents (cognitive 51): uninstall.removeOpenCodeFamilyAgents has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 21). None of this is in the body itself: all 51 points belong to one function literal inside it that branches (line 51). 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":"internal/components/uninstall/opencode_agents.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1e8d9e0981288d61f0f5730c041de7fb1d2bf68bb06fb7f4457114dedb795f"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.UpsertYAMLMCPServerBlock (cognitive 50): filemerge.UpsertYAMLMCPServerBlock has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 5 (7 pts), boolean chains 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/yaml.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3781a75b7b7c97cd5fdf6ef1693f110f8ba5e6168573bf77673be65b031db39e"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.lockedAuthorityDispositionMutation (cognitive 49): reviewtransaction.lockedAuthorityDispositionMutation has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 3 (4 pts), boolean chains 2 (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":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7047b213d9e7cc81369f0f96112eeb1a5809bc14d160345c91a43ea537ed527b"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ensureRARDirectoryChain (cognitive 49): reviewtransaction.ensureRARDirectoryChain has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (45 pts), boolean chains 3, loops 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e468a17fc67f27f3081858042d9808c226399f7b9669c226c82914a745428a"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userCodeGraphReadbackWithNode (cognitive 49): shellinstaller.userCodeGraphReadbackWithNode has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 8 (11 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":"internal/shellinstaller/user_codegraph_admission_unix.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1320db3b64ccda16ca2b59c13ad05d62215610a1e3a63f5f4857c2de0a144c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.validateFindingRouting (cognitive 48): Transaction.validateFindingRouting has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 8, loops 5, match/switch 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a641f825ca49e44c6e501e079245d6f51b00bc44356b0ed989b8d1f294e3d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userNativeMountsData (cognitive 48): shellinstaller.userNativeMountsData has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 7, loops 5 (6 pts) (nesting depth added 18). Of this number, 39 points are the body\u0027s own statements and 9 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":"internal/shellinstaller/user_native_guard_linux.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4821a1ee289a02f7b06afaf0ff6272e5eb1e944f75ec26270e4dfb778fd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runReviewInspectCandidate (cognitive 47): cli.runReviewInspectCandidate has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 10, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_inspect_candidate.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b7252d3fa135d1bb82b2dd59587e417ad5e9d9acd951633e79ba6e1d7811c4"}},{"ruleId":"D2","level":"warning","message":{"text":"shellInstallModel.Update (cognitive 47): shellInstallModel.Update has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 3, match/switch 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":"internal/cli/shell_install_model_other.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f3a5a7ec14757b825f5f7dfeebf0ed7b61b64ffb21f982c62c428fc0c08c43"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.removeSkillRegistryHook (cognitive 47): uninstall.removeSkillRegistryHook has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (38 pts), loops 4 (7 pts), boolean chains 2 (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":"internal/components/uninstall/service.go"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"18eec126df4c9c220c55c5ee9ed5417131d1c82565ef81ba7296c3bffac9cf96"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.markCompactGraph (cognitive 47): reviewtransaction.markCompactGraph has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 7 (13 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/status.go"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f600d8b84a6a96a4c213f361ff83c632631c5afb21efb5b7750eee897c69fa2"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.ApplyUserExperiencePreferences (cognitive 47): shellinstaller.ApplyUserExperiencePreferences has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 2, loops 1 (nesting depth added 17). Of this number, 36 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_apply_unix.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce7cdd0921a154764592da5cb721f883e10d14f543cae7893af2895651ec2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderShellInstall (cognitive 47): screens.RenderShellInstall has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 7 (14 pts), boolean chains 6, match/switch 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":"internal/tui/screens/shell_install.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e133df41bba0af590617354ce7b840f33a776496151fd7a77507740e211926dd"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.checkStateJSON (cognitive 46): cli.checkStateJSON has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (44 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc8862eec8a9077f058a5cb0144c4942ac1fea65f02abef6bceb10ebdc59034"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.scanJSONCValueEnd (cognitive 46): filemerge.scanJSONCValueEnd has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 5, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"383c69d6e844ef9ddd1c64af3cb41995d554605f37cff5551963e7b06d4a91dd"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validateReviewStartBinding (cognitive 45): cli.validateReviewStartBinding has cognitive complexity 45 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 6, match/switch 2, 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":"internal/cli/review_facade.go"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dd1b04fff30eb32842e9b5926a43de731195348617df5e15d9dbb116ce0330"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.InjectStrictTDDWithOptions (cognitive 45): agentguidance.InjectStrictTDDWithOptions has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 5 (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":"internal/components/agentguidance/strict_tdd.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d2907e84581e0032a38731e520de2ad91a3e5ff5e57e6954076d7946d14b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.stdioHandshake (cognitive 45): engram.stdioHandshake has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 21). Of this number, 41 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/healthprobe.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcea814df562ac20f965b1decdda530bd4e8f8f41e46730c5b82d5e31d5b1dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.RetireSDDAssets (cognitive 45): legacyassets.RetireSDDAssets has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 7, loops 4 (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":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95fa46493e9bd5811ba6f9b43f04e3948dfe4142469e786388c73101e715068"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactRepositoryEvidence (cognitive 45): reviewtransaction.validateCompactRepositoryEvidence has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 6, match/switch 1 (3 pts), loops 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"003a2400b4560141136cdced284ec228e649ac5e88f3a747247c9ae3ce8d308a"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userCodeGraphMembers (cognitive 45): shellinstaller.userCodeGraphMembers has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 8, loops 4 (6 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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"59acac9ceefeec20b871e345dc6ecfa0bdc558f5919ae28c40cb89c35af16078"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.prepareCompactReviewerResults (cognitive 44): cli.prepareCompactReviewerResults has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":3185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0070e674a480da36b561b221857760a692d2d518d268569667abbd38ce83d73"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validateReviewStartRiskReasons (cognitive 44): cli.validateReviewStartRiskReasons has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 11, match/switch 1 (2 pts), 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":"internal/cli/review_start_contract.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa901254b6dd0cf9c7e83af112496c8aa426a358f75322eb9906d0e6b1a89c2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runSyncWithSelectionScope (cognitive 44): cli.runSyncWithSelectionScope has cognitive complexity 44 (threshold 15). Drivers by points: if/else 27 (36 pts), boolean chains 5, 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":"internal/cli/sync.go"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cb11168299e22127734a5342a95c1d777c3373b2a864e52d97f9bfca5b93ea"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.topLevelJSONCObjectEnd (cognitive 44): filemerge.topLevelJSONCObjectEnd has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (38 pts), boolean chains 5, 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"620e56940c6047bd5422ac529c7f6f4616203b6bd2fb9b3265b7bc8a33ebef23"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userUnixOverlaySelectSDK (cognitive 44): shellinstaller.userUnixOverlaySelectSDK has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 7, loops 3, match/switch 1 (2 pts) (nesting depth added 8). Of this number, 42 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: 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":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686771318fc36635cf13f71520523ac0c19b8df6581b40dc1588e8579b81c39"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userRestoreAgentImages (cognitive 44): shellinstaller.userRestoreAgentImages has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 5, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). Of this number, 43 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":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35f2f34d5de8a6c9010837f7bcd16f4da97c6a6226dccdb430ffbd98f2baf74"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.NormalizeOpenCode (cognitive 44): telemetry.NormalizeOpenCode has cognitive complexity 44 (threshold 15). Drivers by points: if/else 31 (39 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_opencode.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba4a97658c4235a5dd24aacfaa721d8c3d740fb25a8cb63f13090a2a2890498"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderWelcomeWithInstaller (cognitive 44): screens.renderWelcomeWithInstaller has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28 (37 pts), boolean chains 7 (nesting depth added 9). Most of this is not in the body itself: 6 of the 44 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 90, 164, 84). 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":"internal/tui/screens/welcome.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac10777fccabd06bf5c91795bcc4794ee68b0172c7bd18533973aee2a8ea75c"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.RetireSDDAgents (cognitive 43): legacyassets.RetireSDDAgents has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 7 (11 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/sdd_agents.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8ccc16180f5c7ecb4f58c06674969f37a7ab8969c02921d04c69e773d6de47"}},{"ruleId":"D2","level":"warning","message":{"text":"providercontractbundle.validateEntries (cognitive 43): providercontractbundle.validateEntries has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 3, loops 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":"internal/providercontractbundle/bundle.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab982b5879b7f0ec137e4cfad65f8c6ed6c38bc84e3222219de924ccc6ce7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.updateShellInstall (cognitive 43): Model.updateShellInstall has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 10, match/switch 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":"internal/tui/shell_install.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d96793cad28c0e73b40ea44f45a5df137dc281c64dea0095678c80784e5e32"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.removeJSONCMember (cognitive 42): filemerge.removeJSONCMember has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 16, loops 2 (3 pts), 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":"internal/components/filemerge/jsonc_members.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb31237d02d0d78fc062cf2fe59cc0664b9f244dd4af3c13a866a29d21cadf94"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.activePassiveContentPaths (cognitive 42): SnapshotBuilder.activePassiveContentPaths has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 9 (16 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bda5532429d1c1b9ce331c87c077c7c24d17dda990f7d0dcc5af6cb97fc69de"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.CheckUserShellUpdate (cognitive 42): shellinstaller.CheckUserShellUpdate has cognitive complexity 42 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_update_unix.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d5aef1c248344b28055e48318b62046df468b7cd32e207d26a313785cbc08"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTargetStatusResult.validateSelectorNextTransition (cognitive 41): ReviewTargetStatusResult.validateSelectorNextTransition has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 17, loops 2, 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ea316b41e7ea9f7c630444590bbf231a0627f3ba29aacf750fba530adb6e62"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.SetCloneLocalRDDMode (cognitive 41): reviewtransaction.SetCloneLocalRDDMode has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 12 (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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ede64a7d0d2767542bba5b4220db881b0b55e62e5f940b492eff94362da455f"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userReadRecordedManifest (cognitive 41): shellinstaller.userReadRecordedManifest has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 5, 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5913a552ddd8e924a56a88cfb54325307a5949bc1c4ad45a5be5bbb7d9362474"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactAdmittedRoleResults (cognitive 40): reviewtransaction.validateCompactAdmittedRoleResults has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 9, match/switch 2 (4 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ba84b7e31332541b25fb3a5c0dfcfcb929d384dd9f114c8d2dfa98029b686f"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.replaceContextGuarded (cognitive 40): CompactStore.replaceContextGuarded has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28 (36 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab68782b5ed59582b1d85bd86531da9ca7a479abd0a89e45b16c1d971d3cd37"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.updateShellManage (cognitive 40): Model.updateShellManage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e6eecbe738e69c100a20746eaddcebcbcc62f035196c5b847d9d0d08914112"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.RetireClaudeSDDPreflightHook (cognitive 39): legacyassets.RetireClaudeSDDPreflightHook has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/claude_hook.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76b957ab6c6045226053acc787b071384006797af37e1c4892b0c1553b82f19"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewCaptureUnachievable (cognitive 38): cli.RunReviewCaptureUnachievable has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (34 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":"internal/cli/review_capture_unachievable.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19feb2ed2d0f0c535a845cf4248b5bf928f533233cfb337d5126fc8dff64693"}},{"ruleId":"D2","level":"warning","message":{"text":"opencodeplugin.Uninstall (cognitive 38): opencodeplugin.Uninstall has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodeplugin/uninstall.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c00f14fd5615613f7d808c3ef106a16e23ab6775245b932b648b42e14d6a2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.parseVerboseCatalog (cognitive 38): opencode.parseVerboseCatalog has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 3, 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":"internal/opencode/catalog.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8028e0b142cb202aa05d3a89d32810b537bcddf82420f0c4e0c0b65548b3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivationPlan.Apply (cognitive 38): ActivationPlan.Apply has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (31 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":"internal/opencode/background.go"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"94399afb192a8660aecdb6f396fe453aff4719a8c3be5bb2da5292a5516efb08"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsCodeGraphExtract (cognitive 38): shellinstaller.userWindowsCodeGraphExtract has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 6 (7 pts), boolean chains 6 (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":"internal/shellinstaller/user_codegraph_windows.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6551fb7cbc424cfea43fc473a7164007c52a4cb2622a69f572dbb51844ac4686"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.shellInstallView (cognitive 38): Model.shellInstallView has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (30 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":"internal/tui/shell_experience.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"558c989c52d101d5a53cd93183384689ea2c8bb7d74b9d6e813016b018a30cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"app.persistAssignments (cognitive 37): app.persistAssignments has cognitive complexity 37 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 3 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 1057). 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":"internal/app/app.go"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0a026110c0efd523e494283677eb6cf9b48e000836d7c5521da4adadbe7b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewBundleImport (cognitive 37): cli.RunReviewBundleImport has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (35 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":"internal/cli/review.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfb89b78d18b7e8dfb9462fff446c0532cb71c765fc7fe76ddf3eb96144f526"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.newReviewIntegrationStartResult (cognitive 37): cli.newReviewIntegrationStartResult has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_start_contract.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"818c949bc0377edd2c82914408f2157169ebe823c08b7b07045334897f8698ac"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.restoreSyncFiles (cognitive 37): cli.restoreSyncFiles has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefca89f811844be120ca4a9f784d22ffad344c8f0506cf477d033fc3dbd404d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userNativeCoordinate (cognitive 37): shellinstaller.userNativeCoordinate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 29 (31 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_coordinate_linux.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1b965667d297898fa46d705d98c2c7c7b263f0919535e5359dc9f76cd3b433"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPNPMResolve (cognitive 37): shellinstaller.userPNPMResolve has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef58c27c70cd66ec393271b3fda1a527a0f952d73ae7bffab16aa49e5186c655"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseReviewProviderRoleCapture (cognitive 36): cli.parseReviewProviderRoleCapture has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 11 (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":"internal/cli/review_provider_role_capture.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0297a3eab81b951ded52c28b13390adf5dcf96284cf2eb1f97f7a02c4e17ea"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runPostApplyVerification (cognitive 36): cli.runPostApplyVerification has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 18). Of this number, 24 points are the body\u0027s own statements and 12 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d405066f17064e655e01befc8db2f46b8856b80d9f828fbee0d2c20922bd603"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.UninstallPiCodeGraph (cognitive 36): communitytool.UninstallPiCodeGraph has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 2, loops 2 (nesting depth added 11). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f2525eea0605830595aaa98c08879f2b510b84b461b3c9b34e0fca64710242"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.RetireOpenCodeSDDSettings (cognitive 36): legacyassets.RetireOpenCodeSDDSettings has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (6 pts), match/switch 2 (5 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":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b600f31601d12966d5af50bbd8b0a3fe17c5a84ce7da66ef9d316a35c7504f"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.ValidateFixDeltaResult (cognitive 36): Transaction.ValidateFixDeltaResult has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 7, 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f986357cf71a7b21f50f970271fe77b06e8c192beca2a824ebed4629163776"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageJSON (cognitive 36): shellinstaller.userStageJSON has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 11 (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":"internal/shellinstaller/user_experience_private_unix.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978015dfedd1fb094c02b4ed11f7d56889d6baafddbeacd51f37404d442113c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.privateCgroupPath (cognitive 36): shellinstaller.privateCgroupPath has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 5, 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":"internal/shellinstaller/user_runtime_primitives_linux.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"79948b2a313d05659483c8641296749ea0eeea5ac176b189caff03f2f1538266"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewInvalidate (cognitive 35): cli.RunReviewInvalidate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (31 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":"internal/cli/review_facade.go"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8240618957fbe9b22730dd43c8caa21d1174d76b06ec41d581bd5dd81fed27b1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.closeReviewOnLastCapturedLens (cognitive 35): cli.closeReviewOnLastCapturedLens has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (34 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_last_event_closure.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf13bb8d14304f444b223f745c1439b834a890766b5e7f5741b5b3303fed849"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewLensContextBlock (cognitive 35): cli.reviewLensContextBlock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 2, boolean chains 1 (nesting depth added 14). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_lens_context.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d2e849f5391320fcf8eb458ae5b25643147e8458689983cfa5353e112332dc"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunPreparedInstall (cognitive 35): cli.RunPreparedInstall has cognitive complexity 35 (threshold 15). Drivers by points: if/else 28 (30 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":"internal/cli/run.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c860ab1767b118911ce2d4a75c218f0932a96c308d23d8a40cff650b082c88"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RenderSyncReport (cognitive 35): cli.RenderSyncReport has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 14 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":"internal/cli/sync.go"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b7d27cc28d9e8a2e71686f6545812743f0bd8e37ea02d99c849f48a1952c63"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.mergeAdmittedNonLensRoleResult (cognitive 35): CompactStore.mergeAdmittedNonLensRoleResult has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 7). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"521c58bddedab7ed2cd3cfa4a28435b4c5babc23a5500fa9b77aaf39c5074c15"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.CreateOrReplayAtomicStart (cognitive 35): CompactStore.CreateOrReplayAtomicStart has cognitive complexity 35 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 2 (nesting depth added 7). 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a30a62a8a507976728b351a9abb45b2cb4582b884a48c5d62de0790b70bb5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderDetection (cognitive 35): screens.RenderDetection has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/detection.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c603f9ccbc21ef8ccafcfb4c26980cc20197325a42ca170519bbfd4bb02ad0"}},{"ruleId":"D2","level":"warning","message":{"text":"app.loadPersistedAssignments (cognitive 34): app.loadPersistedAssignments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 6 (12 pts), boolean chains 8 (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":"internal/app/app.go"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"556c949b925a654a22038c2333f956a2a06bf4e8e8f38c9c088cf201e92783e9"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.safeReviewIntegrationArguments (cognitive 34): cli.safeReviewIntegrationArguments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 1 (2 pts), boolean chains 1, 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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac757b25ff150e7146c033c02b26ab731745517f8a6293675a17cf0dc2fe957"}},{"ruleId":"D2","level":"warning","message":{"text":"agenthooks.installSkillRegistry (cognitive 34): agenthooks.installSkillRegistry has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 4, 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":"internal/components/agenthooks/skill_registry.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60c6882d84a237255703fbb17aaeae6781af839fcf2408331a4ce85e066a981"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.fetchLatestEngramVersionWithAssets (cognitive 34): engram.fetchLatestEngramVersionWithAssets has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e58a0918e1a93a27240e4884e499d1c748b5698256e0ece83839548d964fef"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.stripJSONComments (cognitive 34): filemerge.stripJSONComments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a21458050d8a15222259dba60f18ee7b0bf603c817645c46b936d094a968806"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.trailingLineCommentStart (cognitive 34): filemerge.trailingLineCommentStart has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4030dff7cea7008fd6cc4f5a77eb772d095b3bf3b5cab34fcf94d120e74f061"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.referencedSDDAgents (cognitive 34): legacyassets.referencedSDDAgents has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 7 (12 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":"internal/components/legacyassets/sdd_agents.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf633d8508d70f632b2337c4d155128c1481639c845cacaf00e91f4e3a0c823a"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.stripJSONComments (cognitive 34): uninstall.stripJSONComments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/cleaners.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"68df7cfbd1c956e89c878d7d24dc90f9e163ee77947ff48a95f500bb45d40dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.authorityRepairRoot (cognitive 34): reviewtransaction.authorityRepairRoot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"734b111118860f2f2f78d28e74c54805636c2518b6fd0147456c7fbf18c2b8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactReviewLifecycle (cognitive 34): reviewtransaction.validateCompactReviewLifecycle has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 7, match/switch 1 (nesting depth added 12). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ec52069b80e6cf7ecc3eca988d235b8b0c927c0eee7c1bd140f5b12998522"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.repairHistoricalLegacyAlias (cognitive 34): reviewtransaction.repairHistoricalLegacyAlias has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/legacy_alias_repair.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"70be31b0fba0fbd6d76d8357739c9c2b2584463fac2182d244fcb6c6e1eaff56"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ParseGateContext (cognitive 34): reviewtransaction.ParseGateContext has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 13, loops 1, match/switch 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":"internal/reviewtransaction/receipt.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffe8bd1c2a5ac3dafc0a72211c8b863617c6b2ceb8232803bf0c53160049ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsReuseComponents (cognitive 34): shellinstaller.userWindowsReuseComponents has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_scope_windows.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cd953f793e78af51f29a085c8eb5806f50093f6b3b28e853efe2efee9fbd28"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsVerify (cognitive 34): shellinstaller.userWindowsVerify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 5, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_launch_windows.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d7f91ee39c21359489f518f7800e7118a2bdc3a8e3608b21a3ecb89b751f65"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderPhaseList (cognitive 34): screens.renderPhaseList has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/model_picker.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d512e104bbb2673b3d105030d434c5db64324194172b133540aabf6b52371cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.UpsertTOMLTableKey (cognitive 33): filemerge.UpsertTOMLTableKey has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/toml.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f47bf18924a2a1a4221bc5f1625af67d1fce1cff33abea7db4e0b57b9534d4"}},{"ruleId":"D2","level":"warning","message":{"text":"startupPathModel.apply (cognitive 33): startupPathModel.apply has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_readiness.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51df693b468726378c4bdff086dbb3e89ebb0cf89134b3aef58b9b15fcfbd16"}},{"ruleId":"D2","level":"warning","message":{"text":"releasepolicy.compareYAML (cognitive 33): releasepolicy.compareYAML has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (4 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":"internal/releasepolicy/policy.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59921df38bad1f62944712a0fa95a5757050c17c99ced0544040ad9c73b1814"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.RepairClassifiedAuthority (cognitive 33): reviewtransaction.RepairClassifiedAuthority has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (33 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b8fe66582452108d10842ed1dd437afac98b431749ee7952b5c8efc6f4e460"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.isPassiveSVG (cognitive 33): reviewtransaction.isPassiveSVG has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3a813a2849f373bbef6fa9016dc7d6bfef30842a38c89ce77e1833a35cce7"}},{"ruleId":"D2","level":"warning","message":{"text":"authorityRepairScan.scanLegacy (cognitive 33): authorityRepairScan.scanLegacy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cf7ae135ea3d8e1e1f2605f6fae308a3347fb7c67855d4908d276cad8987d0"}},{"ruleId":"D2","level":"warning","message":{"text":"RARAuthorityRepository.Publish (cognitive 33): RARAuthorityRepository.Publish has cognitive complexity 33 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 2 (nesting depth added 6). Of this number, 28 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5757579aabbf15d0323c0073f3eb90782ab3e30a450d58bb652529935b409918"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.ReadNativePNPMInstallation (cognitive 33): shellinstaller.ReadNativePNPMInstallation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 7, loops 1 (nesting depth added 5). Of this number, 25 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c9a62daf7b6bad03101588bc428451151482caca6ddf36d2af3a7f503b381e"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade.managedAgentBackupPaths (cognitive 33): upgrade.managedAgentBackupPaths has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 4 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/executor.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6ffd381b2103a4936d3f37bc20b4d049a9bf3e77e51b766bb2a91e9a8f7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade.RenderUpgradeReport (cognitive 33): upgrade.RenderUpgradeReport has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 3, loops 2 (3 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":"internal/update/upgrade/render.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8bc81e59776825851480132f017e84468f50e0eef56641c237617079202b91"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.discoverCompactFacadeReview (cognitive 32): cli.discoverCompactFacadeReview has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d19c13d94a3630d26627c95fadf4b01fff776658406f75f32781d1215924da"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewLensContextParseNumstat (cognitive 32): cli.reviewLensContextParseNumstat has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_lens_context.go"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1e80413435900763033be543372deb3fc991422f71842ad5177268cff88a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.mergeObjectScope (cognitive 32): filemerge.mergeObjectScope has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 10, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e848cd8cd7c248d7a9f09a88e35cb50f8cf188c7089ebaa3e4c571b614212c"}},{"ruleId":"D2","level":"warning","message":{"text":"geminimodules.Publish (cognitive 32): geminimodules.Publish has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 5, 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":"internal/components/geminimodules/modules.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf935cf3f261d41ede0e83743763f5beeb4f2573ac147bbe5d7756d97aa84553"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.SettingsFileReferences (cognitive 32): opencode.SettingsFileReferences has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 16). Most of this is not in the body itself: 4 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 52). 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":"internal/opencode/file_references.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef52637e7b783f74450422a1c89b7ba67d370f36b26da616acf0011837d16f78"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateChainBundle (cognitive 32): reviewtransaction.validateChainBundle has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8, 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":"internal/reviewtransaction/bundle.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a53fc66e70fd93e640f3f525668405281e8a9d3280b98c36d1ca7c8e74fb94"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.inventoryLineage (cognitive 32): reviewtransaction.inventoryLineage has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/status.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99f193c44cebd50ae18ac8676c52b38acef76a603ae54d8fa23e7d59c9cb2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.DiffStats (cognitive 32): SnapshotBuilder.DiffStats has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96355579d76ebfba465b3018bc8ccc01f737d0e7ab665b7d59197c5f6303991"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.classifyVerificationStat (cognitive 32): SnapshotBuilder.classifyVerificationStat has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b06c7e09d5e1e87328b60a106d18c2a77101f752e6c9fcb5178d9e016fb8326"}},{"ruleId":"D2","level":"warning","message":{"text":"userNativeServiceCustody.captureFiles (cognitive 32): userNativeServiceCustody.captureFiles has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_service_linux.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d443a1a572f7313e88b186fb31da4f42c46c91afb38bbfe7ff29527e376fcb3e"}},{"ruleId":"D2","level":"warning","message":{"text":"skillregistry.findAllSkillFiles (cognitive 32): skillregistry.findAllSkillFiles has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/skillregistry/registry.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab64cb28b3cdcbb303627440f2e00380c4bf14d2d9bfb41fc010e62d4c9a1185"}},{"ruleId":"D2","level":"warning","message":{"text":"backfill-victoriametrics.post_chunks (cognitive 32): backfill-victoriametrics.post_chunks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (22 pts), error handling 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/telemetry/scripts/backfill-victoriametrics.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a967601ed5fd081d11869e6c85de05f710ad0f7098c95a63bb9cfaafbc2942"}},{"ruleId":"D2","level":"warning","message":{"text":"syncRuntime.stagePlan (cognitive 31): syncRuntime.stagePlan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 5 (6 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":"internal/cli/sync.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f811eb2ee6478f2c1c45ab84eba1c58308edc700367b3011c309f70fc559b0f6"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.piChildTools (cognitive 31): communitytool.piChildTools has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bac6a92293d5dbec2cf07003adb7398440c2da9042442f06db0f70921377a0"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.stripTrailingCommas (cognitive 31): filemerge.stripTrailingCommas has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2e40f20d942ff0ccc6795102e9c8ab8f4abbe94ed5a77d44faed1f1c65838f"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.InjectMarkdownSection (cognitive 31): filemerge.InjectMarkdownSection has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/section.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc7d918506850ecd8a0b726e6785d409d14e3089de98fe1a75de13e44eb3125"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.updateTOMLMultilineString (cognitive 31): filemerge.updateTOMLMultilineString has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/toml.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b69bfcf63e39a0c2e7b3249d852c1807ede0a14c9ec08a036f678b9af4526"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.sendOpenCode (cognitive 31): telemetryruntime.sendOpenCode has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 7 (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":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"390b371ec5908ac4f57d2f890b55d018856973602813c05cba6368f5c8566830"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.stripTrailingCommas (cognitive 31): uninstall.stripTrailingCommas has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/cleaners.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"57898208cd66c1b676aef4e166d81b3e28eb9662937486b752d35a1eb6500875"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.discoverClassifiedAuthorityRepairRecord (cognitive 31): reviewtransaction.discoverClassifiedAuthorityRepairRecord has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 3, 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":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"047c9a9e0b70ef467fd1598984a76858381c927df2b0a8060e61d040006e417e"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.resolveAdvertisedSelector (cognitive 31): reviewtransaction.resolveAdvertisedSelector has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, 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":"internal/reviewtransaction/gate.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd874aff2fd9e2ecf2c22c9f65f19391447393233ddc9bc32496f764c012ce"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateReceiptStructure (cognitive 31): reviewtransaction.validateReceiptStructure has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/receipt.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f8f761efd8527d4050573bcbb1d749bed3e848f68676070c986aa2e1c5e318"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.candidateFindingSupportsCausality (cognitive 31): SnapshotBuilder.candidateFindingSupportsCausality has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6, 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76a3c5c5e280077f1ba7887a9db5f4f729c997c0d4023537bda55591fbb5c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageExperience (cognitive 31): shellinstaller.userStageExperience has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 4, 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":"internal/shellinstaller/user_experience_stage_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b0ef5bf85e59f53095fce7ca2010aead855dd8a265399ccd6c4dcde9c8fff7"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userReuseSDKState (cognitive 31): shellinstaller.userReuseSDKState has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 1 (2 pts), boolean chains 1, 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":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21d09916de77df00749275d730fcaca7e9b7b9291e466a8b6c431542e2ec3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPublishNativePNPMPrepared (cognitive 31): shellinstaller.userPublishNativePNPMPrepared has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 7 (nesting depth added 4). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_pnpm_publish_linux.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8a59122e3d41c1db56e11a2bc5535fa7fe1b790b0eafcbcbb5516f56f0f59a"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.LoadUserShellExperience (cognitive 31): shellinstaller.LoadUserShellExperience has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (26 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":"internal/shellinstaller/user_shell_registry_unix.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2429f9a874799e674819cb3d4a686ccdde3a5ffeca38f53427374a6b10fd3c"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.Opportunistic (cognitive 31): telemetry.Opportunistic has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 6, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/opportunistic.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f133aa2a2082e4024f4926c23cac3a78a78313c06b1e9cad08b563a10518d34e"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.normalizeRuntimeRows (cognitive 31): telemetry.normalizeRuntimeRows has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (7 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":"internal/telemetry/runtime.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bee06f740c2001ff9230525bf7be34729efc36e26b8b708feab61fc42a0bc4f"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.DecodeCodexHook (cognitive 31): telemetry.DecodeCodexHook has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_codex.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc4c893996d75250a9884f9aa4be6fa1c014b0c18f811ea6d1a7e632a07ea4f"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderUpgradeSyncResult (cognitive 31): screens.renderUpgradeSyncResult has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/upgrade_sync.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d737a1880d04f4a9483b035d3ef9372191c5d21f7f2938a9278cacb01349ba"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.MergeConfiguredCatalog (cognitive 30): opencode.MergeConfiguredCatalog has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (11 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/catalog.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cd60aa97edb68346e252f9b4c6622ea2bef63ce395f2273e0ae77e2f801d44"}},{"ruleId":"D2","level":"warning","message":{"text":"startupPathModel.expand (cognitive 30): startupPathModel.expand has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_readiness.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"7398b69249b3286afbc71cdecb87ffcf00d4213e8b98ed874e93f41f5c9250ee"}},{"ruleId":"D2","level":"warning","message":{"text":"providercontractbundle.VerifyArchive (cognitive 30): providercontractbundle.VerifyArchive has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13815dec4d21c8343663739cfda84a7c132af3708a47e0cc992796b2561954e"}},{"ruleId":"D2","level":"warning","message":{"text":"providercontractbundle.validateRawTarHeaders (cognitive 30): providercontractbundle.validateRawTarHeaders has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (5 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":"internal/providercontractbundle/bundle.go"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de88121d0e4b42fd9906ab2df5b0221c59f855c69c1a4c14c313f594edbbf73"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.deriveAuthorityDispositionPlan (cognitive 30): reviewtransaction.deriveAuthorityDispositionPlan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 3, 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":"internal/reviewtransaction/authority_disposition_plan.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dae807a444ae9663abcc87b72ea4420308f7294f38e15eae69dc3580ff0baf"}},{"ruleId":"D2","level":"warning","message":{"text":"authorityRepairScan.scanCompact (cognitive 30): authorityRepairScan.scanCompact has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aea4efa4688d6bc7017f135ef768585c34565f70197b516d09c76c01d5508b"}},{"ruleId":"D2","level":"warning","message":{"text":"RARAuthorityRepository.PublishPlan (cognitive 30): RARAuthorityRepository.PublishPlan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25 (28 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_plan_authority.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c888d914383392811f2417392c07ca1d0ca6f3059f1ee697ee141ee945cf8d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.DecodeUserExperience (cognitive 30): shellinstaller.DecodeUserExperience has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 8, 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":"internal/shellinstaller/user_experience.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b0c841311af19b16de9694caa868d3dd12dba9ac3854dd738795ef2f161f1"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userSnapshotZIP (cognitive 30): shellinstaller.userSnapshotZIP has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 10, 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":"internal/shellinstaller/user_source_archive.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca325f823f5b808c40a35816099b6cb94a52fdf6302a0478d0c4a208f4674d3"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.codexTranscriptEvidence (cognitive 30): telemetry.codexTranscriptEvidence has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_codex.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"04343287b79c30559c78bc0500a921b27b55136adbd11e8f590143f9511f5a57"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderUninstallResult (cognitive 30): screens.RenderUninstallResult has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/uninstall.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94cded38cc41aa6e84ff3125b21569af42bd9fefbfbbc429aa7702da016f80f"}},{"ruleId":"D2","level":"warning","message":{"text":"app.runBenchModelPickerCommand (cognitive 29): app.runBenchModelPickerCommand has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/bench_model_picker.go"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"59405dc01799fddc7bc60dd0041a722e56c735ee869c64f1e3a397f858d5c070"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runReviewStopHookStop (cognitive 29): cli.runReviewStopHookStop has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6 (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":"internal/cli/review_stop_hook.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e240243a9afe37fab3ec38c3dc743666917c32866fc4764a071ff6b2ec58175"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.prepareDesiredOrchestratorModules (cognitive 29): agentguidance.prepareDesiredOrchestratorModules has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, loops 3, 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":"internal/components/agentguidance/orchestrator_module_install.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1a362287700ff93c2c8d3df399f8cab8589283e34683547ca7ae256467ceef"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.ResolveTarget (cognitive 29): opencode.ResolveTarget has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e278ddefc876b4c0952756a34913c535a53dd95c2b7e31f3cd00f73f4059a1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ExtractBoundedSingleJSONObject (cognitive 29): reviewtransaction.ExtractBoundedSingleJSONObject has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc9e18d32242a53bf4514a9580a61e08ee932bdb63330cabf2d46c19acaf4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.mergeAdmittedLensResult (cognitive 29): CompactStore.mergeAdmittedLensResult has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 6). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd15689451bd2fa3354bac05768ca85965a01bf064be91964ba894373d4e9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.ClassifyEvidence (cognitive 29): Transaction.ClassifyEvidence has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (6 pts), loops 4 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f80ed967630ab3e82739c71cebe397f45e2bdbb027b0492e4b9bdad1dc86d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userTreeStamp (cognitive 29): shellinstaller.userTreeStamp has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, match/switch 1 (nesting depth added 7). None of this is in the body itself: all 29 points belong to one function literal inside it that branches (line 69). 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":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5b36bb953cbd3d5353d747b93486e2c6e5735ada4f5198652f12cfc34baa45"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsInventory (cognitive 29): shellinstaller.userWindowsInventory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 423, 399, 410). 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":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fcee28cd3cc9e557171c2e6167097eeb2484df81386a8dfa1514dd9e56d48e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeMetrics.WriteTo (cognitive 29): RuntimeMetrics.WriteTo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (13 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":"internal/telemetrycollector/metrics.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cc907d39d4a965bfe9dc917e5c1e3bb7e7f4c7207fa9c32d955efee17bb721"}},{"ruleId":"D2","level":"warning","message":{"text":"installRuntime.stagePlan (cognitive 28): installRuntime.stagePlan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 7, 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":"internal/cli/run.go"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84f6dbe64f6e9d027c701cd94d0caa67a537e5bc2731b37859578bb46348b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.RemoveTOMLTableKeys (cognitive 28): filemerge.RemoveTOMLTableKeys has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (9 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":"internal/components/filemerge/toml.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50fe381b5dca8f60ac4a246e1eb27eec90077a9eb612dfcc4de4fc050375732"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.inspect (cognitive 28): telemetryruntime.inspect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 6, 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":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8662654df83369a6c370a7f1aa8dcf5a7f1785a7f6b3c321fea7e07e6f3f727"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.replayCommittedCompactAbandonment (cognitive 28): reviewtransaction.replayCommittedCompactAbandonment has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, 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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"28df318d3cfe561986813d95a97e0109350ad963da07c34cead1818dbc197d49"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ensurePrivateRARDirectoryTree (cognitive 28): reviewtransaction.ensurePrivateRARDirectoryTree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92162b03afa1e27df21fb608cf355c44841e6dc680b181e52e6906f58ddfb5a"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.runGitCapturedRangeWithTimeout (cognitive 28): reviewtransaction.runGitCapturedRangeWithTimeout has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"686a0cdc54d8076a3abeeb78d3748809ec42852d76d733ec96c1a5f5d21d4037"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageCodeGraphLibrary (cognitive 28): shellinstaller.userStageCodeGraphLibrary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 6 (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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c47af349926892f99ce85f4fbd5971e7196c1e5e50d8707f74da762cc9f2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageOwnedAgentContext7 (cognitive 28): shellinstaller.userStageOwnedAgentContext7 has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"36354e329b9e937f1c783cbd0d5f1e07e9ec4136ec589922510024076c15bd2c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userMainSourceFiles (cognitive 28): shellinstaller.userMainSourceFiles has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_source_archive.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"13af0922ac40c068f016f1442ebffa64e442c0e3e3edeeaf7b198b18a0a9145b"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsIdentityBelow (cognitive 28): shellinstaller.userWindowsIdentityBelow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 10, 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":"internal/shellinstaller/user_files_windows.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfa47e04e11d4031011cb278bf87144162f73cd16e7b524935e4a768a5563b0"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.parseCodeGraphCommand (cognitive 27): opencode.parseCodeGraphCommand has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 10, loops 2, 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":"internal/agents/opencode/adapter.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6cd18876a41979d8fe556a225a9716b8f28dae6cbd462d88542dd058d49a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validateCompatibilityDestinations (cognitive 27): cli.validateCompatibilityDestinations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, 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":"internal/cli/compatibility_skills.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe077c50ee332dc877e81409ba9f35e11391eed096449f2ae8e98698d70a878"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewAssess (cognitive 27): cli.RunReviewAssess has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 2 (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_assess.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0683cce0747d2678eb76951ee87acb1dbb6889329f2af57cee793e7a171dd9df"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.mergeExplicitAgentInstallState (cognitive 27): cli.mergeExplicitAgentInstallState has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b172a1b30c55a9675d24bf033ff437c105f2fbeaba187862f2b1bb7f5ff258d9"}},{"ruleId":"D2","level":"warning","message":{"text":"openCodeModelAssignmentSyncStep.Run (cognitive 27): openCodeModelAssignmentSyncStep.Run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 5, boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a901c13f208205a88a7fb53b4a92532c3114e058bddd3e4f59a4af1d6cb359"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.fetchLatestEngramVersionRequest (cognitive 27): engram.fetchLatestEngramVersionRequest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"166939193aec026d73013f2882f73a58f2c9b28795905f67a166ce3cd684e6a4"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp.mergeContext7JSON (cognitive 27): mcp.mergeContext7JSON has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2beea79ae564e8bf7906af187ac23578305a6e7b973a66bdf5f287862e6d14"}},{"ruleId":"D2","level":"warning","message":{"text":"opencodeagents.Shape (cognitive 27): opencodeagents.Shape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (4 pts), boolean chains 1, 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":"internal/components/opencodeagents/agents.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08803adf4177d616ba01c4b2be075a8f77bf028df817e38cb5064ee2929cf3e"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.removeOwnedFile (cognitive 27): opencode.removeOwnedFile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 4. Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"internal/opencode/background_remove_unix.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5ce44e5e07a82a1becd279390e51b181947737ef7c2f58405d2634f778c2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.AbandonPristineCompactStore (cognitive 27): reviewtransaction.AbandonPristineCompactStore has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aff4b19b73c7e064789ca55e0425c3aa73298075f2d3510690c5e061fd26a3"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.inspectCompactRecoveryRecordSet (cognitive 27): reviewtransaction.inspectCompactRecoveryRecordSet has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_inspect.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef40116128e440aaf1ad7c8e5818c32e403c64ae7179a4f97d6806721e0655a"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactRecoveredEvidenceReferenceShape (cognitive 27): reviewtransaction.validateCompactRecoveredEvidenceReferenceShape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_recovered_evidence.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6334347fa7dcddd9480f3055406f113410aed461db70c059f8f61bf8ab7ab553"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.acquireMaintenanceLockInternal (cognitive 27): reviewtransaction.acquireMaintenanceLockInternal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store_lock.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef76e40126bc1f540141220f94bbeabc98c0845002be2ca5aefc2040bdd9dcd8"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.canonicalLensResult (cognitive 27): reviewtransaction.canonicalLensResult has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00aa9901811261f36481fb2ca778c138b750a1395a0a0b0b47eaf1d4081cc9d"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ValidateCorrectionImpactClosure (cognitive 27): reviewtransaction.ValidateCorrectionImpactClosure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef92291b5df1cf561ba27ccd759b294083fb05873a942a20f2eab0105fad8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.CaptureAdmittedReviewerResult (cognitive 27): CompactStore.CaptureAdmittedReviewerResult has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c83e5cc1a1a5bf21a475b81f6c746b118a7df92a048bce64b01341e29d1b967"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.validateLensState (cognitive 27): Transaction.validateLensState has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfeeb10d69f7afc9caf222febc48d3e8554286e09392f267c41451319c20d53"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.validateResolutionCounters (cognitive 27): Transaction.validateResolutionCounters has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 7, 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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c32be232a1263ce0d5888309682ff8dee520055bf60cbe5d0c2aa9b6560eb2c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userReuseComponents (cognitive 27): shellinstaller.userReuseComponents has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 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":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"95619986fd8b839bc92df65af63581de99893075ce1a30e7810b1dab20a097a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.View (cognitive 27): Model.View has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 4, 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":"internal/tui/model.go"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb14cf79c25163d7135e6eafdc4595cb71dd35efb9eb26d34146239e8ebffd8"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderCustomPhaseList (cognitive 27): screens.renderCustomPhaseList has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"994fc14cec61dfd6d1e033ce64ea1bdf33c4b7279ced8cc163387a316446f036"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReview (cognitive 26): cli.RunReview has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (22 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":"internal/cli/review_facade.go"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"075cfb045c8998512d91b9b447ae3f31d81d4263dc15c8157972fe82da182164"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.openCodeTransportComplete (cognitive 26): cli.openCodeTransportComplete has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (24 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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7186bce33fb975526e85a07e2937f6699c78125d45592fa7192c387c67ccf7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.renderReviewStoreReset (cognitive 26): cli.renderReviewStoreReset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (9 pts), match/switch 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":"internal/cli/review_store_reset.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d405251d902262865281c0876abd28c3727593e71f8c06d2c58978d6fb12a5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.retireOpenCodeFamilyReviewAgents (cognitive 26): cli.retireOpenCodeFamilyReviewAgents has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a053cb2769eac241e12a07af6cc0d08653d0849bf4844777cb95f13881c20039"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.NormalizeInstallFlags (cognitive 26): cli.NormalizeInstallFlags has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/validate.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b348fb143adddf2ea15252d485d23932e16efd742cca75dd4f2375e63ec1ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"unixCompatibilityDirectoryWriter.openParent (cognitive 26): unixCompatibilityDirectoryWriter.openParent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2, 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":"internal/cli/compatibility_writer_unix.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3312be0826eab71475fb0f2f27ac7492d68f2bccff0b5c7d4c13dd73b430677b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTargetStatusResult.validateRepairNextTransition (cognitive 26): ReviewTargetStatusResult.validateRepairNextTransition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, loops 1 (2 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba0717b72d40438950db69601ea922c2a344a1f01f1326c38a4c8b0f3062554"}},{"ruleId":"D2","level":"warning","message":{"text":"prepareBackupStep.Run (cognitive 26): prepareBackupStep.Run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"590a4c2d6fe557f576cfdc7f04f5241be908edfcc3f9712286e6f82049aca2ca"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.decodeOrchestratorFragments (cognitive 26): agentguidance.decodeOrchestratorFragments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 3, loops 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":"internal/components/agentguidance/orchestrator_module_fragments.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"565272434b1253c4ce1c24fbb0dfec4b9148ce4c3a70e4d1d77a3d7d1fa68c28"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.marshalPermissionOrder (cognitive 26): filemerge.marshalPermissionOrder has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"04677bddef1dad94ea3cae168a6f3fbdfe0a6b28c8f99bfff880d144461b093a"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenCodeSDDRegistry.Owns (cognitive 26): OpenCodeSDDRegistry.Owns has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 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":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8854b8282cb2ec155f04ba49277fd074c91cf405461b7883b32130a6dd4aa02a"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.retiredSDDOperation (cognitive 26): Service.retiredSDDOperation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 11 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 65, 96). 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":"internal/components/uninstall/retired_sdd.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bdaabd0b202eebca9d7ed75db2b486850d367310d00b3fb4f93343efa9e1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.reopenCompactAdmittedRoleResults (cognitive 26): reviewtransaction.reopenCompactAdmittedRoleResults has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 9, 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"058ba0990cf62552c733565bcd49ca9ac8d3c37b5b4774f46c03f8b913aad3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.deleteRetiredCompactField (cognitive 26): reviewtransaction.deleteRetiredCompactField has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0fb642d266e65ef7e9a9130fa832d7471d414d1536b9103035801ad1fec9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.readRefuterProbeBatch (cognitive 26): reviewtransaction.readRefuterProbeBatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, 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":"internal/reviewtransaction/refuter_probe.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"471517e8c2a6a09f1513aefd74f83a0b3f77b5dab8520fd07e375b5984cf11c7"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.selectorlessCommittedBaseDiffCorrections (cognitive 26): reviewtransaction.selectorlessCommittedBaseDiffCorrections has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e459e24fa7c8e77356324b51361f0ad06ebab748e900410da55391b93d14b66"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.CaptureAdmittedTargetedValidatorResult (cognitive 26): CompactStore.CaptureAdmittedTargetedValidatorResult has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afb2075f642b8f027f1a2d66c998f60968afa8e230141cf13b60430560ecbff"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.RecordUnachievableLensAttempt (cognitive 26): CompactStore.RecordUnachievableLensAttempt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 3, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_unachievable_lens.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"816d52a56846f3ea268d81f8d56ae2ff37d732ba4a0ebbe35289bcd2be0d2f25"}},{"ruleId":"D2","level":"warning","message":{"text":"VerificationApplicability.Validate (cognitive 26): VerificationApplicability.Validate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e20959ba51365a4f8cce7e1362583c46ca57e54021129d7859c95435f07a438"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userRecover (cognitive 26): shellinstaller.userRecover has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 4, loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0ca88ec43d58a56c548506bfbb8ccc4c7d0166ab6f95d0f225f4cad7e9d016"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageMainSource (cognitive 26): shellinstaller.userStageMainSource has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, 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":"internal/shellinstaller/user_main_source_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e07ba571027377bcfaf4523ed0033097b891246acbbaf047dc2f0eb1e891065"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.PublishUserShellLauncher (cognitive 26): shellinstaller.PublishUserShellLauncher has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, 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":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"070dfbb73f6f189cd6d2a82ded687baef6dc60d23ae23adc26cb66c9c8dcad6e"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode-review-transport.startRelay (cognitive 26): opencode-review-transport.startRelay has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 10). None of this is in the body itself: all 26 points belong to 3 function literals inside it that branch (lines 118, 152, 155). 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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4749dd962f068e18c7f5bab9dafb70e39ace071ce35586a66bf4afb2bd4a98"}},{"ruleId":"D2","level":"warning","message":{"text":"app.tuiExecuteWithSDK (cognitive 25): app.tuiExecuteWithSDK has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 1 (2 pts) (nesting depth added 12). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 698). 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":"internal/app/app.go"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0608009963c584c9c8087da0b31fa15f28b1ef37b029b6af5e2b8709fd019664"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runRestoreWithHomeDir (cognitive 25): cli.runRestoreWithHomeDir has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (24 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":"internal/cli/restore.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54f10b5890fef5c922ea6999e88258fcc22598cee1c51b65080f56ec07045d4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.snapshotSyncFiles (cognitive 25): cli.snapshotSyncFiles has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (24 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":"internal/cli/sync.go"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcd88c05df32c8e1113aa714faf6ce79d71da50ed3202e066218b242ae47297"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.splitOrchestratorModules (cognitive 25): agentguidance.splitOrchestratorModules has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 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":"internal/components/agentguidance/orchestrator_modules.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6ccafea4663d9a44f05c0e0293dc08885ffdeb2b857658986e4e07c0e1f2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.ReadPersistedStdioCommands (cognitive 25): engram.ReadPersistedStdioCommands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 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":"internal/components/engram/healthprobe.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c78b3d5028ab67c0df9c59eb6ee6e4cca6f5d1e62674985433cfc42ce774335"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.RetireOpenCodeSDDPrompts (cognitive 25): legacyassets.RetireOpenCodeSDDPrompts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, loops 2 (nesting depth added 9). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"98480b530e646d3493a2a38bc393397954d1ec0c3a9d59f0520449b78ff09975"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.ReconcileForMajorWithRollback (cognitive 25): telemetryruntime.ReconcileForMajorWithRollback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 3 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45a4e309432567f4d423f39abf3841ffe0b48abe0dd3bdb36675670eea3c3af"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.configuredVariants (cognitive 25): opencode.configuredVariants has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 8). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 280). 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":"internal/opencode/config.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aca5b658750d7f547fb374974a41d9264675944ef63b5b81d0a24925afb185"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.markCompactRecoveryCycles (cognitive 25): reviewtransaction.markCompactRecoveryCycles has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_inspect.go"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"41443ae08ea0b85808e277f12adb45cf40676a81a529b54f40dfe7b471f6b647"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.acquireRARAuthorityLock (cognitive 25): reviewtransaction.acquireRARAuthorityLock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (23 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef99771b07ac60abb9215492ada78acf16580a3dd38683bc5d4738083cbe0a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.documentLineIsActive (cognitive 25): reviewtransaction.documentLineIsActive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (8 pts), 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d381f78f42ac50bee55eb773ed04d54b8fdb40acd1e3d1c897f33acfa98dc494"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.validateCorrectionBudget (cognitive 25): Transaction.validateCorrectionBudget has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8 (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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6272718f1680991a940c872ec827858184fde195982a3b4778264fcc45de4ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userUnixChannelOverlay (cognitive 25): shellinstaller.userUnixChannelOverlay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d376e0246b8f9db3a4f121d45fcbe731544579cb6eab35d866b0626e80160ce"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userInspectInstall (cognitive 25): shellinstaller.userInspectInstall has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9bb6792d3a775df3daca5fd7de2cb4d3a5a77ae9a80e5d00581d7c3a159a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userSupervisorSHA (cognitive 25): shellinstaller.userSupervisorSHA has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (12 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa9c6b80c1be41b07bf41b031b5d46dc3978b0d3432459bd0cee59026edd0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsJobQuiesce (cognitive 25): shellinstaller.userWindowsJobQuiesce has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). Of this number, 20 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":"internal/shellinstaller/user_process_windows.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eb73f0b91e5c01876eb37002290aa091b7960ee27af12415d662a02c16a7fa"}},{"ruleId":"D2","level":"warning","message":{"text":"skillregistry.parseFrontmatter (cognitive 25): skillregistry.parseFrontmatter has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (4 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":"internal/skillregistry/registry.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"164d73cf7783a0a143f175cb9cb50e7dcd9bb98546b296a92dd4026ac2ad8ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.updateShellUpdate (cognitive 25): Model.updateShellUpdate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 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":"internal/tui/shell_install.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3264c2b4d1c2b1b4c11eae09e6e077aeb14e3bc4e9deba92bcbdee039468057e"}},{"ruleId":"D2","level":"warning","message":{"text":"update.detectHomebrewOwnershipWith (cognitive 25): update.detectHomebrewOwnershipWith has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 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":"internal/update/homebrew.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b09fd46197a14a57348902d2d9adabb56067980d1e9187d0551272e4fe461"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade.ExecuteWithOptions (cognitive 25): upgrade.ExecuteWithOptions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4, match/switch 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/executor.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d183eee450b7ea620866884a90388529a4797c075b3774764226f52fbeb0b35"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run (cognitive 24): main.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 2, 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":"cmd/gentle-telemetry/main.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7139c7e34ec242e68f9a15084ecd02f005c09244e64eae6a27178a2e67da4f"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreService.restorePlain (cognitive 24): RestoreService.restorePlain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8301231238d5469b08c301d8e99fc0ad565fa830407514a1d39d09cc380526"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewProviderAdmitTargetedValidatorRaw (cognitive 24): cli.reviewProviderAdmitTargetedValidatorRaw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_roles.go"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f290a0fb7f6dda01dbbe0ddd074794cd81f89eb66fd890a800d9c60dd3def86f"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runTelemetryRuntimeInput (cognitive 24): cli.runTelemetryRuntimeInput has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 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":"internal/cli/telemetry_runtime.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c253694c45a3b38933058fbd1e6cc2c0aa86d2b05e6d1a53d1b4986a27ca9b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewActionEligibility.Validate (cognitive 24): ReviewActionEligibility.Validate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a24bfe0fa93ed28433dd7860001fd6745a657a8232359cbad15067386bc1bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"agenthooks.InstallRetainedClaudeHooks (cognitive 24): agenthooks.InstallRetainedClaudeHooks 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":"internal/components/agenthooks/claude.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bf95ca67b6801d6e8fb06450e3d3d06f9dc361d19bc493e9c97c1f6d53a27c"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.scanJSONCWhitespaceAndComments (cognitive 24): filemerge.scanJSONCWhitespaceAndComments has cognitive complexity 24 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (8 pts), boolean chains 4, 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95e6ba555e75da4d7b790c2c83d8b771e8e4f8c670b4bb61e2660815e69612"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.classifyCompactCorrectionTarget (cognitive 24): reviewtransaction.classifyCompactCorrectionTarget has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c431e76a0ab499da869907c4b66032c4e953d028ee314f4079499a8ae6fd66e7"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.parseCompactRecord (cognitive 24): reviewtransaction.parseCompactRecord has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e3ececd4e819c81d0d00b983614f70f70ac4a8ab3a5bee671a234a2e99134"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.WithdrawUnachievableLensAttempt (cognitive 24): CompactStore.WithdrawUnachievableLensAttempt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (18 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_unachievable_lens.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d492ee3c13ed324496b6f0e8cc15f234a9fd9a2e9f8d728c5267631507bec"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsChannelOverlay (cognitive 24): shellinstaller.userWindowsChannelOverlay has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 2, match/switch 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_windows.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3175a90fce9258f2352645da078c2fae53c854728914eb30f4864121e25fc5d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsSecurity (cognitive 24): shellinstaller.userWindowsSecurity has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, loops 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_files_windows.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b074eb187c99203df3127af5e5bdc1e377945a50acfb32018c74b6e3ec9b94b3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewBundleExport (cognitive 23): cli.RunReviewBundleExport has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (22 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":"internal/cli/review.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"35170a2904dfd3f44315649661632a5d23ef6e138c84a288fd5011804b387939"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.openCodeTransportStartBound (cognitive 23): cli.openCodeTransportStartBound has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_opencode_transport.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e0a3640859496eaebec2d716d835ebdec85f12262f9ed9353f58cef4c25fde"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewCaptureRefuter (cognitive 23): cli.RunReviewCaptureRefuter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 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":"internal/cli/review_provider_role_capture.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"688e1bc5e59d4fcd1ff72d0f5b3a369d030630c0d5ad6c95b4dc7f0408a6a693"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewProviderAdmitRefuterRaw (cognitive 23): cli.reviewProviderAdmitRefuterRaw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 2, 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":"internal/cli/review_provider_roles.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"528c33a00b709cb2023530b5e4a3a148badabda23357eead68a1896065f956ec"}},{"ruleId":"D2","level":"warning","message":{"text":"openCodePluginDependencyPreflightStep.Run (cognitive 23): openCodePluginDependencyPreflightStep.Run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (23 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":"internal/cli/run.go"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c3e3d49d8c5817caf44d278e4ae9db3ba79d4e7f243a79d46d94cfa61333bc"}},{"ruleId":"D2","level":"warning","message":{"text":"agenthooks.InstallCodexTelemetry (cognitive 23): agenthooks.InstallCodexTelemetry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/codex_telemetry.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6fd1340ec2fe4cf56fc01716dd8349db5861948c354a1804109915d9cbd4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"gga.literalWord (cognitive 23): gga.literalWord has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 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":"internal/components/gga/provider.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ed5fcb70a5b8c588b408af9a7307a9765f25732655cb72f01daf494d09b889"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.permissionMap (cognitive 23): legacyassets.permissionMap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 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":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eba024cfed155101df55fc7d8c9204f08edaef59df109d179a2f8c357876ff"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.overlayConfiguredAssignments (cognitive 23): opencode.overlayConfiguredAssignments has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/config_v2.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2163a226b0b5b3c8dd4221ee65a000c7baa70366e2a754a3d33202a64c1279"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.discoverAuthorityDispositionRecord (cognitive 23): reviewtransaction.discoverAuthorityDispositionRecord has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 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":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4df904214297b93794b5dc488e35bc91447fdacde4d88be70c09a6d60f35ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.compactDiscardedWorkSummary (cognitive 23): reviewtransaction.compactDiscardedWorkSummary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb62340dab9c14f108af4ab0c803067353cc5f9308352e8af6f287c0c7c3e8d8"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPruneRemovedBackup (cognitive 23): shellinstaller.userPruneRemovedBackup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 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":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa76117dde105132c5f82c33bd26ebbf9f3f1a0ef9db67868a88bffe7dd1d51"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPublishManifest (cognitive 23): shellinstaller.userPublishManifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, loops 1 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d868500083a8c52e30b70fb965cd2715540c8a2e1612dfe7dbac303cb543b6"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userNativeReadback (cognitive 23): shellinstaller.userNativeReadback has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8 (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60437dd4a5dec0a4430e13e0569630c506f735ef2b436f19dad3c5dd8d107b"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsZIP (cognitive 23): shellinstaller.userWindowsZIP has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be74826aa6192f0f985d2772978b511c6983ddd147b7a3e6e7cf92306effe10"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsOverlayToStable (cognitive 23): shellinstaller.userWindowsOverlayToStable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_windows.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25cf543bb9cb4ab88d4bc1825d0037806df09143c8e5b4c5c3b203e0229a062"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsPruneRemovedBackup (cognitive 23): shellinstaller.userWindowsPruneRemovedBackup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 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":"internal/shellinstaller/user_install_cleanup_windows.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab70d8d08296f9c24d48f3f159402811298aeb075701d1a6b18280438f75b305"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.ParseClaudeTranscriptTail (cognitive 23): telemetry.ParseClaudeTranscriptTail has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, 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":"internal/telemetry/runtime_claude.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b25baa35fc0838f2b1713b1b16a39899adfaeb3f5e7f3413ebc94b315a3be83"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderUserInstallDestination (cognitive 23): screens.RenderUserInstallDestination has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 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":"internal/tui/screens/user_install_destination.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a19722cb9f0ea2151bf22ca8c7372e4a7dd29c26e7fa55853279f3446ca7a1"}},{"ruleId":"D2","level":"warning","message":{"text":"update.checkSingleTool (cognitive 23): update.checkSingleTool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 1 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function 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":"internal/update/check.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7d899d553429d58031e0e6d14e89c97ed8611158b632f91942d5eeacea056d"}},{"ruleId":"D2","level":"warning","message":{"text":"pi.selectPackageBin (cognitive 22): pi.selectPackageBin has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, 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":"internal/agents/pi/model_routing.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de171d1107fc08f05e63609e9e2a5e1ee0bbe5afd261d6beef40bd709701eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"backup.ExtractArchive (cognitive 22): backup.ExtractArchive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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":"internal/backup/compression.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1520ea70b14f60ba8b5ef3dee57c08e381321cd4e08147c11fd2398d1b937f1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.verifiedCandidateCausalFindingIDs (cognitive 22): cli.verifiedCandidateCausalFindingIDs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e7cf22e45716443d9c0880a8bfb7e8ac4a7fbe6433216bd7d359b79284ce87"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.openCodePluginPackageManager (cognitive 22): cli.openCodePluginPackageManager has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a911030c6387978cf83662f405464ebdf2b89baa0ac86000f1ae38b5b0f87f1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.syncPersonaPathsWithWorkspaceScoped (cognitive 22): cli.syncPersonaPathsWithWorkspaceScoped has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b7e501135a1425e0fa95cf33d3fb90c8d337233ba13bcbf69d93658e1019c1"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.RenderRouting (cognitive 22): agentguidance.RenderRouting has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20 (22 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"internal/components/agentguidance/routing.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"878616bbc26f7f4ec1cc7e9f651bb152704545c419f257b6a64267f919eefff7"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.jsonValueEnd (cognitive 22): filemerge.jsonValueEnd has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (7 pts), boolean chains 5, if/else 2 (5 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":"internal/components/filemerge/jsonc_members.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8640b8fdecb04c02b4e8532fc5f4cedbb437ecacebbc027f8d98674db00c28"}},{"ruleId":"D2","level":"warning","message":{"text":"geminimodules.MigrateLegacyRoot (cognitive 22): geminimodules.MigrateLegacyRoot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3, boolean chains 2 (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":"internal/components/geminimodules/migrate.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9629941ce97071c20b278ed6c7ead0bcef0f3f69b982f7b183442d593e44bc84"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewassets.renderNativeAgent (cognitive 22): reviewassets.renderNativeAgent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (21 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":"internal/components/reviewassets/install.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a9a30c4797734578222daeb32e70f4f2858d858b5e42025fd7e669c5cce31f"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.resolveManagedLauncher (cognitive 22): opencode.resolveManagedLauncher has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 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":"internal/opencode/background_readiness.go"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abd95641d98fa7039a5f4805de421a018319f2257981e0e08874e2a0c4ea98b"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.parseV2ModelAPI (cognitive 22): opencode.parseV2ModelAPI has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 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":"internal/opencode/catalog.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe741e18c43f03c5e6b6ea3bc5fe27ce95fddb8393c4e6cd56e82b960ffc78d"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateBundleExpectation (cognitive 22): reviewtransaction.validateBundleExpectation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8 (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":"internal/reviewtransaction/bundle.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ebdfe65f70012474345c98c833f5507879bc7f0d12da90b5001ea4bb4c9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.compactAuthorityGraphViolations (cognitive 22): reviewtransaction.compactAuthorityGraphViolations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df4a07a329f8061ed2a505535be09c4629e1034aa35306f9a8586fc2996aaf7"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateGateRequest (cognitive 22): reviewtransaction.validateGateRequest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/gate.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf45ee6a9cd40de2d6f99206151faa5c67fd413ff15fe090af1662d8e9689af3"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.detectRenamePairs (cognitive 22): reviewtransaction.detectRenamePairs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"48efb4c88f9086c83e8fdba0d570c9c238b2f9e54a4e3a742a1736d949e5d14b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactAtomicStartBinding.Validate (cognitive 22): CompactAtomicStartBinding.Validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a15df624f7a476816deae13c7f3e8a439638831fbb44b052d823a3785bd3d60"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.RecordInconclusiveTargetedValidatorAttempt (cognitive 22): CompactStore.RecordInconclusiveTargetedValidatorAttempt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e567dbe6afc16f3b5492b281281a45db2a290391baeb0226011bc18f298d343"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.buildHeadWithIntended (cognitive 22): SnapshotBuilder.buildHeadWithIntended has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8095532f5b56b9d24944f8d39abe6e9b987b7912033278f2126654cc51303a64"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.loadChain (cognitive 22): Store.loadChain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3054071610598a4efb5b727902db59ff41c2ba27203bc749cfbf87b993212601"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageContext7 (cognitive 22): shellinstaller.userStageContext7 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5, loops 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":"internal/shellinstaller/user_context7_stage_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba61233eeaca437bb8a09bf1af8bfda0d7db738af587e25606f5a12868b8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userToolsAcquire (cognitive 22): shellinstaller.userToolsAcquire has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, loops 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4a0168e539f04b50735ccab6ddf8ee2b663b7ec0e07043105251400821692d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userServiceWithPlan (cognitive 22): shellinstaller.userServiceWithPlan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0b3bf92364ebf3cd6fd6560cc9edf2307fa9c5efd31d65019e12c9e20fcd84"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.PreviewUserInstall (cognitive 22): shellinstaller.PreviewUserInstall has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade3d3bfa882567ae4f773ad8c1c9fb9414dd70b6a80b32951d1f4a5566c991b"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage.RunDailyRollup (cognitive 22): Storage.RunDailyRollup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 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":"internal/telemetrycollector/rollup.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0ed2dd954e022dd0bb88bb2fdeb3bd6d1df5e2bb72b35b7be8770eb3e842ea"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderInstalling (cognitive 22): screens.RenderInstalling has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 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":"internal/tui/screens/installing.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d938bee2d6e564664e3f253d594d0639fb00c92504e18fa79daf17a947c76608"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.handleModelNav (cognitive 22): screens.handleModelNav has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, 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":"internal/tui/screens/model_picker.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d2d68babef6037bfe3239c68449932ebd93b87849da513e7fc00c5d5bd0ec"}},{"ruleId":"D2","level":"warning","message":{"text":"claude.mergeUserConfig (cognitive 21): claude.mergeUserConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 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":"internal/agents/claude/adapter.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e24dab87a6ece5a2526401a6076b8e8d4636b4751ffe40f00287549567aabd1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runReviewOpenCodeTransportFrames (cognitive 21): cli.runReviewOpenCodeTransportFrames has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2 (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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de4a1e22063e5389d2b11621fd905853fd7452d87ce81f15c9e0e0faf8739b3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.newReviewActionEligibility (cognitive 21): cli.newReviewActionEligibility has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, 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":"internal/cli/review_status_contract.go"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f1246f0456d872fde1d53eb5bbcdddf0bbbdc480f16b733dfa52c796106dba"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.migrateLegacyOpenCodeAgents (cognitive 21): cli.migrateLegacyOpenCodeAgents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 2, 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":"internal/cli/run.go"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7624342b3ef0ff7423955bfcbe7d9bcca709da9fee94c54ed664245df5f4a6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.userDeniesQuestion (cognitive 21): cli.userDeniesQuestion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (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":"internal/cli/run.go"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fb89bbe1fa6f6c330143bf6bb5f16e2c05e9df8eb66acd55ef06d1deb22486"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunShellInstallInline (cognitive 21): cli.RunShellInstallInline has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (21 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":"internal/cli/shell_install.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6988a0cde6641ae87c7127f896e7e66493792188213923c2bf3e51cdfc4317"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.restoreOpenCodeModelAssignmentsFromState (cognitive 21): cli.restoreOpenCodeModelAssignmentsFromState has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"81397ea09788d6d2f3a05af10d5c5c02a8e619c1f06027d1881d153ac3a52943"}},{"ruleId":"D2","level":"warning","message":{"text":"checkDependenciesStep.Run (cognitive 21): checkDependenciesStep.Run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3200a9346a2fab67d86599d6ddb3c1e232b7b2c90d93dbd69b68e8c69fc23dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.resolveRoutingDelivery (cognitive 21): agentguidance.resolveRoutingDelivery has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, 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":"internal/components/agentguidance/inject.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"497bd1acb4bad21802ed015f78ef0fc41cb67170960c2514776282f89af1b4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.DownloadLatestBinary (cognitive 21): engram.DownloadLatestBinary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (21 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":"internal/components/engram/download.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3877bace0264839c94fba9036bae8dd9ea8cc6d8e922d744380f593a4d029f94"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.classifyAntigravityOwnershipTransferFailure (cognitive 21): engram.classifyAntigravityOwnershipTransferFailure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), boolean chains 1, 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":"internal/components/engram/inject.go"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4230936ec67ae407d19cc2c572d22d8cdd3da7d62a6250c7694b1942c5e89d6"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.removeManagedAntigravityGlobalEngram (cognitive 21): engram.removeManagedAntigravityGlobalEngram has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 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":"internal/components/engram/inject.go"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b954526c6897ad4ec15ea952c8279a87cc6bdaac4f91f522e6fe66eb92e71663"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.RemoveJSONCMembers (cognitive 21): filemerge.RemoveJSONCMembers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/jsonc_members.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b702c021d235f4f6a032befd6fa65dead4787be764cff9a07d209a005c0667"}},{"ruleId":"D2","level":"warning","message":{"text":"persona.mergeJSONFile (cognitive 21): persona.mergeJSONFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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":"internal/components/persona/inject.go"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0e4d3517b55b0064198cd288b73af17d3bc7e2d305c47d4130eef88ab0aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"persona.removeJSONNestedSubKey (cognitive 21): persona.removeJSONNestedSubKey has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"internal/components/persona/inject.go"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a77dc2e735c6daaceac7273dfb3cd92e1f9e472930f68b1bedcb28f4a74cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.NativeConfig (cognitive 21): opencode.NativeConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 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":"internal/opencode/config_format.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aedb0ebd8b5aef659880575e636f10d7bd8b86a12c7aef9b6959c73f66b6e6"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.AcknowledgedBoundaryCommit (cognitive 21): reviewtransaction.AcknowledgedBoundaryCommit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 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":"internal/reviewtransaction/acknowledged_predecessor.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0ce22612b326f6abc83da354cac540ef944e9b707de56fc9376b9c9ad1c7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.loadCompactRecoveryRecordsUnderMaintenanceHold (cognitive 21): reviewtransaction.loadCompactRecoveryRecordsUnderMaintenanceHold has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 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":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ea2d0984b5a7c76921c80107c5b43ae3421cf64e9bd631f3fe50dba4fe50ff"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.scanLegacyAuthorityRepairOnce (cognitive 21): reviewtransaction.scanLegacyAuthorityRepairOnce has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4, 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22c335c7f48c49dc91925215d1c9bf35d2786f3eb13057b06c50a5ed2c6462c"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.loadCompactRecoveryRecords (cognitive 21): reviewtransaction.loadCompactRecoveryRecords has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 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":"internal/reviewtransaction/compact_inspect.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d269d390524b106dfc94c474c4a6d5093f6e7fd04dd428839a09dc5c21ecfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.deriveSnapshotRiskReasons (cognitive 21): reviewtransaction.deriveSnapshotRiskReasons has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfde8183c545970adc70e8502bce0bbfbc0bdeeabb027a201f2de486e7b9ff0b"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.storeResetUnrecognized (cognitive 21): reviewtransaction.storeResetUnrecognized has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5216fef84152fb4bc70b46b2c1162612fd38fd6d1170619606a537b269d9ab6f"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.projectTargetStatusDecision (cognitive 21): reviewtransaction.projectTargetStatusDecision has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10 (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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2d6303bd8859cf972909b8814f81ee1f9e96ff7fa40291247c2fa0e19dbd45"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthorityRepairAssessment.Validate (cognitive 21): AuthorityRepairAssessment.Validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab536cf7b0babe11ec1da69cd94b55fe3618c3f9150d1d26250cf7601de8be5"}},{"ruleId":"D2","level":"warning","message":{"text":"authorityRepairScan.run (cognitive 21): authorityRepairScan.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab180bcaff1f0ae386625c6218907c5226148113cfa37eb7dbd7feb202fcef5"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStore.resolveAdmittedReviewerResult (cognitive 21): CompactStore.resolveAdmittedReviewerResult has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"496c0698e21edd3bdceed112b2195bd29c426d67a89e07f9218512fc4d11fe9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.installBundle (cognitive 21): Store.installBundle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/bundle.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e6df87e8e37a50a964eaff6b84cdd93572be62b3472311723998f1eeb92b2"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userEngramDecide (cognitive 21): shellinstaller.userEngramDecide has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 2 (3 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":"internal/shellinstaller/user_engram_shared.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e610337d0a1abcf14efee651a8bb16674599642730005985eab4fb1d3dd8b9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageConfigFiles (cognitive 21): shellinstaller.userStageConfigFiles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_stage_unix.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c89e303344cecda32f8f981ad660c65b004e776f7ac37be2703aa5619cf958"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userToolMember (cognitive 21): shellinstaller.userToolMember has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, 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":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3abe449b336944fb455fb66a65c4a20a30e847982c01665563e870916ce506f"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.newUserNativeSlice (cognitive 21): shellinstaller.newUserNativeSlice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 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":"internal/shellinstaller/user_native_slice_linux.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8aa1fb9c6d6f15e4470b6ec4de0d8408e0bbea9824825ca1ebb1d8538ab895"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPNPMCopyFileWithSync (cognitive 21): shellinstaller.userPNPMCopyFileWithSync has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 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":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0154363a3ef92a3b7ca967fc0189d5e26cc4c351a57adcedae53a34b2093319"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsOverlayToMain (cognitive 21): shellinstaller.userWindowsOverlayToMain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3, boolean chains 1 (nesting depth added 4). 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, 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":"internal/shellinstaller/user_channel_overlay_windows.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb211cf53e837a2e975a2abb2be3b9428ec6c5886ce78d964ee1236dd1ca940"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsPublishLauncher (cognitive 21): shellinstaller.userWindowsPublishLauncher has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 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":"internal/shellinstaller/user_shell_launcher_windows.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef98c2d3da89830f27b03bebbe861057aa9a83a1801b19731cf4636e0580b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetrycollector.validateRuntimeStorage (cognitive 21): telemetrycollector.validateRuntimeStorage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, 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":"internal/telemetrycollector/runtime_storage.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f0a3990ffc7f354c9c6651e2ff0f58cf1d228ba903e037545c8854baf1dd58"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage.InsertRuntimeEvent (cognitive 21): Storage.InsertRuntimeEvent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetrycollector/runtime_storage.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d0f55d142af6ec25b1f1a9aa9040c8bf2a3a6981d823da3ef943cf95337080"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.HandleCodexModelPickerNav (cognitive 21): screens.HandleCodexModelPickerNav has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (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":"internal/tui/screens/codex_model_picker.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f6364d31908f9069f7dfa10ab656bd1f97b2f99b29bebe2243dbaafa3dfd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderSkillPicker (cognitive 21): screens.RenderSkillPicker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/skill_picker.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5c19187a582ea0766cad8a0b50d5c1468d4230f5a62f7330bbba88d23c42f1"}},{"ruleId":"D2","level":"warning","message":{"text":"pi.ResolvePackageBin (cognitive 20): pi.ResolvePackageBin has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/pi/model_routing.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbdf01ff4efc3d9275a0984f82232e11030057f099c6fdc5df4dc7aa2fd2c57"}},{"ruleId":"D2","level":"warning","message":{"text":"pi.scanJSONValue (cognitive 20): pi.scanJSONValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 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":"internal/agents/pi/model_routing.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a358ec4a13303ef695bc93f8057b9076917e85257f9ed1af407bd000917f74c7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewCaptureCorrectionPlan (cognitive 20): cli.RunReviewCaptureCorrectionPlan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3 (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":"internal/cli/review_correction_plan_capture.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48470333c1f24cf30b93e5c727fb82fd04487ec436f582ba35ef6164c98a35d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewMissingCaptureTransition (cognitive 20): cli.reviewMissingCaptureTransition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"internal/cli/review_next_transition.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feea4bab252d410300230e69e47601c6cd1fcc17a89dbe3351f38b47fc938ea"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewRecoveryCollection (cognitive 20): cli.reviewRecoveryCollection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7 (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":"internal/cli/review_next_transition.go"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c104077e27751e9a1b7ffc815ad412c393fb4fbc235316869d6823b3a05d0bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.decodeOpenCodeTaskHostOutput (cognitive 20): cli.decodeOpenCodeTaskHostOutput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 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":"internal/cli/review_opencode_transport.go"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a0ca7fd08d49dcfd08ae993052e9b46d56326a1ff5e2e1475fdb1a8534d607"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewIntegrationConsentResult.Validate (cognitive 20): ReviewIntegrationConsentResult.Validate has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 pts), loops 1 (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":"internal/cli/review_consent_contract.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0228fe9886822972d6e85632e7e52f0235201beee82241fb48da403644ed52ee"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewTransitionSelector.recoveryArguments (cognitive 20): reviewTransitionSelector.recoveryArguments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_next_transition.go"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9caa824c6948635467c6a8f88868a6f3b1655a28a413a8eddb62c452166c1d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTargetStatusProjection.Validate (cognitive 20): ReviewTargetStatusProjection.Validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 4 (5 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3faff087a3d58dec102d556aec0ad02222bc99952e7d8d198a45d8bde92193e"}},{"ruleId":"D2","level":"warning","message":{"text":"antigravityrules.splitBody (cognitive 20): antigravityrules.splitBody has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (8 pts), boolean chains 2 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/antigravityrules/render.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"108b2535e333e0a7f1a8f2ca741de5befa5fe4db558d069ab4807293ab70403c"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.rejectDuplicateJSONKeys (cognitive 20): filemerge.rejectDuplicateJSONKeys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 328). 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d28ebb6e33dac561b32ff4f746b792ff0075cce26dcebbcc7bead7c2fc30aae"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall.engramOperations (cognitive 20): uninstall.engramOperations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (9 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":"internal/components/uninstall/service.go"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ce2f30073a5b0688d3fef20ac1d946dc5415a8971fc2f39d3be3485e13c0af"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivationPlan.Rollback (cognitive 20): ActivationPlan.Rollback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background.go"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ed0f6af3784bc5457a629f53bcc910f414dc7ccd0e49cffc946c9e6f81e0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"releasepolicy.validateSnapshotFile (cognitive 20): releasepolicy.validateSnapshotFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/releasepolicy/policy.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded78461791fd05f108cf5e59d4ab8ee0444af2aed53781eea0515aeff41429"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactReviewInput (cognitive 20): reviewtransaction.validateCompactReviewInput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684f9c5fccdc4c3a3d3984eb7ee3093f0a2012979d2ca9f306cdc373416015a"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.SanctionedCompactRecoveryExits (cognitive 20): reviewtransaction.SanctionedCompactRecoveryExits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 2, 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":"internal/reviewtransaction/compact_inspect.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da1b9e03cf9e87340d7e2b2bc5162e7f84c384cf4b28927cacceecb74b7cade"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.publishPrivateRARImmutable (cognitive 20): reviewtransaction.publishPrivateRARImmutable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1373fdadea07ca899291f9a48795a570a07824225729f8c2b2a1ccd4f51a13b1"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ValidateTargetedValidationRequest (cognitive 20): reviewtransaction.ValidateTargetedValidationRequest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, 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":"internal/reviewtransaction/targeted_validation_request.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f533ba494bdcdfb76d46b86f0c2007b23d22a1eb20c328a8a3ae34523de4582"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.verificationDocumentContentActivity (cognitive 20): reviewtransaction.verificationDocumentContentActivity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"553c73418827d65fe68f88999a28ee04635ee0c6b3f8b12a2c5bb32a19c5448d"}},{"ruleId":"D2","level":"warning","message":{"text":"RARAuthorityRepository.resolve (cognitive 20): RARAuthorityRepository.resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, 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":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0c5c511d37a8efd0be21b7c63b10c48aeeb292a1fb0dfdf4eade6b2ec3760d"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.renameAwareSavings (cognitive 20): SnapshotBuilder.renameAwareSavings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c5ac2b773e3793b22376fe80174b2aaaea38275f96c86f87a845397ca1c33d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userSetAsideAgentTools (cognitive 20): shellinstaller.userSetAsideAgentTools has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_tools_unix.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c115862e4a2a2adf3949f9d58af56dd995974d990ac2f5b2dee24cc138c423"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userReuseWalk (cognitive 20): shellinstaller.userReuseWalk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"47525b28c88e843c6938a44871e821f051ee7aa172d178601699414b9b2eb463"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userReadMainArchive (cognitive 20): shellinstaller.userReadMainArchive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_custody_unix.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac0456eb80d95d895c7f16461bed5b8dd19c7bcf88f149f32b68a36f376185"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userNativeExecutionCheck (cognitive 20): shellinstaller.userNativeExecutionCheck has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_guard_linux.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad792626fac41c7aa66582fb3cfac2578e4ac70c7016ca1a34715ec03ba4d357"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPNPMRelocation (cognitive 20): shellinstaller.userPNPMRelocation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 1 (2 pts), match/switch 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":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ab617ecd1cc250394190027c3749cd1ee198cf09dc602c16c3ff1cf5ba6f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeInstallerRuntime.Prepare (cognitive 20): NativeInstallerRuntime.Prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, loops 3 (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":"internal/shellinstaller/user_native_bootstrap_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9840c386e745ee698c0d115a3902c241931496931be4bad3ae86a61f5bbcd567"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeInstallerRuntime.produceForDestination (cognitive 20): NativeInstallerRuntime.produceForDestination has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, loops 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":"internal/shellinstaller/user_native_install_linux.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"137045eefcb4d7784799aeae80dd93d0a153e382d3e707da741986ccc15879c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.optionCount (cognitive 20): Model.optionCount has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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":"internal/tui/model.go"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"790460a54fd5c0e39ce8ca05aa5f7640cd9c52116e71edce89700464c292f8f3"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderShellReady (cognitive 20): screens.RenderShellReady has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 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":"internal/tui/screens/shell_experience.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda82cda18b5787234e6ae4707f40cfb2a09c52adc4f37d24d6a518ac98bc6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderShellManage (cognitive 20): screens.RenderShellManage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, boolean chains 2 (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_manage.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f3e57a1dfa925ef2bf4d1e2cd043da0918b58bbf1d28ed682508ed16b98582"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderShellWelcomeMinimum (cognitive 20): screens.renderShellWelcomeMinimum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/welcome.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"175fa4f5d63dd59a7082ca578b252e6dee952b1692a53c197d4ce6cb847b1f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"pi.repairPiEngramPackages (cognitive 19): pi.repairPiEngramPackages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"internal/agents/pi/adapter.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fd6fed1448b00cb0be18e2ddbdef7790c2c9684814ae95e3e746be86f16626"}},{"ruleId":"D2","level":"warning","message":{"text":"app.selfUpdate (cognitive 19): app.selfUpdate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/selfupdate.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d6fb64c4beb260aac82eda04afd285fbbc1aa0a15ff6427c63c1c14dc9465b"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RestoreManagedBackup (cognitive 19): cli.RestoreManagedBackup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codex_home.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2af8e4b4fb17c08ab147ad8c58f9e7e307f6810ec2bac63b1307071369df063"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewProviderMaterializeEvidence (cognitive 19): cli.reviewProviderMaterializeEvidence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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":"internal/cli/review_provider_roles.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfa386571840aa0a909520701dd5c84bcd748db3a5e68074e9a0ea4a4eb9a15"}},{"ruleId":"D2","level":"warning","message":{"text":"compatibilitySkillsRefreshStep.Run (cognitive 19): compatibilitySkillsRefreshStep.Run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 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":"internal/cli/compatibility_skills.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce92ed24181c6ab022046d6ec05def6bdfbbc72b0921bc19b1108ed6b7555c2"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.permissionRules (cognitive 19): legacyassets.permissionRules has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c243287d4420873cd16fb9154b6c9767c9a5aa9fb3baeddc1dfa239a97033"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivationPlan.rollbackProfiles (cognitive 19): ActivationPlan.rollbackProfiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_profile.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c689354c03bfa8c104c230edb12c06f8611ac138344f92de3b213ed9a3611ac"}},{"ruleId":"D2","level":"warning","message":{"text":"startupPathModel.enterBlocks (cognitive 19): startupPathModel.enterBlocks has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (7 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_readiness.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3f6373b894aa420a961685e27845781ef2770730035f5b33ae79ea0c0402f1"}},{"ruleId":"D2","level":"warning","message":{"text":"providercontractbundle.canonicalOrchestrationEntries (cognitive 19): providercontractbundle.canonicalOrchestrationEntries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"314d94436c39f8a0687d5f89d1191466bb1dcf5db4b39c2c2ebb69aa4bb33291"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.artifactReferenceTokens (cognitive 19): reviewtransaction.artifactReferenceTokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d36e783c575b1640d810af180923ae72fd0d9db199d80a731119f07e4ebbca"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateClassifiedRepairResidue (cognitive 19): reviewtransaction.validateClassifiedRepairResidue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"124434d0879eda911f988a52f5aded6e6dc7798858b813ad0c6ad1e6ff5ca494"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.parseFindingLocation (cognitive 19): reviewtransaction.parseFindingLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b64fb08395c0f70173d40911ba8672d5c5aa0a6c5db29c8211c93c1d49f916"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.classifyCompactTargetRelation (cognitive 19): reviewtransaction.classifyCompactTargetRelation has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 7. 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":"internal/reviewtransaction/compact_target_relation.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a402be69f58d82dbbbdc9e33fef35578c5b1d048af184d83199193272f2ad735"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.BuildCorrectionPlanRequest (cognitive 19): reviewtransaction.BuildCorrectionPlanRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/correction_plan_request.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88387750148139cf08d2ebe4f42c49607481fd9f0b34c57266dada9e0d8449d"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.inspectHistoricalLegacyAlias (cognitive 19): reviewtransaction.inspectHistoricalLegacyAlias has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3, 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":"internal/reviewtransaction/legacy_alias_repair.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26f5828a56c7f846ce59f08e2d96445274740d713dca99d4fe8fb1280541e39"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ensureMaintenanceLockPath (cognitive 19): reviewtransaction.ensureMaintenanceLockPath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, 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":"internal/reviewtransaction/store_lock.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b6741fd337b03c10bdfe6259b31f1c95c50999d0f5d5609c521501894b496"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.targetStatusForCandidate (cognitive 19): reviewtransaction.targetStatusForCandidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd155ddaba4749b778ad1af288b723b4e6f128c4cc357b160c48409117806622"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactState.CompleteCorrection (cognitive 19): CompactState.CompleteCorrection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (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":"internal/reviewtransaction/compact.go"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe63d3a3751a1e835517fb9c5f4e1439e6c9618ea3a5cfef86c5b95c5167c48"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.ClassifyVerificationApplicability (cognitive 19): SnapshotBuilder.ClassifyVerificationApplicability has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2bc40b40ff5828b39d1aeff08366460d82e5b0b4ef94a267e07f1b7783350c"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.FreezeFindings (cognitive 19): Transaction.FreezeFindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ced72de2125aa80f143fe5ed86c7d7a1190c048a8144d5e31a7b4a3a80a94"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userCarryAgentStateEntries (cognitive 19): shellinstaller.userCarryAgentStateEntries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5e839fe39583a6bac4cbc0c7b0ebcf5ab65b54ce0be845634cb535776c2ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userCarryTree (cognitive 19): shellinstaller.userCarryTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 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":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f4db194a146b3d13c51ab18d30122386832ae670dc677c77526075aeab4090"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPlanAgentToolsRestore (cognitive 19): shellinstaller.userPlanAgentToolsRestore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_tools_unix.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d0a7bf467f2ab74def152a3d459d15d58c94308396e15ac6bdb1b01af20bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userAcquireCodeGraphArchives (cognitive 19): shellinstaller.userAcquireCodeGraphArchives has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd08f62b41d7a16aa179ee465a2ef73981698e196c97b3fcce5ce776828c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userContext7Update (cognitive 19): shellinstaller.userContext7Update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3 (nesting depth added 8). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 74). 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":"internal/shellinstaller/user_experience_private_unix.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"918a34d30dba1a0853f77dd5c0c3a54f9d8cfe5c04521e6e1a7d4cdc0a607220"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userTools (cognitive 19): shellinstaller.userTools has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"30af5fd94e2debc1cab71b037ec36da9290164076cbcd00eefdc33c80aae172c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userProvisionAssets (cognitive 19): shellinstaller.userProvisionAssets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"0047ae9e458734fbf882c5750b30a4d506bc0b42927a0d4bc68c9693a1ff08a2"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.RunUserEntry (cognitive 19): shellinstaller.RunUserEntry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), 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":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf23078a53fd073dfab310e02c2106817c02f3638056e5ece4df3f009f68683"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userPNPMPayloadInventory (cognitive 19): shellinstaller.userPNPMPayloadInventory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 48). 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":"internal/shellinstaller/user_pnpm_seal_unix.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb5fcc2eb6e63ef0686446a56ab451e7862f2f13b33e338857f9139ea760baf"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageWindowsAdvancedChoices (cognitive 19): shellinstaller.userStageWindowsAdvancedChoices has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 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":"internal/shellinstaller/user_experience_stage_windows.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"430c2d5f8b92051483ef3e3a3f15ed8e973b564ae61acd2682e390a21f8ac520"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderCommunityToolResultDetails (cognitive 19): screens.renderCommunityToolResultDetails has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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":"internal/tui/screens/community_tool_result.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa8f5e704f98e9b75c5c6184f96313893f0ed059c4ac8373de73fa5cc738b58"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderCommunityTools (cognitive 19): screens.RenderCommunityTools has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (5 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":"internal/tui/screens/community_tools.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02da255b2a4e6b2a09fcd0002d70a88e68f217803540f511a08826735d931ad"}},{"ruleId":"D2","level":"warning","message":{"text":"update.fetchBetaModulePath (cognitive 19): update.fetchBetaModulePath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 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":"internal/update/github.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff907ee8dbf0eff02497dd7c79a677784079fd9e6a7763409150f74baa590cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"update.fetchLatestReleaseMatchingPattern (cognitive 19): update.fetchLatestReleaseMatchingPattern 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":"internal/update/github.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeb334727036a7c9ecfe7c0114735d04dfaed72086403b4df3783e5bc9d097e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentbuilder.uninstallFromAdapter (cognitive 18): agentbuilder.uninstallFromAdapter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 pts) (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentbuilder/uninstall.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe8fd708322ae1c2f8b566b91c003947d61ff2aa6b92f23a2e6713f02dbb7c"}},{"ruleId":"D2","level":"warning","message":{"text":"app.runSkillRegistryRefresh (cognitive 18): app.runSkillRegistryRefresh has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"633f4cd75a842a54da3ed219d96d37954e3c873043c5fe6b9c7ed76d8e8c6e88"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validateReviewTransitionSelectorFlagCounts (cognitive 18): cli.validateReviewTransitionSelectorFlagCounts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3, 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":"internal/cli/review_facade.go"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cd59a17330771718c54cffd73bd26f10fc240a7e1b11cba18ab12b3dfa9105"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewMode (cognitive 18): cli.RunReviewMode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 2. 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: 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":"internal/cli/review_mode.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b7426f1a6a1c5c11966c6cdc83b47cf7bc7a0fd31e5f17282209623695166b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewGateDeniedError.Error (cognitive 18): ReviewGateDeniedError.Error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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":"internal/cli/review.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78000cbad52e0747b9b5ff0901bbbd1f37695671555a5cbfa318bf1d50edb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.ApplyOpenCodeBackgroundPolicy (cognitive 18): agentguidance.ApplyOpenCodeBackgroundPolicy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agentguidance/opencode_background.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4479daa38e4282f2e3ea9eca327806f74768697c573a4511685ccd321498ac54"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.restoreAntigravityPluginAssets (cognitive 18): engram.restoreAntigravityPluginAssets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"354069be665d6f8c05357a5e43cdc5e936af7a5caef1554eb3e667a448259280"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.codexTOMLTableBool (cognitive 18): engram.codexTOMLTableBool has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"internal/components/engram/inject.go"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee9f6c51d6089f116a71d00927a76d5c4cc87fac0f624053b606dc9fa872880"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.mergeJSONDefaultsForPathBody (cognitive 18): filemerge.mergeJSONDefaultsForPathBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff20cd1cca45dbc3948a3ba1f27a88188b0c31b355adacdfecc9f057d13b6af"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.ensureAtomicParentDir (cognitive 18): filemerge.ensureAtomicParentDir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"internal/components/filemerge/writer.go"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3647579dff917590863af5917aec55f81b273a6a1d7ad2424261dc058171d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.readClaudeFile (cognitive 18): telemetryruntime.readClaudeFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (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":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"04422b773e8075b966e472b2743b41b386e4376e9c659cbafd121e9aae332024"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.readCodexTranscriptTail (cognitive 18): telemetryruntime.readCodexTranscriptTail has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bbf499d346d3c0394d7fcfe7cafaccc1aad08249e14154fdf4f6a5d92cb5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.readCodexAssignment (cognitive 18): telemetryruntime.readCodexAssignment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 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":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd6047ad3d47c3ffe202f613a5b5766af2de70f05e7648b500d3f519abecfcf"}},{"ruleId":"D2","level":"warning","message":{"text":"model.DiscoverCodexModels (cognitive 18): model.DiscoverCodexModels has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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":"internal/model/codex_model.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e851fc2d5bd91d222befb0d6e66186029def271a14a5fab4dec1462b3a5563"}},{"ruleId":"D2","level":"warning","message":{"text":"startupPathModel.resolve (cognitive 18): startupPathModel.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"internal/opencode/background_readiness.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb85b4e3558b79a4df2f26a55da163236ed41fb0ff8c1c7a10244145d7149ba"}},{"ruleId":"D2","level":"warning","message":{"text":"planner.TopologicalSort (cognitive 18): planner.TopologicalSort has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (7 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":"internal/planner/order.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb177498857911aa76ba9e9342af49f20f5201875e9f10a5fb40ebec243feb"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.reconcileClassifiedAuthorityRepairRecord (cognitive 18): reviewtransaction.reconcileClassifiedAuthorityRepairRecord has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (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":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"930335dd9ab97eb26bcb3d6e0854a52cebf1795afbef79c30821876924ea85be"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.AcknowledgeApprovedCompactAuthority (cognitive 18): reviewtransaction.AcknowledgeApprovedCompactAuthority has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_burn.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e7242a4b49dd3a0b5aa2c28c26561b34de283d4f2a8df5ad441c33ff331084"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ImportCompactTransport (cognitive 18): reviewtransaction.ImportCompactTransport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"35deed8e20e12a834d59bdd2b8b36d35e4b4fc9ae1c7d0f52fd3eab31f6c543d"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.isOperationalMarkdownPath (cognitive 18): reviewtransaction.isOperationalMarkdownPath has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), boolean chains 4, loops 2 (3 pts), if/else 1 (2 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"972e5536c5f7d33a298b082a8b5e1cf6281f79d90231fb6486cd71d267be7972"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedCandidateInspector.Inspect (cognitive 18): PreparedCandidateInspector.Inspect 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":"internal/reviewtransaction/frozen_candidate_context.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5979b74b481961a87a810f21d4283e38761c4aba248caf3e980375ed3e0cef8c"}},{"ruleId":"D2","level":"warning","message":{"text":"VerificationPlan.validateStructure (cognitive 18): VerificationPlan.validateStructure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"5399e8ba8fb8f34d786ae5f29704f27980f5101e17873ce7f4b0b3cce9db2fee"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userValidateInstallStage (cognitive 18): shellinstaller.userValidateInstallStage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_stage_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8211f3ea3e249ffa60fab83c622dc8490714da0b2f773ace031332bdd1ef1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userCompareMainSource (cognitive 18): shellinstaller.userCompareMainSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 114). 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":"internal/shellinstaller/user_main_source_unix.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e0ee205b6c873fff49f8f689fe1a40ed1a02b7307ca26985f2d7f771a0ae1d"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsCompareMain (cognitive 18): shellinstaller.userWindowsCompareMain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 8. Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). 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":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8dbbe7bbee5fb903f6c106b14a1ae96c26ae81fd6774bd6a605c378cc6f296"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsPruneReplacedBackups (cognitive 18): shellinstaller.userWindowsPruneReplacedBackups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 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":"internal/shellinstaller/user_backup_retention_windows.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"740bbd8b323b089af754f55a09ac751d46002bb8a94ca00c4ca733544c1403aa"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userWindowsVerifyArchive (cognitive 18): shellinstaller.userWindowsVerifyArchive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 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":"internal/shellinstaller/user_launch_windows.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842e1b5cd4a5c1eecd594d3963698246c67072daa6882c7a27e9f2ed1ad348f"}},{"ruleId":"D2","level":"warning","message":{"text":"userPNPMInventoryReader.file (cognitive 18): userPNPMInventoryReader.file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 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":"internal/shellinstaller/user_pnpm_inventory_file_linux.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc7acb0ddb367e09f88edc16d6f610349e2c8f4fb22851dcb5eb6edc036862e"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.SendRuntimeWithDeliveryID (cognitive 18): telemetry.SendRuntimeWithDeliveryID has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_send.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e976f41c747b696ddaac8d793aeb2e0e881c7bdf6525e1e2f1a3ea57a5058db"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetrycollector.fetchGithubReleaseDownloads (cognitive 18): telemetrycollector.fetchGithubReleaseDownloads has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (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":"internal/telemetrycollector/downloads.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a480b89748c27023c2516342a82575970ad5081e8ba68ec003c290a1dc8d336d"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.startInstallation (cognitive 18): Model.startInstallation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts) (nesting depth added 7). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 4912). 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":"internal/tui/model.go"},"region":{"startLine":4903}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc7d86f7ee2a24d3e34d7e59d2dd33c78f67bd6048dc2fd7efd0a7f9082527"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderShellUpdate (cognitive 18): screens.RenderShellUpdate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"internal/tui/screens/shell_update.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"88add05ceaf1462971a39fee444b82343a685cff9d1bfd1e34f58d715db37c08"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderUninstallConfirm (cognitive 18): screens.RenderUninstallConfirm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 3, match/switch 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":"internal/tui/screens/uninstall.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdeb3f843654da4a74e242571d509c89b6acb80676fd48a191c1116027f9955"}},{"ruleId":"D2","level":"warning","message":{"text":"update.RenderCLI (cognitive 18): update.RenderCLI has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/render.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b211aa50fa3f426060ebe86a09df21aaffe26af4f9f4d1371b7a5b00370f6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade.extractBinaryFromTarGz (cognitive 18): upgrade.extractBinaryFromTarGz has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). 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":"internal/update/upgrade/download.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd80595bd77f6f090112ba9009f674014c1c5e93a1fa4f50e1ffbb36014a4cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"codex.compareSemanticVersion (cognitive 17): codex.compareSemanticVersion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2, match/switch 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":"internal/agents/codex/runtime_version.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2684ea1c5ecb90325bfe58be2715b9817e3b390ea75ec8020fbdc0370b9d4f95"}},{"ruleId":"D2","level":"warning","message":{"text":"backup.isPathUnderRoot (cognitive 17): backup.isPathUnderRoot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d44f803b8e9a2912a24ad9e536daf741a651645d66482e2d11e098b38b4ab5a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.ResolveOpenCodeBackground (cognitive 17): cli.ResolveOpenCodeBackground has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 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":"internal/cli/opencode_background.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"861e42dbc31ebd8fabaf177c37c84f24f0ae37a403ef57cd3a123174e9e59085"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.ResolvePiBackground (cognitive 17): cli.ResolvePiBackground has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 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":"internal/cli/pi_background.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"74715d9aa0a9a778fb57adf0e09938a48aa157a79df1ff003ba72cccc8a946a0"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewStatusRecoverySuccessor (cognitive 17): cli.reviewStatusRecoverySuccessor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6671c6cae725465ab9506cf120adf684e4ef41adebd336af68e2d8262b306d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.authorizeReviewStart (cognitive 17): cli.authorizeReviewStart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_mode.go"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"400fe6ea5392ad19f93633e527159155fb975d4c1244c77502bdfbb05f89caa5"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewProviderAdmitRaw (cognitive 17): cli.reviewProviderAdmitRaw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6b33460f97aaf39101d42a2acd253ca7d23b410a26d200c74ab769d2700e5"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.RunReviewCaptureValidation (cognitive 17): cli.RunReviewCaptureValidation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_role_capture.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"102ff22e9da64b4bac2124e0134f62c829615f262c5df19132e4a4c56a4df3af"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.openCodeSDKRunApprovedManager (cognitive 17): cli.openCodeSDKRunApprovedManager has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, 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":"internal/cli/run.go"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c68852755d0d0e4b31ebad672d2a46430d3f363b12044bdf4e95bcecd74abf"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.verificationComponentPaths (cognitive 17): cli.verificationComponentPaths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 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":"internal/cli/run.go"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"331e2b961136d1bd872b2f8c661e98218a0944f4b4de3e834e1b9cf5986671ad"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runTelemetryStateCommand (cognitive 17): cli.runTelemetryStateCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), 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, 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":"internal/cli/telemetry.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"127fd9eeaa9b1b861668bc0aebadf9e30afdab079fa03bcd843cb6d308bb8db6"}},{"ruleId":"D2","level":"warning","message":{"text":"unixCompatibilityDirectoryWriter.Write (cognitive 17): unixCompatibilityDirectoryWriter.Write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2. Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"internal/cli/compatibility_writer_unix.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c14e8a9a638e1b8bf53a4fd5af7aa298eed321d13144bc387af5de44c29a25f"}},{"ruleId":"D2","level":"warning","message":{"text":"codeGraphGuidanceSyncStep.Run (cognitive 17): codeGraphGuidanceSyncStep.Run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"internal/cli/sync.go"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a11895ee0e5db7da9c7cdc7a94c920a0e2901e2403315bba368bc30343662a0"}},{"ruleId":"D2","level":"warning","message":{"text":"agentguidance.renderOrchestrator (cognitive 17): agentguidance.renderOrchestrator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 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":"internal/components/agentguidance/orchestrator.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f421bc71a3434c8cdb9d6c81e43abd4ebcd0de6714c0c27041e155d109cb297f"}},{"ruleId":"D2","level":"warning","message":{"text":"agenthooks.pruneClaudeLegacySkillRegistryHooks (cognitive 17): agenthooks.pruneClaudeLegacySkillRegistryHooks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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":"internal/components/agenthooks/skill_registry.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc6faa59a75e8811103fb4bd03c2e9dde8aab70d499dd1de4d48f6eb0f91a7"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.verifyPiMCPWithProbe (cognitive 17): communitytool.verifyPiMCPWithProbe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"849805dd25778fca6e8c566feaba58701d960fb6dcf4a0c52daef6b8f1a0eebd"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.inspectPiCodeGraph (cognitive 17): communitytool.inspectPiCodeGraph 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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eca8d54bfc2c8805b1847fe0b651f0a8261a901588053d1585aae88f6be40b"}},{"ruleId":"D2","level":"warning","message":{"text":"engram.injectAntigravityMutationsUnderLock (cognitive 17): engram.injectAntigravityMutationsUnderLock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90bd3c845285da1155f4907139348b087f234cb5ac9b9a63501aeb0f820ecf0"}},{"ruleId":"D2","level":"warning","message":{"text":"persona.preflightJSONCAgentCleanup (cognitive 17): persona.preflightJSONCAgentCleanup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/persona/inject.go"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31af5277f8f30a4effefff38b2e197e99a107e33b3ea12d7afead39e448b4be"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.ResolveRuntimeConfigForHome (cognitive 17): opencode.ResolveRuntimeConfigForHome has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"internal/opencode/config.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9134545b12b1b3225afa26f5e25d4331aec704d254e7a67708abe163b73ebd3b"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.referenceOutsideRepository (cognitive 17): reviewtransaction.referenceOutsideRepository has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2662b5303b3e5bc7e0e46ba2ad0803eb8778e2cb610d798debda2eeccef970"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateCompactResultReopens (cognitive 17): reviewtransaction.validateCompactResultReopens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99c6f88193cc23aa8045020f8a3ffd1879dfabd31ca64edfa4b2253509a81dc"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.quarantineCompactStoreEntry (cognitive 17): reviewtransaction.quarantineCompactStoreEntry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: 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":"internal/reviewtransaction/compact_reclaim.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880518902db660027c13dd523144a13f62c2ef1fa87696366e8cdb439c3bb30"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ensureCanonicalReviewQuarantineRoot (cognitive 17): reviewtransaction.ensureCanonicalReviewQuarantineRoot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"internal/reviewtransaction/compact_reclaim.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a1dbaeea3226c1ca4b1ebdebb8a707ad3b5ac07681349973c3fa127f7b733f"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.forensicHistoricalCompactRecord (cognitive 17): reviewtransaction.forensicHistoricalCompactRecord has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4, 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89aded25e3a32aed5201cd5adfbf8e9abc48f27761f60c628fb314a297e45a6"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.RebuildCommittedBaseDiffCorrectionCandidate (cognitive 17): reviewtransaction.RebuildCommittedBaseDiffCorrectionCandidate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"456c2165649f3567ea49b5a70edda220d320288d40341b39275d237105156f71"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.storeResetLineages (cognitive 17): reviewtransaction.storeResetLineages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"01721f72a4e17d56c949e78639fdfffb4a552c104be876b3c39b78e1be9bcaa0"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.storeResetExecute (cognitive 17): reviewtransaction.storeResetExecute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c832992ee61195310503f4eb3e5c36d630f96807d671f0449658dcdd2f0e761"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.explicitReviewingCompactCandidate (cognitive 17): reviewtransaction.explicitReviewingCompactCandidate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e138f434274a38de20683ff64a440634437b79ad61b1c40676039df3072e090"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.buildTargetedValidationRequest (cognitive 17): reviewtransaction.buildTargetedValidationRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 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":"internal/reviewtransaction/targeted_validation_request.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b809ede048dc9c9e1fe393828a622c856217266d5d3b85a227ea944e2a3d0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.ValidateVerificationResultRef (cognitive 17): reviewtransaction.ValidateVerificationResultRef has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1, match/switch 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec008115d7a0bc571aa1f71cc9dec9a3fe466b85438f4a036330eb859b3c69b"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.CompleteFix (cognitive 17): Transaction.CompleteFix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb6beac5db9aa678f77f897c9d523cacc5f454964e85ea77d9056dd6a1b5b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userManagerVersion (cognitive 17): shellinstaller.userManagerVersion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd9db031fadf79bae03d694d37cb26528655e31aead920e5244d2ad741a5166"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userMainSnapshotUsing (cognitive 17): shellinstaller.userMainSnapshotUsing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (17 pts) (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_snapshot.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"460200ea8becd04430a064c1c9f448e32955b3d3c602852f97eb612fdec26f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userRemoveLauncherPath (cognitive 17): shellinstaller.userRemoveLauncherPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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":"internal/shellinstaller/user_shell_launcher_path_unix.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce153bb303c8f5c2e665f273b30f6364c955cdcc8a327e675d7fea7fafd029"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userShellLauncherNote (cognitive 17): shellinstaller.userShellLauncherNote has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 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":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a3fc8d011f1a9e918acac109ec57db14edcafdcd21595b0cbdea0e295bf371"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userSealInheritedDescriptors (cognitive 17): shellinstaller.userSealInheritedDescriptors 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":"internal/shellinstaller/user_supervise_darwin.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aff781b1d5b7f8ec2f49b40264c45e86bc277f62bd34d569cbf801410cf11c"}},{"ruleId":"D2","level":"warning","message":{"text":"system.resolvePlatformProfile (cognitive 17): system.resolvePlatformProfile 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/detect.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb03e178e987d3e69a0ec75591e5b36ab2af7e13986eda09593a971d100be1e6"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.NormalizeClaude (cognitive 17): telemetry.NormalizeClaude has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_claude.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583f8654ff1a78f25cdf40dc34b998118079e779e9b0529e9ae5ea164c2dcff"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.openCodeBounded (cognitive 17): telemetry.openCodeBounded 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":"internal/telemetry/runtime_opencode.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89dd179eaa695638f146f0b8065013ec0072d2e883a0f77162528d8b58d797c"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderCodexCustomPhaseList (cognitive 17): screens.renderCodexCustomPhaseList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/codex_model_picker.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a219f0e27f9c6fd456ccfd6eb4b14c8ebd310157a91f20c10331f8f535846b1"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.parseRose (cognitive 17): styles.parseRose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/styles/rose.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c2330b2117fb8ced7f70b0439c36ff3521107e12c340252862ef440454518"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode-review-transport.compareSemver (cognitive 17): opencode-review-transport.compareSemver has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2def810a549a5526e112ad3fae26aebb41292ccae09d5e2f9e2c0e5ba228fcf9"}},{"ruleId":"D2","level":"warning","message":{"text":"agentbuilder.Uninstall (cognitive 16): agentbuilder.Uninstall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 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":"internal/agentbuilder/uninstall.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f59cf4a536149f1144623930605a29d8d2d107e265eb2335bdcf76e3b1a429"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshotter.Create (cognitive 16): Snapshotter.Create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 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":"internal/backup/snapshot.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f8f04eb61fd8e68a4ab8e246eb7189a2b8c936241fb72149c42776d7410d12"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.excludeCodeGraphIndexLocally (cognitive 16): cli.excludeCodeGraphIndexLocally has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, match/switch 1 (2 pts), loops 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":"internal/cli/codegraph.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c83719ad3d6b8fd5f2420ee0a686ec2649cf74d5eb0b29386fca937d4561fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.doctorLauncherChain (cognitive 16): cli.doctorLauncherChain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (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":"internal/cli/doctor.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b387e9152a1b461c42b05c2f551b51e87fb91748f1180b2495d7e7384212a4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.hasPiMCPAdapter (cognitive 16): cli.hasPiMCPAdapter has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 2 (5 pts), loops 2 (4 pts), 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":"internal/cli/pi_mcp_diagnostic.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"014f91ddd35c7c6294e0a8590c14e3e6d4ecd0faa65320b36cca1276cb07c5b4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewDerivedCommittedRangeSnapshot (cognitive 16): cli.reviewDerivedCommittedRangeSnapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"internal/cli/review_facade.go"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1d946300c20bb95b92a5e0b37cdfe9e158355ab3139254484b19654327e273"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewLensContextBudgetProbe (cognitive 16): cli.reviewLensContextBudgetProbe 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":"internal/cli/review_lens_context.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf361fc2726d9787fb8e7d7fa7d2e629c172d7dca3b624980c915c38d1a5dec"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reviewStatusStartOptionCounts (cognitive 16): cli.reviewStatusStartOptionCounts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_start_preflight.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca6c3e2a98eda16bcd8038ab2be370c70a22c2fc6d08fabf58386a593f01f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTransitionSubmission.validateProviderRoleCapture (cognitive 16): ReviewTransitionSubmission.validateProviderRoleCapture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, loops 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":"internal/cli/review_status_contract.go"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7660155e282b598ee7e398b65fa427b5674cdf165a5113e6cba13b0c95f89d63"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewIntegrationOperationResult.Validate (cognitive 16): ReviewIntegrationOperationResult.Validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, match/switch 1 (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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db265f1bde6f04e79ebd74f16ac81e5b7b079fcb14351b3473954685d0dc84f"}},{"ruleId":"D2","level":"warning","message":{"text":"antigravityrules.MigrateLegacyPrompt (cognitive 16): antigravityrules.MigrateLegacyPrompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/antigravityrules/publish.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bc0802f355f98982411645bcb1600b0a51f5f3a8d6f2775fd3500dcf0b9571"}},{"ruleId":"D2","level":"warning","message":{"text":"antigravityrules.Render (cognitive 16): antigravityrules.Render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/antigravityrules/render.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e3ee352705b45cd95826bf2aef0d6c6deeb172e465085630306cf7efd251dc"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.stripKnownUpstreamCodeGraphLines (cognitive 16): communitytool.stripKnownUpstreamCodeGraphLines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bc541b245a7b228783999b3a5d5a7220c2567f92f902cd9ac82ba74ac82414"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.probePiCodeGraphMCPWithTransport (cognitive 16): communitytool.probePiCodeGraphMCPWithTransport has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86caf39d6cf33db81749b34e8eeaf4e05a50390da90e958d4fce0c957c31ac"}},{"ruleId":"D2","level":"warning","message":{"text":"communitytool.releaseStalePiChildren (cognitive 16): communitytool.releaseStalePiChildren has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b23d95ca1873c7b381ce59848ff625af6bb847b9c036e289bf09bd314245bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.StripLegacyATLBlock (cognitive 16): filemerge.StripLegacyATLBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"internal/components/filemerge/section.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4beea55b7e60b2928aca87ace46a682fb14f97ceefa4fb05367f42b9edc0595d"}},{"ruleId":"D2","level":"warning","message":{"text":"filemerge.writeFileAtomic (cognitive 16): filemerge.writeFileAtomic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/writer.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c4723244b21aec2119a3a20fb38b9d3e3a715ebd4ae055996c327642fc10ba"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.retiredSDDAssetItems (cognitive 16): legacyassets.retiredSDDAssetItems has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (4 pts), loops 3 (4 pts), match/switch 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":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe5c8008789cfd2465751889837244b091ec3abc2f2f86ff42c9aa56665a7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyassets.removeSDDOrchestratorBlock (cognitive 16): legacyassets.removeSDDOrchestratorBlock has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), loops 2, match/switch 1 (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":"internal/components/legacyassets/sdd_runtime_files.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6ce76902c4c56bd7fccb87a5c44344cf3dc0db12320fe3eddd852676487914"}},{"ruleId":"D2","level":"warning","message":{"text":"opencodeplugin.installGentleLogo (cognitive 16): opencodeplugin.installGentleLogo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodeplugin/plugin.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeceacad9c45e2017af9f5c3211e27ab021b2ebd73c905c4fc10946165958f1"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.SendClaude (cognitive 16): telemetryruntime.SendClaude has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, 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":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db6f5e5bf194d7e76cf75daf671b3dbd9de3beb5d9312527d3d6c53cf01a4f5"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.checkManagedPath (cognitive 16): telemetryruntime.checkManagedPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1c7e0f1d65dc3800f2470bfbfc042aa3c9eb7d65e9cb619ce2301cb6c1d5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetryruntime.strictObjectKeys (cognitive 16): telemetryruntime.strictObjectKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46c3175fd9cc1e28d57305925c62ec3c995aaa9e81b95f378b97510f739ed38"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.shellVariableName (cognitive 16): opencode.shellVariableName has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 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":"internal/opencode/background_readiness.go"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a035f80d65183bd92f0b51000e8c9c02133d3530b8f4c3c53394e685430ad29"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.splitShellCommands (cognitive 16): opencode.splitShellCommands has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (5 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"internal/opencode/background_readiness.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"45923037cc24e121b946e7d3064019691782b5bf2bcda268aa521c70d7714ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.candidateConfigDirs (cognitive 16): opencode.candidateConfigDirs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/config.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6c587ff633b3127d760c92be2e0f17aa99cc4ecf2fb9921b9adfaf3ea6677"}},{"ruleId":"D2","level":"warning","message":{"text":"catalogFileReader.monitorSize (cognitive 16): catalogFileReader.monitorSize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (6 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":"internal/opencode/catalog.go"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba641df9b638e2c0c1ad6b97321ce0d20f5a39bd5aada4f612660f9b8ee4c6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewerprovider.codexReviewerLoopbackBaseURL (cognitive 16): reviewerprovider.codexReviewerLoopbackBaseURL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, 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":"internal/reviewerprovider/codex_adapter.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1741c6088c20d20cef71a23a8ddce2656efd5bb5318a86402ccc35ab31bb6a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexAdapter.Review (cognitive 16): CodexAdapter.Review has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 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":"internal/reviewerprovider/codex_adapter.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e15a677529d19157fb02fced52c5a81d806132bc46f3972f53af30c5ad5627"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.artifactRepositoryPathReference (cognitive 16): reviewtransaction.artifactRepositoryPathReference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, loops 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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e012e79898fe3ac09464cf0c08fe21e40c47252edf8b4c51ebac16ca8b900dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.reconstructAuthorityDispositionPlanForResume (cognitive 16): reviewtransaction.reconstructAuthorityDispositionPlanForResume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f03c1e39c54ea8a0f1035fd6c16728f8471937f77950bc7267f47e56c8d876"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.NewCompactState (cognitive 16): reviewtransaction.NewCompactState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab318b2e4b33dd0c64dce0d75c7a0770136567514e798ac14bce7259eeecac2f"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.readPrivateRARFile (cognitive 16): reviewtransaction.readPrivateRARFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"959239adf9cc3b01d0b4c0d0cde89a66a34fcf57d3b8c0b792f6ff872f70cee0"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.validateReviewRepositoryContextRecord (cognitive 16): reviewtransaction.validateReviewRepositoryContextRecord has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"38437a47342886ffca7062e2243bcd3a50950fc84677587654c2a1c76983f14c"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.parseRawDiffModes (cognitive 16): reviewtransaction.parseRawDiffModes 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa0b9642586ed0f295d42c707bba77f3c6f35761f92ac1e618fc17baa90ef0a"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.canonicalGitDirectory (cognitive 16): reviewtransaction.canonicalGitDirectory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"873edd182e11c75ce580a9dce97eec1121ebe6ff4e571386a7997d6146217a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.inventoryVersion (cognitive 16): reviewtransaction.inventoryVersion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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":"internal/reviewtransaction/status.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984f00d726a8e774b05db26df07a914da66a67e0b568e76d8a830334f1ec5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"reviewtransaction.transactionsEqual (cognitive 16): reviewtransaction.transactionsEqual has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (nesting depth added 2). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 694). 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":"internal/reviewtransaction/store.go"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c6f9b679b5ea191278ca1df396c0cf23d072fa64f135aa4902e2073adfc1c4"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactState.ActiveAdmittedLensResult (cognitive 16): CompactState.ActiveAdmittedLensResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"474ff37ca604bbce2c45941f39b3c45f8a083d6a3508e1dad6c7151c53234da8"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userBeginAgentRollback (cognitive 16): shellinstaller.userBeginAgentRollback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_rollback_unix.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab8e1f4d49f814115b01a4c8b42fa511126b4065ab96ca13a6f7f72dfab9f33"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userEntryExperience (cognitive 16): shellinstaller.userEntryExperience has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 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":"internal/shellinstaller/user_experience_selection.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeccf4c2a02165709c1f6474ebf4c2e617a94863b66957f602a40569bcfd544"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.privateNativeFile (cognitive 16): shellinstaller.privateNativeFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, 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":"internal/shellinstaller/user_native_primitives_unix.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e53ab0eaaef5d1f18844572a58276e1484c09db222ed0b891903418ac61dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.privateKernel (cognitive 16): shellinstaller.privateKernel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_runtime_primitives_linux.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173f9f5c39c874b7bdf5695fc9e2de09b56d422dc7f7b539a238dbd3fee09ac"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.RemoveUserShellLauncher (cognitive 16): shellinstaller.RemoveUserShellLauncher 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":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"300a1f81a3d55c726582fa0cf12d9e9711983bbacc56816a5b5229eeb0466ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.privateACL (cognitive 16): shellinstaller.privateACL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 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":"internal/shellinstaller/user_guards_darwin.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb19e996c36fae1fd8fc8a0b2421f0d861eaa7a27d836222807a8306b951b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"shellinstaller.userStageVerify (cognitive 16): shellinstaller.userStageVerify has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_darwin.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac369373d5afb991e0a10f981c585b010e195f4611e169d67e78b39f1155ffe7"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.openCodeError (cognitive 16): telemetry.openCodeError has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (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":"internal/telemetry/runtime_opencode.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05f1934f355034b2c9d507a15e1d9dea35dd5faa6f0cd3cf0179874a530788b"}},{"ruleId":"D2","level":"warning","message":{"text":"tui.readCurrentAssignmentsFn (cognitive 16): tui.readCurrentAssignmentsFn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ee5c6f430419f2f1db74ad3dfc109cfff6b66e98c55b611dcfa8550219561a"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.handleEffortNav (cognitive 16): screens.handleEffortNav has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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":"internal/tui/screens/model_picker.go"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a40eac7c978f21e16e0b80c005f4d9114d5a7b91f4479da558729651673f60"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderModelSelect (cognitive 16): screens.renderModelSelect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"internal/tui/screens/model_picker.go"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e83c7af0962dbfc8ed5b665a648323ca82638c161c83505b4f259b41f92751c"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.RenderReview (cognitive 16): screens.RenderReview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/review.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"88351bff990b523381c8f8d63657da21444e6b3a10026fe2bf4aeafee6947b12"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderShellExperienceConfigWide (cognitive 16): screens.renderShellExperienceConfigWide has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 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":"internal/tui/screens/shell_experience_config.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b9536a9dc0039cee5c647711b1eb354a50a4cfa080949ddd444aaf083b29b8"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.renderUpgradeResult (cognitive 16): screens.renderUpgradeResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/upgrade.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a0f314156b977e166ca1a8aa5eb5e76ba4b3eac4dea0ea92790df231f88dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.renderRoseLine (cognitive 16): styles.renderRoseLine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/styles/rose.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206a4b604fe26bb36d8b81d858c49b58daffd7027bc63f852f4c441864bf313"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade.Download (cognitive 16): upgrade.Download has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 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":"internal/update/upgrade/download.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f61f80695ff67d75c17e2905b3f8cd512a51c87579156f7a48fb174a77a6759"}},{"ruleId":"D2","level":"warning","message":{"text":"windowsCompatibilityDirectoryWriter.Write (cognitive 16): windowsCompatibilityDirectoryWriter.Write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 2. Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b1a18d6e2b3c06625781a2843c3ff287364f8715209b30d120c4f5c668a7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"backfill-victoriametrics.main (cognitive 16): backfill-victoriametrics.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/telemetry/scripts/backfill-victoriametrics.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a34fed58394d3db882e4a0489c437e6ce24ca9c12597ffe05474fa341cee82"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode-review-transport.startRelay (cognitive 16): opencode-review-transport.startRelay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 219, 247, 250). 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":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f371e6b7cdf9213faae29b5f55c116ce54f03026ca7b8b7017b453aa4880b39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/model.go: FileTooLong \u2014 3294 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: Model (85 blocks, 223-4984). The bar is 500 significant lines; this is 2794 over it, 6.59\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":"internal/tui/model.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6be603d40e42faa3a7e8d9e96ad154b65851b626bdaf843045064ee6c3d61"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Model: ClassTooLong \u2014 2579 significant lines (blank, comment-only and punctuation-only lines excluded), 110 methods, 85 blocks, lines 223-4984. The bar is 400 significant lines; this is 2179 over it, 6.45\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":"internal/tui/model.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"34adf0f5ac83ffa32333d3f810e8d67db59ba02374ced0d533f728d0fd48d2ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.confirmSelection: MethodTooLong \u2014 confirmSelection runs 630 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 530 over it, 6.30\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":"internal/tui/model.go"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f3b1edd16b84433e2ac89654476e6322274e4e4d8c405c53751bbc27bb4e16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/run.go: FileTooLong \u2014 3030 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2530 over it, 6.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":"internal/cli/run.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c4b42d51fe57658744db02e3f2b9ea108e8a0aef7b68b38d614aa1b052bdac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.runReviewStatus: FunctionTooLong \u2014 runReviewStatus runs 514 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 414 over it, 5.14\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":"internal/cli/review_facade.go"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f83fee4da7c172a090455dec94bcd5890489224fc42cf93361b53662f6d69c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Model: TooManyFields \u2014 128 stored fields beside 110 methods. The bar is 30 stored fields; this is 98 over it, 4.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":"internal/tui/model.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"553c0d27eb2f4f7686507cb472085bfcd2963a66a59fae4507bab83e2b22ad2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_facade.go: FileTooLong \u2014 1936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1436 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":"internal/cli/review_facade.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b2ea3a5dc0ad5d2708fe6bb14094c2037d948817a4c99cb2c5ceaa7c823487"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Model: TooManyMethods \u2014 110 methods, declared across 3 files: tui/model.go (84), tui/shell_install.go (22), tui/shell_experience.go (4). The bar is 30 methods; this is 80 over it, 3.67\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":"internal/tui/model.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"df86f6e4cc959efd97697ebacaa5852d0fbfe4c635c59e92c0872d6e9d5d3531"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.newReviewIntegrationFailure: FunctionTooLong \u2014 newReviewIntegrationFailure runs 339 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 239 over it, 3.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_operation_contract.go"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54daada77988bbfaef026e0d5a1d0775bb9835c1cdd830d686df3cca532274"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/sync.go: FileTooLong \u2014 1683 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1183 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":"internal/cli/sync.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7770db3886d0e29d01f0425693c848a79cbfde2e643cf446f150bb7518a3dbe7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/compact.go: FileTooLong \u2014 1529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1029 over it, 3.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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f694b222992a5d8fe40cf3b1f33707076c2761735d172c9768a8c741b72211b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: uninstall/service.go: FileTooLong \u2014 1524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1024 over it, 3.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":"internal/components/uninstall/service.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b22099c5e7231038f61e2c07562211ba1bab5e187a99fb197e6418c6ae1ff09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/compact_store.go: FileTooLong \u2014 1515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1015 over it, 3.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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55910065ddeb14f5aed9d1f789431f0481997cda4490438f0469292699efb5b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.handleKeyPress: MethodTooLong \u2014 handleKeyPress runs 266 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 166 over it, 2.66\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":"internal/tui/model.go"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e4292be4e3d4cb3f83893a5f5f19f975f9b02bff8e338ea55ea4998d62cd1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/snapshot.go: FileTooLong \u2014 1321 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 821 over it, 2.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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6297765fd06f3fb3951226550bb7ca77a463483eff112b02c794c5717efe7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_status_contract.go: FileTooLong \u2014 1276 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 776 over it, 2.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":"internal/cli/review_status_contract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00d6aabcc443cd742bb77b1d2c81fa0833a874f2aa2e120addf3658ccfe907d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shellinstaller.userRunInstall: FunctionTooLong \u2014 userRunInstall runs 250 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4e8edf2221d3a78fdade7465c1c1f82e6b5d1f9b3b4caa2599c326639e7838"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: persona.injectInternal: FunctionTooLong \u2014 injectInternal runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\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":"internal/components/persona/inject.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"84644d4abe276f17cedfed9a06c36e154e4cd70bf2b545c38fa25627863ad2f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/transaction.go: FileTooLong \u2014 1233 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: Transaction (29 blocks, 208-1657). The bar is 500 significant lines; this is 733 over it, 2.47\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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"969050f42f2beb9f38cd29169aefbd45f1f9ade49e7884035a126c738e9a4b85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.Update: MethodTooLong \u2014 Update runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\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":"internal/tui/model.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d08baf264f3be6eb699fffc484db625c79fca389a6af47f5691ebaf197d1dff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: componentApplyStep.Run: MethodTooLong \u2014 Run runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\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":"internal/cli/run.go"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"38164b0491095a30d6d07a1f6cfdb17b1568b1d57db23103c9187d52a1c0efc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.runReviewFacadeStart: FunctionTooLong \u2014 runReviewFacadeStart runs 215 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 115 over it, 2.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":"internal/cli/review_facade.go"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ca99de516074d01e1d9ec044fb7f784c83f19cfde3cb0b2396c620e5c27e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_operation_contract.go: FileTooLong \u2014 1027 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f16e8ad7b911a4f75558a355decf152178c5e30d84d2c6671ee7fb5c135931"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/verification_contract.go: FileTooLong \u2014 1019 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 519 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":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a59dc83055ad3d4f23ddecf7084a3cff2668ff3083da99590897d745ae780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engram/inject.go: FileTooLong \u2014 983 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 483 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"548f3ecce4c6d3fdfe747d202e20ca5035544d2f9f96596e3dc6117b03f82ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.RunReviewRecover: FunctionTooLong \u2014 RunReviewRecover runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"001174a3255fe2b244297b2ee70a28755040fbf7e4b34ae0d8e23a247643bdb3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Transaction: ClassTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods, 29 blocks, lines 208-1657. The bar is 400 significant lines; this is 349 over it, 1.87\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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b766e281d243f9d633ea54e70bc5de3fca197ec88ad646ca0609485a2eadb89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shellinstaller/user_install_flow_unix.go: FileTooLong \u2014 921 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f9eeae2433cadc95407d00993f5af30c177d958aac5473491617f5a66b76c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/risk.go: FileTooLong \u2014 914 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 414 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"797444db798139f480f89022ab92ade269ef156cb70808eef8f80e0ac1e6da83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: recoverytrace.reviewAuthorityRows: FunctionTooLong \u2014 reviewAuthorityRows runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"internal/recoverytrace/rows.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c4aeb8aa439753b3c95187df76e5d7b972444ae0863d189f441e04ccbf3a78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.RunReviewCaptureResult: FunctionTooLong \u2014 RunReviewCaptureResult runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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":"internal/cli/review_artifact.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e827eff380703cd51cf85dd41d45a5d851ec4643d754a41b8042264b2037cdd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_next_transition.go: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 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":"internal/cli/review_next_transition.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ed7293e1f0a595b5f4c99664ae33fa3680b1bce027ebeedb575040ee92d8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: engram.injectWithOptions: FunctionTooLong \u2014 injectWithOptions runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"internal/components/engram/inject.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"952012aee70bc0fe903f43cc7bbe1c3161701d51c1fa561a9b5c9fc53c51b8b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.RunArgs: FunctionTooLong \u2014 RunArgs runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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":"internal/app/app.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f20a0897d5c8d8973c576eff5c654d0d92bc9285ced586aba409caef99bdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/authority_repair.go: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 296 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8701ac69554688dc552a260bca574a702dfeaa4a846b12a050ed87f53d9404ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReviewNextTransition.Validate: MethodTooLong \u2014 Validate runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d63601a8f61b640c745938694367c2240b83124af54ecd532fd09f2c54f9ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/app.go: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/app/app.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdb533fd2e4e778d6e8a694af7fa580d25ebbd0b7093b8d7ef35428e88f2025"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CompactState: TooManyFields \u2014 46 stored fields beside 21 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dcefdc635d2378789ac73b104862554bcaabba5a277714d1f9a87ff95eeaf8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SnapshotBuilder: ClassTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods, 29 blocks, lines 111-1534. The bar is 400 significant lines; this is 213 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7eb9326dad15fead79ac8b657b9473508f97e6ead2322c11c84aef5003a24f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: communitytool/pi_codegraph.go: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 261 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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"121cd08dd49fe088bbc7d21f28f47a02d749945d7ea855b3cb93ad9fb871b0f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReviewTargetStatusResult.validateWithCompactAuthority: MethodTooLong \u2014 validateWithCompactAuthority runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57afb70b7e2831ab24c6cee9605eb37e5455a22bd9065720a1b200bf26f6edc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filemerge/json_merge.go: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 248 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a1e8d128034446d73ab32a35a4064639eeb95a16a42521474066901f2f5e02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Service.buildPlan: MethodTooLong \u2014 buildPlan runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"internal/components/uninstall/service.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a82a0281af720edf92dabd3c41f9b9723c44675e441cee0020ac5e3fb88c8de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.View: MethodTooLong \u2014 View runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"internal/tui/model.go"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd74208d02d82b464e161f0f6c5b1d2867ee7ce06faab8c5238934ff827d9b21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.RunPreparedInstall: FunctionTooLong \u2014 RunPreparedInstall runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b44a266f0ead31af1d0f416a5ca67bac39822723cb957e86ab3d9ee2fcee6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/repository_locator.go: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"561a8366d703141614177faeef0eeb33e2f9bbf0730bc56f3b8bab7fdfc97070"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reviewtransaction.AdmitArtifact: FunctionTooLong \u2014 AdmitArtifact runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"854ff8867364852a18544da601993f8b210361ad91453df60774929cc63f8251"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.configureShellExperience: MethodTooLong \u2014 configureShellExperience runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"internal/tui/shell_experience.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86166e919749066c7631b36df07749f17d03e4f83bbf6ca85c4fbf7362eba55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reviewtransaction.assessTargetStatusSnapshot: FunctionTooLong \u2014 assessTargetStatusSnapshot runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a07d4b0b25e8cc87706a5ad4a764c10ca2c1b25a95db0ea357e693faa3d116"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: componentSyncStep.Run: MethodTooLong \u2014 Run runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"internal/cli/sync.go"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18348a87edc216f1761f74e03bcbb30f109335fa45faf7dadfcb4c010efd196"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.goBack: MethodTooLong \u2014 goBack runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"internal/tui/model.go"},"region":{"startLine":3685}}}],"partialFingerprints":{"codehealthFindingId/v1":"e112d9a5709d166fd5d53bc4c50e8a4c6705791f3fbbcba078915bfd90138961"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: recoverytrace/rows.go: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 175 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":"internal/recoverytrace/rows.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c5f56ab77520f00ddbe6df06132ab7e74725b16d45b76cc0b6265c454564d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opencode/background_readiness.go: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 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":"internal/opencode/background_readiness.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cffce41950792e8ca6a6f321080cc90e4cae298bce1f72b61c06656f7b09f7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/compact_reviewer_capture.go: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: CompactStore (8 blocks, 286-985). The bar is 500 significant lines; this is 168 over it, 1.34\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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe966c2a3685755f9f42e464466fad3a69a3a1f9790f69ff92c36c16f525c15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/model_picker.go: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 167 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":"internal/tui/screens/model_picker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b269c16bc9742a006b741f26f2112c0a59f49daaefb58f54cdada497a02645a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SnapshotBuilder: TooManyMethods \u2014 40 methods, declared across 4 files: reviewtransaction/snapshot.go (28), reviewtransaction/risk.go (6), reviewtransaction/frozen_candidate_context.go (4), reviewtransaction/verification_contract.go (2). 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3abc155d576aaf0d3dfacc63862d0dd1f7bbb738dca31f5019f13296d3b4ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReviewTargetStatusResult: ClassTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods, 11 blocks, lines 66-1185. 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":"internal/cli/review_status_contract.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ece55358f1f7b9e6da33157bc44976b19b1380aebee59f154f4276cfe63af48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.componentPathsWithWorkspaceScoped: FunctionTooLong \u2014 componentPathsWithWorkspaceScoped runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"internal/cli/run.go"},"region":{"startLine":4341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb05a678d322faa259ce9c8d3801772edecdba2e1ff4bddb3c54bfdcd27f296"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.validateReviewTransitionExecution: FunctionTooLong \u2014 validateReviewTransitionExecution runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"internal/cli/review_status_contract.go"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4dde44b962725fcd6f612101b4070704682ff1dff47e69811f2a6503ee30de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/store.go: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 146 over it, 1.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":"internal/reviewtransaction/store.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bde7a419940765d2c814741c6d8dd88161bbb5c21d72ebde7e7bdece5afeb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/shell_install.go: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: Model (22 blocks, 51-924). The bar is 500 significant lines; this is 145 over it, 1.29\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":"internal/tui/shell_install.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903c4b3fec051de0e42ea4ee7a37d17b78f24ae6eac9b63a74068619d2c85cff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opencode/background.go: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ffd254a55554c9f0dd2c42bb2192dc0e2653dc0e7441afbeacf395ef66ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persona/inject.go: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/persona/inject.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fb55b6caf1b50cbc7a0144714ce11853c507c350369ae2d7592a2964712177"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.RunSync: FunctionTooLong \u2014 RunSync runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91e48b5e7af629d7985b1fc6c885c794270968f65b1fa21c56115d96d7b7d3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactState.CompactReviewView: MethodTooLong \u2014 CompactReviewView runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"791aac62e50a40740d6cba5e155b81990205f04e8142a30da2623e4ac8259e7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_mode.go: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/cli/review_mode.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3db41cd0993532d381b95e3c13b24b9aa8531d1c66d97114980aa4881fc6eb7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Service.componentOperations: MethodTooLong \u2014 componentOperations runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"internal/components/uninstall/service.go"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c62de4db42c5a345064c12a632940735d47e697c9d9b825826d4c2d7241fe4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Transaction: TooManyFields \u2014 38 stored fields beside 29 methods. The bar is 30 stored fields; this is 8 over it, 1.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":"internal/reviewtransaction/transaction.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb0e5b6a434dfe807a7444e87f078bfcb68157341d3ea34a2e7d830eae28ba3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: agentguidance.RenderRouting: FunctionTooLong \u2014 RenderRouting runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"internal/components/agentguidance/routing.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce6c397fea40ba9d43654a22dc14f10eaa54dcdce43afbc9f97df771efaa7c0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompactState: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods, 18 blocks, lines 109-2375. The bar is 400 significant lines; this is 102 over it, 1.26\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":"internal/reviewtransaction/compact.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70f5f38f930c6f776722f68c734d0b6a64785b85a5cc06052a6f520c403da1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.resolveReviewNextTransition: FunctionTooLong \u2014 resolveReviewNextTransition runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"internal/cli/review_next_transition.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f56fa67c96550678858ecc0bdd5f04796a1a773e4ac063e3b9326089d1b670"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.syncBackupTargetsScoped: FunctionTooLong \u2014 syncBackupTargetsScoped runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"58af7fe9b6d4d8643644ad40cece9636a390e19d4d05f454a4cfa2a5807e4890"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Service: ClassTooLong \u2014 493 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods, 13 blocks, lines 76-1314. The bar is 400 significant lines; this is 93 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1979fbfefc44032402b57545a872860f6b016412e2d61e9780547d571abf97fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.optionCount: MethodTooLong \u2014 optionCount runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ddfc2f00bed4f956a73df90b086a69338cb3be9ffb6dcb97f97b43537539f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/target_status.go: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"429c1218221383e3f17de9e7e6782943e2e3403105fd59fb7166534f8cce5990"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_opencode_transport.go: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_opencode_transport.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8109086cfbcc88c7bbbac49d1dc44a36ead72bdf7e42bcb809af7d50649afb46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/artifact_admission.go: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b723b9e9bddef61bbb8b9953722c76a8e241b761d3d6cdd88661194cbfec8566"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shellinstaller/user_install_windows.go: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade436b4e232f9b3120683f8ce43207bac7dfb477c44c7d363fbb7dec6efee01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/doctor.go: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 over it, 1.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":"internal/cli/doctor.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da21bfc31f4e25e2804df4a52638421feb3f40e62a3f35e2b88b65d2f6430a97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactState.Validate: MethodTooLong \u2014 Validate 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b4dba20aa1e39f486f3f133e1bb7252b584bd539e12917033d6ab988bd8c26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reviewtransaction.validateSuccessor: FunctionTooLong \u2014 validateSuccessor 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":"internal/reviewtransaction/store.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090bd6c9304598fbdf9696017370fe5a18586582b8813b1fc866c84f41c269c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: communitytool.InstallWithOptions: FunctionTooLong \u2014 InstallWithOptions 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":"internal/components/communitytool/tool.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"914b51631ebbbf63cece5c02a88f5011e2a882030f62593f8f5987a351cefb86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Service.executePlan: MethodTooLong \u2014 executePlan 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":"internal/components/uninstall/service.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"625f3d5af4b54d7ca44d312b1b2b5d19afeabedfd4a16069a0c7d73478a02ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review_provider_roles.go: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/cli/review_provider_roles.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28eeeae038d3824eb7476e2f80509080f8ecbe3815ec9e8d72e08272fe01ab1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/rar_path_safety_windows.go: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90fd528c6f301fb34801237a7bfc44e3fa997910555e3c154d541159661e23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.RunReviewAssess: FunctionTooLong \u2014 RunReviewAssess 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":"internal/cli/review_assess.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fafa7faee10f7841c5b33977d5f9bbd093fe89b3f22bd993358f3f7905bdcbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: syncRuntime.stagePlan: MethodTooLong \u2014 stagePlan 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":"internal/cli/sync.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"77143673ddd218c34be17d08cc3945f7545fa648201d6293c8932360b9ac2a2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providercontractbundle/bundle.go: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 53 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":"internal/providercontractbundle/bundle.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dad874a9e21a5891871d36871f5b39b3c67af261974a7a52a7c39b6d4841226"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ReviewTargetStatusResult: TooManyFields \u2014 33 stored fields beside 10 methods. 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":"internal/cli/review_status_contract.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"584e56310f3493c55ce98cdaadeb932d95923147bace9a08c3d390fc72143726"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reviewtransaction/rdd_mode.go: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e910bca919e3f10cb109f482e089fa6b774c2374579e7fb4749122ec2ec39f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.reviewCapabilitiesStaticSurface: FunctionTooLong \u2014 reviewCapabilitiesStaticSurface runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_capabilities.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff7db63911a7eaced5d35fc34f80b99ea0f7af2fd82c9d13925e4426f30628a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReviewIntegrationStartResult.Validate: MethodTooLong \u2014 Validate runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_start_contract.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe7a683980ed4b1b528e059f1ce658e261eb33618d779469f52d7e105c072f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reviewtransaction.RecoverCompactAuthority: FunctionTooLong \u2014 RecoverCompactAuthority runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"863ad71aeac5a0f47753688cfb8d48327fe85421a551d8a4879f36affc3f2a91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: installRuntime.stagePlan: MethodTooLong \u2014 stagePlan 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":"internal/cli/run.go"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"791a199956570aeb2116656851b3fdf613a4104951829093212f28d4a7157981"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.append: MethodTooLong \u2014 append 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":"internal/reviewtransaction/store.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d6bad8c2a25dbf50332edbcfef69a040762946991c948d524e7f5e28fde182"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.runSyncWithSelectionScope: FunctionTooLong \u2014 runSyncWithSelectionScope runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"internal/cli/sync.go"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f419595b68eca39bacd2899b9bfd5b014fe3c06b728ed3fb10f27800262820b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/review.go: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"internal/cli/review.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90df63ec9ebfc2a916fd4a8a34d6f0598a51443de01003194c4083902c2a3c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.run: FunctionTooLong \u2014 run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"cmd/gentle-telemetry/main.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b38d911b3c2c1ea251041a5c87bf0a7da6fdad33311dc565a31fe1196ba00f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactStore.CaptureAdmittedReviewerResult: MethodTooLong \u2014 CaptureAdmittedReviewerResult runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cae0d3896c2f35560af8e5eb28b85d159104292d3275979315775ec2138418"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: communitytool.ReconcilePiCodeGraph: FunctionTooLong \u2014 ReconcilePiCodeGraph runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"386e62fbf1beca0c40f6c4aafeb65388f782909807090b439ea35cba0d943bae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opencode/catalog.go: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 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":"internal/opencode/catalog.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4240a4deef951c79de9e19f9f7c560287086147c192daaee820a3d63ca12062b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 34 shared lines): internal/components/filemerge/json_merge.go:679-740 | internal/components/filemerge/json_merge.go:776-836 | internal/components/filemerge/json_merge.go:908-976 | internal/components/filemerge/json_merge.go:1008-1072 \u2014 These 4 members are variants of one another: a block of 34 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"93daab4a9f669fe4b9ce185b0297f07a1ff7d78186403beb259cedb7f8673b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): internal/shellinstaller/user_install_linux.go:192-292 | internal/shellinstaller/user_root_service_linux.go:36-120 \u2014 These two members are variants of one another: 48 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f484704f6e58421e945f46431e2b7b02ec81d0e6356131c4825bd8d33d495b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/shellinstaller/user_native_primitives_unix.go:71-81 | internal/shellinstaller/user_native_primitives_unix.go:86-96 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_primitives_unix.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe0f5152142c185b08a9ef1c4e5f03ede7fe4011788bcd560fdd975bfbab6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): internal/agents/claude/adapter.go:51-66 | internal/agents/codex/adapter.go:45-60 | internal/agents/copilotcli/adapter.go:38-51 | internal/agents/gemini/adapter.go:45-60 | internal/agents/hermes/adapter.go:46-61 | internal/agents/kilocode/adapter.go:48-63 | internal/agents/kimi/adapter.go:66-84 | internal/agents/openclaw/adapter.go:46-61 | internal/agents/opencode/adapter.go:54-69 | internal/agents/pi/adapter.go:286-300 | internal/agents/qwen/adapter.go:49-64 \u2014 These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/claude/adapter.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"be80d53f75c7e97d7b73c87af0ccaf67346878e351fcd66b4071fa19deaa5fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): internal/reviewtransaction/compact_reviewer_capture.go:504-603 | internal/reviewtransaction/compact_reviewer_capture.go:627-727 | internal/reviewtransaction/compact_reviewer_capture.go:917-985 | internal/reviewtransaction/compact_unachievable_lens.go:39-118 | internal/reviewtransaction/compact_unachievable_lens.go:154-230 \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":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0201d51628f330a51a355b20d51662261c5fda5d640bbc6af753a7e324dab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): internal/shellinstaller/user_codegraph_executable_unix.go:43-82 | internal/shellinstaller/user_codegraph_library_unix.go:195-264 | internal/shellinstaller/user_context7_stage_unix.go:18-81 | internal/shellinstaller/user_experience_private_unix.go:148-233 | internal/shellinstaller/user_experience_stage_unix.go:39-93 \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":"internal/shellinstaller/user_codegraph_executable_unix.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881544d56ef0631e11c8f287bd2c5e96355353a26658e2c5d9bb03436248c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): internal/agents/conductor/adapter.go:54-66 | internal/agents/cursor/adapter.go:40-54 | internal/agents/trae/adapter.go:51-61 | internal/agents/windsurf/adapter.go:49-59 \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":"internal/agents/conductor/adapter.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aafbe85f680da7979164cbd4c8d95f52d62adf9be7ce3879ee6d9277e349f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): internal/components/filemerge/json_merge.go:554-620 | internal/components/filemerge/json_merge.go:622-673 | internal/components/uninstall/cleaners.go:267-333 | internal/components/uninstall/cleaners.go:335-386 \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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5b9a7c1d45cbe26aa2649ecc184b9ca850385d1b6248c36b184a333b0f7659"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): internal/tui/screens/model_picker.go:698-736 | internal/tui/screens/model_picker.go:760-867 | internal/tui/screens/model_picker.go:869-912 | internal/tui/screens/model_picker.go:914-977 \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":"internal/tui/screens/model_picker.go"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7cc668bed08d1a514a7a2499c8a1a366dcc7359074828d6b9ef2545de3070f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): internal/reviewtransaction/authority_disposition_execute.go:467-517 | internal/reviewtransaction/compact_inspect.go:129-179 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3576ffdd0fe62d6af69ca2195638838f131332607af962994df008d6de6e27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): internal/cli/compatibility_transaction_windows.go:249-311 | internal/cli/compatibility_writer_unix.go:60-127 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee03bd8748ebe0bb73ed0070b17f6e3c2ffb66a42683032da1f1312848aa004f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): internal/tui/screens/uninstall.go:91-130 | internal/tui/screens/uninstall.go:132-172 \u2014 These two members are one piece of code written twice and then edited apart: 40 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":"internal/tui/screens/uninstall.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"253ecf02c14f2c0ed0cb7d5a5af78bbf4fc84c5e967b08e62ad020c1e8b04a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): internal/shellinstaller/user_install_cleanup_unix.go:89-139 | internal/shellinstaller/user_install_cleanup_windows.go:67-117 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cfd005e07fcacf484e457ef39ac6e3f63dea96c471acfc4109293d17672fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 43\u002B corresponding lines): internal/cli/doctor_tool_probe_windows.go:41-99 | internal/components/engram/healthprobe_process_windows.go:18-73 | internal/reviewtransaction/git_process_windows.go:27-69 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor_tool_probe_windows.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"621b6e10011991ef56cda13ea8034aa1a5e3f34e8f7023ccf920231245598d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): internal/shellinstaller/user_agent_state.go:72-108 | internal/shellinstaller/user_install_scope_unix.go:52-88 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"583999be1628c11b52e115eba97f2ac2e175414a99c5339db2697a1bc19095f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): internal/reviewtransaction/rar_path_safety.go:103-173 | internal/reviewtransaction/rar_path_safety.go:175-221 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4155b305f866a1b5320020aff8732b8421c46dbb8fd4b77e408bdba4d64d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): internal/tui/screens/backups.go:107-139 | internal/tui/screens/backups.go:170-202 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"internal/tui/screens/backups.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"244f0ff6575a486cac2f1caa7c4ef4f0dc42d77d4aa98a486e6d9e67c14c24a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): internal/cli/opencode_background.go:44-93 | internal/cli/pi_background.go:62-113 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"internal/cli/opencode_background.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"85540bccf1ab7b99bc56482f8da451bd6750caaa40db1960fc1f54e572922bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): internal/cli/review_abandon.go:54-93 | internal/cli/review_reclaim.go:18-52 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"internal/cli/review_abandon.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"104d5334e66f90d0ff9a83fb4c644f2e82cbd65f09cdd8a37cec7624cebb784f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): internal/reviewtransaction/repository_locator.go:250-280 | internal/reviewtransaction/repository_locator.go:287-317 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8183c456c89820ff68053278be35863f46677666c346078ae9eb75912058663a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): internal/cli/run.go:2603-2653 | internal/components/agentguidance/inject.go:416-459 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"internal/cli/run.go"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6f6cc3f5279f6123974f68f41cc2f8dbeba4f7a75418af81fd44d828d277da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): internal/reviewtransaction/target_status.go:264-302 | internal/reviewtransaction/target_status.go:304-338 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf568db6993b583d859beb5ed651917be64e3e8e8edbe865552163bc6f51ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): internal/reviewtransaction/authority_repair.go:556-582 | internal/reviewtransaction/store.go:442-472 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fd28b567dc8c0dddc30105733176d1b5ed67b10cb4c4950b300c3d0b938647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): internal/tui/screens/agent_builder_generating.go:10-36 | internal/tui/screens/agent_builder_installing.go:10-36 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"internal/tui/screens/agent_builder_generating.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e428ba80e9e7d37b6e92dd81321f95f879c8536127ae6a74fed0ddaf2940a380"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): internal/cli/compatibility_transaction_windows.go:461-492 | internal/cli/compatibility_writer_unix.go:217-248 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f3b7b7e3c59c9e9047c60f54ea1bab7ae454b88d34fe85c1b01747fe239239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): internal/telemetrycollector/summary.go:130-160 | internal/telemetrycollector/summary.go:164-195 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"internal/telemetrycollector/summary.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8218bb5b1236d838df4885b6eb0d8687574d914728226b4b761c39152224ac00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): internal/shellinstaller/user_agent_state.go:127-162 | internal/shellinstaller/user_agent_state.go:166-204 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e585a98bb93a5310bd3f7b3e92c4d6cba5b7f0268c11416809460441f9b6d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): internal/components/mcp/inject.go:76-105 | internal/components/mcp/inject.go:111-141 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33a1080ce28e3cc6b069dc3230ef4d176d80b8b732958b7aef42292e5e428ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): internal/components/telemetryruntime/managed.go:191-221 | internal/shellinstaller/user_experience_private_unix.go:113-144 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"079556b2067a7216a867c9693cc16304988a5c0140e0bb8ddfb446e8ce8ee4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): internal/update/upgrade/download.go:202-239 | internal/update/upgrade/download.go:252-280 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/download.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7161db7109c34e1a857487bcbcc68b95f24621dc789bfee4b59e02e79a34fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): internal/app/app.go:1207-1243 | internal/cli/restore.go:218-248 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"internal/app/app.go"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46656cfa78cc0db860423ac0522dbc4c950065db71298d2e792e4b006e4c9cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): internal/tui/screens/claude_model_picker.go:487-509 | internal/tui/screens/claude_model_picker.go:511-534 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dd4ff8f009e07584f810d3d7b51421d8dfa8647427b7c8e713ddaf18600169"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): internal/components/opencodeplugin/plugin.go:259-291 | internal/components/opencodeplugin/plugin.go:297-330 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"internal/components/opencodeplugin/plugin.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dda26881c0c2679df110ae14393071a7b019b6b6b0f5df93b2e69839b1afa2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): internal/cli/compatibility_transaction_windows.go:400-442 | internal/reviewtransaction/rar_path_safety_windows.go:396-439 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"981cf755204dd45fbc9538222a4499dc3bf236e99ef6043500305b23fabdce87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): internal/components/uninstall/service.go:1602-1640 | internal/components/uninstall/service.go:1646-1676 | internal/components/uninstall/service.go:1678-1711 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d2bc6af4197d14b3c6e9de751ac6d0f2265a579a1a158f0d78bd6edd8365ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): internal/reviewtransaction/authority_disposition_execute.go:582-618 | internal/reviewtransaction/classified_authority_replay.go:390-415 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5811ab901b860e730919d40ab86516a484c4264c70f91832d216861c6b149f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/components/communitytool/pi_codegraph.go:1064-1084 | internal/components/mutationjournal/journal.go:178-205 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb580fa0023476749a0d8a0ec1fd25e2133120264c04b615503ef985055b64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): internal/reviewtransaction/store.go:927-959 | internal/shellinstaller/user_launch_pin_cache_unix.go:111-145 | internal/shellinstaller/user_shell_apply_unix.go:118-150 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store.go"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"1238b7034fb34c31cae24ec46cbf898e0833a970fc5046d1256387a3f25be53d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): internal/reviewtransaction/compact.go:447-479 | internal/reviewtransaction/compact.go:499-530 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cd83172c4edc2b43bc9058250d82ce242a2aced24b64fc33757cfcb05a2724"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): internal/cli/review_facade.go:2857-2883 | internal/cli/review_start_preflight.go:65-92 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"internal/cli/review_facade.go"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"941546586de737e178dfc8fc93cc9e1c9bc522395ab2d29fc13444a3b2310815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/shellinstaller/user_agent_tools_unix.go:50-73 | internal/shellinstaller/user_install_flow_unix.go:852-872 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_tools_unix.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c698369bbd7eac2da4e343bc17ee0b98e982da347d751a973db547e24ec780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): internal/tui/screens/claude_model_picker.go:397-420 | internal/tui/screens/kiro_model_picker.go:194-215 | internal/tui/screens/persona.go:24-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc280f779306643495ddb7e1e0010c9a1421ada29f48892b81ac0627ce358de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): internal/cli/run.go:4238-4262 | internal/cli/sync.go:931-955 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b17ae0fbf45b1109422aeab0d64f5b1175862dbee4bdd90e15444979a2dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): internal/components/filemerge/writer.go:382-408 | internal/components/uninstall/cleaners.go:231-260 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"internal/components/filemerge/writer.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45d5a112d2ac24102bf95073c78e3a812257324a510d06d42149d10fa98bdaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): internal/components/engram/antigravity_uninstall.go:77-102 | internal/components/engram/inject.go:1537-1565 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/antigravity_uninstall.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea985c0463704d1927885dbc73263fc242081dfc8c3b1acd4cf74505ce65bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/tui/screens/backups.go:83-103 | internal/tui/screens/backups.go:144-166 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/backups.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a1a2aab6601248daebba52584b084c3bf8f1a76d7e2acf03b52f925a2891eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): internal/reviewtransaction/compact_store.go:2129-2146 | internal/reviewtransaction/snapshot.go:1739-1759 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e54a8e0db8869c9656cf507484410ce4e24e953c58ca5fb4918078b051fe94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): internal/reviewtransaction/rar_path_safety.go:231-258 | internal/reviewtransaction/rar_path_safety_windows.go:940-971 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2ae079305b037d3c3875ecca02a260f0137b8797629aca59855da3ae540d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): internal/telemetrycollector/downloads.go:103-124 | internal/telemetrycollector/downloads.go:179-201 \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":"internal/telemetrycollector/downloads.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09d3dc8d29b904eee06aea55837213a8e399ea52ea32d2b971b93c92b2a2054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): internal/components/communitytool/pi_codegraph.go:1112-1136 | internal/components/mutationjournal/journal.go:254-281 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afde109d1bda2b26d34f660776a512595f2e6b5f07607d4115a4ba2e06350a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/agents/trae/adapter.go:136-151 | internal/agents/vscode/adapter.go:127-142 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/trae/adapter.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"544a519f10b1a9c92965643ce6a0dbe1a878dc91998ed08b5878b7518f14a159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): internal/cli/review_stop_hook.go:358-384 | internal/cli/review_stop_hook.go:389-416 | internal/cli/review_stop_hook.go:429-463 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_stop_hook.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ca0657366f873152f01f0c20a378dd6880b43fbe93d41e9d62c88220a8ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): internal/reviewtransaction/correction_scope.go:192-219 | internal/reviewtransaction/snapshot.go:1639-1658 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/correction_scope.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bad21201b2ccfaae47a520af4e0fb056d183418ffe8cd6d2cf4512153efa474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): internal/telemetry/runtime.go:430-458 | internal/telemetry/runtime_opencode.go:271-305 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime.go"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd2cdcc231bc9ad2d80972c5c92eff570af1ad825c98f8eaadaa7ce65e46780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/cli/compatibility_transaction_windows.go:502-525 | internal/cli/compatibility_writer_unix.go:250-268 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d27acef3e6f902150024d55d91cad69ff6a6f52710fb1654156f51e0aedd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/components/legacyassets/sdd_assets.go:239-263 | internal/components/uninstall/service.go:1412-1432 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f327175360982b49a130f855d06fc99fd78105f808baac004a9d6f9740b6ed4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/reviewtransaction/artifact_subject.go:142-162 | internal/reviewtransaction/artifact_subject.go:164-185 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc44505d88f328422f603bc72d27ff146e93b8c2baf042af5f45555581cd5906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): internal/components/engram/download.go:524-549 | internal/components/engram/download.go:553-572 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee8f1127139e5472cdc4f34ef9cf3ceab1272ed4a879e43a120e85e2ec198a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/tui/screens/opencode_background.go:17-32 | internal/tui/screens/pi_background.go:17-32 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/opencode_background.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"63956b30bb7f0086d563e01a64ae8aea8e79ee308ac5e1b828aa3e6e6db1ff70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): internal/components/filemerge/toml.go:72-101 | internal/components/filemerge/toml.go:269-293 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/toml.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1065d78ec483338b837879ca3c30dafe47b15bdea008f29bb982247fcc278a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/shellinstaller/user_system_git_windows.go:37-49 | internal/shellinstaller/user_system_go_windows.go:104-119 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_system_git_windows.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1be6305bb186ec11f0b08125ba02ed4ce10194683e47843e3764de0b5fd89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): internal/system/install_deps.go:139-156 | internal/system/install_deps.go:158-176 | internal/system/install_deps.go:178-205 | internal/system/install_deps.go:216-233 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/install_deps.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d1b18acb6b60212869aa2d0be2e3b35035a7fd04a4470ed5909bf9ae593b7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): internal/components/communitytool/pi_codegraph.go:1029-1050 | internal/components/mutationjournal/journal.go:59-80 \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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab97bfa1052dc02e4f1c3c18e33bb9067e037a89e41551b2fdfd6f82d5b809c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): internal/reviewtransaction/compact_reviewer_capture.go:158-178 | internal/reviewtransaction/compact_reviewer_capture.go:238-257 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb9a4d39f15a0d71c7ad26001b29d4e060c86a6dd19dbd0010038eb6d5edf2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/cli/validate.go:178-198 | internal/cli/validate.go:200-220 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/validate.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5732976cd27819599f897bce7d36e74e6e9f7e5b6c3c39dc0b7e1e7ad66e9d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/cli/run.go:653-670 | internal/components/engram/download.go:61-75 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"internal/cli/run.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a148a0bb0152aad966d465de5d328a92521b08bb2dd3861f26912ac58faaba9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): internal/components/uninstall/service.go:175-192 | internal/components/uninstall/service.go:194-211 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"internal/components/uninstall/service.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"930a025f8229226c0e8bd6ec0aa148b575357419293c25e2771bc906e4363b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): internal/cli/review_transport_capability.go:274-293 | internal/cli/review_transport_capability.go:331-350 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_transport_capability.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a41309c97ea72b4707697f123b318eead442a0d151be1e510ffcf1e07ac0ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): internal/shellinstaller/user_shell_registry_windows.go:499-520 | internal/shellinstaller/user_shell_update_unix.go:175-200 \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":"internal/shellinstaller/user_shell_registry_windows.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eec3505c1bacf2658ca4a763610846d7094d2da1a09d6053d92407d739786c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/update/github.go:74-93 | internal/update/github.go:95-113 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"internal/update/github.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"97110b4a555045c1b8d3d0b4c899f97a219d0ecb2d21323eb5e11bc372c38e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): internal/components/mcp/inject.go:162-185 | internal/components/mcp/inject.go:394-418 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ba83d08f17517d3497d422b50d2b008399056687b00c45a0c1568b81eb5034"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/shellinstaller/user_native_operation_linux.go:69-83 | internal/shellinstaller/user_native_slice_linux.go:234-248 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"internal/shellinstaller/user_native_operation_linux.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"339dd9b492c62e44d374c2fbfa1d3a2208838f83aa66d214c968231b35482d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): internal/cli/compatibility_transaction_windows.go:347-366 | internal/cli/compatibility_transaction_windows.go:368-390 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79c2bd36f5df55e9c07abf41a918275ba21f061d6c37fc69471aa7048a05453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): internal/shellinstaller/user_install_cleanup_unix.go:28-50 | internal/shellinstaller/user_install_cleanup_windows.go:27-50 | internal/shellinstaller/user_shell_registry_windows.go:345-364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b728100754a23fc37ae80cf1571c184ffc75012983d4660243bd3d0bc8654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): internal/shellinstaller/user_reviewed_stage_unix.go:45-66 | internal/shellinstaller/user_shell_pins_unix.go:55-77 \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":"internal/shellinstaller/user_reviewed_stage_unix.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93d56fb4874e772f9be4017240f42459e07658552abfb4096f078cf984c14a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): internal/agents/kiro/adapter.go:160-180 | internal/agents/windsurf/adapter.go:108-125 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"internal/agents/kiro/adapter.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"920f09129444d23397e0887e5a3f4076294cd1dc586d52964cbb9cd92287e5c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): internal/reviewtransaction/snapshot.go:1619-1635 | internal/reviewtransaction/snapshot.go:1660-1676 \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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7902f25bbcea8928fdc661f68ecf049f6bee123ee1920cff8278649caa8ad0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/cli/review.go:404-419 | internal/components/uninstall/service.go:346-369 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6894e1e6475f59502300062cd87a756bcb57450afb6975df9f00715d8dd78c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): internal/reviewtransaction/verification_contract.go:1045-1062 | internal/reviewtransaction/verification_contract.go:1070-1088 | internal/reviewtransaction/verification_contract.go:1197-1214 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b3e7e13c96297e46395d43deee9fadfd2e68b73e4f75946a62165e22d69043"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/cli/review_capabilities.go:398-413 | internal/components/filemerge/writer.go:359-380 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_capabilities.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"26563de321e049e4b249acc920921583bef9055a6e32d5fd48a0565912027bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/cli/review_operation_contract.go:631-649 | internal/cli/review_operation_contract.go:1391-1410 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"internal/cli/review_operation_contract.go"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a793437b56f4d6d24ab53154d0dcbdc4b2e3b365d13a357f6df565f97528757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/shellinstaller/user_runtime_primitives_unix.go:36-46 | internal/shellinstaller/user_runtime_primitives_unix.go:72-82 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_runtime_primitives_unix.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8b62c08f11ccac97a807089ff608d42c99158f8ca482463d25a0a4c82ac6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): internal/cli/doctor.go:449-468 | internal/opencode/background_readiness.go:1024-1041 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"internal/cli/doctor.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ef811a23e0189a36e3b0a0ae3cdaa8d9dcefd4fec994cbfc393fe64868d499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/components/mcp/inject.go:144-159 | internal/components/persona/inject.go:563-580 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa00622ce4eca9779a6f4c4f9940b30e1e2e639942f19ca34370bccc41bedee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): internal/components/mcp/inject.go:294-312 | internal/components/mcp/inject.go:321-337 \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":"internal/components/mcp/inject.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"79719438c130c86213f1b2416ff5035261bab70bf558ba83f0c3b313101c4645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/cli/uninstall.go:57-67 | internal/cli/uninstall.go:69-79 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/uninstall.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a5c6670480bb3d0ab916886130464cd2774d4e646f2eb42bb87e5e2e7c1595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/components/communitytool/pi_codegraph.go:1051-1063 | internal/components/mutationjournal/journal.go:154-173 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7933973a5ae36e295b9baa40a3965a14810921dbfeaaac6e2d5bba498d3fd8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): internal/components/uninstall/service.go:1967-1988 | internal/components/uninstall/service.go:2073-2091 | internal/components/uninstall/service.go:2095-2116 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"25220c33e14c14490bfa77342069573a21f7aa4449be9ce04a8bb473efceec00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): internal/reviewtransaction/candidate_decline.go:83-94 | internal/reviewtransaction/rar_authority_repository.go:678-689 | internal/reviewtransaction/rar_plan_authority.go:593-604 | internal/reviewtransaction/rdd_mode.go:1087-1098 | internal/reviewtransaction/verification_contract.go:1464-1474 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/candidate_decline.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"996f3dffc5f33ee20a4eec8d5a129905ecdc98ff267a5a9b7b6513d85eaa6bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/opencode/background_profile.go:114-124 | internal/opencode/background_profile.go:129-139 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_profile.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b03014168927fac811b64ac686eec2e826142c8cf6b99c28cda2fd48f086c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/cli/doctor_tool_probe_unix.go:18-29 | internal/components/engram/healthprobe_process_unix.go:13-27 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor_tool_probe_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6a05ef8e3181e12c1b43e6d38dc6213aa45f46c352d13c69dc85decf3926e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/cli/compatibility_transaction_windows.go:574-581 | internal/cli/compatibility_writer_unix.go:160-167 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96fbdad09145ef243d3a019d8181f5f48fe0a8663fb74b07caac7bd571a8f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): internal/tui/model.go:3243-3258 | internal/tui/model.go:3270-3288 | internal/tui/model.go:3290-3304 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"827760261554467f214ae50594b08b7a38d3325179b4dc007b458f993afb19de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): internal/agents/discovery.go:61-76 | internal/cli/sync.go:1694-1710 | internal/telemetrycollector/rollup.go:83-97 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/discovery.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc050c2ff1ef17a53766f9b912cac81ff70e091183291da7408a0cc5ae285212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/app/app.go:1155-1167 | internal/cli/run.go:5132-5144 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ddd5d5afdb4835140c9df0a12bf2f4feed12a5b14bb9e6b56d2bd035f671f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/cli/review_store_reset.go:195-206 | internal/reviewtransaction/store_reset.go:286-299 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_store_reset.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbb36e48f3d67d2dd47f2875d3d2c913bbc56a2e8ececa950d0dfd3e621ff7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/shellinstaller/user_selection_other.go:35-45 | internal/shellinstaller/user_selection_windows.go:32-42 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_selection_other.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3267014b6cd67887b26eda4f3f908db6825232b44196529e37412483468366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): internal/tui/model.go:4146-4161 | internal/tui/model.go:4163-4178 | internal/tui/model.go:4180-4195 | internal/tui/model.go:4197-4212 | internal/tui/model.go:4228-4243 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d06dce7ee59250ab1a4b54a6bb16eb16a3c7642e0fbf03462025ecc60d16ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/agents/pi/adapter.go:559-576 | internal/agents/pi/adapter.go:580-595 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/pi/adapter.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46f3a223c955038b1ff4c7b8ed010b0a3cebf63cf0fc7ce4a3d59b4b6b7377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/releasepolicy/policy.go:78-95 | internal/reviewtransaction/repository_locator.go:1058-1072 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"internal/releasepolicy/policy.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fae18ffcd5e2dd59d6b4b3126b9fec7fb25c761ec2e1670f0cb2d6625fc411"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/tui/screens/common.go:26-41 | internal/tui/screens/common.go:43-58 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/common.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"313654d37b50e1b19d42a032a355c76b4f63df5d5302c02c9154d8c69732d633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/reviewtransaction/compact_recovered_evidence.go:79-89 | internal/reviewtransaction/compact_result_reopen.go:269-279 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_recovered_evidence.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa5967189c3c57e0b6048aa9dbf725452b1030a911e9c94bd782b2124684a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/cli/review_artifact.go:128-140 | internal/reviewtransaction/store.go:21-37 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c177f01762b6e1c04ee61610d53cf00dc10130774079b84927447045d0e851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/cli/review_consent_contract.go:139-151 | internal/cli/review_mode.go:1052-1067 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_consent_contract.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"745004589c45870e9883652112d5f5b304b1323a8a0f5439c7b146f509ea272a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/components/antigravityrules/publish.go:117-127 | internal/components/geminimodules/modules.go:226-235 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/antigravityrules/publish.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f9fa9f8ad1629dbc43802be9ca427db88abd91a2cb3e63220eb272be7057bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/reviewtransaction/rdd_mode.go:830-840 | internal/reviewtransaction/rdd_mode.go:858-874 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a35573b561b12083e2690c3874523c3b451fa55c2fb8c7df16fec694b054602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): internal/reviewtransaction/store_reset.go:431-452 | internal/reviewtransaction/store_reset.go:968-985 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a6d091860b9a094f53b717944e5af511547a66e92ba2a0993aca1410c50a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): internal/app/app.go:848-856 | internal/app/app.go:858-866 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed177ba44197df66830c556436e1c910a2731a0c6939d937fcba7f619c552bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/components/communitytool/pi_codegraph.go:810-819 | internal/components/communitytool/tool.go:373-383 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e9f04ea2fbf64249b2490d6a21df2efce552fa4518ed64fca72830a2274ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): internal/components/gga/runtime.go:45-58 | internal/components/gga/runtime.go:63-76 | internal/components/gga/runtime.go:80-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/gga/runtime.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"888b95f5b9e4e94be70607edccb911d685a65cb2797935983a1b4acee28c5340"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/cli/sync.go:396-421 | internal/tui/model.go:4391-4405 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"internal/cli/sync.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd010e9b14ac74311f8738713f1ec3aa52dd56dffaad8afc665d878b0f0cb851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): internal/cli/review_artifact.go:600-611 | internal/cli/review_operation_contract.go:1751-1762 | internal/reviewtransaction/rar_authority_repository.go:703-717 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97430b9bca79110e4e354b90283ebd4f50bc816ec15d10bc1d0b829a87de315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/model/claude_model.go:135-153 | internal/model/claude_model.go:157-175 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"internal/model/claude_model.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4674fd6db19010d92aa732e5e104327effdb85c4234733a5aa1eede9e2aa2ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): internal/shellinstaller/user_install_flow_unix.go:1357-1370 | internal/shellinstaller/user_install_flow_unix.go:1374-1392 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f9c763ed98c9a907143b118906da93c023cdd5b315ae5f075fd506d8336e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/cli/review_intended_untracked.go:171-185 | internal/reviewtransaction/store.go:873-884 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_intended_untracked.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ac951a580c1afb1acfe3dd6d6a0678b8e697dfd956778f5b67b98863a5dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/components/opencodeplugin/plugin.go:332-344 | internal/releasepolicy/policy.go:487-501 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodeplugin/plugin.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d274f1779f18abcbbe78c9e3d953d09005350b782c9a8c641ce2276f4d2305e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/system/path.go:186-196 | internal/system/path.go:202-212 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/path.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d93a3684c8e19e1e2d3fb097362101b2491b771a92e7fc011376c58a96bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): internal/tui/screens/model_picker.go:569-582 | internal/tui/screens/model_picker.go:601-617 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/model_picker.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"6582b00adc1c96a0020aec35d0c70214a4b694b58c0a404814e37e744f073ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/cli/validate.go:335-347 | internal/components/skills/presets.go:40-52 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/validate.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b58785f051a441ad610c894fb4d1440811b80eded813f05bf06a296c1860d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): internal/recoverytrace/generate.go:365-378 | internal/recoverytrace/generate.go:401-414 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/recoverytrace/generate.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"86875aa76a7f032f170d61a136442881629254513583133abad39ebfbc9ad806"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/reviewtransaction/publish_immutable_darwin.go:19-25 | internal/reviewtransaction/publish_immutable_linux.go:31-37 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/publish_immutable_darwin.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"05707be10ee322649055d022a7cca8fab0f3897b21eaa7d2d71acc38202b19a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): internal/agents/codex/adapter.go:74-80 | internal/agents/gemini/adapter.go:74-80 | internal/agents/qwen/adapter.go:78-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/codex/adapter.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca3f8728c667d7cf6f42b73e1c0ccdeb5225c4b5c378fade4f1c614698cdd48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): internal/components/engram/download.go:871-879 | internal/update/upgrade/download.go:388-398 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f70468beac5a5d27c7e119199e45ba47fd90d3155d69fcc728433b3ab89e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/model/selection.go:3-25 | internal/model/selection.go:91-109 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"internal/model/selection.go"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"378b76239e4980315bfb856ef35efec703fe5ecba9f2f742bfe979347b5319d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/providercontractbundle/bundle.go:296-306 | internal/releasepolicy/policy.go:66-76 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d8387ea6005c890e1836f38ef875d269a0e5bfea60f74a8f8bed7ac364aa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/reviewtransaction/classified_authority_replay.go:259-273 | internal/shellinstaller/user_components.go:20-31 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/classified_authority_replay.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f62e8c712103dd81db8089e22dfb64cead202d2c7a0f3f4f0ef49a4a351511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/reviewtransaction/compact_reclaim.go:326-335 | internal/reviewtransaction/compact_reclaim.go:368-377 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reclaim.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"36436e0410f063016f61d666762c5982dab80dca045f253b8e79912dc948b4c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/reviewtransaction/gate.go:500-509 | internal/reviewtransaction/gate.go:511-517 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/gate.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"99619eff2b3f869e3d3e2d52f51219a62cae5248275817e418275630170fb34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/cli/review_assess.go:212-223 | internal/cli/review_escalation.go:49-60 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_assess.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"688cfa3942f2670796be4b0532b8e8e13f36ea5d6bed4e187df4f6b1b750b8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/components/skills/inject.go:63-73 | internal/components/skills/support.go:82-92 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/skills/inject.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df25e57613bf20011c004accbf1e77d518a8ffa2ab533c2ba869dc58c666c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): internal/system/deps.go:218-226 | internal/update/check.go:369-377 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/deps.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf8b486b8f8347bc4fb47cc73fe736c0204d039d544c192eee706a8f7f3c96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): internal/components/engram/inject.go:1263-1275 | internal/components/mcp/inject.go:420-432 | internal/components/permissions/inject.go:276-288 | internal/components/theme/inject.go:202-216 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"963b16ea447c0db368ef0cd66baa5ac149998b4d83e2efde6dc9bcda3f530209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/components/filemerge/section.go:10-20 | scripts/gen-sdd-agent-digests/assets.go:155-162 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/components/filemerge/section.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b783b85ddae51f6e1797c27bb8ca77576225969663e5e6350af5d7e6c4c57507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/shellinstaller/user_install_scope_unix.go:90-99 | internal/shellinstaller/user_install_scope_windows.go:65-74 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f8b97e4033be53820cdf7f7b56b33cde3f03836721a3ce9388699085cb93e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): internal/state/manifest.go:108-120 | internal/state/state.go:336-347 | internal/telemetry/state.go:201-213 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/state/manifest.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"088843a836ce4d03fb5248fa75014c32f347d596b0c370f5490511f6e5a1179c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/reviewtransaction/compact.go:217-224 | internal/reviewtransaction/compact.go:237-244 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"698ce20d4809bcf5c0b10e069306be037ba1211ebf3426bd8236ad8adb75e457"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): internal/components/filemerge/section.go:101-118 | internal/components/agentguidance/orchestrator.go:506-519 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/section.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"659c6859db60d9f0d6b8effa9096c052815da10c2747dcc85c427d5c33d7fa0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/tui/model.go:3418-3427 | internal/tui/model.go:3446-3457 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cf5daccfe40a304595b4a10dc1f79a418554f2a5eb7551160ebe17c2f06f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/components/engram/setup.go:18-49 | internal/components/engram/verify.go:30-39 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/setup.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a459b52848fc1cb8eae2de32a876cb7a473d11b6773af1ca351bc56485a2b95d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/components/uninstall/service.go:2320-2333 | internal/components/uninstall/service.go:2335-2345 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"29909daae1dd26ae41724967c1b536f3a54fb8868c54dabbeac33e2bdb7f9348"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/reviewtransaction/repository_locator.go:336-346 | internal/reviewtransaction/repository_locator.go:667-677 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eba74be545a3d4edc8e00fd576fcf0544e917ba221e37a125956d5d728fe640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/cli/dryrun.go:50-60 | internal/tui/screens/review.go:76-87 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/dryrun.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae90704f73eef5a42217f65dc9b1d1bbebd8d94ef9c6b999c93c8c42e9aef63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/reviewtransaction/artifact_subject.go:54-64 | internal/reviewtransaction/classified_authority_replay.go:90-97 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa9130e2bfdc2459f87fae7acbfedf12f131eba29fef368febf75d7b53b08d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/system/deps.go:201-215 | internal/update/check.go:351-365 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"internal/system/deps.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd3a5dbb5d8278be12251dae4cbf804bc2d35a830e9713e0301d69dd68d32ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): internal/components/agentguidance/orchestrator_module_install.go:230-242 | internal/shellinstaller/user_agent_rollback_unix.go:174-186 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agentguidance/orchestrator_module_install.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edb00a8d752a72cfd9f6302a46a63298919549e13adb993b978c4064d2bf8ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/reviewtransaction/snapshot.go:1678-1685 | internal/reviewtransaction/store.go:824-831 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"078181332ddfd7dae4c4bf57d50f940de9c47b15d3fac650e3892ad46e02d9a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): internal/app/app.go:76-89 | internal/app/selfupdate.go:207-216 | internal/tui/model.go:3600-3610 | internal/update/cooldown.go:126-138 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8612c28156bbe94b075408122ab242e356eb3ce2fee1e6d58718a6be655936aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/cli/run.go:4731-4743 | internal/components/opencoderuntimeplugins/lifecycle.go:100-107 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/cli/run.go"},"region":{"startLine":4731}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f73b128dafb7aca6f634699b38bbb23cfd03769d0dbb53f00ffa81e440dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/reviewtransaction/bundle.go:108-117 | internal/reviewtransaction/store.go:890-899 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/bundle.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd335cb7ca39ec57e98462bc3149668b136b51d9b1786b9e68552229463ff9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/telemetry/runtime_opencode.go:169-180 | internal/telemetry/runtime_claude.go:89-99 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_opencode.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8138155f38c966bddabcf72d8c4e516812b019598581112863b639cfdbce992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): internal/backup/restore.go:192-195 | internal/cli/codex_home.go:111-117 | internal/components/uninstall/service.go:869-872 | internal/reviewtransaction/repository_locator.go:1121-1125 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d9836c99a06cae0e5da92371b620a110d8a4e7759075992a4968eb3cd05514"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/opencode/background_readiness.go:1002-1012 | internal/shellinstaller/user_engram_shared_windows.go:70-80 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_readiness.go"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65003a00afc23e6aee7fc8d2cf4957844bdc9beae70249c1e8a990d1196a3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/reviewtransaction/gate.go:628-634 | internal/reviewtransaction/snapshot.go:1460-1466 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/gate.go"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22dd0ba087e27346370aef42fca299dec14ac09b2edabf40da2fb33cb883973"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/tui/model.go:272-286 | internal/cli/run.go:5106-5120 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"internal/tui/model.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bad8ed53808d4716574a17b2da1845a12032b0bf0b94e6ae2a990b1cb06486a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): internal/agents/pi/model_routing.go:194-197 | internal/reviewtransaction/repository_locator.go:1116-1119 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/pi/model_routing.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf960f856f587407f7a12491df0ced71ba4671b67760791ae369ccd2b7b6f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/cli/review_capabilities.go:470-476 | internal/reviewtransaction/receipt.go:453-459 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_capabilities.go"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7730cc4173d505a5451f14a8d52dfd98019a4107480f261aeaebb187283fa002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/components/engram/download.go:701-713 | internal/pathidentity/identity.go:65-75 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f73f12bc97c573b87eaf91d04eaebf4e3776e5d4a5d109c8db0449a045ef48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/releasepolicy/policy.go:168-177 | internal/components/opencodedefault/ownership.go:203-212 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/releasepolicy/policy.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97c1bda6c2b243553e7751371f908df3d03d10d631029c9f744aabb62b4d51d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/cli/review_provider_roles.go:894-904 | internal/cli/review_status_contract.go:1953-1963 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_roles.go"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c1cd18a795a3fb13b201846fef76267b249b034be973905b4a2553d00913d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/cli/run.go:3249-3259 | internal/cli/sync.go:1034-1043 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f42e238ab843ce57413d070da062e4a59d362d0a27ade234b516e83417bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/reviewtransaction/compact.go:2047-2058 | internal/reviewtransaction/transaction.go:321-332 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"badac606efabe2852625b482f7304fa091e7886706125cce32bad6e0c5d14fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/tui/model.go:3623-3633 | internal/app/selfupdate.go:193-200 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/tui/model.go"},"region":{"startLine":3623}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f49612637f82abb93b11e36dbf0fd3df6f5adf6c8f835d591c4337ce3607bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/providercontractbundle/bundle.go:857-866 | internal/releasepolicy/policy.go:471-480 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d270045ebd5c6575564439b47c5f00925b9c2c72935a699c9b90e9dc73dcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/tui/model.go:4458-4465 | internal/tui/screens/agents.go:12-19 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/tui/model.go"},"region":{"startLine":4458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3eef5716e859a59309d6a22f5a91cfcce6a1dd4c45398a6e7f0357b4bfe2d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/components/legacyassets/sdd_agents.go:124-134 | internal/tui/screens/model_picker.go:264-271 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/components/legacyassets/sdd_agents.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae76123038dbe1511d75001880bed2a9a3dfb9dec2040b695d731f7b47bd662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/components/uninstall/service.go:1094-1101 | internal/opencode/background.go:463-473 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/components/uninstall/service.go"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"3325a1851fe4cefc72d76a7b08d05b73a4159e330609b5f9072273331da72a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): internal/cli/codegraph.go:188-191 | internal/components/telemetryruntime/claude.go:110-113 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codegraph.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229aabfd81b53f627651d11fb0de4a683dd0dd17e83904b8a04a5e7b06f555e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/agents/pi/config_dir.go:28-34 | internal/components/engram/caller_binary.go:16-22 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/pi/config_dir.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a903fd33305c1d22e44e0c79e55ac8e276bed7f00330d6c58ab1675885a33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/components/engram/setup.go:42-49 | internal/components/engram/verify.go:32-39 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/components/engram/setup.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcd3be2c2bef0207481b26a71f835169164c3ce4b6bbed82014cd8dd64d3ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): bench/main.go:386-392 | internal/agentbuilder/registry.go:42-48 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/main.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f25b5e0783fc4f110998965bc5c7d410f67ec025a809ee5b003c23076aadb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/shellinstaller/user_system_git_windows.go:25-31 | internal/shellinstaller/user_system_go_windows.go:90-96 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_system_git_windows.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f317201dcb3d43d34eca481e941640b41a047a207b627e3518c205089f5571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): internal/reviewtransaction/authority_disposition_execute.go:683-689 | internal/reviewtransaction/transaction.go:1690-1696 | internal/tui/screens/claude_model_picker.go:198-204 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a9b8c6c5e474b815fbdcef5a85e4e7f97518b6ed6bd67d3a04537eb1b5301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): internal/reviewtransaction/store_lock_windows.go:35-38 | internal/telemetry/state_lock_windows.go:30-33 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store_lock_windows.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1057bc1f38f4e99747a96d547f4af682c08a397ea7a009a1ae763441f1830e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/tui/model.go:3612-3619 | internal/tui/screens/upgrade.go:226-236 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"internal/tui/model.go"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc153586197751708361b5793e625e2d3db073d991a0af0b78a1b7813bdea14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): internal/update/homebrew.go:10-14 | internal/update/upgrade/homebrew.go:11-15 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"internal/update/homebrew.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b172ba71811e40b7eed0736c9dba42ee8f815bf6c4aa0895b995b0266fdb658a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): internal/cli/review_status_contract.go:1659-1669 | internal/opencode/background.go:181-191 | internal/reviewtransaction/snapshot.go:701-711 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a732eb732f7b2da8fc5eaccd2701bcd0fd58742ee2e373202d234dff5e8ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/cli/run.go:3332-3341 | internal/opencode/background.go:450-459 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"231197b4a0cc1e8292c012d7018d52b5b11a79be82988ce4e0ae38923bdff4f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): internal/shellinstaller/user_install_cleanup_unix.go:77-80 | internal/shellinstaller/user_install_cleanup_windows.go:54-57 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f760848eedfa6c47a06730fe866e409c79161c0ccb091f417724a5d7d7e71ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2): internal/components/filemerge/json_merge.go:555-620 | internal/components/uninstall/cleaners.go:268-333 \u2014 before extracting anything, compare \u0060internal/components/filemerge/json_merge.go\u0060 and \u0060internal/components/uninstall/cleaners.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 138 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85d76e2853bb42a1af8d32994dc59b583971537f8162ac3114d5f8adcb9d13e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): internal/components/filemerge/json_merge.go:623-673 | internal/components/uninstall/cleaners.go:336-386 \u2014 before extracting anything, compare \u0060internal/components/filemerge/json_merge.go\u0060 and \u0060internal/components/uninstall/cleaners.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 138 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06057d10359672d050811cd9ca9714e540537c991f3b275229924aaa9eaef9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 3): internal/components/filemerge/json_merge.go:781-818 | internal/components/filemerge/json_merge.go:914-951 | internal/components/filemerge/json_merge.go:1013-1050 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/filemerge/json_merge.go:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"870015e709696656b3b97180ae8c1ef8fc336fa54867594de949ca76f169b5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): internal/cli/doctor_tool_probe_windows.go:46-80 | internal/components/engram/healthprobe_process_windows.go:20-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/doctor_tool_probe_windows.go:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor_tool_probe_windows.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a912204469c82df6a4574943db90175c54920040797491539b9dca22a1197a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): internal/shellinstaller/user_install_linux.go:219-250 | internal/shellinstaller/user_root_service_linux.go:63-94 \u2014 before extracting anything, compare \u0060internal/shellinstaller/user_install_linux.go\u0060 and \u0060internal/shellinstaller/user_root_service_linux.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19e09faa87c325cba48fbcf36e29bd8960a267ec1f42e05ce29456bec6ef3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): internal/reviewtransaction/authority_disposition_execute.go:468-499 | internal/reviewtransaction/compact_inspect.go:130-161 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/authority_disposition_execute.go:468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3f228cf7786cb73efd917a271a10a29789ee478e4b82dc3e9415d1c330dbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): internal/reviewtransaction/compact_reviewer_capture.go:927-956 | internal/reviewtransaction/compact_unachievable_lens.go:51-80 | internal/reviewtransaction/compact_unachievable_lens.go:164-193 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact_reviewer_capture.go:927\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f7d6e95b6cf6b1a47edca5cc3592bf2c8f1317b6ee836c2fd7f3f7b7fd57c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): internal/reviewtransaction/rar_path_safety_unix.go:330-358 | internal/reviewtransaction/rar_path_safety_windows.go:944-971 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/rar_path_safety_windows.go:944\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b4d2c384e62d5ef868ef779e1675bc93dc71904c30ff6dd65c89efa115cdd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): internal/components/uninstall/service.go:1573-1600 | internal/components/uninstall/service.go:1823-1850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"759938e63fd06e9b8d2252322e262711ec0be9bf7ba40ab397075da64494530b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): internal/components/filemerge/json_merge.go:785-810 | internal/components/filemerge/json_merge.go:860-885 | internal/components/filemerge/json_merge.go:918-943 | internal/components/filemerge/json_merge.go:1017-1042 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/filemerge/json_merge.go:785\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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"a662404477387a97296909c1117ee561436e48762ef821abcffeb8f2c8e32fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): internal/components/persona/inject.go:182-206 | internal/components/persona/inject.go:383-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/persona/inject.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"864ef1ebf3722eaec82e4b3fe307643834efaca49835a5e9c6459d77b851b67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): internal/backup/restore.go:429-451 | internal/backup/restore.go:490-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/backup/restore.go:429\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"806ec67e5b9f7b9ab8febcf639b7177a414c22b47beb8ec6dae997a7cac43bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): internal/update/homebrew.go:22-44 | internal/update/upgrade/homebrew.go:23-45 \u2014 before extracting anything, compare \u0060internal/update/homebrew.go\u0060 and \u0060internal/update/upgrade/homebrew.go\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/homebrew.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"783fbd48c34f41ba0dee41713158708ce6fc7f794d7a642b979106380b720716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201322 lines \u00D7 3): internal/components/persona/inject.go:183-204 | internal/components/persona/inject.go:385-400 | internal/components/persona/inject.go:565-577 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/persona/inject.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbad083fab9dcea87d7da23054db63b4eccc00f8f2d6c316002d18e8c2f038a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): internal/reviewtransaction/repository_locator.go:251-272 | internal/reviewtransaction/repository_locator.go:288-309 \u2014 both copies are in the same file, so extract the block 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":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f272c0db5192d1110520418aea638899481a408f2eef773ebf877da18dacc3db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): internal/shellinstaller/user_channel_overlay_unix.go:308-329 | internal/shellinstaller/user_channel_overlay_unix.go:367-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_channel_overlay_unix.go:308\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bfc5b9f92f0348bf34dc98761a2da38f45a19c3ce8978c5ac1989243ad6321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): internal/shellinstaller/user_install_darwin.go:66-87 | internal/shellinstaller/user_install_linux.go:506-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_install_darwin.go:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_darwin.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccf86f1ccd4cc8296027fc42ea124f78b4cff1e7ecc8283233ae528a575ade8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): internal/components/filemerge/json_merge.go:580-600 | internal/components/filemerge/json_merge.go:630-650 | internal/components/uninstall/cleaners.go:293-313 | internal/components/uninstall/cleaners.go:343-363 \u2014 before extracting anything, compare \u0060internal/components/filemerge/json_merge.go\u0060 and \u0060internal/components/uninstall/cleaners.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 138 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf84a085e6b171b779c98bf2fe45a53c6be869cd60c63d21e8e01017c7f6e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/reviewtransaction/authority_disposition_execute.go:599-618 | internal/reviewtransaction/classified_authority_replay.go:396-415 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/authority_disposition_execute.go:599\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baedc3624f68239a0e19530779a88dff4185f3285f0e70cdf6c7af1377ac032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/shellinstaller/user_shell_registry_windows.go:501-520 | internal/shellinstaller/user_shell_update_unix.go:181-200 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_shell_registry_windows.go:501\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_registry_windows.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"207508722d850748e2f8cc540a610fbc1a37d9c982531bad8395346e25126395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/tui/model.go:1896-1915 | internal/tui/model.go:1943-1962 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c38e8120b09867344a1da2d269a1f6d01031df90e1082f7a69216fd255cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/tui/model.go:1922-1941 | internal/tui/model.go:1964-1983 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cda5dd2fcbef8031e88b4d48438d6224bbe9d558d3a2019b247f4aafae5201b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 2): internal/components/agentguidance/inject.go:417-435 | internal/components/agentguidance/strict_tdd.go:48-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agentguidance/inject.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fcfbf4391864034be5c2b72d6c52b9e98462593b414253a25d8a18275cbbdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): internal/opencode/background_remove_unix.go:76-94 | internal/opencode/background_remove_windows.go:84-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_remove_unix.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c192f3da17ac06e8974482b74d744fd69f518ea9ede5cff6b820c3dd7f1c3131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): internal/pathidentity/identity.go:84-102 | internal/releasepolicy/policy.go:148-166 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/pathidentity/identity.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1964a93751c966e8aba723d88bb389bed45bef8a79083dfee33a670a8fdfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 4): internal/components/filemerge/json_merge.go:704-720 | internal/components/filemerge/json_merge.go:803-820 | internal/components/filemerge/json_merge.go:936-953 | internal/components/filemerge/json_merge.go:1035-1052 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/filemerge/json_merge.go:704\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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea22c9dcd60709287c289cd8d1ba360bc328873ca791e25a1e24566f19308354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/app/app.go:1226-1243 | internal/cli/restore.go:231-248 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/app/app.go:1226\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"317945b3593c82be07c2a46d2c9bc0a8636d64f5753c4ae5c2b7eb4bd7474a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/cli/shell_install.go:367-384 | internal/cli/shell_install.go:389-406 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/shell_install.go:367\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e71153a009b1af5c4562da33e3dfcbf73f20bc39f16d3b170a5e6132033d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/components/agenthooks/claude.go:18-35 | internal/components/agenthooks/skill_registry.go:94-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/agenthooks/claude.go:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/components/agenthooks/claude.go:17\u0060 calls \u0060SettingsPath\u0060 and \u0060internal/components/agenthooks/skill_registry.go:93\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/claude.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e123d90f0babc4dbe672ea6bfcc3107d363409febd79c08547354653215b862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/components/engram/download.go:591-608 | internal/components/engram/download.go:789-806 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/engram/download.go:789\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae9af6253b2b5f86545b309440d9221a1da5c29913736eac48f1dea2c12944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): internal/components/filemerge/json_merge.go:684-700 | internal/components/filemerge/json_merge.go:780-796 | internal/components/filemerge/json_merge.go:913-929 | internal/components/filemerge/json_merge.go:1012-1028 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/filemerge/json_merge.go:684\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c847d2ae4c47ed457a6e82c0b3722c76d70a68c653ba7e6ad629dbdb227b2280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/app/app.go:1000-1016 | internal/cli/sync.go:2383-2399 \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":"internal/app/app.go"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"974a58f311e8fba2309a285888bfd663a2ae35aa7270447dce26a52c5b11a149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/reviewtransaction/authority_disposition_execute.go:501-517 | internal/reviewtransaction/compact_inspect.go:163-179 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/authority_disposition_execute.go:501\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20e35d478cc5c78e4f52160c20350e662449cb333902835eafb623a7d6e63d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/tui/screens/shell_manage.go:63-79 | internal/tui/screens/shell_update.go:46-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/shell_manage.go:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_manage.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f8eab9dcf2270f32dd1da8aedc98565a411b503a5b84a84bebae789d8708d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/app/app.go:913-928 | internal/cli/run.go:479-494 \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":"internal/app/app.go"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cb8ef648bf80105c93b2544edadfbd1be4035248843f06f44454979b3721e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/backup/restore.go:357-372 | internal/backup/restore.go:467-482 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/backup/restore.go:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44dd922069e6300149cd3a513700e97cc5275052c998b281c498a6857d3f31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/cli/doctor.go:453-468 | internal/opencode/background_readiness.go:1026-1041 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/doctor.go:453\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor.go"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a7ee37c4434b0a5d114c5a9182e80160e486c153aabb93be8b7a65f0c9de08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/cli/review_artifact.go:227-242 | internal/cli/review_capture_unachievable.go:92-107 \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":"internal/cli/review_artifact.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"01537a4804ff77ae42f1f9b6c566bfb54909749ed6cd1758e9faa1900ea7b6dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/components/engram/inject.go:980-995 | internal/components/engram/inject.go:1018-1033 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5358ec3c25f5be6ff79f38452725d5b718df74aecbfb69ea29c61e77a6cd1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/components/uninstall/service.go:1605-1620 | internal/components/uninstall/service.go:1650-1665 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/uninstall/service.go:1605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e272e9b2d3584057a503944bff2cbd6bb4ae830d5c96720563d92a56a28cfdc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): internal/shellinstaller/user_launch_pin_cache_unix.go:131-145 | internal/shellinstaller/user_shell_apply_unix.go:135-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_launch_pin_cache_unix.go:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_launch_pin_cache_unix.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8856ae8c6be242662bd76f6bb472632fbfdf882151e80763b6b63644175477a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/shellinstaller/user_launch_windows.go:69-84 | internal/shellinstaller/user_launch_windows.go:149-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/shellinstaller/user_launch_windows.go:85\u0060 calls \u0060userWindowsInventory\u0060 and \u0060internal/shellinstaller/user_launch_windows.go:165\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_launch_windows.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"be83f133ae3298f22e839dac78d81e08b35b6c4225a4db689a63dec071ed1c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/update/homebrew.go:47-62 | internal/update/upgrade/homebrew.go:48-63 \u2014 before extracting anything, compare \u0060internal/update/homebrew.go\u0060 and \u0060internal/update/upgrade/homebrew.go\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/homebrew.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84ea89f91814347a8f95c64e658ca392279da8513b05b659e3e6d4ee5f86219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/backup/restore.go:260-274 | internal/backup/restore.go:384-398 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/backup/restore.go:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f02a34aa473ab7c19910c8b45fb1ec5c9ce2a78aec37c94e53387507a4bd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 2): internal/cli/review_lens_context.go:782-796 | internal/cli/review_provider_roles.go:407-415 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_lens_context.go:782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_lens_context.go"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e4c551da6e3d7a244c67acb6fa625e5e783076a65bbe0f2c04701d1b2278eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/cli/sync.go:1435-1449 | internal/tui/model.go:3430-3444 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273931960eeea0361166cad3257ada99f980154e1bdbc3b93121056c1cd20aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): internal/cli/sync.go:2093-2107 | internal/cli/sync.go:2413-2425 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/sync.go:2093\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d961582be601ffc2833aa89c944e55b18993d98a77465d9257fc88cc33c22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/components/communitytool/tool.go:213-227 | internal/components/communitytool/tool.go:321-335 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/communitytool/tool.go:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/tool.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbef1c142d02a1de7a699b62f54a8f00c716e23ed2e5c6d0bef56aaccb1c596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/reviewtransaction/rar_plan_authority.go:424-438 | internal/reviewtransaction/rar_plan_authority.go:492-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/reviewtransaction/rar_plan_authority.go:439\u0060 calls \u0060publishPrivateRARImmutable\u0060, \u0060planObjectPath\u0060 and \u0060internal/reviewtransaction/rar_plan_authority.go:507\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_plan_authority.go"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a8f07b0fb363205d02672e97bde9b528ef7848bc68c380dead42e1383e32dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/telemetrycollector/summary.go:138-152 | internal/telemetrycollector/summary.go:172-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetrycollector/summary.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4260811ea2fc248483d0fbe6d71a3d8377c4e8499e58f8f57d1d26135c575fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/tui/screens/community_tool_result.go:52-66 | internal/tui/screens/community_tools.go:120-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/community_tool_result.go:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/community_tool_result.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e696fc5d80ededf71314dad5de765ce9e30f9fec585b95ba532b7f2476b486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): internal/cli/review_facade.go:2860-2873 | internal/cli/review_facade.go:2919-2932 | internal/cli/review_start_preflight.go:68-81 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_facade.go:2860\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":2860}}}],"partialFingerprints":{"codehealthFindingId/v1":"1233da6f5fc3b0bb9d69a4647d91b8b02585d2e219028f4b090fd6341bf63902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): internal/reviewtransaction/rar_plan_authority.go:347-360 | internal/reviewtransaction/rar_plan_authority.go:425-438 | internal/reviewtransaction/rar_plan_authority.go:493-506 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/rar_plan_authority.go:347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/reviewtransaction/rar_plan_authority.go:439\u0060 calls \u0060publishPrivateRARImmutable\u0060, \u0060planObjectPath\u0060 and \u0060internal/reviewtransaction/rar_plan_authority.go:507\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_plan_authority.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cd11c80d4d98aada74fc615d0b356c9c294f0c7337f84a7e8f2e3ff177e13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/app/app.go:986-999 | internal/cli/sync.go:2357-2370 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/app/app.go:986\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":"internal/app/app.go"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b0dfab989c2bc095fa5ec30116dba3d1ec1e0f2263fac9ec02ee4d35357e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/cli/run.go:4249-4262 | internal/cli/sync.go:942-955 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:4249\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/cli/run.go:4248\u0060 calls \u0060Contains\u0060 and \u0060internal/cli/sync.go:941\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4249}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a5c4a6122c2644ea3dd3280ed80b09093d3e6f2ae2d9bd25c6235f4cb9fc3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/cli/run.go:4823-4836 | internal/cli/sync.go:2774-2787 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:4823\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4823}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde87bfb766ee995557406b09e0293f6cb0c3d2c6ec3fff8e128afea0d79cbc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/cli/validate.go:253-266 | internal/tui/model.go:4419-4432 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/validate.go:253\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":"internal/cli/validate.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e0dc9abf83197b110faabac18ce460d5050609f8a95d9b24dbe8687d2bf0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/components/engram/download.go:718-731 | internal/components/engram/download.go:768-781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f589a14eec2d8739b5b4a3b12cc7d7ebc6608756f2b8b7480a2d6d7aa0f750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/components/opencodeagents/agents.go:185-198 | internal/components/opencodeagents/agents.go:244-257 \u2014 both copies are in the same file, so extract the block 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":"internal/components/opencodeagents/agents.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"98afa16b09a71fd6b9bd56441339bb861e55b922be64bcdfdc961e769143b726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/components/uninstall/service.go:176-189 | internal/components/uninstall/service.go:195-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1c097458be13ea28639cf10c8a3ef919e4d0eff16fb025adecc580bf7202dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/tui/screens/upgrade.go:133-146 | internal/tui/screens/upgrade_sync.go: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/upgrade.go:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/tui/screens/upgrade.go:129\u0060 calls \u0060WriteString\u0060, \u0060Render\u0060, \u0060String\u0060 and \u0060internal/tui/screens/upgrade_sync.go:129\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/upgrade.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c67b1436bd95f82e5007d87a284e263c2c062cbecc3323f92b2f553d85c7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): internal/reviewtransaction/compact_reviewer_capture.go:509-521 | internal/reviewtransaction/compact_reviewer_capture.go:653-665 | internal/reviewtransaction/compact_reviewer_capture.go:931-943 | internal/reviewtransaction/compact_unachievable_lens.go:55-67 | internal/reviewtransaction/compact_unachievable_lens.go:168-180 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact_reviewer_capture.go:509\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"483f7a21c92a6c19d934e23fcbf021f8e264e9d448a97b5be33cc4bcd459391c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): internal/shellinstaller/user_codegraph_executable_unix.go:51-63 | internal/shellinstaller/user_codegraph_library_unix.go:204-216 | internal/shellinstaller/user_context7_stage_unix.go:39-51 | internal/shellinstaller/user_experience_private_unix.go:166-178 | internal/shellinstaller/user_experience_stage_unix.go:53-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/shellinstaller/user_codegraph_executable_unix.go:50\u0060 calls \u0060Join\u0060 and \u0060internal/shellinstaller/user_experience_private_unix.go:165\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_codegraph_executable_unix.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c97f4b926c44caa6be25a741d8ec9dce2b2ad3ed26dc96837500f0dbfc058b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): internal/reviewtransaction/rar_path_safety.go:241-253 | internal/reviewtransaction/rar_path_safety_unix.go:341-353 | internal/reviewtransaction/rar_path_safety_windows.go:955-966 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaebdcea88f2b350f2ce74d52a27a5457173f34c043a1ac6869a01e245cc6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): internal/cli/review_stop_hook.go:359-371 | internal/cli/review_stop_hook.go:390-401 \u2014 both copies are in the same file, so extract the block 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":"internal/cli/review_stop_hook.go"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae0fa7e6f93baf20a80383ba356a86dd169b871d86b732eec8a929f4fed98d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/cli/review_transport_capability.go:281-293 | internal/cli/review_transport_capability.go:338-350 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/review_transport_capability.go:281\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_transport_capability.go"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8583d5acf8134131a0e6b8330b4bedfe2a455df3f545806f81cafdc65a1e5e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): internal/cli/run.go:658-670 | internal/components/engram/download.go:64-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:658\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9737e1053f727324e8d95ec6fb12d198e14ca70b1263c429f3adc9804eaee384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): internal/components/agentguidance/inject.go:320-332 | internal/components/agentguidance/inject.go:360-371 \u2014 both copies are in the same file, so extract the block 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":"internal/components/agentguidance/inject.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57efa3dd906a5bd3a1b288e4bdff75ad1c8e8580a72b03683c0a39f6d532d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): internal/components/engram/download.go:747-757 | internal/update/upgrade/download.go:354-366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/engram/download.go:747\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1de94507267b07249f6e388e2fdadc0ba6c9c3a7027ebddd94a9091db04935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/components/engram/inject.go:990-1002 | internal/components/persona/inject.go:397-409 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/engram/inject.go:990\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea90515e1e181051a3056a809850e73c49faa2d8b1d4abb2994f21e6090d444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/reviewtransaction/bundle.go:294-306 | internal/reviewtransaction/rar_path_safety.go:329-341 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/bundle.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c20851593708e162bfa051a4d0271dcb0db31571a63ffc0e554d06cbd313e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 4): internal/agents/conductor/adapter.go:57-66 | internal/agents/cursor/adapter.go:43-54 | internal/agents/trae/adapter.go:53-61 | internal/agents/windsurf/adapter.go:51-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/conductor/adapter.go:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/conductor/adapter.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c05c2c261041f5595f7cbffd520afabea79f38a755cd8957657971299ba3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): internal/tui/screens/model_picker.go:721-732 | internal/tui/screens/model_picker.go:897-908 | internal/tui/screens/model_picker.go:962-973 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/model_picker.go:721\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/tui/screens/model_picker.go:893\u0060 calls \u0060Sprintf\u0060 and \u0060internal/tui/screens/model_picker.go:717\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/model_picker.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce95a301b860bd809c5cdf52a11a3da86dfae6327e04c87696c2c23f741cf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): bench/axis_damaged_store_closure.go:525-534 | internal/assets/managed_digest.go:47-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/axis_damaged_store_closure.go:525\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Check import visibility before settling on that home: \u0060internal/assets/managed_digest.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store_closure.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a578301d343e88c66f26a4a31c5dd62fddda47068b193d5d14835b279fc117a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/components/engram/download.go:305-316 | internal/components/engram/download.go:329-340 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/engram/download.go:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"077e63690907abd546e0b07366f98df271d1b24656d3c8139ee38784fa3a0f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): internal/components/mcp/inject.go:301-312 | internal/components/mcp/inject.go:328-337 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/mcp/inject.go:301\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060homeDir\u0060 in one and \u0060workspaceDir\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a16132fb15578be0901761f74d28458387dcb994f9216c731e3891674a6cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/components/telemetryruntime/codex.go:72-83 | internal/components/telemetryruntime/codex.go:92-103 \u2014 both copies are in the same file, so extract the block 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a056dfcf0273d04ba6f579d3743504951d85230342273f4a0bc42b7db71901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/components/uninstall/opencode_agents.go:17-28 | internal/components/uninstall/opencode_agents.go:52-63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/opencode_agents.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"303b07745396da4afee60240f3b86616f63c851eb4da4c29ec6f1497bd157e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/reviewtransaction/store.go:937-948 | internal/shellinstaller/user_launch_pin_cache_unix.go:121-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store.go"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e958bd72bd88f754cda27adf2536a96a5e2efdadb563f152a4c0fa1b94430575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/telemetry/runtime.go:435-446 | internal/telemetry/runtime_opencode.go:282-293 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/telemetry/runtime.go:435\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e139d66efe7119bbacad5c40c042efab17dbf45d12ca2824fd40abbf072aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): internal/tui/screens/upgrade.go:166-177 | internal/tui/screens/upgrade_sync.go:161-171 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/upgrade.go:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/upgrade.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d53ee70a83b8d8c9e859a068f3db93107b91d6d84a4290520689b10cccdef3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): internal/components/engram/inject.go:1277-1287 | internal/components/mcp/inject.go:476-486 | internal/components/permissions/inject.go:290-300 | internal/components/persona/inject.go:900-910 | internal/components/theme/inject.go:218-228 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc70b24423feb9360526ac717c0d18940874d75afc6c6092729b92b57a540380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): internal/reviewtransaction/bundle.go:299-309 | internal/reviewtransaction/rar_path_safety.go:334-344 | internal/reviewtransaction/store.go:941-951 | internal/shellinstaller/user_launch_pin_cache_unix.go:125-135 | internal/state/manifest.go:200-210 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/reviewtransaction/bundle.go:297\u0060 calls \u0060Name\u0060, \u0060Remove\u0060 and \u0060internal/reviewtransaction/store.go:940\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/bundle.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c5feea6e7ada4605dd2092170b58e28298fffbf0c39197c9079a126b5c0642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): internal/shellinstaller/user_install_darwin.go:77-87 | internal/shellinstaller/user_install_linux.go:460-470 | internal/shellinstaller/user_install_linux.go:517-527 \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. 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":"internal/shellinstaller/user_install_darwin.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bdd8beef201f265d176d4e34f389286a96190397d196fe569e2e26969f6d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/cli/doctor_tool_probe_windows.go:85-95 | internal/components/engram/healthprobe_process_windows.go:59-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/doctor_tool_probe_windows.go:85\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":"internal/cli/doctor_tool_probe_windows.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30bc8353a5b93517efce65daffa6876dc61448d885b2a5dfbfc473115f15a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/cli/review_intended_untracked.go:175-185 | internal/reviewtransaction/store.go:874-884 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_intended_untracked.go:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/reviewtransaction/store.go:873\u0060 calls \u0060sliceIsSubset\u0060 and \u0060internal/cli/review_intended_untracked.go:174\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_intended_untracked.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d55684b3da3e0e7682520f124c8940dc351aef8f0ccb6a056af4453c851da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/cli/review_store_reset.go:211-221 | internal/tui/screens/review_store_reset.go:228-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_store_reset.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab016d5b7589f3e4b2e78d45a8e581e61296f01b116aa222da109d45355b4844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): internal/cli/validate.go:240-250 | internal/tui/model.go:4409-4418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/validate.go:240\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/validate.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"772bc1931e1b51d8ed63694dbcdb892d420401b1f97d8f2bb87f97ba9c53f711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/components/agenthooks/skill_registry.go:35-45 | internal/components/uninstall/service.go:1754-1764 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/agenthooks/skill_registry.go:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/skill_registry.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fbcfbc51066da4614e35beacd7fd0017d83c8fc41813951ccc9b801b22da7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/components/engram/download.go:724-734 | internal/update/upgrade/download.go:323-333 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/engram/download.go:724\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"155668c0539aaac24f523053f9947a78ce40b560495f0564aea2821dc4da0611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/components/mcp/inject.go:202-212 | internal/components/mcp/inject.go:235-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/mcp/inject.go:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9501bc349d5de9b58957bb0f681d683b668e808d6d46da996254decce45b8f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/reviewtransaction/rar_path_safety.go:465-475 | internal/reviewtransaction/store_lock.go:194-205 \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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fbc6d511e5ad22681a4a6fc0300443050369bef4f0947bf3abc85348fe56e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/reviewtransaction/rar_path_safety.go:481-491 | internal/reviewtransaction/store_lock.go:213-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/rar_path_safety.go:481\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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7840de7887f6d78a6bb6bf592756cdab08d06aa47c0aa2428143be888b7a27ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/shellinstaller/user_artifacts_windows.go:42-52 | internal/shellinstaller/user_main_source_unix.go:111-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_artifacts_windows.go:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cabf0cd655db826c41e314ad349d9a5cbccbebff09794ef67969fa4b5aefa83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/shellinstaller/user_install_flow_unix.go:963-973 | internal/shellinstaller/user_install_flow_unix.go:999-1009 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/shellinstaller/user_install_flow_unix.go:963\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e57bdb3fdc6ac4eb35aba8f8fd31c4a804cc4f24225ee5038c1dec023433d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/shellinstaller/user_install_linux.go:196-206 | internal/shellinstaller/user_root_service_linux.go:40-50 \u2014 before extracting anything, compare \u0060internal/shellinstaller/user_install_linux.go\u0060 and \u0060internal/shellinstaller/user_root_service_linux.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6dd71bb4166d9326ce738cf8e441fc14cfbf9c3b6241496b6ff5f082f27f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/tui/screens/codex_model_picker.go:671-681 | internal/tui/screens/codex_model_picker.go:698-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/codex_model_picker.go:671\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/codex_model_picker.go"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb06f80bfdfb55d6f87c50003dd0f33294479dd297c812417dbc269ab871ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 11): internal/agents/claude/adapter.go:57-66 | internal/agents/codex/adapter.go:51-60 | internal/agents/copilotcli/adapter.go:43-51 | internal/agents/gemini/adapter.go:51-60 | internal/agents/hermes/adapter.go:52-61 | internal/agents/kilocode/adapter.go:54-63 | internal/agents/kimi/adapter.go:75-84 | internal/agents/openclaw/adapter.go:52-61 | internal/agents/opencode/adapter.go:60-69 | internal/agents/pi/adapter.go:291-300 | internal/agents/qwen/adapter.go:55-64 \u2014 \u0060internal/agents/claude/adapter.go\u0060 and \u0060internal/agents/kilocode/adapter.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/claude/adapter.go:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/claude/adapter.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece4de211ffd691d986640daccf9c683f1a8d5a0d0e8af0ef0f878461a02128f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): internal/cli/run.go:2381-2390 | internal/cli/run.go:2437-2446 | internal/cli/run.go:2510-2519 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:2381\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e47fce4c4744b801679dfce1a9bf21d6dc44af65eebcc6a2e8b45a2a39688e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): internal/components/persona/inject.go:197-206 | internal/components/persona/inject.go:249-257 | internal/components/persona/inject.go:394-402 \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":"internal/components/persona/inject.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9364968f05aac620e3a964198b949043f4cf31b1527af0d63afb964422b05556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/agents/capabilitymanifest/manifest.go:163-172 | internal/agents/capabilitymanifest/manifest.go:191-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/capabilitymanifest/manifest.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"197457f634924d8adeba3c6dc73f9af2f00dee8194af42e04c561aa3e7012580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/backup/restore.go:277-286 | internal/backup/restore.go:401-410 \u2014 both copies are in the same file, so extract the block 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":"internal/backup/restore.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4940eebb52485b7fa16b67ff8c6681bb61b22477b0623a760603fa6c91c66bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/cli/review_stop_hook.go:375-384 | internal/cli/review_stop_hook.go:407-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_stop_hook.go:375\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_stop_hook.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9332c532f4afd332f75be6ee9af05ca84756213bbd1f67560aeff57e2df3651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/cli/run.go:4497-4506 | internal/cli/sync.go:1082-1091 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:4497\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":"internal/cli/run.go"},"region":{"startLine":4497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f80f711324f58bd6b1358a41a4c2a3a3ee7a5828aec3c9526d41e3745c63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/opencode/background_remove_unix.go:38-47 | internal/opencode/background_remove_windows.go:28-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_remove_unix.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"90822fafa67565eb1c072bb397a9f90e35b2b03c45df7ce4745b0d35a51c4434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/reviewtransaction/authority_repair.go:511-520 | internal/reviewtransaction/legacy_alias_repair.go:195-204 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/authority_repair.go:511\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"955a8ad4bda5fbb2d2926b5fcb4dd025a358a33ec8e04e74a4c76f52fc8b60af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/reviewtransaction/compact_abandon.go:256-265 | internal/reviewtransaction/compact_reclaim.go:153-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79640674de443f6cbebbe7c6a24e85cd24db9bd49b5ff7d3cf5d25a76109fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_experience_stage_windows.go:41-50 | internal/shellinstaller/user_main_source_unix.go:29-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_experience_stage_windows.go:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_stage_windows.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92d921c621f33a61225c131a0d46b59537c64259205c56143bb92b2de38b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_native_operation_linux.go:74-83 | internal/shellinstaller/user_native_slice_linux.go:239-248 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_native_operation_linux.go:74\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_operation_linux.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7cf8984dd303ef4621e622fb99368394e5e6c7e6e4125aab51af88da3bf34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_reviewed_stage_unix.go:53-62 | internal/shellinstaller/user_shell_pins_unix.go:64-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_reviewed_stage_unix.go:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_reviewed_stage_unix.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bb177e524fb791b238ac45c5c9d20c168d2d93a44952eb600b90cb133a7871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_shell_registry_unix.go:93-102 | internal/shellinstaller/user_shell_registry_unix.go:133-142 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/shellinstaller/user_shell_registry_unix.go:93\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_registry_unix.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"99254b690c3cf2b94df47bf7388e6bb42b332c8f4ccb11f192b32a3ae1839bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): internal/components/uninstall/service.go:1603-1611 | internal/components/uninstall/service.go:1648-1656 | internal/components/uninstall/service.go:1679-1687 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/uninstall/service.go:1603\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"200a080e8e8eaa3286076d9338d94128528d54549d1823014b7440a9fc0ab1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): internal/reviewtransaction/verification_contract.go:1046-1054 | internal/reviewtransaction/verification_contract.go:1071-1079 | internal/reviewtransaction/verification_contract.go:1198-1206 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/verification_contract.go:1046\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57ecd76c69a71e2758d458edaeaf7353b5c3dfce15e1c341ce36c46dcf14529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/app/app.go:1196-1204 | internal/cli/run.go:5175-5183 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59ce35c99ed06d407a2e267b8efd045034c4474641c1b70a12ea5ebca2ec41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/compatibility_transaction_windows.go:251-259 | internal/cli/compatibility_writer_unix.go:62-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/compatibility_transaction_windows.go:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"118ac02c7ccd24823445e87aab58d64b63b108cef9925519814fe605db82121c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/review_facade.go:1928-1936 | internal/cli/review_facade.go:2315-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":"internal/cli/review_facade.go"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c0947b9d7d5b3b0be12507dc2c3abb7d575fbcd4f1f73969cac81e4cb73f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/run.go:2553-2561 | internal/cli/run.go:2604-2612 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/run.go:2553\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3cdce56ecca565f754e4d12eb5d49ba58e096ac40a363ef4aa511d427264e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/cli/shell_install_model_other.go:134-144 | internal/cli/shell_install_model_windows.go:108-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/shell_install_model_other.go:134\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install_model_other.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5256b5a41e78d53a57001663f822e70fa6f7bbd1d91928feceff01cb718628b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/components/agenthooks/codex_telemetry.go:72-80 | internal/components/agenthooks/skill_registry.go:154-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/agenthooks/codex_telemetry.go:72\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/codex_telemetry.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f47ce051cabf9715ffaeae07767caa16ed79c2474316cc4d23278e648800a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/app/app.go:976-985 | internal/cli/sync.go:2342-2351 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/app/app.go:976\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":"internal/app/app.go"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a0f101a41e61fedc39fa5f5413610e92e452340e64b370d7858e6b761dbdae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): internal/cli/review_assess.go:302-308 | internal/cli/review_facade.go:2408-2415 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_assess.go:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/cli/review_assess.go:299\u0060 calls \u0060Bool\u0060 and \u0060internal/cli/review_facade.go:2405\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_assess.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49aa29f8a6e32a5ef5ef0306ba11932f33d75a84478f8c3ffd6e2a83ff1dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/cli/review_last_event_closure.go:103-110 | internal/cli/review_provider_roles.go:764-771 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_last_event_closure.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3af3b062691ca8dbcae97801dfda1f8d17d026ec4fa4a2fbf0d8cd930a5510e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/cli/uninstall.go:58-65 | internal/cli/uninstall.go: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":"internal/cli/uninstall.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18b5b5a7a7c6c74bdf97419048ea5777de0f2fc09d41cd3b5b42ab7ed63e361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/components/communitytool/pi_codegraph.go:1065-1072 | internal/components/mutationjournal/journal.go:179-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/communitytool/pi_codegraph.go:1065\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145f0c7fb3280fdf230a924d5cf982a69e810a9a1f57c74f805ac928938cc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/components/skills/inject.go:93-100 | internal/update/upgrade/executor.go:415-422 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/skills/inject.go:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/skills/inject.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b30279329ce1dda09293c9871263e296cf6ffb935a88e8259fc48c7531934b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/components/skills/inject.go:159-166 | internal/components/skills/support.go:192-199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/skills/inject.go:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/skills/inject.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a32a1073fa3fe930b8300049aa9df62f75d10100bf7fe17a41f7da8f2586aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/components/uninstall/opencode_agents.go:38-45 | internal/components/uninstall/opencode_agents.go:153-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/uninstall/opencode_agents.go:38\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/opencode_agents.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"de228d55efa13b8f39f62bc22320d8342170a75cb34fa7bdf5a9f5a6d036e547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/reviewtransaction/authority_repair.go:568-575 | internal/reviewtransaction/bundle.go:326-333 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/authority_repair.go:568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4197d4ddc9b767f2e0fee2914967f46f96ca6e78843c85e967c8223824dbd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): internal/reviewtransaction/compact.go:1857-1863 | internal/reviewtransaction/compact_reviewer_capture.go:101-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact.go:1857\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d81d3add8d93498f36a8c82aeaba535f5a7858c077abc63140f119229eac57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/reviewtransaction/compact_reviewer_capture.go:405-412 | internal/reviewtransaction/compact_reviewer_capture.go:532-539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed913f5be728681da4ef172ea8b27d6b9c26365bb69b251e6c1f4ef05a58f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/shellinstaller/user_agent_preimage_unix.go:101-108 | internal/shellinstaller/user_agent_rollback_unix.go:155-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_preimage_unix.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e212033dbca31975080ab872793fc8278e0c2535ccd22da0357a92d5afe9c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): internal/shellinstaller/user_install_cleanup_windows.go:32-39 | internal/shellinstaller/user_install_cleanup_windows.go:94-100 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/shellinstaller/user_install_cleanup_windows.go:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_cleanup_windows.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6545c80d3ecab15ed9f9282568748ca14ae3b05552e53cf1086dde820384e2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/shellinstaller/user_main_source_cache_unix.go:92-99 | internal/shellinstaller/user_main_source_unix.go:115-122 \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":"internal/shellinstaller/user_main_source_cache_unix.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ad901f71d95adb9450ba08c592b299740edf90f01f328927da5fa12e366de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/state/manifest.go:110-117 | internal/telemetry/state.go:203-210 \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":"internal/state/manifest.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bda5b0e3b93791a887d3525105079beeb378e2a4f6852c8eb6d6a8a86b72de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/system/deps.go:219-226 | internal/update/check.go:370-377 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/deps.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49010f396001acbeb13902d53731ac59be959158c6a01bc5e8f4e051cb06643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/tui/screens/backups.go:124-131 | internal/tui/screens/backups.go:187-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/backups.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1395d17075df48dd4f10834ece27eab5415ec5a9b402e76f325abc2c62184c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/tui/screens/codex_model_picker.go:648-655 | internal/tui/screens/codex_model_picker.go: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/codex_model_picker.go:648\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":"internal/tui/screens/codex_model_picker.go"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"337cf4407a6e99a2e37e3607fa8a503efa6219e889cdb775b16cd19041bad4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/tui/screens/uninstall.go:114-126 | internal/tui/screens/uninstall.go:156-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":"internal/tui/screens/uninstall.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d915cec09f69671c5b1dc20012bf670c801ee14aacb58af394a59562646d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/update/upgrade/strategy.go:577-584 | internal/update/upgrade/strategy.go:656-663 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/update/upgrade/strategy.go:577\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/strategy.go"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c77de470151da38c8240267af92cd2b20a0850fce2636afae61a8eca5265f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): internal/tui/screens/model_picker.go:720-727 | internal/tui/screens/model_picker.go:850-856 | internal/tui/screens/model_picker.go:896-903 | internal/tui/screens/model_picker.go:961-968 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/model_picker.go:720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/tui/screens/model_picker.go:893\u0060 calls \u0060Sprintf\u0060 and \u0060internal/tui/screens/model_picker.go:717\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/model_picker.go"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe7dc96281b7acab997691bfe237b6127b5574cdf46b8119e9901b16545fd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/cli/review_artifact.go:601-607 | internal/reviewtransaction/compact_reviewer_capture.go:243-249 | internal/reviewtransaction/rar_authority_repository.go:707-713 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_artifact.go:601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c2cd79f725952a4b85c60c274d58a098123c973f3a1a56f5f345c073fb5085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): internal/components/agenthooks/claude.go:21-35 | internal/components/agenthooks/codex_telemetry.go:23-37 | internal/components/agenthooks/skill_registry.go:97-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/agenthooks/claude.go:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/claude.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c002e93a7a78b6ed1a737ffccd2b2d8fb6ffc008965e37ee6c4446835aef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/shellinstaller/user_artifacts_windows.go:46-52 | internal/shellinstaller/user_main_source_cache_unix.go:92-98 | internal/shellinstaller/user_main_source_unix.go:115-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d12e79a2a74ef41d0f910928baadc0dfce492c7c75b493d9013332379cf4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/tui/screens/backups.go:87-93 | internal/tui/screens/backups.go:148-154 | internal/tui/screens/backups.go:210-216 \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":"internal/tui/screens/backups.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d456e645bbd47524a041220bf7a0bcb58751f7e4d1236b7ab2b3682cf7b1c9a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/review_capture_unachievable.go:71-77 | internal/cli/review_correction_plan_capture.go:37-43 \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":"internal/cli/review_capture_unachievable.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dd77be44846e63125f9b24048cad62beba22d728b3f26415d5f2b002c7749e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/review_status_contract.go:1317-1323 | internal/cli/review_status_contract.go:1422-1428 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/review_status_contract.go:1317\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"03369b5ca2e36962cbbda6b5bda2b2579cdcd43644cf01acbb91272e80f4a259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/run.go:4087-4093 | internal/cli/sync.go:727-733 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:4087\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":"internal/cli/run.go"},"region":{"startLine":4087}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0c0a25574a30966fb5f29b03e600e1e5720b3d7ab4738cc15d73c9e37b6442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/run.go:4225-4231 | internal/cli/sync.go:910-916 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:4225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/cli/sync.go:917\u0060 calls \u0060pathUnderHomeOnly\u0060 and \u0060internal/cli/run.go:4232\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4225}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d21d466ea46bf2e4fdf1e9d5a64db37e4e142a8a3980681a3f9fb88a9b71e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/authority_repair.go:462-468 | internal/reviewtransaction/authority_repair.go:470-476 \u2014 both copies are in the same file, so extract the block 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bce6675fc7e8cd76ad759f35f40c24a8527f80b2fa2ad28efec193c9541663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/compact_abandon.go:243-249 | internal/reviewtransaction/compact_reclaim.go:143-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact_abandon.go:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8780c84a7cd67d8cf5e3fc4681dde49e964dae157420d7d1d6fc0abffe8cd3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/rar_path_safety_unix.go:152-158 | internal/reviewtransaction/rar_path_safety_windows.go:292-298 \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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f958ebdc74a5c644e0eb7ba1442c5acdbf5db2809c4891fcb5f5f68fa407c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/target_status.go:613-619 | internal/reviewtransaction/target_status.go:627-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status.go"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fddbab0aafaa2eeda1fea49b1d6e1b39905760dbf55c04976fd4370196ee51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/shellinstaller/user_install_scope_unix.go:60-67 | internal/shellinstaller/user_install_scope_windows.go:40-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_install_scope_unix.go:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9159bfd498a84f998d6e65b46de7f53ae66ab58c62a29176cd9a7b0a152809c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/shellinstaller/user_native_primitives_unix.go:75-81 | internal/shellinstaller/user_native_primitives_unix.go:90-96 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/shellinstaller/user_native_primitives_unix.go:75\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_primitives_unix.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cd71716e2e4c1c34eed8dd52750e5a7d927434ee7e269965cfe22fad4224e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/shellinstaller/user_shell_registry_windows.go:250-256 | internal/shellinstaller/user_shell_registry_windows.go:269-275 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/shellinstaller/user_shell_registry_windows.go:250\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_registry_windows.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"792317f607e947d447197344f3f80cfaa8fae1151519f7990c2e78ce29e89a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/tui/screens/claude_model_picker.go:498-504 | internal/tui/screens/claude_model_picker.go:523-529 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/tui/screens/claude_model_picker.go:498\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":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab272e2f598ac6f280a474dd61dd49e69cfdf7abeb6583c082ccade36ee393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): internal/shellinstaller/user_experience_stage_windows.go:44-49 | internal/shellinstaller/user_main_custody_unix.go:33-38 | internal/shellinstaller/user_main_source_unix.go:32-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_stage_windows.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae5940f559bdc6497caab34a7bf9482738edf690a647d71abff88673387bdd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/compatibility_transaction_windows.go:503-508 | internal/cli/compatibility_writer_unix.go:251-256 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/compatibility_transaction_windows.go:503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"116accd6bf12cf9d26b6a31c6aa5a7c3c08fbc71892a78967541c9bdd6c16c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/review_facade.go:3102-3107 | internal/cli/review_facade.go:3123-3128 \u2014 both copies are in the same file, so extract the block 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":"internal/cli/review_facade.go"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3041142566f204ea486ccdbdaa4408c6459c1bf8aaf7ac1b800f1a953b956b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/run.go:4142-4147 | internal/cli/sync.go:903-908 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/cli/run.go:4139\u0060 calls \u0060retiredSDDAssetBackupPaths\u0060 and \u0060internal/cli/sync.go:901\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"03296da675caee9cc197650d8eb5006a58999ba21eb5b52a9beb561e7efd8ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/sync.go:1698-1703 | internal/components/communitytool/codegraph_guidance.go:251-256 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/sync.go:1698\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e3f6c1e390636536bb433ba59db17ed877729fa93fb12b3827a6a5a9bfc200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/shellinstaller/user_shell_launcher_unix.go:83-88 | internal/shellinstaller/user_shell_launcher_windows.go:54-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_shell_launcher_unix.go:83\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":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbf0c5cd77a3f65562e866a4e1e8477aba834b56ed29701f6edbf25cdecda31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/tui/screens/review_store_reset.go:65-70 | internal/tui/screens/review_store_reset.go:79-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/review_store_reset.go:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/review_store_reset.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"486b265e381ed31d4aff7f927cc72ac775beed27c5192a66bb05219c4c387d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 6): internal/cli/shell_install.go:318-322 | internal/cli/shell_install.go:325-329 | internal/cli/shell_install.go:332-338 | internal/cli/shell_install.go:339-343 | internal/cli/shell_install.go:347-350 | internal/cli/shell_install.go:353-357 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/shell_install.go:347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/cli/shell_install.go:323\u0060 calls \u0060report\u0060 and \u0060internal/cli/shell_install.go:338\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8975080909927696c945feeb6f4eebaf9700b9429fcf1dff01de2f1bd5813116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/cli/doctor_tool_probe_unix.go:19-23 | internal/components/engram/healthprobe_process_unix.go:14-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/doctor_tool_probe_unix.go:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor_tool_probe_unix.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f947fe8e40761dd3ac20b7e2bb947274aa6db689e3812e7e577198241058c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/cli/review.go:694-698 | internal/cli/review_facade.go:3061-3065 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/cli/review.go:699\u0060 calls \u0060String\u0060, \u0060Var\u0060 and \u0060internal/cli/review_facade.go:3066\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review.go"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7babc5c271063a90235a2af007d16281e6a94606693029dfe7d1da76b393f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/review_status_contract.go:1552-1558 | internal/cli/review_status_contract.go:1580-1586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_status_contract.go:1552\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4e1c232dd9d7e789ec39302fbc501a5f135a94c9f5e08d8a2d626e13051474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/run.go:4172-4178 | internal/cli/sync.go:838-844 \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":"internal/cli/run.go"},"region":{"startLine":4172}}}],"partialFingerprints":{"codehealthFindingId/v1":"475c5a13d267183fdb54c26831f71be7b16c2a6d0e93bf6b32cb7aa03fa81d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/components/agenthooks/codex_telemetry.go:84-88 | internal/components/legacyassets/claude_hook.go:72-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/agenthooks/codex_telemetry.go:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/codex_telemetry.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"100daf6102f00f24e64beb70aee748561829a7909ce2f71c541aa6307478e41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/components/uninstall/service.go:1459-1463 | internal/components/uninstall/service.go:1518-1522 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/uninstall/service.go:1459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b2175aae7631b85c8d5237b99c1ec3090682cffb5f6cc922cdcec7bc4c9e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/compact_reviewer_capture.go:575-581 | internal/reviewtransaction/compact_reviewer_capture.go:708-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact_reviewer_capture.go:575\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3e88324cb0470057275bcd2b24789732d96b3c75a798cb978a6382fde564a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/reviewtransaction/risk.go:1270-1274 | internal/reviewtransaction/verification_contract.go:1279-1283 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/risk.go:1270\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d3515ca79cca2975fb8314c61214bd7d6272382d152ffe18896a3e1df25b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/reviewtransaction/store_lock.go:356-360 | internal/reviewtransaction/store_lock.go:377-381 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/store_lock.go:356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store_lock.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"98af65725520cc79bf979737e08ff9e9bfb7b1fbbc08e00215a30849d17fb6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/shellinstaller/user_context7_stage_unix.go:66-70 | internal/shellinstaller/user_experience_stage_unix.go:79-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_context7_stage_unix.go:66\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_context7_stage_unix.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b1734e7a2acafc335b029b8029daceaac0c1374078c1be8b5007d0d714273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/shellinstaller/user_launch_windows.go:88-93 | internal/shellinstaller/user_launch_windows.go:165-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":"internal/shellinstaller/user_launch_windows.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"054f1383d4c52e76ff3e0e773ed0bcad2b7045441ffb38e64e7c5593d86a9999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_main_source_unix.go:87-96 | internal/shellinstaller/user_source_archive.go:111-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_main_source_unix.go:87\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_source_unix.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2586c131e01412dafa5e20b252e412a682aaa34dbd7555ebc91f6ec957f21c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/tui/screens/agent_builder_generating.go:18-22 | internal/tui/screens/agent_builder_installing.go:18-22 \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":"internal/tui/screens/agent_builder_generating.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a9ff15b48b2f653c53ddf4892d3863b898a2cc1e3f000739cce9c7e996216e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): internal/agents/antigravity/adapter.go:208-215 | internal/agents/claude/adapter.go:248-255 | internal/agents/codex/adapter.go:175-182 | internal/agents/conductor/adapter.go:164-171 | internal/agents/cursor/adapter.go:157-164 | internal/agents/gemini/adapter.go:166-173 | internal/agents/hermes/adapter.go:156-163 | internal/agents/kilocode/adapter.go:162-169 | internal/agents/kimi/adapter.go:319-325 | internal/agents/openclaw/adapter.go:153-160 | internal/agents/opencode/adapter.go:334-341 | internal/agents/pi/adapter.go:822-828 | internal/agents/qwen/adapter.go:171-178 | internal/agents/trae/adapter.go:195-201 | internal/agents/windsurf/adapter.go:198-204 \u2014 \u0060internal/agents/claude/adapter.go\u0060 and \u0060internal/agents/kilocode/adapter.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/antigravity/adapter.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e6f3374f8806c9df0d2319ecc7ed25d66b806c43f02cc6f4b7f5bd23c556aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): internal/agents/claude/adapter.go:18-29 | internal/agents/kilocode/adapter.go:15-26 | internal/agents/opencode/adapter.go:21-32 \u2014 \u0060internal/agents/claude/adapter.go\u0060 and \u0060internal/agents/kilocode/adapter.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/claude/adapter.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5192ffd93f6169378b548bea4931fca30839a5edacc8c2e2c0ab31b0abf5c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): internal/agents/claude/adapter.go:74-81 | internal/agents/kilocode/adapter.go:71-78 | internal/agents/kimi/adapter.go:123-129 | internal/agents/opencode/adapter.go:77-84 \u2014 \u0060internal/agents/claude/adapter.go\u0060 and \u0060internal/agents/kilocode/adapter.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/claude/adapter.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddcc4b5a76db0068cc4e7c3569147ba4e0eed19e21ef7f39cc32f771fe1ab8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): internal/agents/codex/adapter.go:14-24 | internal/agents/copilotcli/adapter.go:15-26 | internal/agents/gemini/adapter.go:14-24 | internal/agents/hermes/adapter.go:15-25 | internal/agents/openclaw/adapter.go:15-25 | internal/agents/qwen/adapter.go:14-28 \u2014 \u0060internal/agents/codex/adapter.go\u0060 and \u0060internal/agents/gemini/adapter.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/codex/adapter.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf2717533dee584766764cd231d8dd9b9cb58e52212041d5bff31b086fc2beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/agents/codex/runtime_version.go:174-182 | internal/opencode/background.go:193-201 \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":"internal/agents/codex/runtime_version.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3def8a91cc8c1b0d7afa66886b59c3c1c363040652e6561e845a5e0c93379480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/app/app.go:752-761 | internal/cli/run.go:4686-4695 \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":"internal/app/app.go"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397bcd38b0037518e4bb852623a41806f0f41a2c8e3c6e3c066b79ad83a30d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): internal/app/app.go:1132-1141 | internal/app/app.go:1169-1178 | internal/app/app.go:1182-1191 | internal/cli/run.go:5148-5157 | internal/cli/run.go:5161-5170 | internal/model/antigravity_model.go:56-65 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"932d65b1fdc70beb439f07621de1ed4bbe9bafe7e95a96eaf7fdfb1f34d486d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/app/app.go:1255-1260 | internal/cli/run.go:5185-5190 \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":"internal/app/app.go"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d650ef7176bc4838fadd225cc032ec1fc29571a603ef157dd7f1ec21d146084b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/app/app.go:1262-1267 | internal/cli/run.go:5192-5197 \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":"internal/app/app.go"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f07381367eeed47c2c5813e7991d791767b2e067cc1c8f487b747a405610e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/cli/review_artifact.go:130-140 | internal/reviewtransaction/store.go:27-37 \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":"internal/cli/review_artifact.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a185e7d011577c65866a0f1595cf176fe8ad88197ef96ee69e0ea868b6c8951b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/cli/review_facade.go:3452-3456 | internal/reviewtransaction/compact_reviewer_capture.go:196-200 \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":"internal/cli/review_facade.go"},"region":{"startLine":3452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3d5bc520296e03231b1924d7b88b903438e97d0dc0acf33044f3dd6346b2b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/review_store_reset.go:185-193 | internal/tui/screens/review_store_reset.go:215-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":"internal/cli/review_store_reset.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bbf8fd76a3f22263aabb9209e535e5266ce38f9e998a099ac00ac92af69d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/cli/uninstall.go:221-228 | internal/components/communitytool/tool.go:595-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060title\u0060 in one and \u0060homeDir\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/uninstall.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9159740a2bef3e2296f6dc5290e1467edb0ddcefe18e723d1241ab3f2c50ca0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/components/engram/inject.go:1229-1234 | internal/components/persona/inject.go:556-561 \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":"internal/components/engram/inject.go"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"547994ad7439f7de83d1038992ec34b057e1973d0054c7b7ba2d0a0b7178c4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/components/engram/inject.go:1289-1298 | internal/components/persona/inject.go:950-959 \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":"internal/components/engram/inject.go"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd8f440b09f34361cb5479fd0837e941a44eff475d0a3c41d69df2daafce7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/components/legacyassets/opencode_settings.go:434-441 | scripts/gen-sdd-agent-digests/replay.go:366-373 \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. Check import visibility before settling on that home: \u0060internal/components/legacyassets/opencode_settings.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/opencode_settings.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7a5a676b62e24225540eb4ca84451fef1db2ddd0fdc506aee3459319868777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/components/uninstall/retired_sdd.go:143-151 | internal/update/upgrade/executor.go:348-356 \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":"internal/components/uninstall/retired_sdd.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca846dc660a1638d493bb96481184edd29f1c90c29b613b9d711362321e9a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/providercontractbundlecmd/main.go:14-19 | internal/releaseprovenancecmd/main.go:14-19 \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":"internal/providercontractbundlecmd/main.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"396c717a6c9c822314df30ca46873be9c22f3a0f6f12540264f26f05b99da699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/recoverytrace/generate.go:142-148 | internal/reviewtransaction/rar_authority_repository.go:691-697 | internal/state/state.go:367-373 \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":"internal/recoverytrace/generate.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"086ec5acd7d92e5a5388b2ec64ec14623dce37e0fb4fe05187da255c7e021565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): internal/reviewtransaction/candidate_decline.go:96-105 | internal/reviewtransaction/rar_authority_repository.go:626-635 | internal/reviewtransaction/rdd_mode.go:1100-1109 \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":"internal/reviewtransaction/candidate_decline.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"48168e0149bc297b19b3c0c5a075a85df130a9c22605e54e50b7d0ea1c52c6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): internal/reviewtransaction/compact_result_reopen.go:281-291 | internal/reviewtransaction/transaction.go:1717-1727 | internal/reviewtransaction/verification_contract.go:1366-1376 \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":"internal/reviewtransaction/compact_result_reopen.go"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5d763e9a8672c3e8b621b61a056bda3e1579cb0992096d3b2162290506b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/reviewtransaction/rar_authority_repository.go:652-661 | internal/reviewtransaction/rar_plan_authority.go:567-576 \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":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2edcde6ee86a277698f323cca736ab58992ad0b0ec9b03cfc3073a8366c7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/shellinstaller/user_channel_overlay_unix.go:82-89 | internal/shellinstaller/user_channel_overlay_windows.go:45-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060error\u0060 to \u0060r *userUnixOverlayRollback) push(undo func()\u0060 in one and \u0060r *userWindowsOverlayRollback) push(undo func()\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0bd337cf21ef29a22f2db27ccb882317a8fcffa0d293fda9070ee799725258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/tui/model.go:79-91 | internal/tui/screens/sanitize.go:15-25 \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":"internal/tui/model.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1eadee950b06a8340db529c40542c9cfcfc54def0e178fd8d1085421a03120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): internal/tui/screens/claude_model_picker.go:186-196 | internal/tui/screens/codex_model_picker.go:169-179 | internal/tui/screens/kiro_model_picker.go:91-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0c8e8522ba204f393c515fdfd372fa96ac9456248a4937fdf8cb8424fab25d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/tui/screens/codex_model_picker.go:503-509 | internal/tui/screens/model_picker.go:478-484 \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":"internal/tui/screens/codex_model_picker.go"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d7e2a98e6f715a42e141cab945e09ce1ab08a0f2f6f78025db673b4075fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/agents/pi/config_dir.go:38-43 | internal/state/home.go:31-36 \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":"internal/agents/pi/config_dir.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"403fec75e0e0a6f3040b320cf8d5cfa88460c6b764a1f050ab9fbdac70d1d46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/cli/opencode_background.go:95-104 | internal/cli/pi_background.go:115-124 \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":"internal/cli/opencode_background.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e2aa6b0bfd0ac1e58483d7edc57771ec7def6de5d7d970e06098ec4a2002f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/opencode_background.go:122-130 | internal/cli/pi_background.go:142-150 \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":"internal/cli/opencode_background.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"541b01e001bba3e1ae06324acbfd29110be5bc63dea88b5b58c7b252549b61db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/review_consent_contract.go:129-137 | internal/cli/review_mode.go:1042-1050 \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":"internal/cli/review_consent_contract.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb70fa4bb6c3703eded439b0ad1d0fe45d0d0e11b10bbd2a6487fa9cc8c7bee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/cli/review_inspect_candidate.go:44-53 | internal/cli/review_lens_context.go:172-182 \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":"internal/cli/review_inspect_candidate.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"479d4076e12dad0d17b1a25a1082f714d874253cf62aedf05e8f5eeb88e92fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/review_status_contract.go:1200-1206 | internal/reviewtransaction/verification_contract.go:1416-1422 \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":"internal/cli/review_status_contract.go"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"185795ce47a7e6058d4711cc5e5d28a200ae05b4fb0b929eea53ec2ed95c5257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/cli/uninstall.go:205-211 | internal/tui/screens/uninstall.go:459-465 | internal/tui/screens/uninstall.go:476-482 \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":"internal/cli/uninstall.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac234e7cf3c9907bbedb494404b1b3c68b2c14169a50da420ec6ec84d3ac2b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_engram_shared_windows.go:82-91 | internal/shellinstaller/user_system_git_windows.go:103-112 \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":"internal/shellinstaller/user_engram_shared_windows.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f672de612db2d2f294b9e66ed5b11758f98c13677abc95cae6429b44d7ef950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/shellinstaller/user_install_scope_unix.go:230-235 | internal/shellinstaller/user_install_scope_windows.go:140-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":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"23223b73a07477d83e0bd107a709ec7d4335226b5b9dc2a0f0ba9f8f27828377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/shellinstaller/user_shell_pins_unix.go:22-28 | internal/shellinstaller/user_shell_pins_unix.go:82-88 | internal/shellinstaller/user_shell_pins_windows.go:72-78 \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":"internal/shellinstaller/user_shell_pins_unix.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"695aa108959919e19410cbaac335bc039f4befa9b99e105a692505dbc6a9a368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/state/manifest.go:94-104 | internal/state/state.go:233-243 \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":"internal/state/manifest.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc24696b6ac47b11da81de1178927abf8cb4aad7ac9e7e9adcbc628fed9815f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/reviewtransaction/authority_repair.go:257-268 | internal/reviewtransaction/authority_repair.go:324-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/reviewtransaction/authority_repair.go:269\u0060 calls \u0060probeAuthorityRepairLock\u0060, \u0060Join\u0060 and \u0060internal/reviewtransaction/authority_repair.go:336\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c4d69b39be82bf411ae0ccc45804a59126c5a4ed02bc1fcb401e4a7dec179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/cli/review_facade.go:2415-2426 | internal/cli/review_facade.go:3067-3078 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/review_facade.go:2415\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a10a2e265f0139664149048dd2a16a096966cc28ed6e889258ce8d5c1a64be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/app/app.go:454-465 | internal/app/app.go:504-515 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/app/app.go:454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"internal/app/app.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe497c38938cfd710a73f5f4273644b46710bd9598d1a72c64f866ded74a5e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/agents/kiro/adapter.go:165-175 | internal/agents/windsurf/adapter.go:112-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/kiro/adapter.go:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/kiro/adapter.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf745a122d2106085e47ec2786077029433e0772be8f8e21be3a97cac8b081c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/shellinstaller/user_install_cleanup_unix.go:40-50 | internal/shellinstaller/user_install_cleanup_windows.go:40-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_install_cleanup_unix.go:40\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dfb49facfaa706177eb8872f04bc15bf0a5dffc40dccf0fafa22547262bb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_main_source_unix.go:19-28 | internal/shellinstaller/user_main_source_unix.go:101-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_source_unix.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4808b4bf7cc92c684eda9cf707a12c3c09ec5067f847e0fd2d07ea435972f3e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_agent_state.go:168-177 | internal/shellinstaller/user_agent_state.go:181-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_agent_state.go:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f52ce8e9942ff4d53618aa83e0f2abc3766c387bba15fd6f32209ffb67417c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/components/engram/antigravity_uninstall.go:80-89 | internal/components/engram/inject.go:1540-1549 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/engram/antigravity_uninstall.go:80\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":"internal/components/engram/antigravity_uninstall.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4d88a22ea3783d6424d74c9192891a7ac10c6503187f8673907db828823e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/shellinstaller/user_install_cleanup_unix.go:123-132 | internal/shellinstaller/user_install_cleanup_windows.go:101-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_install_cleanup_unix.go:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_cleanup_unix.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11aa7ad3b847c4b4fb594a61c868250229c09e7af5accee154c3f30f79a2ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/cli/telemetry.go:219-228 | internal/cli/telemetry.go:403-412 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/telemetry.go:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/telemetry.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c145b2d455e65e521c5066df5864ef3e424e1808b95b651b9ff69ffe5b6ae322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/review_next_transition.go:1094-1099 | internal/cli/review_next_transition.go:1131-1140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_next_transition.go"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bed6b8e99634fed96d86dd1ff6b63364ce5ac20c174fe349e1e2a8dd67d228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/components/engram/download.go:276-284 | internal/components/engram/download.go:376-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce6da5684e6164d8aa8eb62d51eb691b01157f6971d61fee50931adb095320e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/cli/review.go:466-474 | internal/cli/review.go:565-573 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/cli/review.go:466\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":"internal/cli/review.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea40e85b73d2e386efb6dc010cc0c2a923c833dfd026bccb0263a365e8f79d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/agentbuilder/installer.go:35-43 | internal/agentbuilder/installer.go:48-56 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/agentbuilder/installer.go:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentbuilder/installer.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870cb272c48ae8541adc498906b8657fa196d36b4bdafe794203525f25094f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): internal/cli/review.go:182-190 | internal/cli/review.go:445-453 | internal/cli/review.go:465-473 | internal/cli/review.go:503-511 | internal/cli/review.go:564-572 | internal/cli/review.go:702-710 | internal/cli/review_facade.go:1905-1913 | internal/cli/review_facade.go:2303-2311 | internal/cli/review_reclaim.go:24-32 | internal/cli/review_reopen_results.go:43-51 \u2014 there are 10 copies across 4 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 10 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/cli/review.go:701\u0060 calls \u0060Var\u0060 and \u0060internal/cli/review.go:181\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d0e992b96175a21141bff601be15115025f3954adcd71f87efbad27b31d7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/shellinstaller/user_install_windows.go:545-550 | internal/shellinstaller/user_install_windows.go:928-936 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/shellinstaller/user_install_windows.go:545\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"389cede776446ebb8be8aeafc979e148047b12588244326ed7861d3a4f2407d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/reviewtransaction/snapshot.go:175-183 | internal/reviewtransaction/snapshot.go:230-238 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/snapshot.go:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eedd8367819af0ee7ad5162c07a3f09ad75b55b4cf7b0223c4d5869733021c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/reviewtransaction/snapshot.go:175-183 | internal/reviewtransaction/snapshot.go:190-198 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/snapshot.go:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b71f4605faaec27e2cd807ceb08656a549d273f3c6adc8758ebf06c81d523c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/shellinstaller/user_agent_state.go:93-100 | internal/shellinstaller/user_install_scope_unix.go:73-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_agent_state.go:93\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":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acaf85be1606a8ba3c6b010d1080d82f79977f2f14740ce1ccd87e0b9380a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/cli/run.go:393-400 | internal/cli/sync.go:2214-2221 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/run.go:393\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":"internal/cli/run.go"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb9f8aa72a42f53c11685a1f0b47ede470534bef9b5fdd53aa74da6569a47f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/components/legacyassets/claude_hook.go:43-50 | internal/components/legacyassets/opencode_settings.go:312-319 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/legacyassets/claude_hook.go:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/claude_hook.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deeeaf6cdf7e65097d6dfaf8ba88e81ba31addcb861aca3296c2c4b2ca25791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/cli/run.go:343-350 | internal/cli/sync.go:2196-2203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"014931545ca379e8df0adfcbef4c171dccb6e422efcb2d25eda58767314a74a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/reviewtransaction/compact.go:1106-1112 | internal/reviewtransaction/compact_recovered_evidence.go:170-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact.go:1106\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d387dc48a838bca62e5d568ea62292fd8adbf398644d3ad914af1a19567433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/compact_abandon.go:350-356 | internal/reviewtransaction/legacy_alias_repair.go:264-270 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact_abandon.go:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb976de8f8f8363974d2615f58008d52e9e511b807aefe7b4e58b968a7b1a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/tui/screens/shell_manage.go:18-24 | internal/tui/screens/shell_manage.go:84-90 | internal/tui/screens/shell_update.go:11-17 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/shell_manage.go:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/tui/screens/shell_update.go:19\u0060 calls \u0060Render\u0060 and \u0060internal/tui/screens/shell_manage.go:26\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_manage.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6b41f6e965f728c61ae6caf870bfdecad9910c7f88c1d70ac07ee0ae4fd54c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/uninstall.go:161-167 | internal/cli/uninstall_opencode_plugin.go:153-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/uninstall.go:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/uninstall.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"59510e264c75e78d49d1504610b0d698147431030f6502454606fbc0e8fc3e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/review_artifact.go:257-263 | internal/cli/review_capture_unachievable.go:112-118 \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":"internal/cli/review_artifact.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5177406ec242211f68259c0671200115991899335221643908a3de34a99e4186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/reviewtransaction/compact_abandon.go:284-290 | internal/reviewtransaction/legacy_alias_repair.go:146-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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a95c9c842cf4faf1b8d532bfea088529f49d7ef1e8d95092a7b78cf957cdd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/opencode/background_remove_unix.go:136-142 | internal/opencode/background_remove_unix.go:153-159 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/opencode/background_remove_unix.go:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_remove_unix.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe35d573cbae8394b08d0eb2b4182bbd8a6ec025128a25e8562645a0c9f4fe70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/shellinstaller/user_artifacts_windows.go:76-82 | internal/shellinstaller/user_main_source_unix.go:138-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_artifacts_windows.go:76\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2934d3e29021918049cb73564204092c4201704ed231eba17e91d12523665db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/opencode/background_remove_unix.go:116-122 | internal/opencode/background_remove_unix.go:136-142 | internal/opencode/background_remove_unix.go:153-159 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/opencode/background_remove_unix.go:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background_remove_unix.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9905c0337dcff5cd33937534cb75ab08788bb86c1e6103faec364764c77d6fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/components/agentguidance/pi_cleanup.go:42-47 | internal/components/antigravityrules/publish.go:184-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/agentguidance/pi_cleanup.go:42\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"internal/components/agentguidance/pi_cleanup.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5a81a5f7fd068345c081935d0aa11c07feebe268d69212fdc0926e48a5a40d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/shellinstaller/user_codegraph_executable_unix.go:71-76 | internal/shellinstaller/user_install_flow_unix.go:762-767 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_codegraph_executable_unix.go:71\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_codegraph_executable_unix.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d1d249c84594dcf147485a7fea434a257674c8d5643da52575ad6e9a7c1826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): internal/tui/screens/antigravity_model_picker.go:153-158 | internal/tui/screens/claude_model_picker.go:499-504 | internal/tui/screens/claude_model_picker.go:524-529 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tui/screens/antigravity_model_picker.go:153\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":"internal/tui/screens/antigravity_model_picker.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f325137ea699b224d517b343c8fc5c12f5d49b9164102cdbc58307b351892d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/sync.go:2645-2650 | internal/cli/sync.go:2665-2670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/cli/sync.go:2662\u0060 calls \u0060renderSyncSkippedAgents\u0060 and \u0060internal/cli/sync.go:2642\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d362de4ec93370982a53b94b01776b7e1ef748caf9a995cd14ec25915569b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/providercontractbundle/bundle.go:182-187 | internal/providercontractbundle/bundle.go:224-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/providercontractbundle/bundle.go:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"945b52032ed37d674ab3a87a9b3f0a28bcc3e771b4551ef0bd6b85586a8c10f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/reviewtransaction/compact.go:1143-1147 | internal/reviewtransaction/compact_recovered_evidence.go:189-194 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/compact.go:1143\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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef03ab0f5cb5d50406326ccb459f0b0e57f37d5e0410ceff6d72dc30dd4c0dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/components/mcp/inject.go:91-96 | internal/components/mcp/inject.go:127-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/mcp/inject.go:91\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":"internal/components/mcp/inject.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"45310ed7cbbf9d40fa4cbb5dfc1fe8b6e932454adffd164fd8f5ab32f51b0aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): internal/shellinstaller/user_agent_state.go:82-87 | internal/shellinstaller/user_install_scope_unix.go:62-67 | internal/shellinstaller/user_install_scope_windows.go:42-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_agent_state.go:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_state.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"746314510211f272b43376e2cce9723eb20d170e9601fa9c35087b108c8eb36b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/cli/review.go:192-197 | internal/cli/review.go:475-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review.go:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"558953e132d570e2f230cd72e83e271c359aca3d66a534c1d0831a50ee470726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/components/engram/download.go:525-530 | internal/components/engram/download.go:554-559 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/components/engram/download.go:525\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f58f6228d9f4a8ebfaa7c54196e842d1a7cb6d6a59b7d264191b4ef56af7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/tui/screens/backups.go:117-122 | internal/tui/screens/backups.go:180-185 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/tui/screens/backups.go:117\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":"internal/tui/screens/backups.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d685d7e87a9a8155df7a4fa8bef564f2726c4904226c29ccae93bee811b27e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/reviewtransaction/authority_repair.go:857-862 | internal/reviewtransaction/authority_repair.go:1018-1023 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/authority_repair.go:857\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7683b59f55c89edc1a7cf06038b8c2b92e5b225baf226cef97bda868b84651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/reviewtransaction/artifact_subject.go:157-162 | internal/reviewtransaction/artifact_subject.go:180-185 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/artifact_subject.go:157\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a564f790d50610d67f95d072b6aa45415d9a3630b531a6daeffd6be4fee138f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/components/mcp/inject.go:100-105 | internal/components/mcp/inject.go:136-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/components/mcp/inject.go:100\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f88bec0c1ff9aa70c2d0df1356a4f59a5e7d8a3b00125ff0c40c301c1bc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/components/legacyassets/sdd_agents.go:273-278 | internal/components/legacyassets/sdd_assets.go:220-225 \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":"internal/components/legacyassets/sdd_agents.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4c426ea61d1ab533eaa2bca96804fb74865328c773ee43ab1bd747f411dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/reviewtransaction/store.go:258-262 | internal/reviewtransaction/store.go:276-280 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/store.go:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/store.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ecf64dbbc118587805b29dff07568863d455c39479a5381cb57900d1359340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/cli/review_status_contract.go:1554-1558 | internal/cli/review_status_contract.go:1619-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":"internal/cli/review_status_contract.go"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ba7443b4b024b8aa6c5cefca0afb1474d3f47ef5e15c106d3c6ef9719de3cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/reviewtransaction/compact_store.go:1778-1782 | internal/reviewtransaction/compact_store.go:1795-1799 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/reviewtransaction/compact_store.go:1778\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bbc6f9bf1791a80fdd6ae5f7947979909c02951fbd12fb486419fd77c8c857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): internal/agents/codex/adapter.go:76-80 | internal/agents/gemini/adapter.go:76-80 | internal/agents/qwen/adapter.go:80-84 \u2014 \u0060internal/agents/codex/adapter.go\u0060 and \u0060internal/agents/gemini/adapter.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/codex/adapter.go:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/codex/adapter.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f1c199a08052d8f5f7c2911b976bb17632b5fd6f0529b16a1e7066bb039598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/tui/screens/uninstall.go:345-349 | internal/tui/screens/uninstall.go:360-364 \u2014 both copies are in the same file, so extract the block 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 \u0060internal/tui/screens/uninstall.go:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/uninstall.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bcbccf21d0aae1b762870cdbccfbfabed47d7b9ba3a1115e2b918b361e81ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/cli/review_facade.go:2312-2316 | internal/cli/review_reclaim.go:33-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cli/review_facade.go:2312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d434a5be7d9fea21bea427472ae8fe2ec83aa78945045cd281a435822cb84d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/reviewtransaction/verification_contract.go:451-455 | internal/reviewtransaction/verification_contract.go:546-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/reviewtransaction/verification_contract.go:451\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_contract.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cd4420991743f0f942e53cbe0afcc5e0b9b140e70a9903276481abbe38606b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/cli/compatibility_transaction_windows.go:575-581 | internal/cli/compatibility_writer_unix.go:161-167 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc5e1eeac22aa094d371aab483345031d7a450e582bd11f125d83e29e25f887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/shellinstaller/user_install_linux.go:272-276 | internal/shellinstaller/user_root_service_linux.go:103-107 \u2014 before extracting anything, compare \u0060internal/shellinstaller/user_install_linux.go\u0060 and \u0060internal/shellinstaller/user_root_service_linux.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/shellinstaller/user_install_linux.go:272\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac01362a91e9bb3700b0bcc550d2cef47b6e94229f8019a2741bdc06c4f6db5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): bench/axis_compatibility.go:161-197 | bench/journeys.go:227-264 | bench/journeys_correction_unavailable.go:52-170 | bench/journeys_finding_id_prefix.go:73-144 | bench/journeys_intended_untracked.go:409-489 | bench/journeys_issue3587.go:31-82 \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":"bench/axis_compatibility.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8413985b3523ffcb99762a603743ca4f0f6e7a728322b79c0fe7035a575285be"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): bench/journeys.go:390-421 | bench/journeys_frozen_lineage_resume.go:141-159 | bench/journeys_issue_3065.go:159-200 | bench/journeys_wave1.go:449-498 \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":"bench/journeys.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"343097c07674d0c26d5d853a99b45c5fa86c9f1ebfa2a7a6693e4c956cf18933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): bench/journeys_issue_3557.go:59-107 | bench/journeys_issue_3561.go:67-121 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3557.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce842d9687a032f53c9240a1b519f44cd53ab60426f0ad381f8372cefcda06df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): scripts/crosslane/battery.go:334-370 | scripts/crosslane/host.go:259-289 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"scripts/crosslane/battery.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2340fa814b1bb0b30e05047488cc10d4b67194d7c724b7799e4393bf2db1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): bench/journeys_issue_3557.go:15-48 | bench/journeys_issue_3561.go:12-56 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"bench/journeys_issue_3557.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c5416fc640b7763f6ee381f39ec45b512c16e2b439f5cf39cf42b6efe9cc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): bench/journeys_issue3772.go:32-55 | bench/journeys_issue4377.go:66-89 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3772.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04bf1165c711ae749cd650b186b200cedfe37280388fa1b1c8dcdcb5a9ad28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bench/journeys_reviewed_superset.go:216-233 | bench/journeys_reviewed_superset.go:277-293 \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":"bench/journeys_reviewed_superset.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f86d7f91bd055884b23c6b692de6decde970040afd174ce9558de9d7bc4c30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): bench/journeys_wave1.go:919-939 | bench/journeys_wave1.go:1017-1039 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_wave1.go"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"032efd586be3dd0859f188d653c3c637088087f998cea4b224a1885c637c81ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): bench/axis_damaged_store_closure.go:347-376 | bench/axis_damaged_store_closure.go:383-409 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"bench/axis_damaged_store_closure.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3ae7bcabcafac9364697fd0e45f3c45ad2badad27e352f01b9c4808ea3854b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): bench/journeys_local_gate_advance.go:78-100 | bench/journeys_reviewed_superset.go:116-138 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_local_gate_advance.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39497ed1f51e668d287341395254e9505345921524aea24783136d6570f91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): bench/axis_damaged_store.go:580-605 | bench/axis_damaged_store.go:616-643 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1941a3f9d0d23a4eba887052c7595b13eb5f05f1289c70ae8f8b5b24b8fe71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): bench/axis_damaged_store.go:681-708 | bench/axis_damaged_store_closure.go:254-278 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0baf12697d1f534c8b989f0edac86b08a17e827b7200ce2b2d3465d5afd2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): bench/journeys_edge.go:41-58 | bench/runner.go:151-168 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"bench/journeys_edge.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"433e73c03d682b2351dcd14480471fae8fd29c582fa694ff910e7fb00491abed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): bench/journeys_intended_untracked.go:309-324 | bench/journeys_staged_delivery.go:92-107 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_intended_untracked.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e30c63e843967143f90b3b19cc03768ec90f4b434ebf218cb0f624ec4418152"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): bench/journeys_issue_3065.go:131-144 | bench/journeys_wave1.go:357-370 | bench/journeys_wave1.go:726-739 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"275b301cb48a51b30b896a6fdf168762df349b4375ec4a67d59decb3e214f572"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): bench/journeys_issue_3043.go:11-31 | bench/journeys_provider_capture.go:39-68 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3043.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b76576ed9918611c570108508dc34a6171fc0fb0b3e96b8178ddacd37b561fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): bench/axis_damaged_store.go:1441-1456 | bench/axis_damaged_store.go:1495-1510 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7357769bbbb3e953076cae0e84c07098468525fd7adae715ac954355e0abec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): bench/journeys_capture_evidence_v5.go:96-109 | bench/journeys_wave1.go:340-355 | bench/journeys_wave1.go:1091-1103 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_capture_evidence_v5.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"19af664ca81d97e70e6998dc98fe675c857d3b2ae7dbc9f48eca10bff289946b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): bench/journeys_local_gate_advance.go:209-222 | bench/journeys_reviewed_superset.go:297-311 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_local_gate_advance.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3af9657e38bf9940d8a1b222a81a63f25d7759fbac24b791cf163cbad4ce271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): bench/journeys_issue_3065.go:58-71 | bench/journeys_wave1.go:1250-1264 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"264b952f3e2ce0fed1beee14ab2a6b62f8d214be95667ac3231093b33a2516cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): bench/journeys_edge.go:596-612 | bench/journeys_edge.go:633-647 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"bench/journeys_edge.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"603115667b310fc35896b5411450b0d4155bfa11917970157c38d6ebbbd7d6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): bench/journeys_issue3766.go:81-93 | bench/journeys_issue3776.go:38-51 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3766.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b84c252189989faba6c04ab03323ed3a6c9e0935c1b84c248e85363c31a2101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): bench/axis_damaged_store.go:760-773 | bench/axis_damaged_store.go:777-793 | bench/axis_damaged_store.go:1326-1345 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1a0caf836c0ac0d40476aaf1e300c2f8aeb87f55e227c496a3ead7381a00ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): bench/journeys_issue2879.go:84-91 | bench/journeys_issue2995.go:241-251 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"bench/journeys_issue2879.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f660695101eb1455166a23f272aa0ca991d1a135a6f158b295999e2d1fcc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): bench/journeys.go:423-432 | bench/journeys_capture_evidence_v5.go:111-120 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90a60c94d0f7599a0f81a29071f229c569ccb4988d1f293e4a1d97355d44a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bench/journeys_repository_context.go:201-209 | bench/journeys_wave1.go:212-220 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_repository_context.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46c2497ac42455c500f2ee82bebbe2c3b31480be4988d2c03e12eed7b024210"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): scripts/crosslane/battery.go:462-477 | scripts/crosslane/host.go:129-142 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/battery.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99413c2dddc069141adac771cbfbc8d1c76e48240f40015cbe6699732ccfac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bench/journeys_wave1.go:716-724 | bench/journeys_wave1.go:741-749 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_wave1.go"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9bd758990e5ad152103a10ed54735f2817d4d0c32e1821e07a35f949c81394"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): bench/axis_damaged_store.go:998-1009 | bench/axis_damaged_store.go:1011-1027 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4095555175f564bc2cddd5cd4f123fb131962de97f40421b1bfb869dc16a2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): bench/runner.go:858-863 | bench/runner.go:865-870 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"bench/runner.go"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb24aeba5d7007327f35920c546b6da38916fcec2b297e0c5975efe6edebfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bench/journeys.go:655-663 | bench/journeys_edge.go:88-99 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys.go"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a996f1e615111fa8f031ac6789d598e24ebe0c8f696bf838dc07bb69e46f6575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/crosslane/battery.go:271-277 | scripts/crosslane/host.go:119-125 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/battery.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd00edd6736e47b8a8d83defd30d8e55fef6c30425bcc58bf7a308630a9ae96b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/crosslane/battery.go:427-437 | scripts/crosslane/battery.go:439-449 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/battery.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"365dd0bc3771c627daf5d8a1dfd19cce3ad139a6d222bae835266728daa198d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/crosslane/host.go:98-106 | scripts/crosslane/battery.go:131-139 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/host.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b646baeb43ff7a483322de50be55d643900d6b0884def2a789be344f42897946"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/crosslane/battery.go:143-150 | scripts/crosslane/host.go:109-115 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/battery.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b18313e50dd64b0b830b3f9386f6ce30b240fd061610847bd33411db7a61654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): bench/runner.go:190-195 | scripts/crosslane/battery.go:405-411 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"bench/runner.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"04251501dd5d3f75be98fe27e5c7cdc7f3b2efbf439de5f4b80740360a958ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): bench/axis_damaged_store.go:305-311 | bench/axis_damaged_store_closure.go:331-337 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"75996a93744a2145b1b092ad92c017a4a18b1364af664507efce30b547c6f4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): bench/axis_damaged_store_closure.go:348-366 | bench/axis_damaged_store_closure.go:384-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store_closure.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"881d4d2889637976eb8e9d907be5a81cb80bb94786785a5f1d6d7d54b9caea40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): bench/journeys_correction_unavailable.go:75-94 | bench/journeys_intended_untracked.go:444-462 \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":"bench/journeys_correction_unavailable.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb61898063517c3e61aa757c0d44c534a2523b82f02e53f81a8a397535974a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): bench/journeys_wave3.go:272-290 | bench/journeys_wave3.go:410-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_wave3.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ce059fbb82d0087ae3d676e36f5f7e1cef900cb6dfa4f3a546012699919a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): bench/runner.go:254-271 | bench/runner.go:561-578 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/runner.go:254\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/runner.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c868e8013194f6a6ef5fc758d9f95e0067c022c305f7a30ed1ad9ae0233377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): bench/axis_damaged_store.go:779-793 | bench/axis_damaged_store.go:1331-1345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/axis_damaged_store.go:779\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2edb532f8eccd5ed1b33c71c351fb183fd8b11d7f038516edb18a470345a24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): bench/axis_damaged_store.go:931-942 | bench/axis_damaged_store.go:974-985 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/axis_damaged_store.go:931\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd38e9f49bae4e8d6c5793710a047e8e42a72549d28b7c9e624715b21acf2e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): bench/journeys_edge.go:43-53 | bench/runner.go:549-559 \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":"bench/journeys_edge.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5883cc5d4bce3113bfbea28569b702956483980daf115acce2081f8123c0126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): bench/journeys_issue_3065.go:132-142 | bench/journeys_wave1.go:358-368 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f1f0009cf2cbb6939768b072038541e988c9d67ba713b5cb343e6f6dd008be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/crosslane/battery.go:113-123 | scripts/crosslane/host.go:80-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/crosslane/battery.go:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/battery.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbaae4656c47a7f0f16c15d70bd52edc0b3eddd9caca1c933de2cd9ec61baf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bench/journeys_issue_3557.go:27-36 | bench/journeys_issue_3561.go:34-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_issue_3557.go:27\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3557.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbeaca05eee04a64c7ddc6f9ab8d5d16e39027cfc435113a6733648a06a34cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bench/journeys_frozen_lineage_resume.go:212-220 | bench/journeys_frozen_lineage_resume.go:294-302 \u2014 both copies are in the same file, so extract the block 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":"bench/journeys_frozen_lineage_resume.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec80ee0a9f52744a314a296e1c4cf2296958bfc6bbd3f11903bb7f94f1ceceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bench/journeys_issue_3065.go:147-155 | bench/journeys_wave1.go:378-386 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad6da63dd495febaa0232b92d4a98ae1358d64209ef0bd470dcce032b81f643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bench/journeys_reviewed_superset.go:244-251 | bench/runner.go:175-182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_reviewed_superset.go:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_reviewed_superset.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"53105d79163a439a06aac6b75b6cc4f3c200430032770da41719dd2acba91037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): bench/axis_compatibility.go:177-183 | bench/journeys_finding_id_prefix.go:107-113 | bench/journeys_issue3587.go:49-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/axis_compatibility.go:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_compatibility.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c6c4afd90752bd919112baa2ffbf4584ea3080d4d0a0af5c2395138fb842d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): bench/journeys_capture_evidence_v5.go:98-104 | bench/journeys_wave1.go:320-326 \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":"bench/journeys_capture_evidence_v5.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a90518f03f01a7daa6c2c6127000adb7a66c73a9d07d186deb1eb642f93fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bench/journeys_issue_3557.go:100-107 | bench/journeys_issue_3561.go:114-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_issue_3557.go:100\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3557.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1455718a076f3bb60310d3cf8d16b0e798f65f424851b5872e4f6b981e5d04c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bench/journeys.go:391-396 | bench/journeys_finding_id_prefix.go:75-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys.go:391\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dbf4b1b5d23df3678d2267fa74c0f0e5ea7a166498c20921a43c33dbe8aeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bench/journeys_atomic_review.go:196-201 | bench/journeys_wave3.go:349-354 \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":"bench/journeys_atomic_review.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633eddf4a1215aaac6176762731beb1f609e8781b4149d84339b7ac68a17cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bench/journeys_frozen_lineage_resume.go:181-186 | bench/journeys_frozen_lineage_resume.go:256-261 \u2014 both copies are in the same file, so extract the block 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":"bench/journeys_frozen_lineage_resume.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d65446721937d9a236d5c508b0b8e69ad865e3daa9c96aab5a73fcf618f588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): bench/axis_compatibility.go:182-189 | bench/journeys.go:248-255 | bench/journeys_intended_untracked.go:469-473 | bench/journeys_issue3587.go:54-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/axis_compatibility.go:182\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":"bench/axis_compatibility.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f738d0d6eb26df6b32e9c89608e5a5cfa11d027c5293a14c6550db9b8d643968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_correction_unavailable.go:96-100 | bench/journeys_intended_untracked.go:464-469 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_correction_unavailable.go:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_correction_unavailable.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ada826eb23ef267487d9011d6af2457a3d34e744a7849b7e27b1ffd638d4be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_issue3766.go:53-57 | bench/journeys_issue3766.go:62-66 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/journeys_issue3766.go:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3766.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"207dde4ec4e98d57c36f3dfa0d05b3b5ddc4b74a9ba9b3bedd5ad6ee5f5f7add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_issue_3557.go:88-92 | bench/journeys_issue_3561.go:102-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3557.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a7ac60442fbbc5c966ba75f5b28311d56c8f440491fefd77150445ff3cb661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_reviewed_superset.go:224-228 | bench/journeys_reviewed_superset.go:285-289 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/journeys_reviewed_superset.go:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_reviewed_superset.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba134a4aff13997fe02ca896eb9d96f95bd786965512c24153f8a600d495d515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bench/axis_damaged_store.go:507-514 | bench/journeys.go:665-672 \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":"bench/axis_damaged_store.go"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7be734eba926cafdea0ed589efec7626c6a6f7d7b1e13d588154be3dc453080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): bench/journeys_issue_3065.go:166-181 | bench/journeys_wave1.go:459-476 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_wave1.go:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"168722587b9ec21192237e255ba3af87dc1203ae4c17891a6bc955c79b8fdcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): bench/journeys_frozen_lineage_resume.go:162-173 | bench/journeys_lens_context_budget.go:38-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. 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":"bench/journeys_frozen_lineage_resume.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e48b96261629bcfed6144cd2b236e145a1d6c9dde42014b31df6994bd271188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): bench/axis_damaged_store.go:581-592 | bench/axis_damaged_store.go:617-628 \u2014 both copies are in the same file, so extract the block 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":"bench/axis_damaged_store.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aad1e86ae96ef45c3d5bf8b97c52dfa567ff3086951bd9f81a08a1b9a0b2c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bench/journeys_edge.go:313-323 | bench/journeys_edge.go:352-360 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/journeys_edge.go:313\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_edge.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2283d4161f9d9b0552b05ce0588355ecf1cd865826c9a8295b96928574d5b0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bench/report.go:271-281 | bench/report.go:328-337 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/report.go:271\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":"bench/report.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d64d5222f11a0bbe81e816e9100deb2de7e9818b9435d83eacb63192230fe30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bench/journeys_local_gate_advance.go:80-89 | bench/journeys_reviewed_superset.go:118-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_local_gate_advance.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d913360a1fce7c706ace17929603aab3c02e7600f73f90fe22ba9ec6e2b988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): bench/journeys.go:402-410 | bench/journeys_frozen_lineage_resume.go:145-151 | bench/journeys_issue_3065.go:176-181 | bench/journeys_wave1.go:470-477 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys.go:402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbe2aa3d3569ade6b49190924f70060f968bf738bae4e49c36a707287ba752a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bench/journeys_lens_context_budget.go:32-40 | bench/journeys_provider_capture.go:99-107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_lens_context_budget.go:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_lens_context_budget.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c372466a62ed40e3a5c69a0a7ac9fd65de682d6cd74f07e45413bf5066043e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): bench/journeys_lens_context_budget.go:31-39 | bench/journeys_provider_capture.go:98-106 | bench/journeys_repository_context.go:114-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_lens_context_budget.go:31\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_lens_context_budget.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"821296a50fb64af01e38cdf18a31752e1a7d7e10921a3a7e93c02bb14907d285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): bench/journeys_edge.go:179-186 | bench/journeys_edge.go:385-392 | bench/journeys_edge.go:415-422 | bench/journeys_edge.go:541-548 | bench/journeys_edge.go:553-560 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_edge.go:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060bench/journeys_edge.go:539\u0060 calls \u0060Join\u0060 and \u0060bench/journeys_edge.go:551\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_edge.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4731b7b04bca64dee8a759b585fe86b112d165934fa25e21cceda4fa468d3543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bench/journeys_local_gate_advance.go:151-158 | bench/journeys_reviewed_superset.go:259-266 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_local_gate_advance.go:151\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_local_gate_advance.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfa104d22e4c31ad098303bb79dbd762c326369bbe05e9daeb7f41c9a0a2069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): bench/journeys_issue_3065.go:132-139 | bench/journeys_wave1.go:358-365 | bench/journeys_wave1.go:727-734 \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. 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":"bench/journeys_issue_3065.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1062ec5ba8cbffb7de8e6bc98e5088725940292c539b65f6c62e88b506f091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): bench/journeys_intended_untracked.go:312-318 | bench/journeys_staged_delivery.go: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. 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":"bench/journeys_intended_untracked.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe0453e774057f050f201e3da6f93c3115fe86c39b8d3a0515adcf8ee3450c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): bench/report.go:299-305 | bench/report.go:342-348 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/report.go:299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/report.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe8ebfefeb0989addd50ae02be43ea18d4b91e2bc688f0acd09d524a9657242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): bench/journeys_intended_untracked.go:263-269 | bench/journeys_local_gate_advance.go:86-92 | bench/journeys_reviewed_superset.go:124-130 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_intended_untracked.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"722e5a79e6a29d1d918a5bba390d4196ccabbbe0c28ae0b4a15bbc63c892412e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bench/journeys_wave1.go:344-349 | bench/journeys_wave1.go:808-813 \u2014 both copies are in the same file, so extract the block 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":"bench/journeys_wave1.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd25a124d0f5fe1372b59796514e3a2be32e19501eeed43554c2009e83975207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bench/journeys_issue2906.go:57-62 | bench/journeys_issue2906.go:80-85 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/journeys_issue2906.go:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue2906.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"81be5cd6d030a79e182fcfcc71a26c91e2ba04227c81ed6fe96000372a2498b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bench/journeys_wave1.go:717-722 | bench/journeys_wave1.go:742-747 \u2014 both copies are in the same file, so extract the block 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":"bench/journeys_wave1.go"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d172cd0eb4bfc17e26e15b68a13fd55d27f72961dd5a6c5abf21e7c0ab849af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): bench/journeys_issue_3557.go:87-92 | bench/journeys_issue_3561.go:95-100 | bench/journeys_issue_3561.go:101-106 \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. 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":"bench/journeys_issue_3557.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee16c91c411756447c4fae6e7938b1777cfb7972bbf14d6d4b4431ec931f326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_reviewed_superset.go:217-221 | bench/journeys_reviewed_superset.go:278-282 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/journeys_reviewed_superset.go:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_reviewed_superset.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6edbde7f83ae31844b260d6f31f29ad3fda922896f0ec04bcade06407b7152e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_staged_delivery.go:14-18 | bench/journeys_staged_delivery.go:27-31 \u2014 both copies are in the same file, so extract the block 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 \u0060bench/journeys_staged_delivery.go:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_staged_delivery.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77dae5547e4cf0eefad7d362e775a1f9a6fafc6ae5979af46095990ebc9fac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_issue3772.go:41-45 | bench/journeys_issue3813.go:66-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_issue3772.go:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3772.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"064e62c0f4d4a662626531e115c26d3e59fea5af86078a0bbb2d8ef2a595f503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_issue4395.go:38-42 | bench/journeys_issue4395.go:56-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_issue4395.go:38\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue4395.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"34926624999d89e1ecccb9a15ed409fccc45901c98d0c073212de8906c9d505f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_issue_3065.go:76-80 | bench/journeys_wave1.go:401-405 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ca74018103e44d5f1e9fab68721c5967eac0c44a7610ecbb04a3407fa21617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_intended_untracked.go:152-156 | bench/journeys_wave1.go:553-557 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_intended_untracked.go:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_intended_untracked.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afd08228444fbeb0ea85dd657f1ac32617e24e3ef49f64e8be027bab50715d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys.go:1176-1180 | bench/journeys_review_recovery.go:56-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys.go"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6912d3c71338b423066b2e1773e9ed596631a7c2e7c227180182246bb050b8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/journeys_captured_provider_validator.go:189-193 | bench/journeys_issue_3065.go:229-233 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bench/journeys_captured_provider_validator.go:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_captured_provider_validator.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8f3b533f100cd4637c25c899ab246bcd856677934712de98553eebf700fdb6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: runtimeState (LCOM4 4): runtimeState\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":"internal/cli/run.go"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47bd7aee47bba51d016a241ecc998747d5841bcb50822868702025e3719265d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: cmd/gentle-telemetry/main.go: 11.3% line coverage (23/203)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/gentle-telemetry/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"746e9d81d003e681ab649cd38affeaf0f6b52fff630f8e2813fcae03e7a6373d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/agentbuilder/engine.go: 44.8% line coverage (26/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentbuilder/engine.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c800ae8e3ca013bfb5d3d4abb2b83ffd68682631e6406ef7479b3c98d6fe2a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/agents/kiro/errors.go: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/kiro/errors.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"155b7c031103272bcec48d974e1c3ee4500bfda203afcd2515cd8e77596d855b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/app/bench_model_picker.go: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/bench_model_picker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0141389eca24c0c1c90a0540de0a0e6ca935d9b4b4568824dd091c0324f67ca2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/cli/shell_install.go: 46.4% line coverage (128/276)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f3b61cc6e855c6e63d986a5b1b6447061b06b13bed948d5dab9915970bc193"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/cli/shell_install_platform_other.go: 32.3% line coverage (10/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install_platform_other.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf82aa8f195cb71754c5653b49f35e3da755cb4cf1035da159d14a01b357f12"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/providercontractbundlecmd/main.go: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundlecmd/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c01073af2338d04d05a67d2d5f8d98153dcc0361903940c6b05d4cf18691a5e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/releasepolicy/policy.go: 6.7% line coverage (28/415)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/releasepolicy/policy.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"129def7086bde962a8b37bc88e4cb90e27450e0eed35b300c8755e269a32ba7b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/releasepolicycmd/main.go: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/releasepolicycmd/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4829a0601ff0790f134b097363618ac859f0cdd712d46ea245cc114414675e6f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/reviewtransaction/bundle.go: 34.0% line coverage (91/268)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/bundle.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed793230d58ca45a681c2d6111a7806869726766d6a942e7211fbe8352dbcca7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/reviewtransaction/gate.go: 13.1% line coverage (41/312)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/gate.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014c20540c2c87de36fcfd6126c904754443f0f74aefa5be266646a28f91635"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/reviewtransaction/receipt.go: 44.6% line coverage (82/184)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/receipt.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f29db85c7628350ee98307c5fb11b09796abc6da7e10c4fd3f4106a0ebf4f5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/reviewtransaction/verification_convergence.go: 49.1% line coverage (28/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/verification_convergence.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9064f8746245300ce678db1de200d693e8edae46ef5b364c9be59fa2775e20d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_install_flow_unix.go: 39.8% line coverage (434/1091)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd80efc507e0ac3f067e4cf9329fc9486ba1259fb48e844a1fe1e30d4147610a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_install_linux.go: 41.5% line coverage (170/410)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f9d60ebfa613485bc9779b14703324de437e35ae67e2c544b9cfb2b80a4828"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_main_bindings_unix.go: 30.0% line coverage (18/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_bindings_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d02f18148c7a8087421009bca6bd9c82eb3f3c69548d8714afe2df49b7f115"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_main_source_cache_unix.go: 39.3% line coverage (42/107)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_source_cache_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"137b6fbeb8bee19514a2ac31e260baad257ee49d6a375b8b9a457e8a0d0c4dcf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_bootstrap_unix.go: 14.0% line coverage (7/50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_bootstrap_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c40d4a322c5dde38acd41db88f3a9cfdff4f6bf6e5ae23ddc2c02bcb33c1ae"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_child_linux.go: 40.0% line coverage (38/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_child_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c67a8e949e85179263a5b106ab27a3220b54bebcba46ce2c3faf910bbb84f0c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_control_linux.go: 21.4% line coverage (6/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_control_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c79c8d289320ba345122feca7788eba76ec59a77804c80abec23fdcfa8626a0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_coordinate_linux.go: 21.8% line coverage (29/133)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_coordinate_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d2a4ff967f962024b24add9c88770ce741ca06a274b8ac688d04c202872c1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_install_linux.go: 6.8% line coverage (4/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_install_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b263b4cce5e6f57ec5b425b0ee5cc048f3a524ef17a3e47a7960b846276542d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_operation_linux.go: 45.3% line coverage (24/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_operation_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6baed90ad467005bad0af23ffb3147bc095796bb5891aa036fb2edfb713bf3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_owner_linux.go: 6.7% line coverage (3/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_owner_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"002e35d4ad3ce6a3a5bcccce7a32dfefa475b521a8af607d42b9546b4e484864"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_runtime_unix.go: 39.1% line coverage (45/115)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_runtime_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d647480acebd8a56adabcc982af5e328994aecbda4b1d77f39bce3d822488c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_native_slice_linux.go: 20.4% line coverage (38/186)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_slice_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb094af7c1eff9fc6593d3e191adfc0ad9e137031b87e1762a6fbb7302cf395b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_pnpm_launch_linux.go: 0.0% line coverage (0/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_launch_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d42321b5ac3613f7981cb5b436ee21635357d062c280d9d82aa7d745c7747f2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_pnpm_manifest_linux.go: 0.0% line coverage (0/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_manifest_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a41003caaae15829d430d49ea96890f2e66cbdc1f5641d833f79dea10edbf71"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_pnpm_publish_linux.go: 11.3% line coverage (8/71)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_publish_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af63dd65688c501e885a7b86c1719f09de2bda147d899439873c8d2a336a5752"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_pnpm_readback_unix.go: 8.9% line coverage (14/158)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c160f550b63c32a1d50844544c06ff9fd8063ea4cd8463464f48902e1642d54"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_pnpm_stage_unix.go: 16.3% line coverage (33/203)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4840dc395d9d50cbbbf21c214bd91e9e516380f364f8d620035a569be117d01"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_root_service_linux.go: 3.5% line coverage (3/86)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_root_service_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4328a27c21ed90d433918e20e1c0e3e73d3dd32a5303537bf41ac9959c57c794"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/shellinstaller/user_runtime_primitives_unix.go: 42.9% line coverage (76/177)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_runtime_primitives_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6016d42dee1c624ec7eead7c1accdaa91e663be0e677c8ffc9b3b6d394305bce"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/storage/space_unix.go: 45.5% line coverage (5/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/space_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0dab2fd7afa98e8b92bbe9303eefcc5642af829f5d7666364011e6ff886560"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/model.go: 17.9% line coverage (536/2993). 1 more line(s) were executed in some of the 3 runs of the suite and not in others, so they are not counted as covered."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08190a787bd8b2110971614b41e4a3993f410b6fea2befcf062d54b98a8a32c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/opencode_presentation.go: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/opencode_presentation.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265f6a49fcf11ae88d3cbb1c2e991e5d45ca29ded2deb5b461739df0dc35fead"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/progress.go: 49.3% line coverage (34/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/progress.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307c5307c355ca8d83ecfab7458b8f674251b647e02d5993f0be0070707b0b0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/router.go: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/router.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a483a3ccc7a2935450bc96943c9b82dc6530be7971f284b553794c05fa434"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/agent_builder_installing.go: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/agent_builder_installing.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8761435988a96ee11ae86fbaf77225a3028d678af64e614805e5d30b3bf2229b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/agents.go: 17.1% line coverage (6/35)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/agents.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13771a22a76293504f1b4314263969653f7e0d7d7383239230c61bf95789586"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/detection.go: 0.0% line coverage (0/79)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/detection.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"867521234c3cbd1b496dfa9e195a3fcea7968429b8e0f88b5930a5c4a65ea48c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/review_mode.go: 0.0% line coverage (0/30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/review_mode.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e22cd32b45cf9c9847b6d7932bdede8440a9093add4a1d646fb230daf5dab4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/review_store_reset.go: 0.0% line coverage (0/156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/review_store_reset.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c165aefe52dee69cecf41eceb4e8a6c076927a5056e531d970235a1146cd60a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/shell_detected.go: 0.0% line coverage (0/86)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_detected.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c1eb23ad70e6ecdc79b172bc98f43378fbc4dee66818048d2b14c2c14710bf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/shell_manage.go: 0.0% line coverage (0/108)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_manage.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1affe9296e345111373fea7f7acd54caee58d8272e82f2dadf3dd06777b18bf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/shell_plan.go: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_plan.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9e2bcb61a3743db0e2e5a2ff3fec77b3fadae761c69ba6a1fbb92d4ff8244c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/shell_root_risk.go: 0.0% line coverage (0/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_root_risk.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cac0637eb0a21b2c6319589db0b22c24b1ee954965f9d85c8ca7aa7d8ef264"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/shell_update.go: 0.0% line coverage (0/48)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_update.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa3adaa3a2f020d6783f2d1c2a9f5aaefa4c5664632e48bae489f228e581173"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/screens/update_prompt.go: 0.0% line coverage (0/52)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/update_prompt.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7b4d8aa49f5b2ddb16a344bca687023c24af1355055e202ba26230f1e9fa93"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/shell_experience.go: 0.0% line coverage (0/351)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_experience.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc70057650d761e032d167c2ba3e282c710a528bbcc8cd5ddae304dc352415d4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/shell_install.go: 1.4% line coverage (8/592)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca329d6248e433080a29ac1a3b70d9fdd3f8ec6f2a6c571a0d270824def1e85"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/tui/shell_platform_other.go: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_platform_other.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba6c70f8962151289817a61046929dcd91206ea780fed3fe6a1892bcbcc0d07"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/update/upgrade/scoop_resolve_other.go: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/scoop_resolve_other.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f0eb376129d2d2a5890c695f6279cfcdb23ed9e01020da86d5cca6841a162"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/advisory.go: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/advisory.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"557ada0ab10d239d936786334a66df1c51b996b70eed7511de56e8e8fafe41b4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/battery.go: 23.7% line coverage (100/422)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/battery.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e408348c27b7fdaa24ea300c2dc11cc09cfa464424d2a0f29ad7ae417cd22e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/claude.go: 0.0% line coverage (0/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/claude.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"274744b05b12855459b39096285d10fe0e059a9693731c6e25645c43f80e0edb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/codex.go: 0.0% line coverage (0/61)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/codex.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f487cd959b7ec1cf7a73a0a0b6c54a732116108a83e68c052902c9d978d5f4b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/host.go: 9.1% line coverage (26/285)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/host.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f4791f8393851702f677a94eacca02f3a8c91d524fa7529e2bd877d7b162a4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/hostcodex.go: 0.0% line coverage (0/27)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/hostcodex.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"614ece13895b6b2bfe2ff237b2a6f8e95aa95dbc762f62faa92e92828970addb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/hostopencode.go: 0.0% line coverage (0/157)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/hostopencode.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d979e684fd4a77eb415ae5a42aacf8f434270acb3705857b98972c8739f9c9e4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/hostpi.go: 16.0% line coverage (43/268)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/hostpi.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4a0461b8eb9a2a8d5db4650e3c88ee71423bd2d0953c0be414d8dee2cf8a5d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/main.go: 0.0% line coverage (0/99)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8875bb73fa4554488d0578e4bf69978e6e1303b6d1d95b53ad4e3117631e31"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/opencode.go: 1.9% line coverage (7/375)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/opencode.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d06c08ce071a217aa79ddd61ac9df8758c4b906936618f9e7f06b47dd0380c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/crosslane/opencodeecho.go: 0.0% line coverage (0/123)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/opencodeecho.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb84136868dd55e5fbee14c4a48b8f7bee0063a2933c0fb5bd79a0c3de4916e4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/gen-sdd-agent-digests/assets.go: 0.0% line coverage (0/93)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-sdd-agent-digests/assets.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a484b18969b9420bd2219b7eb3e47e76e610d32535f784b14adc08ddc103501"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/gen-sdd-agent-digests/main.go: 0.0% line coverage (0/197)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-sdd-agent-digests/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d7cff25c58c35e71f73fe08dec3dcace30ba2c96879ace794b7329e7df9b0a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/gen-sdd-agent-digests/opencode.go: 0.0% line coverage (0/126)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-sdd-agent-digests/opencode.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1727520ea2ede5642c1d2ec201df4eabb30ce5443c193dd487e1e44825fc1870"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/gen-sdd-agent-digests/replay.go: 0.0% line coverage (0/237)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-sdd-agent-digests/replay.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"685ce3b3e4935f8a8bd9710765484cc00a6c8cc90434aca08379947ee00d47b7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/axis_compatibility.go: 49.0% line coverage (73/149)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_compatibility.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b74c91609b20726d5e4d0fcfe97a83973b8754c59a78380b66409c9f0a53cd7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/axis_compatibility_runtime_identity.go: 24.4% line coverage (10/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_compatibility_runtime_identity.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86e9f1d52e60f968a52cb7db9f7c791183dab8f7ae74fbe48ac7ce90170d1f5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/axis_damaged_store.go: 0.1% line coverage (1/928)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9608bee3735d2c705bbf2a37525453f525c85ae4ba37e5650f255670f12706a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/axis_damaged_store_closure.go: 0.0% line coverage (0/394)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_damaged_store_closure.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c183d45de968e30dab31c0f83d2b0d39515990c5e9ea8ed107028c69803dd87a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/axis_model_picker.go: 30.7% line coverage (23/75)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/axis_model_picker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8619e73d91e3e15d43f32e29927d57689d9e0d221c3da9e5fae6d72affe5a7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys.go: 36.1% line coverage (219/607)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44ae5244db5d3b69de9012f9169296cf70c31e2237c576902147be64363352d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_atomic_review.go: 8.2% line coverage (16/196)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_atomic_review.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffaa901c9ba5e1d4b6164af2c110b92085ae0c835a9bb3cc8a43fea8a6bf0ad"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_capture_evidence_v5.go: 5.6% line coverage (12/213)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_capture_evidence_v5.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"643abda738c40e89e510bc4e1793c4df4c0317a1414b0524bcce5b43c157e2f1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_capture_result_dry_run.go: 10.6% line coverage (12/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_capture_result_dry_run.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdb85ff8451472a6f3532cf41892f5950d8f0111a1bfcd367f0ce436904d88d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_captured_provider_validator.go: 5.0% line coverage (11/219)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_captured_provider_validator.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f37989ec56e2ab7f6fb254112620e27257b573ad2358f371090db1f24674074"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_correction_unavailable.go: 7.6% line coverage (11/144)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_correction_unavailable.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d39952c8b032be66e78630d4b1e18ec2e52081cba61b5df094c5fe0c3c9725"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_edge.go: 2.8% line coverage (16/565)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_edge.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"201204f7d10a19706f2e0789fc49e3dee7bc25666570713fa4724cf0069f1824"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_finding_id_prefix.go: 11.1% line coverage (13/117)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_finding_id_prefix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d735eec3f5d22e9c3adc52de3ddf99140f409b911b8f389979f378fa7930c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_frozen_lineage_resume.go: 3.9% line coverage (11/282)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_frozen_lineage_resume.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c900ee7c595c77db8eb823e94ae1abb008233148f7714407ff98e2f513c4576"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_intended_untracked.go: 11.3% line coverage (56/494)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_intended_untracked.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc159ad38163a381159b068618f97321f610b2c742bc7d029d16e416b1bfce"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue1800.go: 6.1% line coverage (11/181)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue1800.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1fa4f9bf32652507a6e176cd0e80c5d61e28ec62a8a88cde36e25043b9d38e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue2879.go: 11.3% line coverage (17/151)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue2879.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cb3fc5518efc4cbfe46b258c19c2d6b7198ee25bf0f9657dee5e98dc55118f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue2906.go: 17.5% line coverage (14/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue2906.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"743aade302f2c84f6c3a2e16d13aaff2c9a5cb0a450f9ec8e4cd388e2c550f3c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue2995.go: 10.6% line coverage (17/161)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue2995.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c543ea773ab9b17a9fea0b845e92541ba51ea3e268f1190adc9f619c96384b0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3321.go: 25.5% line coverage (12/47)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3321.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab5f08501a09c1ab9185ae294c58bcd940bb10fe0c9bb5e5794f93edeeae23d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3587.go: 22.6% line coverage (14/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3587.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5571d73ec9c62a3d3027808efef67e32c44c532cf3914887889a9b65cc9002ae"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3748.go: 6.6% line coverage (12/182)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3748.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40ddc8b75e098b38ce8aa85e99390f7d1bcedc0fab29d9d3da4b40bff0211cc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3766.go: 32.1% line coverage (17/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3766.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed28882ab8e741a5098db72eec227b7065809cd406231d805dedab0b505c505"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3772.go: 47.4% line coverage (18/38)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3772.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"365ace362bc844858d74aa9f42c389721b917c3436089ab5f86276580f4550c5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3776.go: 34.5% line coverage (10/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3776.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6078ad66f749f92d9e22cd524ca2d05cb187d22ffb245f8c67613b5e5a0315"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue3813.go: 28.6% line coverage (16/56)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3813.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cf58604b3c42b243df762d848c47897cef3154c4d56219d77f9a1a23999ff7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue4377.go: 12.9% line coverage (9/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue4377.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd4eced1d2a3bd0ecf8ad418c66db91af9f90dbb97238328253add7c422fd52"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue4395.go: 22.0% line coverage (13/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue4395.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d2b43b35647c329310dd171131d0c1df6b0b8aba3d0719299de211259ac885"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue4772.go: 11.7% line coverage (16/137)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue4772.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"742297d42b92b1a9b06510e6d1e69dc2d770db442af3c099c5db53c9b57822aa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_2031.go: 21.5% line coverage (20/93)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_2031.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7d93612babfb621e548a78b76a7b8e58b235086d063d72a25c5f84b676c11a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_2138.go: 17.6% line coverage (9/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_2138.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"682f6b05a2e20c8b900077d7cc8583b987765d99993c51ef347d6624743ee9ab"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_3043.go: 19.0% line coverage (12/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3043.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c6057ae4423d14a956514514441ad958ee1b32d0d20653d78218e184cf50d1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_3065.go: 3.7% line coverage (10/269)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3065.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87de640d95b2540feabc0822ad0d4c393320ba1ae32df0d698f5a985e264772"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_3500.go: 26.9% line coverage (14/52)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3500.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a2145d525dc608f9df1719071dff903229ccb4ff4e6eac91f1d98c09c44885"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_3557.go: 11.2% line coverage (10/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3557.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"206306cb75cc90552917f4749b359697280b7279a05daf09019bfd13706a2536"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_3561.go: 9.8% line coverage (10/102)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3561.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f6f68125f974c15b9bb605f07fe3421cfcf51f9e93f829bbe2e7036c530d67"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_issue_3565.go: 39.4% line coverage (28/71)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue_3565.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7fc5a6ba886632c38ae0d1512c6b73146b23527edbf7d21f09a9dfaf8fa70a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_lens_context_budget.go: 21.1% line coverage (12/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_lens_context_budget.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6faac9bb47f4956190dea8fb978f1f2fb7c28782c8661c47b5f6a8fba3c9ee0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_local_gate_advance.go: 13.5% line coverage (23/170)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_local_gate_advance.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f3e342c9306a10a83563d508741c6a3151e1ae25e82635108559da0d1c132a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_managed_assets.go: 20.6% line coverage (14/68)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_managed_assets.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e547489699884545911e176918ab6b82b05c1aabe1637281bf8cef82319c7a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_provider_capture.go: 7.9% line coverage (11/139)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_provider_capture.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc51b6b4a3468ab599cf3226b9ee013ed625cade9a178fd8db5de40eb3cfe823"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_repository_context.go: 7.1% line coverage (11/156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_repository_context.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67625ce6bb4099da384c85b5897b7d2cf08d562150b84e5924adfe50d091cae3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_review_helpers.go: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_review_helpers.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad9b90148c0f08faedb66e542cd5a91e7ba8a497f5e92cfbba9e9599168f93b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_review_recovery.go: 31.4% line coverage (22/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_review_recovery.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68af6b6c34a7bad53acd0665296f26f2c198e53ea02dbbfde9d64479a13965b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_reviewed_superset.go: 17.0% line coverage (43/253)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_reviewed_superset.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90c873607f9775f77dd961de293fc9d743a9ac6b8e66a7562f19a5965375099"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_scope_changed_fixture.go: 12.0% line coverage (30/251)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_scope_changed_fixture.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f066200a76b4c71ccfbd1c43fba2ef941478e07cd212a0d8f8a0f54d7c14435"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_staged_delivery.go: 12.0% line coverage (11/92)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_staged_delivery.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d778d7cceb01b5eb8ebe5ce3352e54456eea7d779b63165ed8b2b80340052e51"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_stop_hook.go: 32.6% line coverage (15/46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_stop_hook.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf3c4cd2d40522f4975a22d0ff14f9e1c150d3ab740408c1cbb72535e7063b6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_wave1.go: 7.1% line coverage (60/847)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_wave1.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0796a545a7cfe2b58d1fff8f387338f38f22c7bc46fe2a9dc188c3935ee96be"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/journeys_wave3.go: 4.6% line coverage (24/524)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_wave3.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af019d98a320b162a4108eb703373d42856d2536f992ba50dfff49aec159569"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/lock_unix.go: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/lock_unix.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"162225e4584b70052493ebf898587bc5d8e6eb2ed7448a8c6993ce4bb5b4ae4d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/main.go: 30.8% line coverage (90/292)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdfe6bd3d2d57f1f990d9c3e67b5df0b0d21b5ddd343e3685f6b9d7e258ce25"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/record.go: 0.0% line coverage (0/158)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/record.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cf4dc50d8eeb649bae467ce5753a2eaaddd5e56b65a129e258fd0dc1c49d4d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bench/runtime_fixture.go: 43.5% line coverage (20/46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/runtime_fixture.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d892ff2f3ccce447f0d2896a4418e0679ec88a6af6de0bf98bce89880eda956"}},{"ruleId":"D8","level":"note","message":{"text":"Tests reach code only in some runs: internal/reviewtransaction/compact_reviewer_capture.go: 4 line(s) (520, 523, 664, 667) were executed in some of the 3 runs of the suite and not in others. A test that does not take the same path every run only tests the part it always takes, so these lines are not counted as covered. Make the tests that reach them deterministic (a fixed clock, seed or ordering, or waiting on the event instead of on time), or test the paths directly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4c64d565e5102b5687625fb1613c4b3609a4eece7cea013bee965d7deb8dbb"}},{"ruleId":"D8","level":"note","message":{"text":"Tests reach code only in some runs: internal/tui/model.go: 1 line(s) (360) were executed in some of the 3 runs of the suite and not in others. A test that does not take the same path every run only tests the part it always takes, so these lines are not counted as covered. Make the tests that reach them deterministic (a fixed clock, seed or ordering, or waiting on the event instead of on time), or test the paths directly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"068595e6258571de44b3ace1f628fa1dbcde82cc2910651399c832621866e09f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_facade.go: internal/cli/review_facade.go changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 284 in cli.runReviewStatus at line 799. 51 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_facade.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f063bc2bec8003393bb9763cd62fdafdfd001647a7bef0ac84d50fec640ef35a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/model.go: internal/tui/model.go changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 230 in Model.confirmSelection at line 2100. 24 of those changes were fix/bug commits, and the other 33 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/model.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd53315ea775ce747b79af91b87cf27366fb1a9c78a2b92866ae5e9fa9b299c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/run.go: internal/cli/run.go changed 97 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in componentApplyStep.Run at line 3343. 72 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/run.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"099ae4b4d6a87592ac2fb61c4abdc143141e4ceedf90ce4b16f2df5cc5a9bdf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_install_flow_unix.go: internal/shellinstaller/user_install_flow_unix.go changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in shellinstaller.userRunInstall at line 218. 21 of those changes were fix/bug commits, and the other 33 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_install_flow_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d57dd93f5a79723af4213711b8d086f2ffcd849c91b805ea5a7653054fc991"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_status_contract.go: internal/cli/review_status_contract.go changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 167 in ReviewNextTransition.Validate at line 1239. 25 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_status_contract.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"736e4a2b7a0a03a8bd1be721f579cf2143a8a26bfc1b0193a086f6ed9b4187be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/sync.go: internal/cli/sync.go changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in cli.syncBackupTargetsScoped at line 712. 45 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/sync.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4c928cb3fbd0b91bba03b2efce58844c6c702ed2c2e8fad2b2022eeebe368a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/uninstall/service.go: internal/components/uninstall/service.go changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in Service.buildPlan at line 431. 33 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/uninstall/service.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/service.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3fe285486a1f3c8e882d19c94584d84c0c9d95a5edb4dfc7dec7a05f29a850"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/shell_experience.go: internal/tui/shell_experience.go changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in Model.configureShellExperience at line 134. 18 of those changes were fix/bug commits, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/shell_experience.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_experience.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4c198cd55db5cc5016f9a290f86b69071cec7f9f42ff6f8740a2aa6ab447b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_operation_contract.go: internal/cli/review_operation_contract.go changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in ReviewIntegrationFailure.Validate at line 1429. 16 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_operation_contract.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_operation_contract.go"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b79f2e76cecee9129e59a05ce4c6313097574068ab92618ec698f8d47a4679a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/app/app.go: internal/app/app.go changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in app.RunArgs at line 91. 15 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/app/app.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/app.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"451c72d0147d3b3db366aedc09d43bf2aae8fa1533876b186bb99bbfadef10ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_next_transition.go: internal/cli/review_next_transition.go changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in cli.resolveReviewNextTransition at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_next_transition.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_next_transition.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b48161c91daa727dd5c7978327fc760898c3aaf6b0e5a36241abb6b36e2a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/persona/inject.go: internal/components/persona/inject.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in persona.injectInternal at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/persona/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/persona/inject.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce7b501b82435f1454665f0db4fd96f6c28979c33a54e09b98254eb322ce433"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/engram/inject.go: internal/components/engram/inject.go changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in engram.injectWithOptions at line 748. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/engram/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"df77a054038d4ba3a6caf909bc565956d44ce4c2db00596c0da82c1e0feaa25e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/compact_store.go: internal/reviewtransaction/compact_store.go changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in reviewtransaction.validateCompactSuccessor at line 1727. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/compact_store.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9773b3f2ead6c843f5502592326ad1076499fe06a0b6caa5744afbb0d020f750"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/compact.go: internal/reviewtransaction/compact.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in CompactState.CompactReviewView at line 1188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/compact.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3837eaee48e30edf290719cf91d1cd3db41eb77ad146936e9068ca74e8f5f191"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/shell_install.go: internal/tui/shell_install.go changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Model.updateShellInstall at line 810. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/shell_install.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffac805cf1be2d69d815d676b064c75b542134d16b7832ebd6ad65fc06aab55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_install_windows.go: internal/shellinstaller/user_install_windows.go changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in shellinstaller.userWindowsInventory at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_install_windows.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab14135213f5ca17eed88875c9663086da931ca0165a5ef8607f3e5cdfeb5d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/target_status.go: internal/reviewtransaction/target_status.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in reviewtransaction.assessTargetStatusSnapshot at line 429. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/target_status.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c50237fc4083f20ae8b1714466687ee58b15cf18cf504b8906c9b0207806c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_start_contract.go: internal/cli/review_start_contract.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in ReviewIntegrationStartResult.Validate at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_start_contract.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_start_contract.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf892c91bfba2785ff3d0324a236638090c5365786734695ad44e42f39c8299e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_artifact.go: internal/cli/review_artifact.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in cli.RunReviewCaptureResult at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_artifact.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"046aa20ccc608d594c15236a8d2b2decaa87d13ad1be3394554191e5f58be997"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/snapshot.go: internal/reviewtransaction/snapshot.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in SnapshotBuilder.build at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/snapshot.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bc88c9eb92eafc793b188cf3d3cc2afedf5f43df8967e2e37ee658429e042a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/update/upgrade/executor.go: internal/update/upgrade/executor.go changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in upgrade.managedAgentBackupPaths at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/update/upgrade/executor.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/executor.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da96315cc61cb51c2a3bb98d14173562e78208b85aba1b6a06e2c24b59f841"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/provision-gentle-shell-private-global.mjs: scripts/provision-gentle-shell-private-global.mjs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in provision-gentle-shell-private-global.readReviewedList at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/provision-gentle-shell-private-global.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb235d57c30bcf231d2cdce8631a59d1d47912a8a49a1cdf475e89ef0789cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_install_linux.go: internal/shellinstaller/user_install_linux.go changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in shellinstaller.userServiceWithPlan at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_install_linux.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9e2c3c63ddb08d8187b8d381652eb8f94fcaaecb60187a68930ed298f22849"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/communitytool/tool.go: internal/components/communitytool/tool.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in communitytool.InstallWithOptions at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/communitytool/tool.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/tool.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cc23be2e3669adbe7da3683051a83bfa84d7f363021e977847c964f012aae6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_provider_roles.go: internal/cli/review_provider_roles.go changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cli.reviewProviderAdmitTargetedValidatorRaw at line 622. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_provider_roles.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_roles.go"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d0b1deb6bdbc6788eb03e9374402a4795517bc0207288bcc58897148ab0826"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/provision-gentle-shell-windows.mjs: scripts/provision-gentle-shell-windows.mjs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in provision-gentle-shell-windows.reviewedSuppliers at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/provision-gentle-shell-windows.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/provision-gentle-shell-windows.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5a93cd24f5e1e9e47c451d6568765ab251bbcf71d5d884c6c691dab60001ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/shell_install.go: internal/tui/screens/shell_install.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in screens.RenderShellInstall at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/shell_install.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_install.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"65934eaa2825c2e32736bb99272365274391ab80cce55ec33179848e05dec9b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/filemerge/json_merge.go: internal/components/filemerge/json_merge.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in filemerge.RemoveLegacyOpenCodeAgentMarkers at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/filemerge/json_merge.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55013c8994bce4d4f814869511b09e4214fdd2c5be53d1df2703250e7f5cce5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_provider_role_capture.go: internal/cli/review_provider_role_capture.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in cli.parseReviewProviderRoleCapture at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_provider_role_capture.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_role_capture.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b37779830ab28280bd2f4411be18e927042689d4cc660c7eeb2fd2e22365f1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/doctor.go: internal/cli/doctor.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cli.checkStateJSON at line 517. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/doctor.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1183d0fe71ab3c45ffc61f85fb5bfa0c34676626030b934b951720caa4ce595"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_lens_context.go: internal/cli/review_lens_context.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cli.reviewLensContextBlock at line 690. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_lens_context.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_lens_context.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db96d1f98d95167dad33b4f7ea65fba9a0833761b00c9587ceb5d4d3efb6266"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/communitytool/pi_codegraph.go: internal/components/communitytool/pi_codegraph.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in communitytool.ReconcilePiCodeGraph at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/communitytool/pi_codegraph.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14eada00de1538677ef0abb4444d30e23d1686b8e33da195ff9f2c339a6bf73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/journeys_wave3.go: bench/journeys_wave3.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in main.captureExactSelectedReviewerSlots at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_wave3.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_wave3.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc96f432cecda07952e518351493a02369e1a80fb78cbc1290a1b97832da1c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/shell_install.go: internal/cli/shell_install.go changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cli.RunShellInstallInline 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/shell_install.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/shell_install.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"47464c59024ee9ca2633abab06f3cab288820b4f87f30bd8e0c0f504993a3659"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/artifact_admission.go: internal/reviewtransaction/artifact_admission.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in reviewtransaction.AdmitArtifact at line 404. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/artifact_admission.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd19e4295edde2c08509fd4a37eb416f7070124beabe0ff282cd95ab91b37e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_mode.go: internal/cli/review_mode.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in cli.RunReviewMode at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_mode.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_mode.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15bfc8835a3be5f0cbe03a178c9219253b9bc7d340a052a67144c9ca898017b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_opencode_transport.go: internal/cli/review_opencode_transport.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in cli.openCodeTransportComplete at line 492. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_opencode_transport.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_opencode_transport.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b296772c6abb48861a2c704fb8540a1b557f34322f376e6f1397627fea27df9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/welcome.go: internal/tui/screens/welcome.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in screens.renderWelcomeWithInstaller at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/welcome.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/welcome.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"096027dbc97e2589c2fc9684570912ee342945e31755d997539666d7bc665864"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/journeys_intended_untracked.go: bench/journeys_intended_untracked.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in main.captureSelectedUntrackedCorrectionFinding at line 409. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_intended_untracked.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_intended_untracked.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca970b7e7ccfcee1eb400c3491d199f5469c4ace13e5fe2a03079673bf62c63c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_install_stage_unix.go: internal/shellinstaller/user_install_stage_unix.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in shellinstaller.userValidateInstallStage at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_install_stage_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_stage_unix.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd85eac4369ad65b70408d4e1c42987eff4bffba5c0f4034c2c17dd1d8500a82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_experience_files.go: internal/shellinstaller/user_experience_files.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in shellinstaller.userValidateStageExperience at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_experience_files.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_files.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ca3c805abddef484b4dc2bd9d54fa10d2552899d722b49377e7e86fa6b5b39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/opencode/catalog.go: internal/opencode/catalog.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in opencode.parseVerboseCatalog at line 336. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/opencode/catalog.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/catalog.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9b45a4dc942ce13eea4bf9f8de27df7a7c1c5e93454f48bc36002f627df662"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/agentguidance/inject.go: internal/components/agentguidance/inject.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in agentguidance.resolveRoutingDelivery at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/agentguidance/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agentguidance/inject.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fd8c3ba547d2a07b443a0e8cbbec4f68c13f42071cd1d7c282ce881cf70c78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/risk.go: internal/reviewtransaction/risk.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in SnapshotBuilder.processBoundaryRiskReasons at line 649. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/risk.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ca6646485cd163790e036c564bb267dc5eb9e08568aa6cb769ed087982e3cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_repair.go: internal/cli/review_repair.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in cli.runReviewRepair at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_repair.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_repair.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2fc48ce8abfeb02ac57626837c94e2e4d6746b6718393a71c3e612c2b019bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_last_event_closure.go: internal/cli/review_last_event_closure.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in cli.closeReviewOnLastCapturedLens 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_last_event_closure.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_last_event_closure.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c553eabc8dd5d669a0b9c41c8e7a84421e7270287a1ffc3e7a44598cdfcdc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/battery.go: scripts/crosslane/battery.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in battery.acknowledgeApproved at line 541. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/battery.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/battery.go"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d98bb5c5a5d88942f94c0fddb0d8aef959040362caca6857b76ffbd9d8ae5be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/reviewassets/install.go: internal/components/reviewassets/install.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in reviewassets.InstallNativeAgents at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/reviewassets/install.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/reviewassets/install.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"14024cd25c29c64b5232109aa23edd9404f2244ad997b87db49b3464f15d5df9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_shell_update_unix.go: internal/shellinstaller/user_shell_update_unix.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in shellinstaller.CheckUserShellUpdate at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_shell_update_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_update_unix.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b5c4014c4b4b1dd2f403100271cb324fa7010bf4fdba4290f25369e698af7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/backup/restore.go: internal/backup/restore.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RestoreService.restoreCompressed at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/backup/restore.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/backup/restore.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70acc042532a0cc0e4ad067741956dcff583aa24d6033674141839873e4d79c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/model_picker.go: internal/tui/screens/model_picker.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in screens.renderPhaseList at line 756. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/model_picker.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/model_picker.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee2997c7ccce5c74736ff8d60594922210bf8bbd9bc2e74085e21de19c8a6d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_launch_windows.go: internal/shellinstaller/user_launch_windows.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in shellinstaller.userWindowsVerify at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_launch_windows.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_launch_windows.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f198e7c13e49e840d3dc7fb8ee2ff2513ee4105e8c41b7a2f6c9f16f8379c745"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/journeys_captured_provider_validator.go: bench/journeys_captured_provider_validator.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in main.captureProviderValidatorSlotWithResult at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_captured_provider_validator.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_captured_provider_validator.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff0eb4e988b9e93cc00b7baf3d9e49aa994553c7377b7bcef025924a70a0642"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_native_coordinate_linux.go: internal/shellinstaller/user_native_coordinate_linux.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in shellinstaller.userNativeCoordinate at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_native_coordinate_linux.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_coordinate_linux.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b4bcf6424727dd1879fb33baa9b0e8646aff0c461e97a279a8d35de9dca1ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/compact_reviewer_capture.go: internal/reviewtransaction/compact_reviewer_capture.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in CompactStore.mergeAdmittedNonLensRoleResult at line 619. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/compact_reviewer_capture.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ce6602b452d9eb3cfbebbf514d6d741d57aa51bdcfeafb05be2067d1d982ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_experience_selection.go: internal/shellinstaller/user_experience_selection.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in shellinstaller.userExperienceSupported at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_experience_selection.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_selection.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5fd3cd1035c4a31f78c74f630d670053917ef2a7dce9da2199621e92e10ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/providercontractbundle/bundle.go: internal/providercontractbundle/bundle.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in providercontractbundle.validateEntries at line 627. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/providercontractbundle/bundle.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/providercontractbundle/bundle.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b5ed8b67299db99cc725528569d3ac40aada1cf26d2ea726c2a2844f2891c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/shell_experience_advice.go: internal/tui/screens/shell_experience_advice.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in screens.shellExperienceRecommendation at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/shell_experience_advice.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_experience_advice.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"027bdb364d908b7f45ae4246caaa5dc34ce14c1345eadfce2158cd4d7d572f9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/runner.go: bench/runner.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in main.runTTYWithDeadlines at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/runner.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/runner.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f86d660643eb6291d06581454bedbccdf4c6c62dadf1b936419865566d737b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/gentle-telemetry/main.go: cmd/gentle-telemetry/main.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in main.run at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- cmd/gentle-telemetry/main.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/gentle-telemetry/main.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5fd3b5d3ec61009901467be429adb6c70bb3a8eda3c90e86e8a6f0bec8e0b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_assess.go: internal/cli/review_assess.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in cli.RunReviewAssess at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_assess.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_assess.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a367a4739b79b6a949a41de52ccfa01dbed7ae5064052ea5fcd5e3c852957238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/uninstall/opencode_agents.go: internal/components/uninstall/opencode_agents.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in uninstall.removeOpenCodeFamilyAgents at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/uninstall/opencode_agents.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/uninstall/opencode_agents.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8b906e9775c38c175b46c7b41837b3c4bb01e9d800be698cfa03e3ef0315a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/opencode.go: scripts/crosslane/opencode.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in battery.runOpenCodeLane at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/opencode.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/opencode.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"757170c371b762f1ceeaeb63702e2938525befc6f71af3a00ad02e92f4e2f748"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_runtime_primitives_linux.go: internal/shellinstaller/user_runtime_primitives_linux.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in shellinstaller.privateCgroupPath at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_runtime_primitives_linux.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_runtime_primitives_linux.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6860891bd28416fcc2c45b9be871fb2559ea745c581bde681ed20a73eb1a4472"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/opencode/background.go: internal/opencode/background.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ActivationPlan.Apply at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/opencode/background.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/background.go"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"78529aacc9e8f9cc72d3ba2b5984ffc41b297dd7e78cee49eaea943790ff5087"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_shell_registry_unix.go: internal/shellinstaller/user_shell_registry_unix.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in shellinstaller.LoadUserShellExperience at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_shell_registry_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_registry_unix.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf2fa76e141b4bf9d78c9506a5b09379d03912391a267a6a26ae59d8f6c2778"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_experience_stage_unix.go: internal/shellinstaller/user_experience_stage_unix.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in shellinstaller.userStageExperience at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_experience_stage_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience_stage_unix.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7e5a5eb5e74db1fc59dd065e4871bfa908cfc56b34bb2733290b3c9133de18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/telemetryruntime/opencode.go: internal/components/telemetryruntime/opencode.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in telemetryruntime.sendOpenCode at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/telemetryruntime/opencode.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1808dbfaf9d1ce5af86c8ef6bdcef8fb01340d4ce6a1ec6eb1ddca6e72fef716"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_experience.go: internal/shellinstaller/user_experience.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in shellinstaller.DecodeUserExperience at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_experience.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d05ce9949b339348c659945a72901d134b4e238cd4541b4b03ec5da02b33ac5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/rdd_mode.go: internal/reviewtransaction/rdd_mode.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in reviewtransaction.SetCloneLocalRDDMode 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/rdd_mode.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"50099eb4d6ab1550b0ff90e6138484c9c4c03dd934ca2e95f30e3672c8e20bec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/telemetryruntime/managed.go: internal/components/telemetryruntime/managed.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in telemetryruntime.inspect at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/telemetryruntime/managed.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"574e6bf9b632a081d34d71977d2c800c71a3bcca200b129cafc4e9588b12d8d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_shell_agent_unix.go: internal/shellinstaller/user_shell_agent_unix.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in shellinstaller.userRestoreAgentImages 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_shell_agent_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"347499e1d77dcb89366146576b5cde6bc813454ee9430fb9bfcc82784d4fb1a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/authority_disposition_plan.go: internal/reviewtransaction/authority_disposition_plan.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in reviewtransaction.deriveAuthorityDispositionPlan at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/authority_disposition_plan.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/authority_disposition_plan.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1bdb85f732cfe098059e0aae98ccd1c1ed9ebb1884e08a21c58716920a10db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/repository_locator.go: internal/reviewtransaction/repository_locator.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in reviewtransaction.resolveOpaqueReviewRepositoryContextRecord at line 519. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/repository_locator.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"640aef3d0d780116c95dac899624254e1f388ef16c45eddcec152471c177cac0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/restore.go: internal/cli/restore.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cli.runRestoreWithHomeDir at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/restore.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/restore.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"71345da50257891b886cd9bef8eb940d8f6e34ba17b6c49e583daf9f8363bbc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_stop_hook.go: internal/cli/review_stop_hook.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in cli.runReviewStopHookStop at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_stop_hook.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_stop_hook.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9d61a9e49f72a1ee6fe2d84c8a0e9e791c2b2ff8ed324c59f243cd1689062"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/shell_manage.go: internal/tui/screens/shell_manage.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in screens.RenderShellManage at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/shell_manage.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_manage.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d540f784360d28b17da636c2f0a6d22494997f56d87531ee95b444ac68c6cb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/host.go: scripts/crosslane/host.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in battery.hostFollowToReceipt at line 360. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/host.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/host.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc606bf05edd741a8e7b2e21d8f68b27022406589f543bdab03910e98264202a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_pnpm_publish_linux.go: internal/shellinstaller/user_pnpm_publish_linux.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in shellinstaller.userPublishNativePNPMPrepared at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_pnpm_publish_linux.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_publish_linux.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c7c26ad993d6fbc6f09dfe2e04717988bdb113385d4180f85829a967429b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/rar_authority_repository.go: internal/reviewtransaction/rar_authority_repository.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in RARAuthorityRepository.Publish at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/rar_authority_repository.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3babb2801b5732a68f11f5c08d1dbcca4d761496b0315456021394dcc81ecbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gen-sdd-agent-digests/main.go: scripts/gen-sdd-agent-digests/main.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in main.main at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/gen-sdd-agent-digests/main.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/gen-sdd-agent-digests/main.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfa85b2e7f292aa78c831405cd5d66f82b9d2cd5f8e7873694d522bafa5d84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/telemetry/runtime.go: internal/telemetry/runtime.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in telemetry.normalizeRuntimeRows at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/telemetry/runtime.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"081e5a3061b5caa37303d0ed5e1dcbe2c3d794ab11b2993378d8b2b717ae8fea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_install_unix.go: internal/shellinstaller/user_install_unix.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in shellinstaller.userSupervisorSHA at line 252. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_install_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_unix.go"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3e833482a5e34e934cfca428089d9f644aa423b759fd2c29ddc4a10587ce93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/frozen_candidate_context.go: internal/reviewtransaction/frozen_candidate_context.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PreparedCandidateInspector.Inspect at line 344. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/frozen_candidate_context.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/frozen_candidate_context.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b02e055aaeaa6396f4592e669d5a653d2eea8bf03e678dcb657907596e2522"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/journeys_repository_context.go: bench/journeys_repository_context.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in main.driveRepositoryContextFreshProcesses at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_repository_context.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_repository_context.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0c8fd9191f75016b15911252d45a354803d28b34a71c8bd30124976964016e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/claude_model_picker.go: internal/tui/screens/claude_model_picker.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in screens.renderCustomPhaseList 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/claude_model_picker.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/claude_model_picker.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5441d9cc4af85332be9cd09a8a7a52b0bd69ac307a941d6823bc67fedd2d1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/opencodeagents/agents.go: internal/components/opencodeagents/agents.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in opencodeagents.Shape at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/opencodeagents/agents.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodeagents/agents.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"623aabd3e4bb689157fe27abcbab7dd7b5e16b0802ffd1b558d7c60b2d9686cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/compact_burn.go: internal/reviewtransaction/compact_burn.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in reviewtransaction.AcknowledgeApprovedCompactAuthority at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/compact_burn.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_burn.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d70ff6f8c87d394118f4293e95d465d32a206313d327f92b278e14b3d67b54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/uninstall.go: internal/tui/screens/uninstall.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in screens.RenderUninstallConfirm at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/uninstall.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/uninstall.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b9d8124781e3947a77d393c01ef16b75e490d5934d278dde7e70eedb5473cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/opencodedefault/ownership.go: internal/components/opencodedefault/ownership.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UninstallPlan.Apply at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/opencodedefault/ownership.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodedefault/ownership.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"334f5306d1b38934b70459d7eb8928dfc309a5429042aa2ad9ff2eb594bbea23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/telemetry_runtime.go: internal/cli/telemetry_runtime.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cli.runTelemetryRuntimeInput at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/telemetry_runtime.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/telemetry_runtime.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c24791794627bfdd9140c90a4f236c43abd33688bab2537f60021420bd2d53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/review_correction_plan_capture.go: internal/cli/review_correction_plan_capture.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cli.RunReviewCaptureCorrectionPlan at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_correction_plan_capture.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_correction_plan_capture.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a2f1129003d339ea70c5acb1ab5af676aaaa705a17300f9b1efc64bfbb1afd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_shell_launcher_unix.go: internal/shellinstaller/user_shell_launcher_unix.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in shellinstaller.PublishUserShellLauncher at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_shell_launcher_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5390c0988ac35ada9041b93f9379a705dbb549f0bdd49e396f248ff75015cf73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_channel_overlay_unix.go: internal/shellinstaller/user_channel_overlay_unix.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in shellinstaller.userUnixChannelOverlay at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_channel_overlay_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f658ce4934b6d2d33e07e2c6ba6ac6ad589069089a297acd52601de7b882358f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/corrected_inspection.go: internal/reviewtransaction/corrected_inspection.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in reviewtransaction.ResolveCorrectedCandidateInspection 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/corrected_inspection.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/corrected_inspection.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"500606127f5aec82140daf86f192ddd3f5d2cf1f82e23b9f22278cba9b6103bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/agenthooks/skill_registry.go: internal/components/agenthooks/skill_registry.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in agenthooks.installSkillRegistry at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/agenthooks/skill_registry.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/skill_registry.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d940b83a5bf4a05135f97a92d3906668f0aefb6b4a725844c2f58385e62f6871"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/target_status_projection.go: internal/reviewtransaction/target_status_projection.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in reviewtransaction.loadCompactTargetStatusCandidates at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/target_status_projection.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/target_status_projection.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50be46e3667d0f68245384b29cfd04ecf876c8d9c64bc48b81660d3bd42f07f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_install_scope_unix.go: internal/shellinstaller/user_install_scope_unix.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in shellinstaller.userReuseComponents at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_install_scope_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_scope_unix.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"597dba29b8cbc72b01476213ca833c2d9c78f19941cfcdd2b22377804a495588"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_shell_apply_unix.go: internal/shellinstaller/user_shell_apply_unix.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in shellinstaller.ApplyUserExperiencePreferences at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_shell_apply_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_apply_unix.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"87418fddec3e99e2eb61de389de79eb82ca4be8e124af9d05727458a4b02ecd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/opencodeecho.go: scripts/crosslane/opencodeecho.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in battery.runOpenCodeHostEchoScenario at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/opencodeecho.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/opencodeecho.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d48545a2fa9c849dbf5b3768b337d3de86cc6fb3400d86f78c0d3701e9a7763"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/cli/codegraph.go: internal/cli/codegraph.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cli.RunCodeGraph at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/codegraph.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codegraph.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc27c22f43b81733e2e709227f014b0a2b80339ca7e9a069a12d2fbca233c73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/installing.go: internal/tui/screens/installing.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in screens.RenderInstalling at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/installing.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/installing.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"669a9e2203c7266dcdfe442b30a0595b3fc5cdbc6f34f5ab416e0b090359fe50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/telemetry/runtime_claude.go: internal/telemetry/runtime_claude.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in telemetry.NormalizeClaude at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/telemetry/runtime_claude.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_claude.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"84332e4df523d3bcd4b05c3f462804273ec6f96cf6e88c3d6668a8f3f10d8f53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/acknowledged_predecessor.go: internal/reviewtransaction/acknowledged_predecessor.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in reviewtransaction.AcknowledgedBoundaryCommit at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/acknowledged_predecessor.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/acknowledged_predecessor.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e77f3e70728adb236412946d5f733a829072d8ed2da9522b5d67bd58abfc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/correction_plan_request.go: internal/reviewtransaction/correction_plan_request.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in reviewtransaction.BuildCorrectionPlanRequest at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/correction_plan_request.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/correction_plan_request.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d48fa39b52918b21fdfda51e2fae89f1de20acc0996107c0e2d777d61abb44f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/assets/opencode/plugins-v2/opencode-review-transport.ts: internal/assets/opencode/plugins-v2/opencode-review-transport.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in opencode-review-transport.startRelay at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/assets/opencode/plugins-v2/opencode-review-transport.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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"260ef7813c32e100fb351ae3a73330eb2c2879af19e0f9052aa4b7a1a3458ee0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_native_slice_linux.go: internal/shellinstaller/user_native_slice_linux.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in shellinstaller.newUserNativeSlice at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_native_slice_linux.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_native_slice_linux.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"496a5818c4f8e854f35df4234a354ad717bdadacd8cf08ebba65cc790cacf6e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/shellinstaller/user_codegraph_admission_unix.go: internal/shellinstaller/user_codegraph_admission_unix.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in shellinstaller.userCodeGraphReadbackWithNode at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_codegraph_admission_unix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_codegraph_admission_unix.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"599771de2540918af70859ab5e8fa0da5b0bc299f6b4a25880878a15a0a02c7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/agenthooks/codex_telemetry.go: internal/components/agenthooks/codex_telemetry.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in agenthooks.InstallCodexTelemetry at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/agenthooks/codex_telemetry.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/codex_telemetry.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8377c75884a5a13340df818d86f227f4f35fbb866b9208becb930aea48eb6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/agentguidance/opencode_background.go: internal/components/agentguidance/opencode_background.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in agentguidance.ApplyOpenCodeBackgroundPolicy at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/agentguidance/opencode_background.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agentguidance/opencode_background.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40d2b902dd926a7c5ed7ba879ba48c433d43eaacee36a58ae6804bcee6f359d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/journeys_managed_assets.go: bench/journeys_managed_assets.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in main.staleManagedAssetsStatusIsNotUnknown at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_managed_assets.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_managed_assets.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f527651052d37ac720881ce28fcff6b2c235202923d1aba1683146ebab32c069"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/compact_abandon.go: internal/reviewtransaction/compact_abandon.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in reviewtransaction.compactDiscardedWorkSummary at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/compact_abandon.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"012988d120451b26385a43b5525e3ea2d518872d9853efc3f0eee494919e50af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/reviewtransaction/targeted_validation_request.go: internal/reviewtransaction/targeted_validation_request.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in reviewtransaction.buildTargetedValidationRequest at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/targeted_validation_request.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/targeted_validation_request.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a701344ecc2c89c1bdd2ce26412b88af2eb9809b2cc903bc4ab503e2c04a15e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/journeys_finding_id_prefix.go: bench/journeys_finding_id_prefix.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in main.captureDisclosedFindingIDPrefixes at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_finding_id_prefix.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_finding_id_prefix.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"73537893967f1442fef0caee11b43568d9f2faa57753d3af2efd1a70df57b27b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/geminimodules/modules.go: internal/components/geminimodules/modules.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in geminimodules.Publish at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/geminimodules/modules.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/geminimodules/modules.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b29b45cb33bed5779bd6728b02504ac16c58118ef89fe9d9f4b92d46b362179"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/advisory.go: scripts/crosslane/advisory.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in battery.runAdvisoryLane at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/advisory.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/advisory.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d996bc21dd76dc8e295cb639b137cdd2cbed2f1af86ad32c9e7d0e08f56e71d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/hostpi.go: scripts/crosslane/hostpi.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in battery.hostPiDriveCorrectionToValidation at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/hostpi.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/hostpi.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"322b9ab3927e2df896dc930a40d81e5a387c21e0a4cbe3c00c03922137d1ad68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/crosslane/codex.go: scripts/crosslane/codex.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in battery.runCodexLane 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- scripts/crosslane/codex.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/crosslane/codex.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0904f630b94af050c86b5793d591d8dff03242a6dcd88a3577e4de3373a7b96c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tui/screens/user_install_destination.go: internal/tui/screens/user_install_destination.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in screens.RenderUserInstallDestination at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/screens/user_install_destination.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/user_install_destination.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4215a3258557d2223674db2be33278b3c41bbb82655d77f6ae47e6de29a689"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/components/legacyassets/sdd_assets.go: internal/components/legacyassets/sdd_assets.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in legacyassets.retiredSDDAssetItems at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/legacyassets/sdd_assets.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7281b03c7150b2d6117796b34e919735c034a491f9634926941c26c390cb0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/permissions/inject.go: internal/components/permissions/inject.go changed 11 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 11 (its worst body is permissions.InjectAtPath at line 132), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(permissions): anchor Claude secret deny rules to the home directory (#5867)\u201D; \u201Cfix(permissions): preserve existing Claude deny rules\u201D; \u201Cfix(permissions): keep a user deny-by-default when merging the OpenCode overlay (#5311)\u201D; \u201Cfix(opencode): align OpenCode permissions with the Pi safety model (#5273)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/permissions/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/permissions/inject.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3005c59d53ec71419c164473207d772965c64083cebb1ab76b8f09badd5e7c3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/agents/pi/adapter.go: internal/agents/pi/adapter.go changed 17 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 pi.repairPiEngramPackages at line 704), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): preserve Engram pins before package installation\u201D; \u201Cfix(pi): prevent and repair duplicate Engram declarations\u201D; \u201Cfix(filemerge): preserve exact JSON numbers in managed merges (#5240)\u201D; \u201Cfix(pi): ensure mcp.json on sync and migrate mcp-adapter.json servers (#5132)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/agents/pi/adapter.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/pi/adapter.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1e61b166e1b1c67d673a779944e8ff3f1fc61d28b8aef364fd82ee65ec19f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/review_narration.go: internal/cli/review_narration.go 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 3 (its worst body is cli.buildReviewNarrationRegistry at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): use plain narration and refresh Linux references\u201D; \u201Cfix(review): offer eligible manual release for unbuildable correction\u201D; \u201Cfix(review): report an unbuildable correction request as correction_request_unavailable\u201D; \u201Cfix(review): align managed-assets narration with the agentless continuation (#5540)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_narration.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_narration.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"811dc796f064b0fe1495b9d76e7be2af54760366fd0a9b0613af58f4210afde0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/reviewerprovider/contract.go: internal/reviewerprovider/contract.go changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is reviewerprovider.ContractFor at line 204), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): ask the refuter to echo request_hash as refuter_request_hash (#5865)\u201D; \u201Cfix(review): include frozen dependency lockfile patches\u201D; \u201Cfix(review): stop promising the validator content it is not handed\u201D; \u201Cfix(review): decide validator inconclusiveness from a typed inspection field\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewerprovider/contract.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewerprovider/contract.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"72198952537b702c92ce74fddb6b9ea873c708a17a3e190503d775dcfe47cc40"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/assets/opencode/plugins/skill-registry.ts: internal/assets/opencode/plugins/skill-registry.ts changed 8 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 skill-registry.isProjectRoot at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(skill-registry): render a byte-identical disk registry shared with Gentle Shell (#6059)\u201D; \u201Cfix(opencode): keep ENOENT missing resource neutral\u201D; \u201Cfix(opencode): make skill-registry ENOENT diagnostic runtime-neutral\u201D; \u201Cfix(opencode): use console.warn for skip-refresh (main contract test)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/assets/opencode/plugins/skill-registry.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":"internal/assets/opencode/plugins/skill-registry.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed8989a0567ae3020b9999039a0037d204d543110d4747e3ad26b788a06e3ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/theme/inject.go: internal/components/theme/inject.go 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 8 (its worst body is theme.InjectVisualThemes at line 157), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(theme): keep the sync settings contract while skipping the gentleman overlay (#6005)\u201D; \u201Cfix(settings): preserve native TOML and YAML configuration (#5243)\u201D; \u201Cfix(opencode): scope settings refusals to OpenCode and port new tests\u201D; \u201Cfix(opencode): keep settings comments and refuse theme symlinks\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/theme/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/theme/inject.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f857f3e48be8080f077afaf9c25c3d98dbbd828d8e5dcbe2efece80ba4c6bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/communitytool/codegraph_guidance.go: internal/components/communitytool/codegraph_guidance.go changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is communitytool.stripKnownUpstreamCodeGraphLines at line 448), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): reconcile CodeGraph wiring for native OpenCode configs (#5628)\u201D; \u201Cfix(guidance): clarify nested codegraph worktree placement (#4151)\u201D; \u201Cfix(codegraph): sync before numbered CLI read instruction\u201D; \u201Cfix(codegraph): require fresh index before CLI intelligence reads\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/communitytool/codegraph_guidance.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffafa9c9e71aa56c36a4287100231a5edd1b1ea44bda67f73d1c7b329ff2203"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/review_intended_untracked.go: internal/cli/review_intended_untracked.go changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is cli.intendedUntrackedDeclarationShape at line 86), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): keep the target selector in the intended-untracked submission (#5872)\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(review): preserve selected untracked correction scope (#4445)\u201D; \u201Cfix(review): keep the untracked binding through correction and name an exit for interior anomalies\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_intended_untracked.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_intended_untracked.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"52363b5419dd0e20726e9c09de9e7a48761ca44d82f89c478d6cd6edca8298dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/mcp/inject.go: internal/components/mcp/inject.go changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is mcp.removeInertSettingsMCPServers at line 358), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(codex): validate CODEX_HOME before configuration mutations (#5526)\u201D; \u201Cfix(mcp): migrate only exact released Context7 defaults\u201D; \u201Cfix(mcp): preserve configured Context7 servers during sync\u201D; \u201Cfix(opencode): keep new settings refusals off other agents\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/mcp/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fe2861c3c5c8fd6bf0f462a6eda66312ca1b99073a9b8d7c40acf451a24f93"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/filemerge/writer.go: internal/components/filemerge/writer.go changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is filemerge.replaceDurably at line 253), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(filemerge): skip chmod when the forced mode already matches\u201D; \u201Cfix(filemerge): ignore TOML headers in multiline strings and report mode-only changes\u201D; \u201Cfix(filemerge): never widen forced zero modes and repair launcher exec bits\u201D; \u201Cfix(filemerge): stop rewrites from widening existing file permissions\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/filemerge/writer.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/writer.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa072103ff2ce16112a32d94f2a228c80dc9beb96e56324333e6c743f740590"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/update/upgrade/strategy.go: internal/update/upgrade/strategy.go 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 upgrade.runStrategy at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(upgrade): route source-build self-updates through Go\u201D; \u201Cfix(update): pin cross-major beta upgrade to checked revision (#4979)\u201D; \u201Cfix(update): derive go-install module major from the target version (#4687, slice 2/2) (#4926)\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/update/upgrade/strategy.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/strategy.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"af138a5922111887f69d183020d0311a8df135bf99a8f236640785a9d4a9caf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/review_transport_capability.go: internal/cli/review_transport_capability.go 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 cli.reviewImmutableRuntimeCapabilityChecking at line 155), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): name the user-owned exit in transport refusal messages\u201D; \u201Cfix(review): resolve OpenCode review eligibility once per process (#5289)\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(review): type the unavailable inspection and unbind materialize from the relay variable\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_transport_capability.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_transport_capability.go"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e18560c09f664aba673e9b6ab7d3b31e172fba257c2c775723dd3b04262212"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/opencodeplugin/plugin.go: internal/components/opencodeplugin/plugin.go 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 11 (its worst body is opencodeplugin.installGentleLogo at line 157), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(filemerge): stop rewrites from widening existing file permissions\u201D; \u201Cfix(opencode): compensate the source when its own write lands with an error\u201D; \u201Cfix(opencode): compensate tui.json too when registration lands with an error\u201D; \u201Cfix(opencode): roll back the Gentle Logo source when TUI registration fails\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/opencodeplugin/plugin.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencodeplugin/plugin.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e551e8c2c8285e89e6ab70b9d762873e4a8ca59568d0ebc45b171e56b743bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/agents/kimi/adapter.go: internal/agents/kimi/adapter.go 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 Adapter.BootstrapTemplate at line 399), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(kimi): declare rendered agents hub writes\u201D; \u201Cfix(kimi): preserve current agents instructions\u201D; \u201Cfix(kimi): expand current agents hub modules\u201D; \u201Cfix(kimi): tighten current layout contracts\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/agents/kimi/adapter.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/kimi/adapter.go"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b528d24adddd6db15c16a251c9b49986a73331f2e422c7e94d98632ee30284"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/agents/antigravity/adapter.go: internal/agents/antigravity/adapter.go 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 4 (its worst body is Adapter.Detect at line 77), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(antigravity): list both variant roots in doctor config dirs\u201D; \u201Cfix(antigravity): load Gentle AI guidance through agy rules instead of GEMINI.md\u201D; \u201Cfix(antigravity): target the agy 1.4 shared config root\u201D; \u201Cfix(antigravity): accept legacy and variant roots in doctor config check\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/agents/antigravity/adapter.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/antigravity/adapter.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e20e7626fad19ef9d4247f0ce8766b689d9b4a8215a536e86f66fc8261381c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/gga/config.go: internal/components/gga/config.go 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 12 (its worst body is gga.Inject at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(restore): admit redirected APPDATA gga config dir as a restore root (#6027)\u201D; \u201Cfix(gga): preserve unmapped configs and surface TUI notices\u201D; \u201Cfix(gga): preserve configured providers during install and sync\u201D; \u201Cfix(gga): generate compatible test exclusion patterns\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/gga/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/gga/config.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdabd05eb6b198e1758de361e3130bf955045d6d776e20bd3b13269ee6f6ea8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/communitytool/codegraph_contract.go: internal/components/communitytool/codegraph_contract.go 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 communitytool.hasCodeGraphToolWiring at line 123), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): reconcile CodeGraph wiring for native OpenCode configs (#5628)\u201D; \u201Cfix(agent): complete Conductor review contracts\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(sync): scope community tool injectors to selected agents\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/communitytool/codegraph_contract.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/codegraph_contract.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd7e414bc997482148c9d6ef99536517244cc817b0c6a4214c461896468ea8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/skills/inject.go: internal/components/skills/inject.go 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 skills.directoryAssets at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(codex): validate CODEX_HOME before configuration mutations (#5526)\u201D; \u201Cfix(skills): remove the legacy shared marker on Windows and uninstall\u201D; \u201Cfix(install): restore non-SDD assets dropped by the SDD retirement\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/skills/inject.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/skills/inject.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b377ceedefb9861c82639bd9ce17d97dbf2765d6f157f1cc667c1e62f9ad055"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: bench/journeys_issue3766.go: bench/journeys_issue3766.go 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 main.waitForReviewModeTTY at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): restore original Gentle Shell presentation\u201D; \u201Cfix(bench): navigate RDD from the stable Welcome origin\u201D; \u201Cfix(bench): seed the update cooldown in j121\u0027s sandbox so the Update Available modal cannot cover the exchange\u201D; \u201Cfix(tui): align RDD copy with advisory policy\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- bench/journeys_issue3766.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/journeys_issue3766.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"043b16f523a354a32362e77e51404f9ec8470a7804413b7fab23f711b0af2ce6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/review_provider_correction.go: internal/cli/review_provider_correction.go 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 10 (its worst body is cli.reviewProviderCorrectSubjectHashEcho at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): bound complete role prompts and corrective retries\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(review): launch Windows batch shims with a rebuilt command line and correct a target-identity echo\u201D; \u201Cfix(review): retry a malformed targeted validator result once with admission feedback and preserve the refused payloads (#4076)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_provider_correction.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_correction.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94651762ae1efcc5baabf248304f508c6801ada119b1ce18a817a0d3b9d6db1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/shellinstaller/user_main_snapshot.go: internal/shellinstaller/user_main_snapshot.go 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 15 (its worst body is shellinstaller.userMainSnapshotUsing at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shell): resolve the Main ref as a bare SHA (#6149)\u201D; \u201Cfix(shell): report the supervisor on the Main preview update check\u201D; \u201Cfix(shell): name the refused Main publisher response instead of an opaque error\u201D; \u201Cfix(shell): pin Main to a qualified commit\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_main_snapshot.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_snapshot.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4208cf9160f04be34096f8c2cba8daf01fac5ed610b199db31ad35f478c89751"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/agents/claude/adapter.go: internal/agents/claude/adapter.go 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 claude.mergeUserConfig at line 104), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): migrate only exact released Context7 defaults\u201D; \u201Cfix(mcp): preserve configured Context7 servers during sync\u201D; \u201Cfix(filemerge): stop rewrites from widening existing file permissions\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/agents/claude/adapter.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/claude/adapter.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"330b875e7672315ea1f172b9bf8129d9520d454a632c6bececacde1f5bd516c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/system/path.go: internal/system/path.go changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is system.AddToUserPathWithResult at line 44), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(system): match expanded Windows PATH entries\u201D; \u201Cfix(system): preserve PATH rollback on notification failures\u201D; \u201Cfix(system): preserve Windows user PATH registry kind\u201D; \u201Cfix(opencode): report effective managed activation readiness (#5282)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/system/path.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/path.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e82333be8494998f0c7df90dbe8696b6364b8ff73e1dc515cd9f5fe00055a54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/opencode/runtime.go: internal/opencode/runtime.go 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 12 (its worst body is opencode.brokenManagedLauncherFallback at line 122), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): allow slow runtime version probes\u201D; \u201Cfix(opencode): preserve stable launcher targets across upgrades\u201D; \u201Cfix(review): resolve OpenCode review eligibility once per process (#5289)\u201D; \u201Cfix(opencode): bound discovery shutdown against escaped descendants and preserve read errors\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/opencode/runtime.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/runtime.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ccb8a6ef54b7150d6f395b539a4e60462a20f577b4a50bdc08f6cc148755b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/tui/progress.go: internal/tui/progress.go changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ProgressState.Mark at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): complete installer progress after rollback\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(installer): wait for pipeline completion\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/tui/progress.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/progress.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ddcba2889510d374aae1a541d1130757c39d82cb8a70bffbb7d1ea1429179b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/reviewerprovider/claude_adapter.go: internal/reviewerprovider/claude_adapter.go 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 ClaudeAdapter.Review at line 47), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): honor assigned Claude reviewer effort\u201D; \u201Cfix(review): launch Windows batch shims with a rebuilt command line and correct a target-identity echo\u201D; \u201Cfix(review): keep the scrubbed cause on read-only failures, answer rdd_disabled first, and name runnable inventory and capture commands (#3958)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewerprovider/claude_adapter.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewerprovider/claude_adapter.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a04d6a1b22c84e4c072dae5f311fdc748d3ff40caef599ab4391dcaf2d29322"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/uninstall.go: internal/cli/uninstall.go 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 cli.ParseUninstallFlags at line 25), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): answer --help with derived usage instead of an opaque sentinel\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(pi): report retained resources after uninstall (#4485)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/uninstall.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/uninstall.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b0057f1980e761a3aa7f824ceff31de95666bde750d6e32c7c90b57b57aa4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/update/instructions.go: internal/update/instructions.go 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 6 (its worst body is update.gentleAIHint at line 73), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(update): pin cross-major beta upgrade to checked revision (#4979)\u201D; \u201Cfix(update): add version-aware Go module path helper (#4687, slice 1/2) (#4925)\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/update/instructions.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/instructions.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e992cbd8bc2fc7afc0d7d8ed1546dbd84977149a66a33fdc67df24074d6bef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/app/bench_model_picker_fixture.go: internal/app/bench_model_picker_fixture.go changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is app.benchSyncDone at line 152), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(opencode): complete runtime catalog migration\u201D; \u201Cfix(opencode): discover models from runtime catalog\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/app/bench_model_picker_fixture.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/app/bench_model_picker_fixture.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d8da648120bf9aa08b9c3ad887afd2b9fec704fe47c5102fed150d6955facd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/review_provider.go: internal/cli/review_provider.go 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 15 (its worst body is cli.reviewProviderAdmitRaw at line 113), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): enforce runtime input budgets before starting authority\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(review): downgrade unverified causal findings per finding and fail closed on degraded evidence\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_provider.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0a403dcc67e4e7913ab9be547ee931ae503a6aff9d76cea39f5be9771c6ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/telemetrycollector/runtime_handlers.go: internal/telemetrycollector/runtime_handlers.go 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 12 (its worst body is Server.handleRuntimeEvents at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(telemetry): key the rate limiter on a parsed address, budget runtime separately, and paginate GitHub downloads (#4724)\u201D; \u201Cfix(telemetry): run the collector in WAL, anchor maintenance to UTC midnight, and report busy storage (#4718)\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/telemetrycollector/runtime_handlers.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetrycollector/runtime_handlers.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"359d6f6e6451a57ba59fe2d059a9771c4e5c76779a00eabf16f1acc844354d27"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/opencode/models.go: internal/opencode/models.go changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is opencode.DefaultSettingsPathForHome at line 20), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): restore agent parity with Gentle Shell without __managed_by\u201D; \u201Cfix(opencode): honor effective model selector config (#3988)\u201D; \u201Cfix(opencode): complete runtime catalog migration\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/opencode/models.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/models.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3272a4d690aff9e28aac89c220decb5ed5fb24ed8f17d077f28845f5955c8258"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/telemetrycollector/storage.go: internal/telemetrycollector/storage.go changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Storage.PurgeOlderThan at line 326), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(telemetry): bound the online vacuum, checkpoint passively and validate the dedup window\u201D; \u201Cfix(telemetry): give runtime delivery ids their own short retention and purge them in batches\u201D; \u201Cfix(telemetry): run the collector in WAL, anchor maintenance to UTC midnight, and report busy storage (#4718)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/telemetrycollector/storage.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetrycollector/storage.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"978cf1358718c7f7c5fcc93ff5b39c0abe6ed04597c7a0cdb77cbc32cdfa71ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/shellinstaller/user_backup_retention_windows.go: internal/shellinstaller/user_backup_retention_windows.go 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 shellinstaller.userWindowsPruneReplacedBackups at line 116), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shell): preserve uncertain replacement backups\u201D; \u201Cfix(shell): retain recent Windows replacement backup\u201D; \u201Cfix(shell): validate Windows replaced-backup removal\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/shellinstaller/user_backup_retention_windows.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_backup_retention_windows.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a2c65a12c92ed32c2554453bbce40d12deeda6a4c01d16cac2030daee56f17"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/codex_home.go: internal/cli/codex_home.go 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 13 (its worst body is cli.RestoreManagedBackup at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(restore): admit redirected APPDATA gga config dir as a restore root (#6027)\u201D; \u201Cfix(restore): authorize a workspace root present in uninstall manifests (#6008)\u201D; \u201Cfix(codex): restore backups through validated home symlinks\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/codex_home.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codex_home.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7a8ea022ab5978a37fe6367ea3bb2cbbbb36ae71f42dfdd818ecabb7c4cbcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/review_asset_provenance.go: internal/cli/review_asset_provenance.go 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 cli.checkManagedReviewerAssets at line 83), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): align managed-assets narration with the agentless continuation (#5540)\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(review): report stale managed assets at STATUS time with a typed sync continuation\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/review_asset_provenance.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_asset_provenance.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bc85d4e26433c02c199e50342289362b7b55e5ea5658897d2a206bb5039596"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/opencoderuntimeplugins/lifecycle.go: internal/components/opencoderuntimeplugins/lifecycle.go 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 11 (its worst body is opencoderuntimeplugins.ValidateReplacement at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(sync): scope a drifted managed OpenCode plugin to that agent\u0027s plugins (#5396)\u201D; \u201Cfix(opencode): retire every shipped plugin and share ownership across install, backup, and uninstall (#5281)\u201D; \u201Cfix(opencode): converge managed plugin sync with install and trust released bytes (#5277)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/opencoderuntimeplugins/lifecycle.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/lifecycle.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf7adbe53d1879beaadb077f7faa8d4dd3989dded3daa4dc4e6eb3458284cd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/update/cooldown.go: internal/update/cooldown.go 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 update.checkAllWithCooldownReport at line 83), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): distinguish skipped update checks from current tools\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(update): serialize cooldown state persistence (#4083)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/update/cooldown.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/cooldown.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d8ca16cc0dcc8a336749ae3fa691d592f39f21b5453066e5478e82cdcf8173"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/cli/install_state_lock.go: internal/cli/install_state_lock.go 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 1 (its worst body is cli.withInstallStateLock at line 5), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D; \u201Cfix(update): serialize cooldown state persistence (#4083)\u201D; \u201Cfix(review): admit the pending acknowledgement without a selector, resolve validation from the frozen runtime, and accept a symlinked home (#3957)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/cli/install_state_lock.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/install_state_lock.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d5bf53162a0d1e61ff6c7b402b97ab3f296d61edbddf4e11e28b732113d9bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/components/gga/runtime.go: internal/components/gga/runtime.go 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 3 (its worst body is gga.EnsureRuntimeAssets at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(filemerge): never widen forced zero modes and repair launcher exec bits\u201D; \u201Cfix(filemerge): stop rewrites from widening existing file permissions\u201D; \u201Cfix!: move the Go module path to /v3 so v3.x is installable through go install (#4683)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/components/gga/runtime.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/gga/runtime.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b00add37321044f8644a4aed94bd641bd728e998826bb09dfa24ada8778b5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/telemetrycollector/metrics.go: internal/telemetrycollector/metrics.go 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 RuntimeMetrics.WriteTo at line 253), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(telemetry): render expired runtime series before evicting them\u201D; \u201Cfix(telemetry): evict idle runtime metric series after a TTL\u201D; \u201Cfix(telemetry): skip zero-delta series in runtime metrics\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/telemetrycollector/metrics.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetrycollector/metrics.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"138f0b6c156909e3e30c21cebbdadb5795bf6c2603087c2743d993dff4f7f224"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/reviewtransaction/rar_path_safety_windows.go: internal/reviewtransaction/rar_path_safety_windows.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is reviewtransaction.observeRARWindowsDescriptor at line 482), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): keep local long paths local and project failed mode mutations as unavailable (#5533)\u201D; \u201Cfix(review): skip RAR authority validation when RDD is off (#4670)\u201D; \u201Cfix(reviewtransaction): classify Windows RAR filesystems and repair private directories\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/reviewtransaction/rar_path_safety_windows.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"08601386b0394f47bb189f60feadccaea66040666ad1fbcdfc140a7d726a00fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/doctor/doctor.go: internal/doctor/doctor.go 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 doctor.NewRemedy at line 88), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(doctor): distinguish state access errors from invalid JSON\u201D; \u201Cfix(opencode): report effective managed activation readiness (#5282)\u201D; \u201Cfix(opencode): persist POSIX launcher PATH in login profiles (#5276)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 03:19:15 -03:00\u0027 --until=\u00272026-11-16 03:19:15 -03:00\u0027 --full-history --no-merges -- internal/doctor/doctor.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/doctor/doctor.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d723119d65df741faa07ed94df73d62ce956d2058bd4a25553421b62dcdaf906"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 162 significant file(s) lose their only recent owner: internal/reviewtransaction/transaction.go, bench/journeys_edge.go, internal/reviewtransaction/authority_repair.go, internal/components/agentguidance/routing.go, internal/reviewtransaction/store_reset.go, internal/cli/review.go, bench/axis_damaged_store_closure.go, internal/reviewtransaction/store.go (\u002B154 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e11b4536cbdf0b13e7bd79b71629d76e8ee0ed88556947611e607579847b4315"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 19 significant file(s) lose their only recent owner: internal/shellinstaller/user_install_windows.go, internal/tui/shell_install.go, internal/cli/shell_install.go, internal/shellinstaller/user_artifacts_windows.go, internal/shellinstaller/user_process_windows.go, internal/shellinstaller/user_experience.go, internal/shellinstaller/user_files_windows.go, internal/shellinstaller/user_runtime_primitives_linux.go (\u002B11 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c93790867a492c80236e3343fffca63d929179061524ae648b678cc24817fc66"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: bench/journeys_issue_3565.go, internal/cli/pi_mcp_diagnostic.go, internal/cli/doctor_tool_probe_windows.go, internal/components/persona/resources.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a3f913950992a3266aa61c2bc928dea7d0aca21aa6aef45ae75e59a5c08a6c1"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (188 single-owned of 563 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 563 of the 805 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: internal/cli/review_correction_context.go, bench/journeys_issue2906.go, bench/journeys_issue3813.go."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060isInPATH\u0060 spells \u0060PATH\u0060 where 579 names in the project spell it \u0060Path\u0060: 579 of 580 names in project github.com/gentleman-programming/gentle-ai/v4 spell the token \u0060Path\u0060 (579 of 580; unit: names in project github.com/gentleman-programming/gentle-ai/v4 containing \u0060Path\u0060). Peers: agentbuilder.Uninstall(registryPath) (internal/agentbuilder/uninstall.go:30); Adapter.statPath (internal/agents/antigravity/adapter.go:19); Adapter.SettingsPath (internal/agents/antigravity/adapter.go:131); Adapter.MCPConfigPath (internal/agents/antigravity/adapter.go:147); claude.LookPathOverride (internal/agents/claude/adapter.go:18). Rename to \u0060isInPath\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd653cc595c079c5663b27b6d9c7b3e8f64d66aa6a7f2e41d36307ed8c71d0d8"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060codeGraphPnpmGlobalBin\u0060 spells \u0060Pnpm\u0060 where 25 names in the project spell it \u0060PNPM\u0060: 25 of 27 names in project github.com/gentleman-programming/gentle-ai/v4 spell the token \u0060PNPM\u0060 (25 of 27; unit: names in project github.com/gentleman-programming/gentle-ai/v4 containing \u0060PNPM\u0060). Peers: github.com/gentleman-programming/gentle-ai/v4/internal/shellinstaller.userPNPMInventoryReader (internal/shellinstaller/user_pnpm_inventory_file_linux.go:20); shellinstaller.newUserPNPMInventoryReader (internal/shellinstaller/user_pnpm_inventory_file_linux.go:27); shellinstaller.userLaunchPNPM (internal/shellinstaller/user_pnpm_launch_linux.go:15); github.com/gentleman-programming/gentle-ai/v4/internal/shellinstaller.userPNPMManifest (internal/shellinstaller/user_pnpm_manifest.go:5); shellinstaller.userReadPNPMManifest (internal/shellinstaller/user_pnpm_manifest_linux.go:14). Rename to \u0060codeGraphPNPMGlobalBin\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/tool.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5628bdfcb32aa6ef546ec3a60065b41ee700a9753a8b1b680704379513b21e26"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060defaultPnpmGlobalBin\u0060 spells \u0060Pnpm\u0060 where 25 names in the project spell it \u0060PNPM\u0060: 25 of 27 names in project github.com/gentleman-programming/gentle-ai/v4 spell the token \u0060PNPM\u0060 (25 of 27; unit: names in project github.com/gentleman-programming/gentle-ai/v4 containing \u0060PNPM\u0060). Peers: github.com/gentleman-programming/gentle-ai/v4/internal/shellinstaller.userPNPMInventoryReader (internal/shellinstaller/user_pnpm_inventory_file_linux.go:20); shellinstaller.newUserPNPMInventoryReader (internal/shellinstaller/user_pnpm_inventory_file_linux.go:27); shellinstaller.userLaunchPNPM (internal/shellinstaller/user_pnpm_launch_linux.go:15); github.com/gentleman-programming/gentle-ai/v4/internal/shellinstaller.userPNPMManifest (internal/shellinstaller/user_pnpm_manifest.go:5); shellinstaller.userReadPNPMManifest (internal/shellinstaller/user_pnpm_manifest_linux.go:14). Rename to \u0060defaultPNPMGlobalBin\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/tool.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3257ff8f157c5a30d543d0df7d5780425883661432edb67d8acade44d02a83"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060scripts.ReadUserAssets\u0060 returns a map (\u0060map[K]V\u0060) where its 4 siblings return a slice (\u0060[]T\u0060): 4 of 5 collection-returning members of \u0060package scripts\u0060 return a slice (\u0060[]T\u0060) (4 of 5). Siblings: scripts.ReadNativeInstallerSource (scripts/native_installer_source_linux.go:13); scripts.ReadReviewedSuppliers (scripts/user_helpers.go:17); scripts.ReadUserHelper (scripts/user_helpers.go:21); scripts.ReadWindowsUserHelper (scripts/user_windows_helpers.go:15). Return a slice (\u0060[]T\u0060). [rule A4]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user_helpers.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6c89bd08029b6b3410524d20015ac1f334dfcd81fc60c7542f15af49eecba0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a session for metadata generation\u0022 repeats the code it sits on: 4 of its 4 words (create, session, metadata, generation) are already in \u0060const session = await client.session.create({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.33.2/plugins/background-agents.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4461cd35a4c53f7dbe35d61aac3f3acd28945294bb824ea03beefbac59d5a483"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate readable ID\u0022 repeats the code it sits on: 3 of its 3 words (generate, readable, id) are already in \u0060const id = generateReadableId()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.33.2/plugins/background-agents.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aba1a914b504e3ac3008e7b1ca1e4025a440ab4edf37d01f6cbd5500955658"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get running delegations for this session tree\u0022 repeats the code it sits on: 4 of its 5 words (get, running, delegations, session) are already in \u0060const running = manager\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.33.2/plugins/background-agents.ts"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fed838631de453cc37638f418511d43d2b60a56e5d573fba8b04646bdd9c15f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a session for metadata generation\u0022 repeats the code it sits on: 4 of its 4 words (create, session, metadata, generation) are already in \u0060const session = await client.session.create({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.7.19/plugins/background-agents.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b2e6fb52cbcef16eafc597d7a53ed46f7597db866a7c16ebb50b04730a0e2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate readable ID\u0022 repeats the code it sits on: 3 of its 3 words (generate, readable, id) are already in \u0060const id = generateReadableId()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.7.19/plugins/background-agents.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2682e78592f5e180312d0a5f12378290a97a2273bb7fdde93158a945485604a4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get running delegations for this session tree\u0022 repeats the code it sits on: 4 of its 5 words (get, running, delegations, session) are already in \u0060const running = manager\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.7.19/plugins/background-agents.ts"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a2a52f78cdb38abbf7344e8026a0ebe2387ecb2d2df629786fd5eabe4ab861"}},{"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":"ed9270c1ed4b93b203a8ca51d353d242f333b2c778a78bf26a9b0d833b1fef20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"613a89b1a0d97ab1decc105e1144ebaabce95c764c27df4495dfe773f8c3d3f9"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e8f21bf099e214d767a4755a05fec6e0d837006bd38e0ecc24f51095f9d6d25"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24680698070665298abc6ee731ac0fffcc522568ea6b913a0e5df93a63caf6b4"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"234f07888cc4471413cc1456700ef8416c592fa1fecfcd0bc35db7e0d3d4145a"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2ca15b743778cef105ac24b5f7b7e8f754f1df64fffe453bb3f8a4fac912a4d"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1d06ee587e5b1abf867c7b6222484a30122d0b5eb13cfa63ccd528290a79803"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43fc44ae36399642f814a077a834ea0f88eccf40b54820c9c5415a2fdfb22b33"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9aae7893c3e79c24089206830de3358f67af7054a1fa1f6a82c893a3bbeac577"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0edbd623d2b5d48668758ac297b7fb9c979f41e8fc4285dd93a363b0c4565d2e"},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d68883e6199338e4efaa37468b7affee51a3ac930d2bc192f7e9a88312143f7a"},"taxa":[{"id":"CWE-276","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"1fd6772a1fc8c6d15bfb7da08a08cb5abdf125c8b5efcfb8550701d464495926"},"taxa":[{"id":"CWE-276","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c3428412bdcf96dccd4bbb0f2ad425408829e487097543be2fbf5db6414a0666"},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"179b90dbbd3c8e670839f10cf929485f3bdf987eaf4134961d033e2e235a62d2"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"5a82f00340abe5d220f9554012be8e3ea316347002825629a1e31b3d4f0d6471"},"taxa":[{"id":"CWE-775","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":"08256517455b807cab8108b3ebaa32151b342efd01b5d0bcb1208a5e44a0df01"},"taxa":[{"id":"CWE-775","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":"aea7b1ef23980522ba70f0e7aa92dd7fe7e518669b74722ed38bc7571e687555"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","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":"3e0f83b2b0bb25475a2177ae001986141d2d42a4f0938fffe26cc12186ee529f"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","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":"8081356b281b2c0eab2f5afb15ff488d3157fa81894bac302b8fcb88a098d984"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","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":"3f9010173a93c400408b7e106ae137b99dc3281ec77eca9a918609f43d932148"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","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":"25cec824dc4244fe95093b9c7a688816924eb53913ca439324889610507f29fd"},"taxa":[{"id":"CWE-391","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":"eac4e616265e4118df69ff88bf91aa091fcc3f76a490617898b5f5647f299514"},"taxa":[{"id":"CWE-391","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":"f3e8547d49f4e40715131f36efc6dd35017f9a631927eb0ac0b4d4ae6283c6bf"},"taxa":[{"id":"CWE-391","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":"9aa7f6da1a2fd70d468c12b114c1117a98b4fad0da453abe9d8360b2cebf478c"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","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":"2bb32062b40a92360f9e60c5e31099b482b8995141cc278645e44da7efb9c5c3"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","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":"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":"45bc3cdb9069dfedd195d09b0c709eb34db0c9fbd6a085522be1160cfe480a85"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a66598c4de6b52a547a354dc21951aa05864c313b9239b37badd15b519f27ae"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"060fd581149f70b686cf5ef55aec21dbd1e6c13a07ac44bf74b4f31682e5c78a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d2ff6c538e7f7126d5e21a2f5f1e66b100ef04fefe8d78c4449b235382a1d49"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"471cfe6542133613f19e6811562939283a9a37f2cb2ddfd343e34a7272130f92"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac5a90825ddd3e50c8d2a46a6823748960ea01bd24107678ed3de8f2c68c365c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a8268079285d9bf544433f7c5d8aa8c0add416c538ab361fec3bd084aacde86"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8891002b9377dda995a5044e50980d79fed505b60043f526a5b88cf7815b0211"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90515075c0eb56c1169f624080b0f4da6476e336251b43b0da7c04f065000889"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"449196711752a18c91b62f432a8cc95220bfad8ea9dcd68ba24bbf996426a769"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"758af2ddf595024e56d23cebcb66ecb256aa5a2d4437b34f6279f9de4553a300"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a613d1bda7d7bc764fd85bfeb06044d1147526678f07a0b7e3b6da4d0f07ab4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8bbcfe42d9336e9487b3ecb4e799d0420c5a21fb8156f709cf29b1d7322ecd7"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44438281734d2828ac0e423efbba0811265a7e537c56b4b95477ca2e9d3f9cba"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15a148eaf78f250ee35a812161607d191904aef0c9b68a4a88540d91bf75aad9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f8d403d2dd0909ba67894dc0f5f175bf1dd15626bd36480d8a93cbb66840759"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53f3ed7bbd75fbf34bcf0e1eef2466413829cfc233ab67c5182ec257aece19fb"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac06787b465b2c6fddf8a3a2666f1340f60356f06aeff32ee5c8720fe3df87b3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3df0342953a137d870d04f2294efe1caa835a0714050ea0b304666acd5f2f592"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51c4462a84687bda757eb1b33ee6ab732bab29f79681a5a11a82b19fc48e785e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00a46d2f1d429acd84f0463456183c0ad3b2bba2ce09857749141224acfc3d10"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9633f2c557a2227634d55fa7ccd32f0dba4a035089e3e11876153f4f01da2a9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9df388aaea867f0510e72e252872599254e4b6f5f3bc408a7c447843e591015"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5f9780d2241b30d98bf29296bf5a674603cee3735ced692beb278ae84b81ab2"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c3f214a510035d80573c358868b22083b3b1c81886c692f91f82956494ebb34"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f08b43cb3699912a7fb85e58e53909e69d9073b7e14f03c80bae94e01d5c0fc4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15a89507912fbf666bbd7eaef41d5a16a4c1fac26b3357a287212b58b9e80228"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd9ec1d9e66829b27c8dc5db942c0d9d49cdc7731f9d6a6686084c24654f89b6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ddcfa8ceb3ca0ae73f967816cecf46f2baf86775942cf76488e04d7393a5099"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6ada641e817d7300ccceffdafc16ba8229d3d4a2dfd7d21a70034527de28e62"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bda790a0ba0debe0eea21cada3211ef5e932542512c2f1186751b981bde8d28f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"547d7b0372b9963aca4194e86507419e69b05c7109cd0968f179500b1d5d1a95"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6079caa88a8692a4053e3f82c47d7ce744f86320692e1931381e46e6ff41dba9"},"properties":{"dependency":{"package":"undici","version":"8.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.12.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e11bcf3e253fd6ffc03e2f58db7414e6cc2b98e614934e4b0112fda5e78f0abf"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"890bdc2aa2c4f43c47ae63744a6771b154e7158841aa5f99032abf5791636ba2"},"properties":{"dependency":{"package":"undici","version":"8.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.12.2","relation":"transitive","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":"18b2bbd077d39905782d88b5e6cb2c545cc34334544c302a3698beced6f79202"},"properties":{"dependency":{"package":"stdlib","version":"1.25.10","advisory":"GO-2026-4970","aliases":["BIT-golang-2026-111943","BIT-golang-2026-27145","BIT-golang-2026-33818","BIT-golang-2026-39822","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.25.12","relation":"direct","declaredRange":"1.25.10","reachability":{"kind":"production","file":"internal/components/engram/download.go","line":275,"symbol":"http.NewRequest"}}}},{"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":"1c9c7154a9d80981a2f1da0fd0aa2e12a4e104a4411624a7aabc5ce2dd45d848"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.52.0","advisory":"GO-2026-5932","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-6303","GO-2026-6354","GO-2026-6355"],"severity":"medium","fixedVersion":"0.58.1-0.20261009181718-2f1f834330b2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76d999f7f0da1c7805a61d7a77ca6e9d78cdf7e7d953cafe7b73d81759ae1a99"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.37.0","advisory":"GO-2026-5970","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6629"],"severity":"medium","fixedVersion":"0.39.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7027f4c7213188b3d3889004a2b03606c6605778af70b649496b6ca64f995c7a"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"6ab502d37a24af91476481e38bb957e915a2c86c33dbf8e228ed487ce5da14a9"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 563 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 563 of the 805 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: internal/agents/kilocode/adapter.go. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/kilocode/adapter.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c462397a10c462ab7180e500390016bb95af5f7141c46f1fe74191d02b1ea0d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: adapter.go \u2194 dependency_tree.go: \u0060internal/agents/pi/adapter.go\u0060 and \u0060internal/tui/screens/dependency_tree.go\u0060 change together 90% of the time (18 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 \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 18 shared commits counted here, the most recent 3 are \u00607972a443\u0060 fix(pi): prevent and repair duplicate Engram declarations; \u0060c4de51f2\u0060 feat(pi): retire pi-mcp-adapter in favor of Pi built-in MCP (#5121); \u00608b72e249\u0060 chore(pi): retire rpiv-ask-user-question now that gentle-pi ships ask\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/pi/adapter.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3143194f9bc2600c015ba0b96304f7840448328204b842d150885872ffa36851"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: shell_experience_config.go \u2194 shell_experience.go: \u0060internal/tui/screens/shell_experience_config.go\u0060 and \u0060internal/tui/shell_experience.go\u0060 change together 80% of the time (8 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 8 shared commits counted here, the most recent 3 are \u006001b1a031\u0060 feat(shell): remove GGA from the Gentle Shell installer; \u0060d246b249\u0060 feat(tui): put uninstall last and label pending manage actions; \u0060a54f9be2\u0060 fix(shell): keep the TUI install path reachable \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_experience_config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dbef5606d996d9edc9ebdf3df37a458577f82ab0a5c1dd973f220538ff80bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: factory.go \u2192 validate.go, setup.go, config_scan.go: \u0060internal/agents/factory.go\u0060 changes together with 3 other files \u2014 \u0060internal/cli/validate.go\u0060, \u0060internal/components/engram/setup.go\u0060, \u0060internal/system/config_scan.go\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":"internal/agents/factory.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23b5da9085b3e39c186fcc9fe7c7b68d46caf8b376674416ef35333adc8c845"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: shell_experience_advice.go \u2194 shell_experience.go: \u0060internal/tui/screens/shell_experience_advice.go\u0060 and \u0060internal/tui/shell_experience.go\u0060 change together 79% of the time (11 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 11 shared commits counted here, the most recent 3 are \u006001b1a031\u0060 feat(shell): remove GGA from the Gentle Shell installer; \u00609b3c4e91\u0060 fix(shell): enable CodeGraph by default on Windows; \u00603a074aca\u0060 refactor(shell): remove the test-only completion preview \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_experience_advice.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c698307c73b64fbfc7f88cf2e26e99fbdc86a2e3660ace00e5cb2f41b7324d4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: compact_gate.go \u2194 prepr.go: \u0060internal/reviewtransaction/compact_gate.go\u0060 and \u0060internal/reviewtransaction/prepr.go\u0060 change together 70% of the time (7 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, 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 \u0060822b290b\u0060 fix(review): admit companion test paths in a bounded correction; \u00603d9fa076\u0060 fix(review): preserve receipts across local parent merges; \u006076593278\u0060 fix(review): bind pre-pr candidates to merge-base \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_gate.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd0431a6459b125fa91be118381d99e94a25970d6dbfc270dd4667a951f3b29"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: validate.go \u2194 config_scan.go: \u0060internal/cli/validate.go\u0060 and \u0060internal/system/config_scan.go\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 8 shared commits counted here, the most recent 3 are \u0060c5282d1c\u0060 feat(registration): wire hermes into factory, catalog, config scan, c\u2026; \u0060dcbba08e\u0060 feat(agent): add Trae IDE as first-class agent (#532); \u00609c541e2d\u0060 feat(agent): add pi support \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/validate.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d300a48689bd460592d22ff938ae5ce5a641d0e65f5d1955d16889a9edcb084"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: types.go \u2194 config_scan.go: \u0060internal/model/types.go\u0060 and \u0060internal/system/config_scan.go\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 7 shared commits counted here, the most recent 3 are \u0060855ea658\u0060 feat(agent): add Conductor workspace orchestrator support; \u0060dcbba08e\u0060 feat(agent): add Trae IDE as first-class agent (#532); \u00609c541e2d\u0060 feat(agent): add pi support \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/model/types.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b47955845ad13daf6d2b42f837de7de973399ba0a2258e8f5b52b37b394a08"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: compact_gate.go \u2194 gate.go: \u0060internal/reviewtransaction/compact_gate.go\u0060 and \u0060internal/reviewtransaction/gate.go\u0060 change together 52% of the time (14 of the 27 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; 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 \u0060fe263c32\u0060 fix(review): preserve advertised remote failures; \u00603d9fa076\u0060 fix(review): preserve receipts across local parent merges; \u006076593278\u0060 fix(review): bind pre-pr candidates to merge-base \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_gate.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66dabc8030e812f21ef133584b53bc8ce85547a5b7b1d781cd343c4e916e384"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: shell_experience_advice.go \u2194 shell_install.go: \u0060internal/tui/screens/shell_experience_advice.go\u0060 and \u0060internal/tui/shell_install.go\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 \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 7 shared commits counted here, the most recent 3 are \u006001b1a031\u0060 feat(shell): remove GGA from the Gentle Shell installer; \u00603a074aca\u0060 refactor(shell): remove the test-only completion preview; \u0060d51357f7\u0060 feat(shell): preview the completion rose from Manage \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/screens/shell_experience_advice.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba3bbbf664fa996d95afe9cbf26d374ac295c43038c7c20e06568bb1370fcfc"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Adapter (22 methods): \u0060Adapter\u0060 declares 22 methods: \u0060Agent\u0060, \u0060Tier\u0060, \u0060Detect\u0060, \u0060InstallCommand\u0060, \u0060GlobalConfigDir\u0060, \u0060SystemPromptDir\u0060, \u0060SystemPromptFile\u0060, \u0060SkillsDir\u0060, \u0060SettingsPath\u0060, \u0060SystemPromptStrategy\u0060, \u0060MCPStrategy\u0060, \u0060MCPConfigPath\u0060, \u0060SupportsOutputStyles\u0060, \u0060OutputStyleDir\u0060, \u0060SupportsSlashCommands\u0060, \u0060CommandsDir\u0060, \u0060SupportsSubAgents\u0060, \u0060SubAgentsDir\u0060, \u0060EmbeddedSubAgentsDir\u0060, \u0060SupportsSkills\u0060, \u0060SupportsSystemPrompt\u0060, \u0060SupportsMCP\u0060. Counted over the exported method specs the interface itself declares, once per name; an embedded interface is a role it composes, judged on its own declaration, and is not counted here. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/interface.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"96be5fbc6a9fb406a3f28c640ac99eeb14149a6ba997e479eefa377c29677362"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/components/opencoderuntimeplugins/testdata/released/v1.7.19/plugins/background-agents.ts\u0060 reports through \u0060console.*\u0060 at line 78 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.7.19/plugins/background-agents.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea9826b3612936b4f71deaa04074e8bd17211ab6e1943ed0df64fee633a5afd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/components/opencoderuntimeplugins/testdata/released/v1.33.2/plugins/background-agents.ts\u0060 reports through \u0060console.*\u0060 at line 98 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/opencoderuntimeplugins/testdata/released/v1.33.2/plugins/background-agents.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a04400653d8cb2f8eeff31a8ed8c3af82e4b2ddd7767c18773f40d4e0558bb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/assets/opencode/plugins/model-variants.ts\u0060 reports through \u0060console.*\u0060 at line 28 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/model-variants.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faaf1080d273c67c10918ad02f0209b3a0d0e17efb62f285b31c6d9b02c6cd5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/assets/opencode/plugins/model-variants.ts\u0060 reports through \u0060console.*\u0060 at line 64 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/model-variants.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6c477b9275558d0d947509731e8952de0fc4fe477dbde0cf957565659d0f60"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/assets/opencode/plugins/model-variants.ts\u0060 reports through \u0060console.*\u0060 at line 74 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/model-variants.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"934bb604dd299e292b3ceeda44ba8ec71c21eea5c7481adb09c4cb06982aca3f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/assets/opencode/plugins/skill-registry.ts\u0060 reports through \u0060console.*\u0060 at line 154 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/skill-registry.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"27855332577c14b4457fd4d36b6016841e7ed558b8db64d398fd2863b0bd0ef7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/assets/opencode/plugins/skill-registry.ts\u0060 reports through \u0060console.*\u0060 at line 165 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/skill-registry.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e17e245677673d7593ec1942fd0e40c3fd65361ed0985b34b2fe0a686fe792"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060internal/assets/opencode/plugins/skill-registry.ts\u0060 reports through \u0060console.*\u0060 at line 172 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/skill-registry.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfdaa6531dfff7273f7211887728502fd13333a35858ca98a5da693e8b29e21"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add gosec / govulncheck (or golangci-lint) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 12 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment automation exists and the service already exposes health probe endpoints (healthz/livez/readyz or a container healthcheck), but no manifest in this repository wires them into readiness/liveness probes, a rolling-update strategy, lifecycle hooks or a migration job \u2014 a bad release is harder to detect and reverse. If that wiring lives in a separate ops/Helm repository, document the pointer here so release safety is evidenced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 8 typed \u00B7 31 plain JS \u2014 the untyped files are e2e/complete-generated-lock-sri.test.mjs, e2e/frozen-global-materialization.test.mjs, e2e/frozen-user-lock-acquisition.test.mjs, e2e/normalize-private-optional-platform-closure.test.mjs, e2e/shared-recovery.test.mjs, e2e/shared-settings-durability.test.mjs (\u002B25 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:57 \u00B7 scripts/provision-gentle-shell-windows.mjs:47 \u2014 the two spans are one implementation copied and then locally edited \u2014 484 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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2be51e20c62227684367f5f854b825d2430f7dceb464a3f27580e7e1cab5bab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): internal/assets/opencode/plugins-v2/opencode-review-transport.ts:89 \u00B7 internal/assets/opencode/plugins/opencode-review-transport.ts:190 \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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d711a0855f6804f0a447455586e1422a83e2f4b1b49daf4fba66dcee3614117"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): internal/assets/opencode/plugins-v2/opencode-review-transport.ts:140 \u00B7 internal/assets/opencode/plugins/opencode-review-transport.ts:235 \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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d46ae18df39edb768a7a959c0b7b49a7f4624c13829fcd84a9d86d21b3a0587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): internal/assets/opencode/plugins-v2/telemetry-runtime.ts:60 \u00B7 internal/assets/opencode/plugins/telemetry-runtime.ts:50 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"internal/assets/opencode/plugins-v2/telemetry-runtime.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed3ed6df20029c2f616feb68e1c739c4136c00b4955e102d9c3f91790dac5f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:249 \u00B7 scripts/provision-gentle-shell-windows.mjs:219 \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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec8bf2cfab21415eb503c003be65e0fc02c2cdec3eb17b1b7dba6331f1242b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:944 \u00B7 scripts/provision-gentle-shell-private-global.mjs:1007 \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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"63774e7a0122fd5267800dec386d7dbcdda41ad1bdd88896e19436dea329d464"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:489 \u00B7 scripts/provision-gentle-shell-private-global.mjs:666 \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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"87823431fbf7beca8753194086b9dbcfc712012cc91f3a91df1a71f187b79ff6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): internal/assets/opencode/plugins-v2/opencode-review-transport.ts:218 \u00B7 internal/assets/opencode/plugins-v2/opencode-review-transport.ts:241 \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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd62557bb618906263bcf45ee97a236738631f7cd259e99334f6407c1158cad2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/normalize-private-optional-platform-closure.mjs:8 \u00B7 scripts/provision-gentle-shell-private-global.mjs:479 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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/normalize-private-optional-platform-closure.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8f827388f1a6d72fd38726e0787654150d45bd9508e4ba573cab9d073fc182"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:380 \u00B7 scripts/provision-gentle-shell-private-global.mjs:447 \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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb66f586a788f772756708d06a3dd7fef2469c56c5c761054d407a177fc71e58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:527 \u00B7 scripts/provision-gentle-shell-windows.mjs:324 \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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b047c0890c095ae6b14f53a055f691d56aaa4bcbe7c5be12c932abed49167b41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/provision-gentle-shell-private-global.mjs:936 \u00B7 scripts/provision-gentle-shell-private-global.mjs:968 \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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb8575803ebe960c25a56dc0e6bb52b25203aff46449db776701d84810cc595"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 38, cognitive 51): run has cyclomatic complexity 38 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins-v2/telemetry-runtime.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"149912d6f0641ec7ab4d9bd393acf00cd21f02563ddeaea8f4658837c79c23ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 27, cognitive 34): normalize has cyclomatic complexity 27 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/normalize-private-optional-platform-closure.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba688bfc59dc831cc7c1cfefad07d5f001ed532e24d8861fdf2f5995677322d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeState (cyclomatic 25, cognitive 25): nativeState has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"4631244d302ff12f393aefbfb675cc4939d910ceffadd078904e7558350fe03b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readReviewedList (cyclomatic 23, cognitive 17): readReviewedList has cyclomatic complexity 23 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"92120b4db7baca91a1ca4a7178dd60bc4552cf6202ce61b880fa9dfa7d8f4cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewedSuppliers (cyclomatic 22, cognitive 15): reviewedSuppliers has cyclomatic complexity 22 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-windows.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c22940a4346b90cc521c5334ab464913750c3215e405fd615e1238b180294e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function event (cyclomatic 20, cognitive 14): event has cyclomatic complexity 20 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/telemetry-runtime.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"37171c0b704ccb559bbb2f21e3b88bb1987e51716b09800156e7775567e5b606"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 17): (anonymous) has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad28ce8d65777b473a74d1c1b7be08e50a6aecd4fc58a5fbf534ebc3b1820ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 26): (anonymous) has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccebbe7fd83e601e7b3b7684e96d65d1b71d53d8bab0158790e4021c587387c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertCanonicalPackages (cyclomatic 18, cognitive 18): assertCanonicalPackages has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bb26f86173ff2b0ffae26b362249595e65b0825e7fa1d3bca4c6dee52c9d0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 18, cognitive 17): fixture has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/frozen-user-lock-acquisition.test.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"278328b8be28a713860844e4f49319813db681d4090ee310c4bed0b64f008f01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 17, cognitive 19): compare has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7fddfb1617668f3243bf4c58f1a7b15b1f5d30e551fb297fda634a798e06d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rootAuthorities (cyclomatic 17, cognitive 9): rootAuthorities has cyclomatic complexity 17 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-windows.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ec58b0c3aeb03246cdf6b170176b3ea1ecb20751bc579d00de1a29c2e0a9d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 16, cognitive 24): fixture has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/frozen-global-materialization.test.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7b7fa83e46064ba2b85dc30802aaade703a3da9cdda7adbe380d5b9dc52c2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graphFastPath (cyclomatic 16, cognitive 15): graphFastPath has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"986f1d701ed118b6c57c8182984ce62f83db2b12f636202c5f917c1ba0cf9074"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packages (cyclomatic 15, cognitive 27): packages has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-windows.mjs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96094feace755bc17899b16b3e5958d135b4dfebac630821831aadede576c37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 24): (anonymous) has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cad80a91dc52e62d76c7c2ec399f6d455f1d464da4ba9d61acc755be46f0416"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceMembers (cyclomatic 15, cognitive 22): sourceMembers has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"82112ffda8bb9a0b9b0b893f56e8c83fb655fa4e8b36226d08fd14b01f5814d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mainOverlayComposition (cyclomatic 14, cognitive 15): mainOverlayComposition has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-windows.mjs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"047d445458e5fabc98b5220a7c37b3518b9378faed068d7b395d18ae077432a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 14, cognitive 13): restore has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6690ca084f81b542de989da08dda0da4a09437c729f44d5ae042989f9f4edff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02c7a0718055d3d7796935f394a15ee04c23d97bfcee1a89afbb587bb8436b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshVariantsCache (cyclomatic 13, cognitive 14): refreshVariantsCache has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/model-variants.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b09a0b2a3cf17754df18fff594ea45ad7481349c85c40b0f4254d04181eacd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeReviewSessionID (cyclomatic 12, cognitive 13): decodeReviewSessionID has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6b64be15f9581ce3d7e1f2e7973f225c2114e4575df9218d4b41a6eec6c4c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completeLock (cyclomatic 12, cognitive 13): completeLock has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/complete-generated-lock-sri.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd491a32eeb684dea1c57632d171127883618f2a42a718a346d989472522a8d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tool.execute.after (cyclomatic 12, cognitive 12): tool.execute.after has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9081836dc158b2d59fb82b31e95982c3fad196eba0443f38b3d8fd07e37a359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa433f4b659be97872852ec21151a68b92cb605ec0c0a2a279ae5ac1e680dfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graphStampsEqual (cyclomatic 11, cognitive 11): graphStampsEqual has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-private-global.mjs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"91be4c54fefacd7f2cb2554e78e696cf55a7d246c995c983369fb24e88e81311"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function npmCommand (cyclomatic 11, cognitive 10): npmCommand has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-windows.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"33abb618e80337326577a449130d2df6afd6b261ee3287ab55d3cc5109ff23b3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (21 application, 0 tooling, 33 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/pirelay.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d211a86aed9bb572579ff95ada8a00f483310081f9b51c7ca48fc03c1f983e82"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (21 application, 0 tooling, 33 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/harness.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c1ca13e88717c4aa43573a604a1673433c034a4137a7ca8030902326abd7d7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rootNames\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":"e2e/frozen-global-materialization.test.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e00ebfb40e09c1a407ca0caf2367a4649aebeebd52bb9631658ae1f17e1e0eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027treeDigest\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/provision-gentle-shell-windows.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d449148fb17b294695c5e6c602dea5ee4e64993667c3cac74b592064c28684e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry.IsDir() || validateLineageID(entry.Name()) != nil\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/authority_repair.go, internal/reviewtransaction/compact_store.go. 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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0980180b012da2943130a958e7972ba2dbcb1583016c05e85be9dcd2b25e78de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!exists || entry.IsDir() != (file == nil || file.FileInfo().IsDir())\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_artifacts_windows.go, internal/shellinstaller/user_main_source_unix.go. 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":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4922ad6ce60ffa7c06d19873b9d5a267433bdc800cfd807599e05c7fcb26a62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!filepath.IsAbs(corePath) || filepath.Dir(corePath) != configDir\u0060 appears character-identically in 2 files \u2014 internal/components/agentguidance/inject.go, internal/components/agentguidance/orchestrator_module_uninstall.go. 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":"internal/components/agentguidance/inject.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab038dfd5766bb85c5e0395f61b72d0029ab22225c268ef8d3b2bc3abe4b4cac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!opened.Mode().IsRegular() || !os.SameFile(initial, opened)\u0060 appears character-identically in 2 files \u2014 internal/opencode/background_remove_unix.go, internal/opencode/background_remove_windows.go. 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":"internal/opencode/background_remove_unix.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41f653345333d884d360739572348011c4ab2b0c25ca28e0a7f1178065d9d47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!os.SameFile(before, opened) || !os.SameFile(opened, current) || !rarRepositoryOpenDirectorySafe(file, opened)\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/rar_path_safety_unix.go, internal/reviewtransaction/rar_path_safety_windows.go. 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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7599c5033aa73d5b6f8d1da0aa045a99cbd4aae0c49993af0e52a82b67c50fa8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!privateHierarchyPath(from) || !privateHierarchyPath(to)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_agent_state_unix.go, internal/shellinstaller/user_install_scope_unix.go. 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":"internal/shellinstaller/user_agent_state_unix.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd1c9a76a1d33b2061b6bfcbf4fe9ba35aae0f34f88d3228aa2bf78cb8499a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!readBackExists || !bytes.Equal(readBack, content)\u0060 appears character-identically in 2 files \u2014 internal/cli/compatibility_transaction_windows.go, internal/cli/compatibility_writer_unix.go. 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":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"664da40a8ba9ce2de4b71927b0a2661f9c66ad407dec16dac1b6eec5a371448e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!strings.HasPrefix(value, \u0022sha256:\u0022) || len(value) != len(\u0022sha256:\u0022)\u002B64\u0060 appears character-identically in 2 files \u2014 internal/cli/review_capabilities.go, internal/reviewtransaction/receipt.go. 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":"internal/cli/review_capabilities.go"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edbc8005d2032ff94d8eac7aa9b7ce70a6511edc2f70ac457251f02dcd432bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a == b || strings.HasPrefix(a, b\u002B\u0022/\u0022) || strings.HasPrefix(b, a\u002B\u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_guards_darwin.go, internal/shellinstaller/user_os_linux.go. 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":"internal/shellinstaller/user_guards_darwin.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada493221c70eab631e71a558ef9dcb23aafd276f95fac433c95cc4e7a4346f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adapter.Agent() == model.AgentOpenCode \u0026\u0026 selectedSettingsPath != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 internal/components/mcp/inject.go, internal/components/persona/inject.go. 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":"internal/components/mcp/inject.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fe0210a7f65e9e7d43dac2956f4e0b1b6545c81059cf8a3ac481fae41131e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adapter.Agent() == model.AgentOpenCode || adapter.Agent() == model.AgentKilocode\u0060 appears character-identically in 4 files \u2014 internal/cli/sync.go, internal/components/mcp/inject.go, internal/components/permissions/inject.go, internal/components/uninstall/service.go. 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":"internal/cli/sync.go"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"892ca6fa5042ed6918d398399c740ebab4844101d13aac57039bbbd29964860c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agent != model.AgentClaudeCode \u0026\u0026 agent != model.AgentCodex\u0060 appears character-identically in 2 files \u2014 internal/cli/review_provider_runtime.go, internal/components/agentguidance/orchestrator_modules.go. 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":"internal/cli/review_provider_runtime.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d475d8a0f1ff227a68c5ab0a7350e861cb33db3c4ff3f18e22665a3f3c91b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agent == model.AgentOpenCode || agent == model.AgentKilocode\u0060 appears character-identically in 3 files \u2014 internal/components/agentguidance/inject.go, internal/components/agentguidance/strict_tdd.go, internal/components/opencoderuntimeplugins/inventory.go. 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":"internal/components/agentguidance/inject.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdf2d68cf41be59f78aa17c8a4fa49b9de2a413b304d74686299ce6e5cef3c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch == \u0027*\u0027 \u0026\u0026 i\u002B1 \u003C len(raw) \u0026\u0026 raw[i\u002B1] == \u0027/\u0027\u0060 appears character-identically in 2 files \u2014 internal/components/filemerge/json_merge.go, internal/components/uninstall/cleaners.go. 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6191a28ac19e561217ae68e1ecbaef3464fb9b1d8148794c22e442807973362e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code != 0 || operationState(plan) != \u0022correction_required\u0022\u0060 appears character-identically in 2 files \u2014 scripts/crosslane/hostpi.go, scripts/crosslane/opencode.go. 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/crosslane/hostpi.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3915b29c98c1355521a9a0268062ec282182b9e605e1601c6c484b0f693594f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.reconfigure \u0026\u0026 (config.mode == \u0022separate\u0022 || config.mode == \u0022agent\u0022)\u0060 appears character-identically in 2 files \u2014 internal/tui/shell_experience.go, internal/tui/shell_platform_windows.go. 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":"internal/tui/shell_experience.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b102b428de80242c2d7dbf744dc47bbc841c80f900f4516786a8a3da0e0c0af0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx == nil || ctx.Err() != nil || validateReviewRepositoryContextBinding(binding) != nil\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/repository_context_seal.go, internal/reviewtransaction/repository_locator.go. 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":"internal/reviewtransaction/repository_context_seal.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e7a761dcbc1df0f6fd78a1e7a6766e5e79f16d6e202f836a1392150a6f2bdc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edge.PredecessorLineageID == lineage || edge.SuccessorLineageID == lineage\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/authority_disposition_plan.go, internal/reviewtransaction/compact_inspect.go. 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":"internal/reviewtransaction/authority_disposition_plan.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7815b998c9392d10a95524527e644f9581a73fb5f56d59335187ba5f6b55017"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil \u0026\u0026 !errors.Is(err, os.ErrNotExist)\u0060 appears character-identically in 3 files \u2014 internal/cli/codex_service_tier.go, internal/cli/review_mode.go, internal/tui/model.go. 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":"internal/cli/codex_service_tier.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ef6392231310a31397b64781c335da60bb6b6a67236e75d807208a319b51b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil \u0026\u0026 !reviewLastCapturedLensClosureSuperseded(store, currentRecord)\u0060 appears character-identically in 3 files \u2014 internal/cli/review_artifact.go, internal/cli/review_opencode_transport.go, internal/cli/review_provider_role_capture.go. 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":"internal/cli/review_artifact.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea784ecc944575e28ad2bc82c8aadb502bcfa97bab19968107bb69571d20e0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !bytes.Equal(payload, canonical)\u0060 appears character-identically in 4 files \u2014 internal/reviewtransaction/candidate_decline.go, internal/reviewtransaction/rar_authority_repository.go, internal/reviewtransaction/rar_plan_authority.go, internal/reviewtransaction/rdd_mode.go. 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":"internal/reviewtransaction/candidate_decline.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfe15ee921cdf251e581b306c8fbeccd3bb3bd471c3e922e6ab22c3bd56fcd1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !equalStrings(canonicalCandidate, paths)\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/correction_scope.go, internal/reviewtransaction/snapshot.go. 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":"internal/reviewtransaction/correction_scope.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4794dd962a4a52e900d78baab584151489cec783c452d76cba1a149a68c6eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !equalStrings(canonicalGenesis, genesis)\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/correction_scope.go, internal/reviewtransaction/snapshot.go. 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":"internal/reviewtransaction/correction_scope.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e69964c995a4efcc1eff2f105e2ca96a2e0a2fbdb693215a95a51e46e4f883"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !equalStrings(fixFindingIDs, state.FixFindingIDs)\u0060 appears character-identically in 3 files \u2014 internal/reviewtransaction/compact.go, internal/reviewtransaction/correction_plan_request.go, internal/reviewtransaction/targeted_validation_request.go. 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1278ab112b8cce9a441dc6623e7b40b7162443420307f009edcf9625354bdad3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !equalStrings(viewFixFindingIDs, view.FixFindingIDs) || !equalStrings(viewFixFindingIDs, fixFindingIDs)\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/correction_plan_request.go, internal/reviewtransaction/targeted_validation_request.go. 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":"internal/reviewtransaction/correction_plan_request.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"db41489d7faff16bb818d9685c4c183ef8b41ea3d45fe01aae680e813d6ae5d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !filepath.IsAbs(candidate)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_system_git_windows.go, internal/shellinstaller/user_system_go_windows.go. 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":"internal/shellinstaller/user_system_git_windows.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1569390d7279162fc3ef5dc8db64b20e3361217d05c5851e829a12fd31ea52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !os.SameFile(before, after)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_codegraph_admission_unix.go, internal/shellinstaller/user_main_custody_unix.go. 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":"internal/shellinstaller/user_codegraph_admission_unix.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8707bb143647011c376610408dabf4e6bd69406b7fb87b579eb6cd1da30d5c9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !os.SameFile(before, fresh)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_codegraph_library_unix.go, internal/shellinstaller/user_context7_stage_unix.go. 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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac574ace2240620e502b803271479e2811c789d1c8e53d83fbbca8f0738d6e26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !os.SameFile(before, opened)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_experience_stage_windows.go, internal/shellinstaller/user_retained_source_unix.go. 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":"internal/shellinstaller/user_experience_stage_windows.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23f389908c129007892d4e817c8bc575308782bc31c6c1db2075037be29621f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !os.SameFile(identity, fresh)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_experience_stage_unix.go, internal/shellinstaller/user_main_source_unix.go. 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":"internal/shellinstaller/user_experience_stage_unix.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7d92d28dbd72bf8be0054e83e1c3303d6a786cf7d492c5e071017cf041e14b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !os.SameFile(identity, opened)\u0060 appears character-identically in 6 files \u2014 internal/shellinstaller/user_codegraph_executable_unix.go, internal/shellinstaller/user_codegraph_library_unix.go, internal/shellinstaller/user_context7_stage_unix.go, internal/shellinstaller/user_experience_private_unix.go. 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":"internal/shellinstaller/user_codegraph_executable_unix.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"575056db8044b78c75399f11af748a734a2110a70319cb371700674760b53beb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || int64(len(data)) != info.Size()\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_agent_rollback_unix.go, internal/shellinstaller/user_shell_agent_unix.go. 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":"internal/shellinstaller/user_agent_rollback_unix.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7f684991617d43244a8918e6c4be66601a7622a17e5183965b4828ce4c23d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || lease.Validate(ctx) != nil\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/repository_context_seal.go, internal/reviewtransaction/repository_locator.go. 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":"internal/reviewtransaction/repository_context_seal.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"093347f2dc869c19a2b55f4bc8e9469c04e4cd4e97ddd4c7a3caa114d0b94862"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || len(batch) \u003E telemetry.RuntimeMaxBytes\u0060 appears character-identically in 2 files \u2014 internal/components/telemetryruntime/claude.go, internal/components/telemetryruntime/codex.go. 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":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d07aac8ca4790aea4166bf5560a52700b2b57877f93f7afbc67a76ab91c63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || len(words) \u003C 2 || words[0] != \u0022gentle-ai\u0022\u0060 appears character-identically in 2 files \u2014 scripts/crosslane/battery.go, scripts/crosslane/host.go. 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/crosslane/battery.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f7c1c30ef3e904c5ffa399b590497196c7abceb5a7b6de3a47d6aa3e092619"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || rel == \u0022..\u0022 || strings.HasPrefix(rel, \u0022..\u0022\u002Bstring(filepath.Separator))\u0060 appears character-identically in 2 files \u2014 internal/components/legacyassets/sdd_assets.go, internal/components/uninstall/service.go. 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":"internal/components/legacyassets/sdd_assets.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"569310befbd6273b5403f99b253163c436fdbbc12184976348f3b013a9f352f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || relative == \u0022.\u0022 || filepath.IsAbs(relative) || relative == \u0022..\u0022 || strings.HasPrefix(relative, \u0022..\u0022\u002Bstring(filepath.Separator)\u2026\u0060 appears character-identically in 3 files \u2014 internal/cli/compatibility_skills.go, internal/cli/compatibility_transaction_windows.go, internal/cli/compatibility_writer_unix.go. 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":"internal/cli/compatibility_skills.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08cf2c838731eba731f9f9015f2f45f89cf07b40293c0517e71d2893697426a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || relative == \u0022..\u0022 || strings.HasPrefix(relative, \u0022..\u0022\u002Bstring(filepath.Separator)) || filepath.IsAbs(relative)\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/rar_path_safety.go, internal/reviewtransaction/repository_locator.go. 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":"internal/reviewtransaction/rar_path_safety.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e63b8eceb7742837a1ffd272c2af724df01b7514108df7c2ea33ef77fc299"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || req.Confirmation != confirmation\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_install_flow_unix.go, internal/shellinstaller/user_native_install_linux.go. 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2212f9e2544504b0fb52a045b110fe608f6dcb5a189a525f1696c9ebf84d8b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err == nil \u0026\u0026 filepath.Clean(homeDir) == filepath.Clean(userHome)\u0060 appears character-identically in 5 files \u2014 internal/agents/opencode/paths.go, internal/agents/pi/adapter.go, internal/agents/trae/adapter.go, internal/agents/vscode/adapter.go. 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":"internal/agents/opencode/paths.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"407b2027fe189e35390b9ff409566fa29440e5f9742b50140e1696f126bb523e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err == nil \u0026\u0026 rel != \u0022.\u0022 \u0026\u0026 rel != \u0022..\u0022 \u0026\u0026 !strings.HasPrefix(rel, \u0022..\u0022\u002Bstring(filepath.Separator)) \u0026\u0026 !filepath.IsAbs(rel)\u0060 appears character-identically in 3 files \u2014 internal/backup/restore.go, internal/cli/codex_home.go, internal/components/uninstall/service.go. 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":"internal/backup/restore.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c9e8cd65bc69b493f6d0cbd1747186535a8041d19bd8cf23d044d62fddd256"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err == nil \u0026\u0026 rel != \u0022..\u0022 \u0026\u0026 !strings.HasPrefix(rel, \u0022..\u0022\u002Bstring(filepath.Separator))\u0060 appears character-identically in 2 files \u2014 internal/cli/codegraph.go, internal/components/communitytool/pi_codegraph.go. 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":"internal/cli/codegraph.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"980c3a93a62c1616f0f97a105ea493918ba75dc48f81c2b46740e51abf211816"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060exists \u0026\u0026 bytes.Equal(existing, content)\u0060 appears character-identically in 2 files \u2014 internal/cli/compatibility_transaction_windows.go, internal/cli/compatibility_writer_unix.go. 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":"internal/cli/compatibility_transaction_windows.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e1cbc05e0c50155c3167105f6a89e73f6a007f7cf1f52fd8227ddc031ea804"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filepath.Base(hdr.Name) == binaryName \u0026\u0026 (hdr.Typeflag == tar.TypeReg || hdr.Typeflag == tar.TypeRegA)\u0060 appears character-identically in 2 files \u2014 internal/components/engram/download.go, internal/update/upgrade/download.go. 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":"internal/components/engram/download.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ecccbd3934a0c0fc4ccbd71058869bd3b2c63504f0ecb7c83a0240a658d12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hook.HookEventName != \u0022Stop\u0022 \u0026\u0026 hook.HookEventName != \u0022SubagentStop\u0022\u0060 appears character-identically in 2 files \u2014 internal/components/telemetryruntime/claude.go, internal/telemetry/runtime_claude.go. 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":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"901c323feb3e3b1376c76bdde41edb498a8d4cd3f2627c57358043e1d7238ef1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input == nil || input[\u0022capture_operation\u0022] != \u0022review.capture-result\u0022\u0060 appears character-identically in 5 files \u2014 scripts/crosslane/advisory.go, scripts/crosslane/hostopencode.go, scripts/crosslane/hostpi.go, scripts/crosslane/opencode.go. 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/crosslane/advisory.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7287df014f63a2efe93f5c9aec339a02c667971855eb2f543c9cebde5967c42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.String() == \u0022ctrl\u002Bc\u0022 || key.String() == \u0022esc\u0022\u0060 appears character-identically in 2 files \u2014 internal/cli/shell_install_model_other.go, internal/cli/shell_install_model_windows.go. 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":"internal/cli/shell_install_model_other.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"94345898cd8647f1e424eea9d46753c3e4dbb4f6189fb414f69d16167985404f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.Type == tea.KeyBackspace \u0026\u0026 len(*field) \u003E 0\u0060 appears character-identically in 2 files \u2014 internal/cli/shell_install_model_other.go, internal/cli/shell_install_model_windows.go. 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":"internal/cli/shell_install_model_other.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c59a697b57becc3d9207e989e2eeca5f3a002957e9f9dbd1adae7e87149710e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.Type == tea.KeyEsc || key.Type == tea.KeyCtrlC\u0060 appears character-identically in 2 files \u2014 internal/tui/shell_experience.go, internal/tui/shell_install.go. 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":"internal/tui/shell_experience.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a458479a9b30f46fb8ae9905eff22b093d1d2675c20a67d5ae4213139712613"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.Type == tea.KeyRunes || key.Type == tea.KeySpace\u0060 appears character-identically in 2 files \u2014 internal/cli/shell_install_model_other.go, internal/tui/shell_install.go. 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":"internal/cli/shell_install_model_other.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a419791188d1c2b345e17b39798de1476b5665e3d943d9d68a67dd6fe90ac4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(a) \u003C len(b) || len(a) == len(b) \u0026\u0026 a \u003C b\u0060 appears character-identically in 2 files \u2014 internal/agents/codex/runtime_version.go, internal/opencode/background.go. 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":"internal/agents/codex/runtime_version.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc159b9ceef30f9b2063e424a59f2723cf7f06cc7cce44d56be6ebf8dbce765"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(agents) == 1 \u0026\u0026 agents[0] == model.AgentPi\u0060 appears character-identically in 2 files \u2014 internal/cli/validate.go, internal/tui/model.go. 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":"internal/cli/validate.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b943c4ba135a8acd0e4fb44a827c9b2f02d3545c1953d6f9e95d46008a8f86d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(payload) == 0 || len(payload) \u003E rarAuthorityMaxBytes\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/rar_authority_repository.go, internal/reviewtransaction/rar_path_safety.go. 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":"internal/reviewtransaction/rar_authority_repository.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd7b45530c5dde4b6934e87ef5f67d2a907a9b84a7c9c5e8caa496521085f58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line == \u0022\u0022 || strings.HasPrefix(line, \u0022#\u0022)\u0060 appears character-identically in 3 files \u2014 internal/components/gga/provider.go, internal/reviewtransaction/snapshot.go, internal/system/detect.go. 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":"internal/components/gga/provider.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9cdeb2337df3e780bd9b17db67605443c2d7b6f0aea071932b1b16f2c0c70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest.Mode != \u0022separate\u0022 \u0026\u0026 manifest.Mode != \u0022shared\u0022 \u0026\u0026 manifest.Mode != \u0022agent\u0022\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_install_flow_unix.go, internal/shellinstaller/user_shell_registry_unix.go. 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a926bdab186cd58213f72f62b45624815944c44e0fbee27abf4c11990b0ac147"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest.Mode == \u0022separate\u0022 \u0026\u0026 manifest.Agent != filepath.Join(root, \u0022agent\u0022)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_main_bindings_unix.go, internal/shellinstaller/user_pnpm_manifest_linux.go. 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":"internal/shellinstaller/user_main_bindings_unix.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f1200733e69de82f4388036bb820618c92c15f81eab25b3dbd81f24b362f0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next == \u0027 \u0027 || next == \u0027\\t\u0027 || next == \u0027\\n\u0027 || next == \u0027\\r\u0027\u0060 appears character-identically in 2 files \u2014 internal/components/filemerge/json_merge.go, internal/components/uninstall/cleaners.go. 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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f957cf8175a7a79d1b7560d4f5318742c78ccce374604934cda5709590d263"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.ZDotDir != \u0022\u0022 \u0026\u0026 !samePath(options.ZDotDir, homeDir, options.OS)\u0060 appears character-identically in 2 files \u2014 internal/opencode/background_profile.go, internal/opencode/background_readiness.go. 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":"internal/opencode/background_profile.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66847dd5b2289220debcb8ad879a53dfcce61b3a557644fcb1774df769c7798"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.IsNotExist(err) || errors.Is(err, syscall.ENOTDIR)\u0060 appears character-identically in 3 files \u2014 internal/backup/snapshot.go, internal/components/agentguidance/orchestrator_module_uninstall.go, internal/components/legacyassets/sdd_runtime_files.go. 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":"internal/backup/snapshot.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"242ad6cfa1e2812d7304e60a0b1ab64476a20af6a7be27c830df4f0a86bbc054"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.overflow || !utf8.Valid(output.data)\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_install_darwin.go, internal/shellinstaller/user_runtime_primitives_unix.go. 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":"internal/shellinstaller/user_install_darwin.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee48d23f26ff75644c8062b63a67cddd0935816f5899b6f993215736354277c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part == \u0022\u0022 || part == \u0022.\u0022 || part == \u0022..\u0022\u0060 appears character-identically in 3 files \u2014 internal/releasepolicy/policy.go, internal/reviewtransaction/rar_path_safety.go, internal/reviewtransaction/repository_locator.go. 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":"internal/releasepolicy/policy.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5aa5dc255dfb6e77201d2f098d86b017c8f98fb6cd8538d025c549b932c21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile != nil \u0026\u0026 profile.SDKSource == \u0022main-preview\u0022\u0060 appears character-identically in 3 files \u2014 internal/shellinstaller/user_install_stage_unix.go, internal/shellinstaller/user_selection_windows.go, internal/shellinstaller/user_shell_agent_unix.go. 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":"internal/shellinstaller/user_install_stage_unix.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b411921ad2776669711dd8746ccd430d9ef6045cce34641621900279a557585"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile == nil || profile.CodeGraph != \u0022on\u0022\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_codegraph_library_unix.go, internal/shellinstaller/user_codegraph_windows.go. 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":"internal/shellinstaller/user_codegraph_library_unix.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"72696e2d24418a2db49ded492c1a12c7e3b0991c8dd44aae8230b20ea925d50d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.OS == \u0022linux\u0022 \u0026\u0026 !profile.NpmWritable\u0060 appears character-identically in 5 files \u2014 internal/agents/codex/adapter.go, internal/agents/copilotcli/adapter.go, internal/agents/gemini/adapter.go, internal/agents/qwen/adapter.go. 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":"internal/agents/codex/adapter.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2072207fc137b9aed804837eb92191d1b3e5a2724401eb2d1906079116d6b8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rarPathUnsafe(path, before) || !before.IsDir()\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/rar_path_safety_unix.go, internal/reviewtransaction/rar_path_safety_windows.go. 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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ddf03c68efe05b96db816f582b101ef1a2a52f0b622f6591298598076bd0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060readErr != nil \u0026\u0026 !errors.Is(readErr, os.ErrNotExist)\u0060 appears character-identically in 2 files \u2014 internal/app/selfupdate.go, internal/tui/model.go. 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":"internal/app/selfupdate.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"da02ebf3d9978cdf34a86671e7ef5d7cd0024cf0a8c95ba7cd22b6e22620055e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060readErr != nil \u0026\u0026 !os.IsNotExist(readErr)\u0060 appears character-identically in 3 files \u2014 internal/components/communitytool/pi_codegraph.go, internal/components/opencodedefault/ownership.go, internal/components/opencodeplugin/plugin.go. 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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd1df013a51b857b1fee5ffd034ea1d7deb8be07e9523b0b307614bfcb02b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.PreviousRevision != \u0022\u0022 \u0026\u0026 !validSHA256(record.PreviousRevision)\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/rdd_mode.go, internal/reviewtransaction/store.go. 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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"352829626a1cd98bf5cd9c3ad9d9f4bd88be85a9db1aa29536a30b85a67be875"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.Experience != nil \u0026\u0026 req.Experience.CodeGraph == \u0022on\u0022\u0060 appears character-identically in 3 files \u2014 internal/shellinstaller/user_install_flow_unix.go, internal/shellinstaller/user_install_windows.go, internal/shellinstaller/user_native_coordinate_linux.go. 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6602aa698c4a2a948bb29a71a0b9e3e03a759ead6530092232b9d04540e0c310"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.Experience != nil \u0026\u0026 req.Experience.Context7 != \u0022\u0022\u0060 appears character-identically in 3 files \u2014 internal/shellinstaller/user_install_flow_unix.go, internal/shellinstaller/user_install_scope_unix.go, internal/shellinstaller/user_install_windows.go. 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac038101f3a83231dc67be8eb46c792c9d6770f78a4126736c9d072d93176ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.Experience != nil \u0026\u0026 req.Experience.SDKSource == \u0022main-preview\u0022\u0060 appears character-identically in 3 files \u2014 internal/shellinstaller/user_install_windows.go, internal/shellinstaller/user_main_bindings_unix.go, internal/tui/screens/shell_experience.go. 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":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6823f0e75e9a516fb6d9b2b65ef3e763dfeec7c3d583f7d13413f59580dfa0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.Experience != nil \u0026\u0026 userReconfigureTarget() == req.Destination\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_install_flow_unix.go, internal/shellinstaller/user_native_coordinate_linux.go. 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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba2ca52467f54bf85f35dee2ed567a322c2856daae7dafe1a3a26e9332c4f23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.ChangedFiles \u003C 0 || result.ChangedLines \u003C 0\u0060 appears character-identically in 2 files \u2014 internal/cli/review_consent_contract.go, internal/cli/review_start_contract.go. 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":"internal/cli/review_consent_contract.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb36016cd769ea20a72819b7ad76bf01c4dba424870583d6b34c4432eeedc756"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.Findings == nil || result.Evidence == nil\u0060 appears character-identically in 2 files \u2014 internal/cli/review_provider.go, internal/reviewtransaction/reviewer_envelope.go. 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":"internal/cli/review_provider.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3366abc192cd2cb695064d4ae74faf2a50ac10607cd468e97030c77f63a6c0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.Projection != reviewtransaction.ProjectionWorkspace \u0026\u0026 result.Projection != reviewtransaction.ProjectionStaged\u0060 appears character-identically in 2 files \u2014 internal/cli/review_consent_contract.go, internal/cli/review_start_contract.go. 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":"internal/cli/review_consent_contract.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f475acaf7eb2954c6d70ca5451a52b32f8392344b1a79e9afde2ca1c86fc73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.ToolName == \u0022gentle-ai\u0022 \u0026\u0026 result.Status == upgrade.UpgradeSucceeded\u0060 appears character-identically in 2 files \u2014 internal/tui/model.go, internal/tui/screens/upgrade.go. 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":"internal/tui/model.go"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d9006f3ba308860d981370ffac4aadc0428db69b6370b12d5bb8692b361974"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scope.reused[UserComponentCodeGraph] \u0026\u0026 req.Experience != nil \u0026\u0026 req.Experience.CodeGraph == \u0022on\u0022\u0060 appears character-identically in 4 files \u2014 internal/shellinstaller/user_codegraph_windows.go, internal/shellinstaller/user_install_flow_unix.go, internal/shellinstaller/user_install_scope_unix.go, internal/shellinstaller/user_install_scope_windows.go. 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":"internal/shellinstaller/user_codegraph_windows.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd56cc3d4e5aeaa493c71787388335bf6513b0fe68dc6fb61b5cf55f2aaba711"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start == -1 || end == -1 || end \u003C= start\u0060 appears character-identically in 2 files \u2014 internal/components/filemerge/section.go, scripts/gen-sdd-agent-digests/assets.go. 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":"internal/components/filemerge/section.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15f2da131dd92fb02fd26f260399a566c979648cb2c7e3385532118071e9162"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.Recovery == nil || state.Recovery.Evidence == nil\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/compact.go, internal/reviewtransaction/compact_recovered_evidence.go. 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bb6c19cbb76d515699c439473d37eb704f5ab329b2495e92549d8018e50f27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.State != StateCorrectionRequired || state.ProposedCorrectionLines == nil\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/compact.go, internal/reviewtransaction/compact_reviewer_capture.go. 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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e55cef79e36e92832c2090c23787dfb1b1b808eea304abd7538128e7ee85b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.State == StateCorrectionRequired \u0026\u0026 state.CorrectionAttemptConsumed()\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/target_status.go, internal/reviewtransaction/targeted_validation_request.go. 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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"614e519f98c40184cb4c12426d1d863db873a015b5f507dd74e9131d8059f514"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(source, \u0022npm:gentle-pi\u0022) || source == packageRoot\u0060 appears character-identically in 2 files \u2014 internal/shellinstaller/user_install_preview.go, internal/shellinstaller/user_shell_agent_unix.go. 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":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7becf8b765b2d9a5a72b7740945e82b768117825cd9c7192bca62f719fa3b22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(trimmed, key\u002B\u0022 \u0022) || strings.HasPrefix(trimmed, key\u002B\u0022=\u0022)\u0060 appears character-identically in 2 files \u2014 internal/components/filemerge/toml.go, internal/components/uninstall/cleaners.go. 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":"internal/components/filemerge/toml.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe291319e7442cedb84d65b4face0034af7161a57afea1b7abaefa7b986ec31"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.TrimSpace(request.Reason) == \u0022\u0022 || strings.TrimSpace(request.Actor) == \u0022\u0022\u0060 appears character-identically in 3 files \u2014 internal/reviewtransaction/compact_abandon.go, internal/reviewtransaction/compact_reclaim.go, internal/reviewtransaction/legacy_alias_repair.go. 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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc291d262107eacff513cad65d53243e782dbf5694e6a118c0b861a8fd09013"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subject == \u0022\u0022 || strings.TrimSpace(reason.Path) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 internal/cli/review_consent_contract.go, internal/cli/review_mode.go. 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":"internal/cli/review_consent_contract.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f823f86b7459ba1869595f59f88eb9ecf09e6e86b1a72a3382f6bbcb6f07517c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unicode.IsPrint(runes[0]) \u0026\u0026 runes[0] != \u0027j\u0027 \u0026\u0026 runes[0] != \u0027k\u0027\u0060 appears character-identically in 2 files \u2014 internal/tui/screens/codex_model_picker.go, internal/tui/screens/model_picker.go. 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":"internal/tui/screens/codex_model_picker.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2082fa6e156a349d10bac136615f852513242cfca0f53c0030dcab0b196e4c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v == \u0022\u0022 || v == \u0022dev\u0022 || strings.HasPrefix(v, \u00220.0.0-dev\u0022)\u0060 appears character-identically in 2 files \u2014 internal/telemetry/opportunistic.go, internal/telemetrycollector/event.go. 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":"internal/telemetry/opportunistic.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2fca8434655176534c4fcf408e1c470de05b536b88d6f7d58590866807f9b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060validation.OriginalCriteria.Passed \u0026\u0026 validation.CorrectionRegression.Passed\u0060 appears character-identically in 2 files \u2014 internal/cli/review_provider_roles.go, internal/reviewtransaction/compact_reviewer_capture.go. 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":"internal/cli/review_provider_roles.go"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"43042fa5da00b855ad7d06aa294be596a1e9b01208713bd39ea2c9ee6614c8a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060version.mode == \u0022\u0022 || version.mode == \u0022000000\u0022\u0060 appears character-identically in 2 files \u2014 internal/reviewtransaction/risk.go, internal/reviewtransaction/verification_contract.go. 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":"internal/reviewtransaction/risk.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"763ac0bdcbf29c2906d7e199fa23c6d9421c9ae2bb14cb7c4c038cf52ef22ddd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!frame || typeof frame !== \u0022object\u0022 || Array.isArray(frame)\u0060 appears character-identically in 2 files \u2014 internal/assets/opencode/plugins-v2/opencode-review-transport.ts, internal/assets/opencode/plugins/opencode-review-transport.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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"97633c3758e455da5496defda1598cbc622e386518b117d5296bb19e57ab49ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!semver.test(version) || entry === null || typeof entry !== \u0027object\u0027 || Array.isArray(entry) || Object.keys(entry).sort().join(\u0027,\u0027) !== \u0027bin\u2026\u0060 appears character-identically in 2 files \u2014 scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced62de2ea75a9ff941309e22c267f4ab5904466b566c750d95737b9ff780412"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.operation === TRANSPORT.Prompt \u0026\u0026 typeof frame.nonce === \u0022string\u0022 \u0026\u0026 frame.nonce !== \u0022\u0022 \u0026\u0026 typeof frame.prompt === \u0022string\u0022 \u0026\u0026 frame.p\u2026\u0060 appears character-identically in 2 files \u2014 internal/assets/opencode/plugins-v2/opencode-review-transport.ts, internal/assets/opencode/plugins/opencode-review-transport.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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"474c04770a2056605a212b8596f17d16dfb7931ae0a2aab34e49b1e058de3717"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.operation === TRANSPORT.Result \u0026\u0026 typeof frame.output === \u0022string\u0022 \u0026\u0026 frame.output !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 internal/assets/opencode/plugins-v2/opencode-review-transport.ts, internal/assets/opencode/plugins/opencode-review-transport.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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4180c74c8e600b49fa5de2d04bfa452a7662938416cad5b37b939004cfd73a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060list === null || typeof list !== \u0027object\u0027 || Array.isArray(list) || list.schema !== \u0027gentle-shell-reviewed-suppliers/v1\u0027 || list.releases ==\u2026\u0060 appears character-identically in 2 files \u2014 scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c159d5eb2b546372a67d5aff5d16c295b75a0ba20053a2545723321f52f262"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name !== \u0027node_modules\u0027 \u0026\u0026 !(gentle \u0026\u0026 name === \u0027.gentle-ai\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa90b58dfe661bf64918a14d8193d0bd13b88c80e61dedabc0447b7b8a0fc93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name === \u0027.bin\u0027 || name === \u0027.package-lock.json\u0027\u0060 appears character-identically in 2 files \u2014 scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"519c8c2dab4111c40db96bae664d588ebeaa678a0d93092cfeafb8c88453c7c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pin \u0026\u0026 locked === pin \u0026\u0026 installed === pin\u0060 appears character-identically in 2 files \u2014 scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0cba11143618877779f4ac5e269b03b206bbf471c62353cb6b2db41ea75707"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relays.get(key) === deferredTo || deferredTo.completing\u0060 appears character-identically in 2 files \u2014 internal/assets/opencode/plugins-v2/opencode-review-transport.ts, internal/assets/opencode/plugins/opencode-review-transport.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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"39777585c6d817e0b3bc9697854d5d6d67e6c7277de078ae835d154e992ce20b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060truthy(process.env.DO_NOT_TRACK) || process.env.GENTLE_AI_TELEMETRY === \u00220\u0022 || truthy(process.env.CI) || truthy(process.env.GITHUB_ACTIONS)\u0060 appears character-identically in 2 files \u2014 internal/assets/opencode/plugins-v2/telemetry-runtime.ts, internal/assets/opencode/plugins/telemetry-runtime.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":"internal/assets/opencode/plugins-v2/telemetry-runtime.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9929ef14de05ce22a7c29fadd03b953f7cedb4861d48ab087ea600fba2b504e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof downloads?.artifactFor !== \u0027function\u0027 || typeof downloads.verifiedDownload !== \u0027function\u0027 || typeof bundled?.engramExecutable !== \u0027fu\u2026\u0060 appears character-identically in 2 files \u2014 scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/provision-gentle-shell-private-global.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab58b371f74e004cbf65a8bd1b750df87824e75f2487d9d80d013b19ca8ab02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 \u0026\u0026 /^sha512-[A-Za-z0-9\u002B/]{86}==$/.test(value) \u0026\u0026 Buffer.from(value.slice(7), \u0027base64\u0027).toString(\u0027base64\u0027) === valu\u2026\u0060 appears character-identically in 3 files \u2014 scripts/complete-generated-lock-sri.mjs, scripts/provision-gentle-shell-private-global.mjs, scripts/provision-gentle-shell-windows.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/complete-generated-lock-sri.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"585d18426cfad8071a70beb772dfc0c5be31fc1a23867ce9395429bdc6fff0ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shell[\u0022status\u0022] == \u0022running\u0022 and time.monotonic() \u003C deadline\u0060 appears character-identically in 2 files \u2014 scripts/opencode_v2_loopback.py, scripts/test-opencode-v2-host.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/opencode_v2_loopback.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda72d40003ee61d364f254ade44f71d157e95e16f403a475cceaecc17a73256"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060configureShellExperience\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060GENTLE_AI_RECONFIGURE_TARGET\u0060 environment variable (set at line 257, cleared at line 259) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, so anything that leaves the body in between \u2014 an error, an early return, a crash \u2014 skips it: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or configuration read in ANY code resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory and the environment are per-process, so every concurrent thread or Go process in it sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: give the child its own directory and environment (\u0060exec.Cmd.Dir\u0060, \u0060exec.Cmd.Env\u0060), or build absolute paths with \u0060filepath.Join\u0060. Where the global genuinely must move, put the restore in a \u0060defer\u0060 right after the change, so it runs on every return and on a panic."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_experience.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3e0348857bfc0236273f41ad9b9528a2a58f84117890b83600b0ea72408f7d"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060launchShellInstall\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060GENTLE_AI_MAIN_FALLBACK\u0060 environment variable (set at line 132, cleared at line 134) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, so anything that leaves the body in between \u2014 an error, an early return, a crash \u2014 skips it: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or configuration read in ANY code resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory and the environment are per-process, so every concurrent thread or Go process in it sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: give the child its own directory and environment (\u0060exec.Cmd.Dir\u0060, \u0060exec.Cmd.Env\u0060), or build absolute paths with \u0060filepath.Join\u0060. Where the global genuinely must move, put the restore in a \u0060defer\u0060 right after the change, so it runs on every return and on a panic."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3033c42661b5ef3fe6d3ba3c9ef87ed14eba9be4772400b1f14375e6825aaf00"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060finishShellInstallSelection\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060GENTLE_AI_RECONFIGURE_TARGET\u0060 environment variable (set at line 915, cleared at line 917) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, so anything that leaves the body in between \u2014 an error, an early return, a crash \u2014 skips it: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or configuration read in ANY code resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory and the environment are per-process, so every concurrent thread or Go process in it sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: give the child its own directory and environment (\u0060exec.Cmd.Dir\u0060, \u0060exec.Cmd.Env\u0060), or build absolute paths with \u0060filepath.Join\u0060. Where the global genuinely must move, put the restore in a \u0060defer\u0060 right after the change, so it runs on every return and on a panic."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/shell_install.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae790a71a282eb437e51c9ed240f2db958fadb5ef029b52fabe403554f56d8e"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context: Only 20/24 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a cancelled request, a shutdown, an expired deadline. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it (\u0060http.NewRequestWithContext\u0060, \u0060DialContext\u0060); where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"faab330444baf00d50193f250b5c9b514f84cdca16c24014ef3776329847910c"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: fetchLatestEngramVersionRequest: \u0060fetchLatestEngramVersionRequest\u0060 calls \u0060http.NewRequest(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea35d727db2feeeed4b64a0a689a27019ac0fd8d74104edd09e84654d4c736ce"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: fetchLatestEngramVersionWithAssets: \u0060fetchLatestEngramVersionWithAssets\u0060 calls \u0060http.NewRequest(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c5a44b5645ab178320408d3be035aa1ca0899cb927fd1e6a756c2ccbe047b"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: downloadAndExtractTarGz: \u0060downloadAndExtractTarGz\u0060 calls \u0060http.NewRequest(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd8f20a13bcf4efdaa00fe5c57e85946be4d915763e7709a28248ba4164225"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: downloadAndExtractZip: \u0060downloadAndExtractZip\u0060 calls \u0060http.NewRequest(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1e3421134bb16d0dd3cae9d2af1e9b1181e2434111fa2b15709c07eee50ca0"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060lineStart\u0060 is the result of a search that answers -1 when nothing is found, and \u0060content[lineStart:start]\u0060 uses it as a bound with no test of \u0060lineStart\u0060 in between. When the search misses, the bound is -1 and the access panics with \u0060slice bounds out of range\u0060. Test \u0060lineStart \u003C 0\u0060 (or use \u0060strings.Cut\u0060) before using it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0073a5e95bc3cef533a92d27cb32730bf6beacf2fc52d67dbeb729ea111ac6b3"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060floorMatch\u0060 holds what \u0060FindStringSubmatch\u0060 returns, and \u0060floorMatch[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(floorMatch)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c2348e6a6329e087c47005900e17cbdf6bc78f7b01695da03c19851d1b133a"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060floorMatch\u0060 holds what \u0060FindStringSubmatch\u0060 returns, and \u0060floorMatch[2]\u0060 takes element 2 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(floorMatch)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2821e1c0b26e1c748f31bd549059d502b6b58906a95f428ca8b5064324af85d"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060floorMatch\u0060 holds what \u0060FindStringSubmatch\u0060 returns, and \u0060floorMatch[3]\u0060 takes element 3 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(floorMatch)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a080ec416e741d7d8e48ee95555b7c8c0375067cc16d53962926d1a1d7cc650c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060n, _ := strconv.Atoi(parts[i])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060n\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060n\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060n\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/check.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d9b8d508e4ca1dba5afb33624bbe67ced1ade8484cb30ddb6d2b739628fae2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/detect.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b86c6245049936eb47bd8ad65194fe558c9e24ea22a0775715add86919e4061"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := detectCtx.Err(); err != nil\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":"internal/update/detect.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1c51acd033ae0b0cb99070a41a8826cad29ce1c25b353a45a94f396a1549f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := cmd.Start(); err != nil\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":"internal/update/detect.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74d67e69c2fba54713899bd23589259def810fb7f2554e48e76d68822fbfcbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/homebrew.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4956734ad04eb9474d78ba005041135f9ea5efe91fcb2ade437d2165e82c20d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/module_path.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8fb086d14d97e4a5d7cf9df5dec1e4862181957531ce3b58cabda0bb195474"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/homebrew.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6ef2ecf09bfc0bbc2c629aedbfd9cd0b14bd64c9ced94a2cc0dbbd41069c4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/scoop.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d48ec1f190a0b8800e6cda3371dcf1ec2da48817f27ea9225f5ad08f1f47a67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/scoop.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aa2edf37c333617ca84b7acb52dc0673d771afbdccff77b487d38bf66072a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/scoop.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59f760f39859f013dec88ab1f773062b0e27cab573b07c50b29d8e4bd2afd89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/scoop.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e175b7782d95deec7b68ca1b246579362b6a37d9d52b5575f4ae32347d58710"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/strategy.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1e2a549e5f7cdd773e4a29207496490f89ec3904c4f633b75698e76bcc6862"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/update/upgrade/strategy.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec5792d54c6c20f5011b4112ffc91d41b4ad025a9dc8f05a45f07df4a1b72b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/model.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af03d1a3d277737bbb78cf0bdc591dc0a19f2b65265a7057355533ec575ef67"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060home, _ := os.UserHomeDir()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060home\u0060 as if the call succeeded. When \u0060os.UserHomeDir\u0060 fails, \u0060home\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060home\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"63acd815c0b705c6a1c95d0885e99da14fb05380a1d840354f0f17b01891d7b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/model.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf27a97554b4a84c8d47a21e64b19cb3ecd88481b5d3bfef1fdd439f3666405"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060workspaceDir, _ := osGetwdFn()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060workspaceDir\u0060 as if the call succeeded. When \u0060osGetwdFn\u0060 fails, \u0060workspaceDir\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060workspaceDir\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/model.go"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c785eb2a94dae213ad22dd111becd7e91660b08dd607ef547a8dd3fb6b2c58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/model.go"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb567ec5123fe983153b09a54367350ae23f5512977ed193b9bb3fee9ff31ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060major, _ := opencode.DetectRuntimeMajor(context.Background())\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060major\u0060 as if the call succeeded. When \u0060opencode.DetectRuntimeMajor\u0060 fails, \u0060major\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060major\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tui/opencode_presentation.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9c08f1ef8abe3b078625b8fc6106eb0dfe26dfabddfeada6f908855913faff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/shell_experience.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99d4bc53c756fd2d4975a58d0ff30093425da07634f73c01adc4fe05d02f5a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/shell_experience.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"094aa3d03ef03644469318e7d40419b9319f8184ce3400f1d4c769e11dc9acf8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := os.Setenv(shellinstaller.RootRiskEnv, shellinstaller.RootRiskBinding); err != nil\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":"internal/tui/shell_install.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"295eac09eaedd77fbf7fdaaa9e20601d838558021e49a159b3a3deda24c24165"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/shell_install.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"274abd490599109b5d5cd919a967f7f98e1826aa2a907ac4751cf4b5d6daee8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tui/screens/model_picker.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"db18a8c92f60d01157abcf52249320dada71af418291a29057228f0a420bfcf4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/telemetrycollector/handlers.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c73c4ccc53b28aa03fc81cca2e9535f11cddaaede89e844532c5e423938d67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026f); err != nil\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":"internal/telemetrycollector/metrics.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac773e9617b4f1cb74a0ca773ed59935994bbedca9eb3c01a85cd47a0f6195b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/telemetry/counters.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fa849f996474f035e67e889101dec03da6821a90850967f3159953124eb6a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060out, _ := json.Marshal(token)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060out\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060out\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060out\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2170ac1c92e97a8b72d7b736eb2a48cb21dc8c04c05ca4c11081e4c839df5788"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/telemetry/runtime_send.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf777d6d8ce50d1b3870665ee7f14e915bc2b6cc548f9ce9c9155510037fad82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err = rand.Read(id[:]); err != nil\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":"internal/telemetry/runtime_send.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f6a080a83cbea857f1870eba074b7099f83714f1574652c093f45ade36c47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/telemetry/runtime_send.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed7c54d16171e1ed2e35f85d825ca0428e81c0f84e6e198e9ae4d5fdfbb6e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/telemetry/runtime_send.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0684be766e816fe94c8fa24510cb61a2848b2bc6b92dab40443f70ac5810b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060root, _ := resolveCodexHome(homeDir)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060root\u0060 as if the call succeeded. When \u0060resolveCodexHome\u0060 fails, \u0060root\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060root\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/codex_paths.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f9b61cea7e4b48e48dffac3513fe3a2196c459967ef3c4f7aaf7ba7fff3287"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060entries, _ := os.ReadDir(filepath.Join(homeDir, \u0022.vscode\u0022, \u0022extensions\u0022))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060entries\u0060 as if the call succeeded. When \u0060os.ReadDir\u0060 fails, \u0060entries\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060entries\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/config_scan.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af7c1773a23f5f9efb17df856fb640398644e6d71bdbf7e7989889559095191"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/system/config_scan.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60009fe3a1f36468d4add5c981e50ab1124399f36bbcd88b5d4c479a80be895"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := exec.LookPath(binary); err != nil\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":"internal/system/deps.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f96f59aaba21717da9946087df27e344520430a0456cf74f57d897099a1b684"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060n, _ := strconv.Atoi(parts[i])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060n\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060n\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060n\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/deps.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5147740ac5d359f3746e53222a8081ad33efcbcf87210529354b401d1a91bff"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060osReleaseContent, _ := osReleaseContent(runtime.GOOS)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060osReleaseContent\u0060 as if the call succeeded. When \u0060osReleaseContent\u0060 fails, \u0060osReleaseContent\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060osReleaseContent\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/system/detect.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cdc09ff1bd0fb33605450632be0d086558f47cccdd60a9b398d926e8b3cca1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/system/detect.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f579998ed7b4bb5ba658cc998d0cbbcedc78fe7700e531ef10c1f19c658d22a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(line, \u0026e); err != nil\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":"internal/state/manifest.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b34efed08b45e3899d24506ecacd7577b5cb6f373c7db7e2b8c4e6970ed1ad7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/skillregistry/registry.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"967ccb2bb6b8f82f2491a09f73f825a63d72b97c01bd69beda96f47755e5ab7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/skillregistry/registry.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b3a87ad06d1aa7d8b256a17f95b43c8e0d009b36807e97cdc7edd3eb5cf74f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/skillregistry/registry.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2579cb23c7e737bbd6223f734997511cb562bb61ec0f5347e24877574bc63050"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/skillregistry/registry.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3629d434f94d8bb0e8772a4a7daf8bae560fbef2ded1064d32946be145c9f06e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.ReadDir(clean); err != nil\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":"internal/skillregistry/registry.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"163bedbb6c06232b26f84c1b7a7b4d7aae4b0e80373d61742002cfaeb6221547"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_agent_rollback_unix.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffd9f16ef174f238d381c1cb222c3aefc80c71ca814afc86b3274090e13b464"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060mode, _ := strconv.ParseUint(p.record.Files[name].Mode, 8, 32)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060mode\u0060 as if the call succeeded. When \u0060strconv.ParseUint\u0060 fails, \u0060mode\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060mode\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_agent_tools_unix.go"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c05e575a382d7b3b185e68b3752e7e3f34de48d8a753f0080e3e41f45da85a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060canonical, _ := json.Marshal(artifact)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060canonical\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060canonical\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060canonical\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b74682e52e1c1fb7c5a0e143e261c1dee12f7c1a4463437e3ba4b39da1e56b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_artifacts_windows.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0809c9ea334cb231f52de456a2057fdc801d3358ec0f89f7bb04f0918388e35"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060userRecordPublishedShell(rebound)\u0060 returns an error, and the statement drops it: when \u0060userRecordPublishedShell\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := userRecordPublishedShell(rebound); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_channel_overlay_unix.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3021d11c17374c326b3e74df7180bb3cc36d8cae50899cb24bdc0f9caadccb0b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_engram_shared.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f8dbc0c2e3c766df457ccafd4a83cba26132e5c61f29412ea14003662e8039"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_engram_shared.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b06c1feaf82d643484e893df0861bfa9612818d6fc14459eeb1c5f64af68a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_engram_shared.go"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089437bddb8dc636d1a7d63f4c7838a137720535160f978d985b185ca641cba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := io.ReadFull(file, header); err != nil\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":"internal/shellinstaller/user_engram_shared.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8b5736e9be5b85b1f52bc467b398ac7e4d25e3be87a69705c7dc30dbb1b2ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateDirectory(root); err != nil\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":"internal/shellinstaller/user_engram_shared_unix.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"133f7a99efb5ed7caba6eab9c2eb67f37fcdbc3de103aabe916a8bf53ba388ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateNativeFile(ctx, path, 0600, -1, \u0022\u0022); err != nil\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":"internal/shellinstaller/user_engram_shared_unix.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d5783fad8edfd58b590383900e63cb1b47b69d45cbb9f42dfb99d87b9f1dc4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateNativeFile(ctx, core, 0700, -1, \u0022\u0022); err != nil\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":"internal/shellinstaller/user_engram_shared_unix.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30229bf075ae858dee759aad94ef7eb84349a0988718d8dec373add644f923d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := userWindowsIdentity(core, true); err != nil\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":"internal/shellinstaller/user_engram_shared_windows.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f140e3d14ddb68d33c41017ff162820134df11ac56faefeed98eb4a1399d26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := userWindowsIdentity(home, false); err != nil\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":"internal/shellinstaller/user_engram_shared_windows.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9a8278966a1fe4c87233c6f6a928e3f01d429262879177055ade55a89decf4"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(map[string]string{\u0022channel\u0022: channel})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_experience.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb1a227b3dbc66b8f45d3627484d2b74eb620ca825d3fbbbfe89884bf256700"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_experience.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e11c03c0b2d77037356f03c36e4fb8fc987b472d75e037f8e6914a6f1ae36e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060name, _ := windows.UTF16PtrFromString(path)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060name\u0060 as if the call succeeded. When \u0060windows.UTF16PtrFromString\u0060 fails, \u0060name\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060name\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_files_windows.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"24676b457dce6840041a0cab93cd199e53dbf2695348275b7d4c49894ac9941c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Lstat(agent); err != nil\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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bb6253f8e2e0d8c1d85167d79d4ba5270118ad22c400e1e68be0b153305056"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"236e6777c24612e2b86249709f6d53e06fb275ac27b767b8c6f72f71919a6f44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_install_flow_unix.go"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e8728c405ef3d0b8fe2018ce12b284c115211405b1f40cf30948cb5d6bd526"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateDirectory(dir); err != nil\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":"internal/shellinstaller/user_install_linux.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d441df899384821ce59c4b04bedef280e2b5ce28be4f731daaf9517e03b60e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060compact, _ := json.Marshal(packages)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060compact\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060compact\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060compact\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a40dea5e327163d1d21cfdffa6b7e048dbf30291367ab05de37c89bd91bb358"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060rootJSON, _ := json.Marshal(packageRoot)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060rootJSON\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060rootJSON\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060rootJSON\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"380a7d1fc095fd958d7826e4a403496f076065002011aaea8d5ea6a8ad32844f"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060after, _ := json.Marshal(append(packages, rootJSON))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060after\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060after\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060after\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"647c0294a9915c6da354f7951d951a30f91eba8019703e9677b207928b0810ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060command, _ := json.Marshal([]string{filepath.Join(req.Destination, \u0022runtime/node/bin/node\u0022), filepath.Join(req.Destination, \u0022runtime/node/lib/node_modules/npm/bin/npm-cli.js\u0022), \u0022--prefix\u0022, req.SharedPrefix})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060command\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060command\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060command\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_preview.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bc8860da4e837243d3018c1f5681d0330d5c0feef307946f6d4bd3f04b416a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_install_scope_windows.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"46157153b65ed16ea0905715be318b641623b74d25aefbce72db24624b88b588"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060canonical, _ := json.Marshal(req)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060canonical\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060canonical\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060canonical\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d813416974889f3bdc13dd05cf9f65b0cc947e24b8d244b89b41aee38b4dbe07"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060canonical, _ := json.Marshal(manifest)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060canonical\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060canonical\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060canonical\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf87d78d336aefb33a36173284f8dced210d1f221d387c75647253b8e329f6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports an error that is nil on this path): \u0060if _, err := os.Lstat(req.Destination); err == nil\u0060 reports \u0060err\u0060 on the one path where it is nil, and the path where the call failed goes on without ever reading it: the comparison is inverted. The real failure is lost and a nil error (or a panic on \u0060err.Error()\u0060) is reported in its place. Test \u0060err != nil\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1f51db1c66852758bce3fff547e426a3e8e09e51c89ef82ded8f28c7b974ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060metadata, _ := json.Marshal(mainArtifact)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060metadata\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060metadata\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060metadata\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1be6b9555cec4a6a60256ee31db31beebc4e04e6ad54849840470f3714d1fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060encoded, _ := json.Marshal(manifest)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060encoded\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060encoded\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060encoded\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d967f55752a45adf38f1d5d730a1c7d9e65676340bd2eec8edbdb5c9dbfe34"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060from, _ := windows.UTF16PtrFromString(stage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060from\u0060 as if the call succeeded. When \u0060windows.UTF16PtrFromString\u0060 fails, \u0060from\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060from\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f8210bc705af426550a5b1f2f720e7c9f3e7751994d53d200378ea0be157a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060to, _ := windows.UTF16PtrFromString(req.Destination)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060to\u0060 as if the call succeeded. When \u0060windows.UTF16PtrFromString\u0060 fails, \u0060to\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060to\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_windows.go"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb1820916a5beba55dcbbefb7018bfb8a3be8b2356bb75820088f99b59d676a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_launch_pin_cache_unix.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd736b1ab6912b4f361f4fb5df1b409ec01c91d43b508891878e08f69426372"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateDirectory(filepath.Join(root, \u0022 \u0022)); err != nil\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":"internal/shellinstaller/user_launch_pin_cache_unix.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"017e4b55396b5da947f8f5613dd88083bf816a0804f15b780145f67f8c96897a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := userAtomicWrite(userPinCachePath(root), data, 0600); err != nil\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":"internal/shellinstaller/user_launch_pin_cache_unix.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b382741a2acd03b75ecd2f58c1e93fd3f6895642852a46112abdf451c5d02149"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_main_source_cache_unix.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b196ebea00335421a3b7fc87656ca9cae95aa1274225af8cd01757a28809f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateDirectory(filepath.Join(root, \u0022 \u0022)); err != nil\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":"internal/shellinstaller/user_main_source_cache_unix.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8011fb3de90bfb47a312a769b6d7b99a60d1865e8594615525c6f12072053a23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err = os.Lstat(req.Destination); err != nil\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":"internal/shellinstaller/user_native_coordinate_linux.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c437077cc004923ed5bce5206c1c9eb94d09b734dd158f9c2fa80527430140c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060rel, _ := filepath.Rel(root, physical)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060rel\u0060 as if the call succeeded. When \u0060filepath.Rel\u0060 fails, \u0060rel\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060rel\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8497b3bd48770857b62b2efb1ac54f3e3c084bc460af64a861cd0f0bf5fe06"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060rel, _ := filepath.Rel(root, metadata)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060rel\u0060 as if the call succeeded. When \u0060filepath.Rel\u0060 fails, \u0060rel\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060rel\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f243c8273517222eac854b9321df7e9d81bf5292ebd0c938e07f76bf642419"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060rel, _ := filepath.Rel(location.GlobalBin, target)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060rel\u0060 as if the call succeeded. When \u0060filepath.Rel\u0060 fails, \u0060rel\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060rel\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_readback_unix.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"323df9053fa96f8dd5cab2d4bfb50355bb92b8220b3085bf488df0e9b82a9775"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(code)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_seal_unix.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a5faf5670de87bad8b1b34bfadbf00291d378afb007d634c5809d1c267eb6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060rel, _ := filepath.Rel(root, path)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060rel\u0060 as if the call succeeded. When \u0060filepath.Rel\u0060 fails, \u0060rel\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060rel\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_seal_unix.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"445f3f148d74ced10b4b190f44206014a62641731b15bcba9fd21cef50ad4fda"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060rel, _ := filepath.Rel(source, path)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060rel\u0060 as if the call succeeded. When \u0060filepath.Rel\u0060 fails, \u0060rel\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060rel\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_pnpm_stage_unix.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418478f026c5603c7116295d6b5610b7ea302b6b13741fb3fbc85525ddce9d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060status, _, _ := resumeUserWindowsProcess.Call(uintptr(process))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060status\u0060 as if the call succeeded. When \u0060resumeUserWindowsProcess.Call\u0060 fails, \u0060status\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060status\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_process_windows.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"611782abaa76715bf1469a25ebc22337240447d3593a57911a43ce6d47e25877"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060a, _ = strconv.Atoi(parts[0])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060a\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060a\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060a\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_reviewed_suppliers.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e765336369c9afa51f234a48172f28df8858a65854d9124975921722ee015a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ = strconv.Atoi(parts[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_reviewed_suppliers.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03b6ed2c25b84d73af9e2f63515b5a73b9d0f33a1f0e7c88ccaae7b1756e9c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060c, _ = strconv.Atoi(parts[2])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060c\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060c\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060c\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_reviewed_suppliers.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab3b47957335db7ec96a91ec9212c38b0173d233bd32295dd526e114f03e02a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060root, _ := url.Parse(\u0022https://nodejs.org/\u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060root\u0060 as if the call succeeded. When \u0060url.Parse\u0060 fails, \u0060root\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060root\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_runtime_primitives_unix.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51ebbc46412698b17dee9856e29babbca34cdf18b31b7bbb831421a5c882700"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_selection_other.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab2b49a1725511cc8090ed1ff47b63894f36dcab96e7e2f4d598ad02419ab9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_selection_windows.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c8f4dcb03c16749aca986481a31b378cc9ba7abd2ae2c13cf7a200384f88a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(req)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_selection_windows.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"373c5808858e00b3d444326c6559353ecaf58d30f0b481f3d373716bdadd198f"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060real, _ := filepath.EvalSymlinks(agent)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060real\u0060 as if the call succeeded. When \u0060filepath.EvalSymlinks\u0060 fails, \u0060real\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060real\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6032821241dd26694711fe365e4f486eb0c238bfa4042ff96d0d4ff125ef2c43"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060mode, _ = userAgentPreimageMode(entry)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060mode\u0060 as if the call succeeded. When \u0060userAgentPreimageMode\u0060 fails, \u0060mode\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060mode\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_agent_unix.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe9b1612ef4f0880026ca154b2684fc6cc83bb792a44c540845974c53410f3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_shell_launcher_path_unix.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49cc5968a39f97b4e62d594b8fa35ddd92e3ef1d5917b597332982007e63dda"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060info, _ := os.Lstat(folder)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060info\u0060 as if the call succeeded. When \u0060os.Lstat\u0060 fails, \u0060info\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060info\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_shell_launcher_path_unix.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfad6931e18dd904057b878132edf879ab50b730112bde76d7cbfb1b8a1dda1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_shell_launcher_unix.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75d70824655c655dd743e2138086f5bea603cc020b3a817f3957d9895f6e4b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_shell_registry_unix.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be9a08cbe43fc4359886080de781c211c496ecadfac27ae15b0e83fa1103154"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := userWindowsManifestRead(target); err != nil\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":"internal/shellinstaller/user_shell_registry_windows.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f1c9f39200d64dce7615ff6f6c5110316fc9396fc042418a030002e8102c71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_shell_registry_windows.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb36f3016fef70a673717a65ddcc9f0ab866e97e94fab87f409afd0123611e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateDirectory(prefixes[0]); err != nil\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":"internal/shellinstaller/user_shell_target_unix.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ec4ff4ad06476a73611543917be7906819a0d23d70b117d3d4e4d1f0eda50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := privateDirectory(agent); err != nil\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":"internal/shellinstaller/user_shell_target_unix.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a744adbb87c806ab8c6b12d9190bfc61effe753e44e3b10ebd30d68235189d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/shellinstaller/user_shell_update_unix.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed622d957b7e96370850bc224db50fbb4f2cf165aff344868a6a758d6b1fab6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := userWindowsIdentity(folder, false); err != nil\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":"internal/shellinstaller/user_system_git_windows.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db53cbc6809af0241bb21d7a87f85b62b193e27516844292d639cf70d7163ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060canonical, _ := json.Marshal(marker)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060canonical\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060canonical\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060canonical\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_system_go_windows.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba810dd9a06440fa8764e2830efe6c4625bd2f421bbf4fc62f4ea699c69a3e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/advisory_disposition.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"214a9ecade7fc7a21fa0ab7ef7a9733486c2492a737689e3509a7f102e840f3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/advisory_disposition.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b180a4f00159084e93d6f64c78d8f6ae5d2abd87f53bb9dbef1510139053b5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060encoded, _ := json.Marshal(err.Diagnostic)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060encoded\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060encoded\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060encoded\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09ae0ea935397448658699ddf34ee11d40aa7a89ec2e19f423da286ff74479a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := normalizeLogicalPath(logicalPath); err != nil\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":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"947d66bc351c55cf4d3159177b00a898d22a761ebcb9c77a524ab1950bd6e2d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940409989468b6846417f9e89b701efa37f116542a587540447b2d0c78ae8d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_subject.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"10764c91babe041e552ab100915d31648a989b86c95742d03bd989cea7b81fb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a73fbb8b6297394123f0bb4d3ca1162ea56643767c5861ead37c6ea0d852be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(payload, \u0026record); err != nil\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":"internal/reviewtransaction/authority_disposition_execute.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b18908f2d32059e68ff068049b59a0df04035808267b21bf9f3787ac7da0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if parseErr != nil\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d5a1a48b15932ec66b934bae2bcb9657eceafbcfa05bc68f796e3dfa710d5d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3691e61041e8fe1cb83e4707e7ba5fd6d648170ce9f08952f6fb878a6c76d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a24aca51d14acb5f04534ddc93b84ca06f5d10a14d3c0f750c25d053284210"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := unlockFile(file); err != nil\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"581749d4fd663c7394c000e019016fd3f04969939c5d58c5657862d69f24cd3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"945d80e6340431e7ec49d4cce87e4ae8c228eb1ae49c0ebafe3873c14efd9f98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(payload, \u0026record); err != nil\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":"internal/reviewtransaction/authority_repair.go"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a0290f4e6a6a1092fed1e504bc5474b8137e362e95803155d375c7a18b8db6"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(bundle.TerminalReceipt)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/bundle.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ca24101b14ecf2338f5c2eb661c46c1ad78930235271da8d88c5df464c2a99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/compact.go"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3122bacf03a51fb82b0f3e47b10e03ed76c61e5c06ef0b682cf0e9d4c05c3d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(struct { LensResults []LensResult \u0060json:\u0022lens_results\u0022\u0060 Findings []Finding \u0060json:\u0022findings\u0022\u0060 Classifications map[string]FindingEvidence \u0060json:\u0022classifications\u0022\u0060 Outcomes map[string]EvidenceOutcome \u0060json:\u0022outcomes\u0022\u0060 FixFindingIDs []string \u0060json:\u0022fix_finding_ids\u0022\u0060 FollowUps []FollowUp \u0060json:\u0022follow_ups\u0022\u0060 }{ LensResults: view.LensResults, Findings: view.Findings, Classifications: view.Classifications, Outcomes: view.Outcomes, FixFindingIDs: view.FixFindingIDs, FollowUps: view.FollowUps, })\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact.go"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"7526344980b9565278ebc17f61031b9a022ddc023a67bcd948e6f7d54ae4b54b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/compact.go"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60010dcc2e4f1bf31bd9e553e5c2d46f92acf3aa83a9ac091775686c7676a25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\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":"internal/reviewtransaction/compact_abandon.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1e8068a5ba8a25bb80262bd3d3d70ea55b58d122e906023f971497a191079e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(check)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_reviewer_capture.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"564a2c52af8c523cde098f4c65de9013a66417afcfab79eca6daea84eca9466c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060carrier, _ := compactAuthorityBlockingCause(records, violations, lineage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060carrier\u0060 as if the call succeeded. When \u0060compactAuthorityBlockingCause\u0060 fails, \u0060carrier\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060carrier\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"57edb395105014672c944a3fec7aa657a6da41d4860ada46215d2c5e5d79d666"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\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":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aca6bb1159ddd63e1119753aac7f4a4d73748252996317ca847dc5ab86cfa8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060outcome, _ := recordCompactTrace(request.TracePath, CompactTraceEntry{ Operation: \u0022review/start\u0022, Revision: record.Revision, State: state.State, RecordedAt: time.Now().UTC().Format(time.RFC3339Nano), })\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060outcome\u0060 as if the call succeeded. When \u0060recordCompactTrace\u0060 fails, \u0060outcome\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060outcome\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"88504a8f28a02a6aa87872568c709f4b056b782254510128dbb728a56f9c86ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060recordPayload, _ := json.Marshal(transport.Record)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060recordPayload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060recordPayload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060recordPayload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"013c88f832655b48a1aa94f22bfbb38ffa7e27bb069630f71d3280d576037fdb"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(transport)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2551}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca44e45e87a0ee66d3484417ed2d3d2ebf03c371ac2b1794c9c1575bedb6647"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(copy)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_store.go"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f152c15be11a5d283d2c4baa43dd52304b70ded9220c2a16cac982edc39553"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/correction_plan_request.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cee3be730969fbc640ba53a227be5674ec6e3c2d9708f3fbbfae66ced02bfdc"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060pushRemote, _, _ := publicationRemote(ctx, repo)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060pushRemote\u0060 as if the call succeeded. When \u0060publicationRemote\u0060 fails, \u0060pushRemote\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060pushRemote\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/gate.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"710af32ac1c80eeeed61c5883ee1fd20338409c90dd10b69b59c30c98e181bd0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := runGit(ctx, repo, nil, nil, \u0022 \u0022, \u0022 \u0022, branch); err != nil\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":"internal/reviewtransaction/gate.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b31e7528b39d98342756690cc57243249616e982ed8ef628fd16d3f2a3ecd56"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060branchOutput, _ := runGit(ctx, repo, nil, nil, \u0022symbolic-ref\u0022, \u0022--quiet\u0022, \u0022--short\u0022, \u0022HEAD\u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060branchOutput\u0060 as if the call succeeded. When \u0060runGit\u0060 fails, \u0060branchOutput\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060branchOutput\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/gate.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab3493a32242f77b2f49c9c75d06e08287d6e08e2e29905cef77edb8a94311d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060status, _, _ := ntResumeProcess.Call(uintptr(process))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060status\u0060 as if the call succeeded. When \u0060ntResumeProcess.Call\u0060 fails, \u0060status\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060status\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/git_process_windows.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01a788660e2c72c833361e755f5e09bca37458801400894f6da1971a863aaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\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":"internal/reviewtransaction/legacy_alias_repair.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b84b93f898acbd2c6f578a17dfe030066b71ba047d3c1448a86ea9cf4cc74b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := windows.GetExitCodeProcess(handle, \u0026code); err != nil\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":"internal/reviewtransaction/process_liveness_windows.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5817d5d00a2bf4bc4e336a634b181ec9f199b54fb9a937bd720651d4fb0636"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f904493f07e74826260e13f510c9ec7a94286bda9f2727744d08406817fa005d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := file.Chmod(0o600); err != nil\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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d814e1a1c07e2ef7ef26e4d523524d31bb2aa8abf268cb123e1c64ac292fdb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a505be716cd09c41a64ddb87b80ab5c983feb70c63c480621f29435e8149071a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_unix.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f0fe063062f95bd5b332b771b2267f09fd7a98fb7596e201c0cea9346b49c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2306b7a46b4eb92a5601c3a897f5a3ef1c62c4bdd7b8855a7743c269b2877a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4423653abb72bab09ed4581adb28996e93cc773b186184d64e03162c1fba2193"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"10089847ef8fb47360d871b08cd382b53d59921c65b4f3d8701f2d9230dcf5d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := windows.GetFileInformationByHandle(windows.Handle(file.Fd()), \u0026info); err != nil\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":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e91b379d021ff223801f129708b61909732c42cae61f724e6bcac70f26a1991"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rar_path_safety_windows.go"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ba42c93ff04e4e5a1786e68b5c5c761e64b81c2d12563cf6c1d93779f9340d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"353065465ec473259c960643650abd0441fcfe17423a0cebdf3a92e8155a609e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b40c17530a73ea58a49db7c4cd164bfa2c61a0f9e6a9b6a9331e2c60fbf5d75"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if legacyErr != nil\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":"internal/reviewtransaction/rdd_mode.go"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a38ebceb49a5fedd2ad479de1713a434a33bcad31766ef842fab83b0d8d72b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f43a620a4b6e830203270d5734fed35f6a78a8b2ed2dc252dab1a2de9982958"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/repository_locator.go"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdb80c35486c540dfdc605e3c186f45e97a3e5487a1ec78d379f1cfae294aa1"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060legacy, _ := CorrectionBudget(originalChangedLines)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060legacy\u0060 as if the call succeeded. When \u0060CorrectionBudget\u0060 fails, \u0060legacy\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060legacy\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ebf5a1982d9e6a68377c845c4c49b4614838f91ac245233600df99a7799ccb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/risk.go"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d181847a300308fe1a90456c5af7b5e2eff1d7dae3cd925d91f2dc271a9e20f"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports an error that is nil on this path): \u0060if err == nil\u0060 reports \u0060err\u0060 on the one path where it is nil, and the path where the call failed goes on without ever reading it: the comparison is inverted. The real failure is lost and a nil error (or a panic on \u0060err.Error()\u0060) is reported in its place. Test \u0060err != nil\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea6f713a94cfc1a14d78fd7dd16ea401bdad86f0cc120b19875bfeced32bcd5"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060start, _ := strconv.Atoi(string(match[offset]))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060start\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060start\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060start\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8225cb6a4d0b9d6ce55ed37054ede1a37710167e93f4cec008cf002810c82a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060count, _ = strconv.Atoi(string(match[offset\u002B1]))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060count\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060count\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060count\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/snapshot.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd9c1b9d42bb29f1894f657c85afeb103391231942dda6937e9a26fe5c03957"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/store_lock.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b953dc8cb600a6e2bca27793e7e7fddaab0e65aed9fcfda2b9f57ff3e66fdb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc19aacb7697461818054ff829f194139cadb8ab7a43c17f9f315a99cf3c4307"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"751eb131539878d63fa9b8904d349c740dd3f062fd12befebaa74fad8ef39dd4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5448a90e3e1f40f960f301cf2a23da233a41a230490312f343c31f1b8eedfd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbf075913a5df40506278c89ba498297f110a878965b46e8cf60e8ba2454baa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/store_reset.go"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f945c90279454190a42eb84df65a1d0b67f855cad88e976d647e49bbbef199e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e7502b443e194ca0c421b34014e5eb1be35739f655da4dffc3800dc82ce993"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cc21dc986575ca1cfa1859554151e869c54a3d8c60d0143d5f430b60894c79"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/reviewtransaction/target_status.go"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e62d149797aea331394a967a455665f6ff1688b39114df394920024fab69a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/targeted_validation_request.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f23702985df8ef11f075703a1d3cea0da387b2858dcaaaa9feed7aeeb613efd"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(struct { Lens string \u0060json:\u0022lens\u0022\u0060 Findings []Finding \u0060json:\u0022findings\u0022\u0060 Evidence []string \u0060json:\u0022evidence\u0022\u0060 }{Lens: result.Lens, Findings: result.Findings, Evidence: result.Evidence})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f703b2e6194774ee8f70032f823232db513072df840d1025cd5261651291b61"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060left, _ := json.Marshal(merged)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060left\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060left\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060left\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef4187e3a9b54f597432c6028b4f0163b15150ae88f4438b9aafca71c2233c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060right, _ := json.Marshal(findings)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060right\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060right\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060right\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bd5e25292df1d95a35d7e9d05f48ad927cff0082c88ffbc6143582d818681d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(ledgerProjection(findings))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/transaction.go"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eae19aa91db684060080ec38e1c9cec3b1444abd74053b3b3b8a5eabf69197"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/releasepolicy/policy.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b96c0489c1e12842c4d91a61c262ba7875e1d58fa1c5b568f0c59ced1771a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/pathidentity/identity.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b361d0bca8c8673b6fa505f524778288fe9dd7eabbacf0b272f1326e4d3f1900"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/background.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dae9f4da0a43a9ff7f2fc29be3a48c76d142d7e50578138e8b1ab6576bba5e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/background.go"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"239305362732ca8d5dcdaa488c1ccae8050acd838a1a7f48a3f1b7eb833b47cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if evalErr != nil\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":"internal/opencode/background.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d97add2583e36c5326300b12297105890d09d4aa68163743e748a8d3da6aed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if absErr != nil\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":"internal/opencode/background.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abb91636bbb5926a6286a6e828bb4647518c27bb6b911fcfdde79d1ec08d15f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/background_readiness.go"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c23978fde37af6f34b0b3ca1fbee0d3006ed8be5924560ef86fccde3b39921d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/background_readiness.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cc8ac90a88a5433c9c437f87a5330ad95d0264a9b2e55639dfebba65a5dd9c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/catalog.go"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e2f85a869230f1a158c500378998d1cacfdf653bc501626cb61b1f8a9f987"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/catalog_process_windows.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0877f299133b41cea3b0dc48d418038aa2b4344b1f0d9911adcf24bc8c618e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/catalog_process_windows.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"46eab181ec832c8fe064494229ce416b892109db4a09afc3f4e30ad4be022fea"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060home, _ := os.UserHomeDir()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060home\u0060 as if the call succeeded. When \u0060os.UserHomeDir\u0060 fails, \u0060home\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060home\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/config.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dc83dd2b58ee77d859f9ac4d27486903a6b973aa64067b89e67b04ba0f37ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/config.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e988a5597a9935793aa63e9a6a75bce8c1c810a08b5fa97558c3ae8b1799a804"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/config.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e074d5b063ae31672a59e81c6dd17215b019ef7ae05359252bc92a3264c09d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060f, _ := v.Float64()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060f\u0060 as if the call succeeded. When \u0060v.Float64\u0060 fails, \u0060f\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060f\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/config.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2276ccb6796e7947c2267bee2b16db5d8013bf3bb3a225864abae53c92b888"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060f, _ := v.Float64()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060f\u0060 as if the call succeeded. When \u0060v.Float64\u0060 fails, \u0060f\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060f\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/config.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"920e87e559c9dd0e75af4808bed2aded1ed8ccd9388de489ff5070a517934480"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/models.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a152e2f752a2b9d09c3996663ac346f6f386180acd118a97c20ad56d3c32bc18"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/runtime.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb828f8a300e7b815ec6a90b47d1a66331af14b76e8cab8e6e312bb5481cb6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/runtime.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"40535af7a5341015b70be8c851d90b575beef52379d280d59c0a28360817c977"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/runtime.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06d9cc39f42ff632f5d503e2497f8f6d92555cf92cb53bedd53e6cfab897d53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/opencode/runtime.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e2a71f017da16c6b9ae7dd475ab9b71f7f1d1406a5b8c1c6c5b9507d42842f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/model/codex_model.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dab0bfb3b92665209c076517a12338a9f2dd0740617689c5b7c40d2311ad871"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(output.data.String()), \u0026catalog); err != nil\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":"internal/model/codex_model.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"180a4c8e6d1b500f03a5e425c6d1e66fd4fb5b023fe290cc4bcf973d9373286e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060major, _ := strconv.Atoi(versionParts[0])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060major\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060major\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060major\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/installcmd/resolver.go"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9bf30d3b182afe124486c6ce0f7e19de8ffc8f94dfefec0bb5e7dda5256f0b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060minor, _ := strconv.Atoi(versionParts[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060minor\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060minor\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060minor\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/installcmd/resolver.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"501e58de449d1caf16714d4331cadbf08a83332bc3c34e9279da35cd8db27dea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/uninstall/cleaners.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0f5d0f59f0856c03bdb6b83cd3d78fc93f0fe8d80ccca3871e56e9564d1c5d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/uninstall/service.go"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b541e28fcc451be12aeb7d64d3de908667aeb66f3b532db24575b454993cbcaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/uninstall/service.go"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9332c203391731fa1d3938683e862df4f1b44b040dc1e36cf4d3b5dd0387c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/uninstall/service.go"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de69c3b305402d47ff8218a2ba576ad7dacb6e542e2742247a60278045e3847"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(content, \u0026root); err != nil\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":"internal/components/uninstall/service.go"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec9c867594c61bfe65faf72e5e671e7af738a2666d64f34ba526c42393fa12a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"758eeb04d7a3f8f6454c0e5cff198a97650382468894cbb96155d96b3cd9fcbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060definition, _, _ = readClaudeFile(home, filepath.Join(home, \u0022.claude\u0022, \u0022agents\u0022, hook.AgentType\u002B\u0022.md\u0022), telemetry.ClaudeAgentMaxBytes, false)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060definition\u0060 as if the call succeeded. When \u0060readClaudeFile\u0060 fails, \u0060definition\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060definition\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7663ca816eb616ed0c36c83b5778d5b1b21fdb8075de6b7cc9998ef7257b6c47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843620153c5efcd28b0ac17968f4a9437260eb21e663bf5f6f5ccdcedcc4686"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060head, _ := readCodexTranscriptHead(source.TranscriptPath)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060head\u0060 as if the call succeeded. When \u0060readCodexTranscriptHead\u0060 fails, \u0060head\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060head\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aef11962318df05c3be81c15015ef199be94571ff20065f7e963411c377b59d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060transcript, _ := readCodexTranscriptTail(source.TranscriptPath)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060transcript\u0060 as if the call succeeded. When \u0060readCodexTranscriptTail\u0060 fails, \u0060transcript\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060transcript\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e182337c5c48e1726d12f6a0256220674aae9cffe77d72bd0b800bf691cf2326"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/telemetryruntime/managed.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea80cc6435cafdbf99125a70a60bae969fb168cf6bd8cc500ebb77cbd745c0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"504497ca7e3d1492816c967bce2e1a3b8d67d2700f3eaa71ec01be622b3e5c13"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060event, _ := json.Marshal(struct { Type string \u0060json:\u0022type\u0022\u0060 Properties struct { Info openCodeInfo \u0060json:\u0022info\u0022\u0060 } \u0060json:\u0022properties\u0022\u0060 }{Type: \u0022message.updated\u0022, Properties: struct { Info openCodeInfo \u0060json:\u0022info\u0022\u0060 }{envelope.Info}})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060event\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060event\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060event\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2c928584e6a7384be8e79e8686f1f40cb34ffb71d65f5db666fa91a55021c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"838ab9ad703ce151328e19f5ead9d8bef8b4fe2c0482249f21f25708f1b16a2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d8fc9231a2193715b932a0b829deb03894a792ec1d50267ccf89eea2fa8c31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/persona/inject.go"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b0df8f419cc0ac012fa969ca7e9bad50d5622485492c02d3de1e6b272619af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/permissions/inject.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7a484bd0f646b2b987e5d81a0d2f4784c5c81fe3cc943e043c72519a50b898"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/permissions/inject.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"827a2e79aed636e1a58b319f3d3426e45b0fd5ec3c36ea91b585417ea66ef8aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/permissions/inject.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ce2a75f3c8f78ccf4f267464b99d3f717981796f559005a3e259edd7ee46ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := removeAll(removal.staged); err != nil\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":"internal/components/opencodeplugin/uninstall.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ddae9431aacd6c380bc7cf2bd5fe939a965c0ac03422814490c4ebe9dac238"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/opencodedefault/custom_agents.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ab4b1a6166c02703faf18996d5f9aaa07d47aa2c2af4899646f01d843c6369"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if rootErr != nil\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":"internal/components/mutationjournal/journal.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"081b300d45599dd5f4db879251242418f584cd78acfa6ce82a18c572993d88ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060root, _ := filemerge.UnmarshalJSONObject(baseJSON)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060root\u0060 as if the call succeeded. When \u0060filemerge.UnmarshalJSONObject\u0060 fails, \u0060root\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060root\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"32faad7010929ce0c8a727d5f6d690bc503e1dad6c2e8d347e3dee2503c0eb3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports the zero value of a failed type assertion): \u0060mcp, ok := root[\u0022mcp\u0022].(map[string]any)\u0060 failed on this branch, so \u0060mcp\u0060 is the zero value of \u0060map[string]any\u0060 here, and that is what is reported: the value that did not fit is lost. Report \u0060root[\u0022mcp\u0022]\u0060 itself (and \u0060%T\u0060 of it) instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e413314bc4b3ead55bd438c6413fd10e2e8a44ea2c411e8a91e733e591f1503"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports the zero value of a failed type assertion): \u0060servers, ok := mcp[\u0022servers\u0022].(map[string]any)\u0060 failed on this branch, so \u0060servers\u0060 is the zero value of \u0060map[string]any\u0060 here, and that is what is reported: the value that did not fit is lost. Report \u0060mcp[\u0022servers\u0022]\u0060 itself (and \u0060%T\u0060 of it) instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e666cfd2b59d9695da933212f2ef08327555b1533c4ed1e2f5eaaf6dc9500c02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/mcp/inject.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c1b7b2db3d71ed9a98bef5a23c65b021c9a92da37c7bd7190d8c2cfb629c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060defaults, _ := filemerge.UnmarshalJSONObject(overlay)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060defaults\u0060 as if the call succeeded. When \u0060filemerge.UnmarshalJSONObject\u0060 fails, \u0060defaults\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060defaults\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fc44afba96b1eab3e27ea57cb1e16ac239b703008242beda354476ffbd09d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports an error that is nil on this path): \u0060if err == nil\u0060 reports \u0060err\u0060 on the one path where it is nil, and the path where the call failed goes on without ever reading it: the comparison is inverted. The real failure is lost and a nil error (or a panic on \u0060err.Error()\u0060) is reported in its place. Test \u0060err != nil\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/mcp/inject.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"9842a99dc51d8f8fa50a21130cf2d12af4a249e341c348ce001f06bca4975a8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/legacyassets/claude_hook.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9add146eb806148fa755bc40ef9cd66980efc4cd6f3011dd82fd4d58c0e8d070"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060hook, _ := json.Marshal(releasedClaudeSDDPreflightHook)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060hook\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060hook\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060hook\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/legacyassets/claude_hook.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f85a04e5c62b3e5b4ce2c518a15f5af411fc8cc9bc0d202a4275bbc6307160"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060paths, _ := OwnedModulePaths(baseDir)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060paths\u0060 as if the call succeeded. When \u0060OwnedModulePaths\u0060 fails, \u0060paths\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060paths\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/geminimodules/modules.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc3afc661078e22fe837d0f5023fc0967f2efd335760c5717f7ee75f415e0c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060key, _ := decoder.Token()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060key\u0060 as if the call succeeded. When \u0060decoder.Token\u0060 fails, \u0060key\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060key\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29b173f3f72bbb8dff21afcb8ab6781dc9ba764708a1907f7937f4fbc842ed7"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060name, _ := json.Marshal(key)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060name\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060name\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060name\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6d0f0e82e27e2a6fc5d29ecf9ac147c09f0fa0680a4f08c7c147aecb220bc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ac4b207c647da23f8f47256476a9ca4ddb1d6b16f8c415123dd555859c546f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/filemerge/json_merge.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d067545ac42a8ea36c1d395006e5079e171e0d0e7f4628a9928e523069dbb513"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(s)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/filemerge/json_merge.go"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa98b52ec46119d3b22c9d859abe384753db5cd32f6856bbc19aa1d6029220a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(content, \u0026root); err != nil\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":"internal/components/engram/antigravity_uninstall.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce519a7e00a41bfb42656b2c2410c7b4fd0be4d2625a79265b03d01f38eb7aa2"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060home, _ := os.UserHomeDir()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060home\u0060 as if the call succeeded. When \u0060os.UserHomeDir\u0060 fails, \u0060home\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060home\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9639bd1f9347c4a152ec812cb5c3428ace42d39cde5c3ccfaf328d36658077"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/engram/download.go"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3675af61928da2611ca070a539f1d768afa254c5eeeb140b477c76d5693077"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/engram/download.go"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ba1866950043fa1fee196abd908c78f2cf48a7343b84b289d54875fc69dac9"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060home, _ := os.UserHomeDir()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060home\u0060 as if the call succeeded. When \u0060os.UserHomeDir\u0060 fails, \u0060home\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060home\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ce6e6d5689401533691921f5d7880729c2c1d1cb21f0d91524badc4bd87ed3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/engram/healthprobe.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d3a40b816f583406763117162969722020039aa2d974c2378483913eaa66c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060status, _, _ := ntResumeProbeProcess.Call(uintptr(process))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060status\u0060 as if the call succeeded. When \u0060ntResumeProbeProcess.Call\u0060 fails, \u0060status\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060status\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/healthprobe_process_windows.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96815e29e5583e4dd6fcc7afc86427b4d1535cb864bee352af676b1a02b9365"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.MarshalIndent(cfg, \u0022\u0022, \u0022 \u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.MarshalIndent\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee415443a7b7d47e7bc7deede2dca7ae76038de99a7b2c4c3fb8c8524864bb05"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.MarshalIndent(cfg, \u0022\u0022, \u0022 \u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.MarshalIndent\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"66034b714eced0681df9b64a8e24eb2c3c792908c850ceff793b9870c4d34093"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.MarshalIndent(cfg, \u0022\u0022, \u0022 \u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.MarshalIndent\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0814a39d3dbf3d4ae7956cc3743d625fb64a0a45a01fd154caffa724b2b66d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.MarshalIndent(cfg, \u0022\u0022, \u0022 \u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.MarshalIndent\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/inject.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbb9e747dfabf4564916786aeb0fc74479b40de7dc492c9ba97557ab91766af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/engram/inject.go"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8f2c85b5e910b0f38a91f1394966c45121e42556a0d3e7a14c36b5d6bfe240"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026settings); err != nil\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":"internal/components/engram/inject.go"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10d8e2b67aa50d993fcff0f9389633dcd07ce2912211d713e574dbf0142a361"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/engram/inject.go"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffdfcdd1df17566aecc77c32dae4d091cdc9907f49c1cfc15e98a4c7c9ce61c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/engram/inject.go"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31983ec4d5d26c4f90d972cb2449bf0c69d63669ace915bba364b28b4ec0c31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(normalized, \u0026root); err != nil\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":"internal/components/engram/inject.go"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f2b79f6fb5ea02dc294a6f2dacc26e6181533ce4ad1230521daea4f0aaa74a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060major, _ := strconv.Atoi(match[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060major\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060major\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060major\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f660a506ad5ed7345e24a060bc69089176124c7f0bd09118d9a26a36d6d11487"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060minor, _ := strconv.Atoi(match[2])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060minor\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060minor\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060minor\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8575aa68772bc4546bf2acd2e52c8a6f5fafacc35d160f2f4c2a1b3781e09e36"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060patch, _ := strconv.Atoi(match[3])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060patch\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060patch\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060patch\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e549b98a963040de6154292ffc81cbc2abd222d13856fa60d5e1e05a4aac2ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060floorMajor, _ := strconv.Atoi(floorMatch[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060floorMajor\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060floorMajor\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060floorMajor\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ec208c49a437ee9f760f9f897c78bc8f80241f0cfa209d47e0e6e12f31371f"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060floorMinor, _ := strconv.Atoi(floorMatch[2])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060floorMinor\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060floorMinor\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060floorMinor\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52d520af0f65e0080628687d151e984ff3fdee109447665a7db44b6a8b86634"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060floorPatch, _ := strconv.Atoi(floorMatch[3])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060floorPatch\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060floorPatch\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060floorPatch\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/protocol.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7b31f9b432e63e3ba6af89dcdafb0f78e715ee9a2a99fc71fda484a768bcb1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_contract.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3425f509bfe82ba3d36f6525cb0669b2bb40a8e99b5b886fc94aa1b9c9568cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_contract.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe474ad347055179f2b819197b30bb89edbe0ba9f57707f1fea6a0adaee26fa0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"75957b4396f489afca8d13fb866099835ce8038c7ceb526f7c907ee6fef16dd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"225deafee11f8e19bbe36887b5a6088750798d40342d95f5b5f709e02256cb63"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d3e78e3fb69fe769f8d5ea9473ea04ff8d6b488b4e9d75f2a6e2a5d5a27c53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9271f054af32e4cdf3f15782fe511a116b43fd4d5a8ba6dde3b2aed22565be08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e841a4729fb15347cccfdb78f06179bc45c0860f84bf8fa2bde73a942624a2d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_guidance.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c54b3831e82e3b4d247b6044c34c666733ae6b7c1c6b7fc83b840878d47a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/codegraph_version.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b79ee178c69985da9635d5c9a61b169bad831d4f777bad2091273394cf6b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060encoded, _ := json.MarshalIndent(root, \u0022\u0022, \u0022 \u0022)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060encoded\u0060 as if the call succeeded. When \u0060json.MarshalIndent\u0060 fails, \u0060encoded\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060encoded\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5950534b013ec063f1e97ca486c0011d940896c9b347fbd63bcbfe21aaf785"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Stat(paths.Manifest); err != nil\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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e530e4b395d1689a3b1e410b441c3d57008d0eaf0e0e0afc24029e3defa3ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b692c55c256b661a71619bb9c4a2b50b610b5e554839548c35b4cddec405c58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483237ef1636d1d9de0e93139c1dcaefe64d5486e1284e537ad0a2eef8c3c1e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/pi_codegraph.go"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"845a8da8725604874fd753bdf00267ad5d363cfe95abc787cc677cf4e8660f6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/tool.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22b01d187e389f7a54b59523108765746210321c410ff8ffea1cd854bbc1836"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/tool.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7051c022d2455d473d57f93cfd2cd3b09e8109dda1a89aab9291b6dac6afa5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/tool.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8754a93daac1cb583a6597022111e7668d3fb288648256d7985c1c9f9f5d8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/components/communitytool/tool.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443c161b86bca34f1b7dca9911ccaa09a162ea274075927e140e7a333ce237c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060paths, _ := OwnedRulePaths(baseDir)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060paths\u0060 as if the call succeeded. When \u0060OwnedRulePaths\u0060 fails, \u0060paths\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060paths\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/antigravityrules/publish.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a27891230c47c102fa1696ba7c1de6eff32dd7a7d9713d8b5f310080a8720fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports an error that is nil on this path): \u0060if err == nil\u0060 reports \u0060err\u0060 on the one path where it is nil, and the path where the call failed goes on without ever reading it: the comparison is inverted. The real failure is lost and a nil error (or a panic on \u0060err.Error()\u0060) is reported in its place. Test \u0060err != nil\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/claude.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"936ddb55bc98e9b5a324f88909accb53f50ca48d55f3443a62c5caef7bfd99de"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports an error that is nil on this path): \u0060if err == nil\u0060 reports \u0060err\u0060 on the one path where it is nil, and the path where the call failed goes on without ever reading it: the comparison is inverted. The real failure is lost and a nil error (or a panic on \u0060err.Error()\u0060) is reported in its place. Test \u0060err != nil\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/codex_telemetry.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039c9e23b31c03080e840e9b67f42ba0adddc7c9d53a322cd75617f6ca08f9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Lost error (reports an error that is nil on this path): \u0060if err == nil\u0060 reports \u0060err\u0060 on the one path where it is nil, and the path where the call failed goes on without ever reading it: the comparison is inverted. The real failure is lost and a nil error (or a panic on \u0060err.Error()\u0060) is reported in its place. Test \u0060err != nil\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agenthooks/skill_registry.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"940a0f8fb83e4ead54a3ac004149e17c58f10351bdf47f881362f1af79b6e01f"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060overlay, _ := json.Marshal(map[string]any{\u0022agent\u0022: map[string]any{opencodedefault.ManagedAgent: map[string]any{\u0022prompt\u0022: prompt}}})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060overlay\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060overlay\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060overlay\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/agentguidance/opencode_background.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb3766582f764c30ddd6050f08ed38b8171f3487053f219519e43629f1d93a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/codegraph.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e0f8eb2bd215fc20fb798027b1f915b14ddecba848f9242c9caf2d48d807a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/codegraph.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e669532f784a9668669200c7832dddb63fb378dda9484b39ecc1736560e766"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/codegraph.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46eb4c428e1242d9527238b7acad3ba18c837ecd371d54e110bf7d74f827a9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/codex_home.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a1d76f63ed1f047955118bbab33cfa13ffc7dcf0275cea22d23d3ad72f0d8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/codex_home.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc835dd74a153ea11d3ae18a21510cad7eff36b59af9e2c047ffe3f4c34d7fa7"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060installedState, _ := state.Read(homeDir)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060installedState\u0060 as if the call succeeded. When \u0060state.Read\u0060 fails, \u0060installedState\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060installedState\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1e4ee2a2d4a1da43a3acb00cbac0c69429888824728373e9269325fcf9020b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/doctor.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbbb80cbed95ce640d6d919a955fb95190a815efa781c828a974753e7cde3ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/doctor.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f281193f9c3dd4ef29be256a124847ef7acb36234b6cb6064e6f9114d300c828"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/doctor.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e361858b42f59a71884767d84d6a0741fa476ced7c9959d35e885bcd935c74d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/doctor.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba0af67695c7cc5b39e5c7fd4ad071ba2e6180318891b075c8418f18e8ce8c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/doctor.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f29c95160bee0c331dec311d08b29413ad76f63efd4de22b7dfc0140b8cecc"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060status, _, _ := ntResumeDoctorProbeProcess.Call(uintptr(process))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060status\u0060 as if the call succeeded. When \u0060ntResumeDoctorProbeProcess.Call\u0060 fails, \u0060status\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060status\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor_tool_probe_windows.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1841af84cbbbcf691d4958beaeabc5d55fe34f6ff8108b8251c0eb90a18ebbe8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := (csvListFlag{values: \u0026values}).Set(envValue); err != nil\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":"internal/cli/pi_exclude.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d997ff712d3f88029315e61334f5e41bcaf5314287ba61d150b2f9546d7c815"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/restore.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d256f0734e8c83f1716314d0c7c5047ba23a28385e48fcf965117204279b801"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/restore.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e55e897c676a13337ff7e682049608cca1dea86cdb884236b6e5a2ac3e4833"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Compact(\u0026out, entry); err != nil\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":"internal/cli/review.go"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d29b6e29607d67e2c7fb4e9dbb3b355eef3d83020205ceda8599fc6e559b21"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_artifact.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"927729a8c95067c037eb1e8ee69f767ccbe46f0e119e4976d003524c8534850d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_audit_actor.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efacb08157c4afb5154a04db96d04845d3496c6ada048e3d13ce5f3867bd48b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(preimage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_capabilities.go"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7035c442b9a0230b1199af601815ee5b7e094ae76b916109f389ae6ad6c282a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_correction_context.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61a7eb325c2566976afce6613aac677867556e57febd8c0a0a2e28904af13b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_defect_report.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1db6bb2202d25aaaaa69cf978ae8f4c82fdefe31046d618956a6b86575e312"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060legacyBudget, _ := reviewtransaction.CorrectionBudget(authority.OriginalChangedLines)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060legacyBudget\u0060 as if the call succeeded. When \u0060reviewtransaction.CorrectionBudget\u0060 fails, \u0060legacyBudget\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060legacyBudget\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"40678bfdd38650cd76221f0d979e7b5b8da8196c10a30a82ec5eaf80c49c441d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if loadErr != nil\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":"internal/cli/review_facade.go"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b617a4d51597cb6227d0d273448faceaa8e83e0e0b59c925fd5732060d4c6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060payload, _ := json.Marshal(value)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060payload\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060payload\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060payload\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_facade.go"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929b84aa2a609d9e2b48859be3b9f5612aec9ff68818e81f7df28df80c21592"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060paths, _ := json.Marshal(scope.Inventory)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060paths\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060paths\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060paths\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_intended_untracked.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b177bbe3e782635b191ea047ee6b47d9494251dbbce5e99f18ffa1a89a5c0e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060aloneOutcome, _ := reviewLensContextBudgetProbe(ctx, reviewLensContextDependencies(), repo, alone, revision, model.AgentID(state.RuntimeAgent))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060aloneOutcome\u0060 as if the call succeeded. When \u0060reviewLensContextBudgetProbe\u0060 fails, \u0060aloneOutcome\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060aloneOutcome\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_lens_context.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3dee33627b03eec30774b4be8d9b12a0c080d557bd1b8fb787c3a9a36b9424"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if homeErr != nil\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":"internal/cli/review_mode.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e30981f3db96daa40a872dbb75604bdd96f63cfa02f1c05e7626ff1e237671"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.ParseBool(flagValue); err != nil\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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6c0c3aff637a796fb78181ae2802421b37a54a7a401a02a94fa95125d83e50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.Atoi(flagValue); err != nil\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":"internal/cli/review_operation_contract.go"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d5dbea708343863cd9d16217c518045f499f549460a25e6cc51eeea915b4e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026fields); err != nil\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":"internal/cli/review_provider_correction.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df08d80679a29356322bf7c20d39b1b5eab9727e01a85d65fb514592d07fbbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_provider_correction.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"120e7404602f8e3cd0916e6c666cc945999768daa90c8ea91014841b88c42886"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_provider_correction.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0bf19a68b1465aad11cf10d24e40b3ce3c197a9b7ba2648b4ab073f9732bfc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_provider_roles.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a5af8fad1788576af31139d737bb7e24e7243dc5bc8d33c1076cf3be36e686"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_provider_runtime.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b7387d694fcd06e2dde8200119f5a501059db9543e173194aef29431f482a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_provider_runtime.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bfd332c16d73ddb170f49064e6758a06bd80d6b8b4faedcace7b04ef063cc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_rejected_result.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa5ee8c477d8a71dc4c596c5e27ba8c5421388c68f409af39ff734702338109"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060correctionBudget, _ := reviewtransaction.CorrectionBudget(native.OriginalChangedLines)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060correctionBudget\u0060 as if the call succeeded. When \u0060reviewtransaction.CorrectionBudget\u0060 fails, \u0060correctionBudget\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060correctionBudget\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_status_contract.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c573645d1e62963f4c55953f3f5a998584d1b6369931ceb970bcf075d0cc6ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(output.Bytes(), \u0026result); err != nil\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":"internal/cli/review_stop_hook.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf0a3cb6196a7896055c2887cffd2b4d5960ac87bbf93da692dfb26453ba29b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_stop_hook.go"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa995f2b3302fed828af37975f73adec189bb02597a88c765d62632472f10d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if loadErr != nil\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":"internal/cli/review_stop_hook.go"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6517a9c57b381e8ced3d1ceb62890dd7260a5fb374c1deaea84bf845eb19e1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/review_transport_capability.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c102a2c1fe266457986a217c9078a30b61d05c667493514f59218d801a959729"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Stat(filepath.Join(config, \u0022 \u0022, \u0022 \u0022, \u0022 \u0022, \u0022 \u0022)); err != nil\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":"internal/cli/run.go"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df4e43433cda8f5d7eaeb9b8a5a2c42dbd3a0e0b6b67e3be04ec3259b11d1b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/run.go"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d09abcbe811837d93071d53ebf1372c5493fefbceecf6af8aed097e3488324e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/run.go"},"region":{"startLine":3253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7e5be6c588286858c489c985621255617a7eb75f3493fcb7fbb33785e9a57c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/run.go"},"region":{"startLine":3832}}}],"partialFingerprints":{"codehealthFindingId/v1":"937abd862e875fa8e4f1a7929409946bfc1b267d46388f0aa5aae2e74602cc15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/run.go"},"region":{"startLine":4716}}}],"partialFingerprints":{"codehealthFindingId/v1":"411f670f0359b82b5190054d7a7e69dc7a9a23d8759b76287357a21566198266"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/sync.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ca472e1966d9a9ce768a080060028ae76e3b5abf61fc08ccb932a83ac92019"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/sync.go"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"97566ecda49fe3b8fd9b84662cc6d49e09621ac8634a2eee4a66acfe9c84aa86"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060actualHome, _ := os.UserHomeDir()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060actualHome\u0060 as if the call succeeded. When \u0060os.UserHomeDir\u0060 fails, \u0060actualHome\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060actualHome\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/sync.go"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"184cdaaf818ea588606cc8e17b2737dceb167f0a3320bb6fbae77745b6b57ea1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/sync.go"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b416da13661bea6d2b10ae6d859f07c5537b8324370a51a7707212853cf44fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/telemetry.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"114f2f33b32c51fd9d2813cb3424763c3062bea6918dce791e7b1191be4055dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/telemetry.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f872adc0ceff9855f952d7bae39e46cfbfec26da14aff31e0f9a548495f092b4"}},{"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":"internal/cli/telemetry.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90f262e2671b10228ad4197a4f21a2148495bbb21e250a365caec7a2f8d764b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/telemetry.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe181bce59ac34c7ca9535ee191ba7493712e1b332f8c293741531e3e26941"}},{"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":"internal/cli/telemetry.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd85cbb1d358ccf6006e6b33b6e4bdd52a158cdada627132db383d2441b3fe6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/telemetry.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c60f1eca44f985fd160ea33b560d3f70ed155c84179f0060d9492964a0792b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/cli/telemetry_runtime.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcf6fe897c2537691e0a03c78eefce94e960d4ea8b7c8744720e70aab9c58e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/backup/manifest.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf8ac1a323fd8e616bc122f5c3b34b9e98517857e23bfd7b6f99a553fb97989"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/backup/restore.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"428ebf3423e73635b56f03a6839c6f398ec4b59a2f80e0a3acaf5cffad09b021"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/backup/restore.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a49a2f55dd0526cf2af5ee21e1dbf07a8050c983ae92964a4cac59549660224"}},{"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":"internal/assets/opencode/plugins-v2/model-variants.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f8f89156051298fd06438e1b2f436b3e316059ffc1ca5131f42cf435bf44a0"}},{"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":"internal/assets/opencode/plugins-v2/model-variants.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a29f283c4600b0ff75160dd3924e99da83f170878d93111ce6a2628963407e2"}},{"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":"internal/assets/opencode/plugins-v2/model-variants.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a2b0ef456f5104eb7f199c0f44b1f490028e966c9fba4a624945a5a017d14c"}},{"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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc987e73b8cdcaf7ee14a91e062b8a246b70e9ce224eedba96bf9b62e97186a7"}},{"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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feba59abc22cdda068187e9628b245f6d73dd22b9dd355e741d8d8467a8c73f"}},{"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":"internal/assets/opencode/plugins-v2/opencode-review-transport.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c0b98346e0a42a3cf75862df194f5bb63816a330e775b88a4089132909faf"}},{"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":"internal/assets/opencode/plugins-v2/skill-registry.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f946b4d3f1a42bdbe298e8e309d1eb3481c52fefb29f88cb0bda8fde4fa32550"}},{"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":"internal/assets/opencode/plugins-v2/telemetry-runtime.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0aa92d6e2e7a2141060760c0e2672863b925de28a4b813b678e5020f37f889"}},{"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":"internal/assets/opencode/plugins-v2/telemetry-runtime.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b1e55d737c11ab51adb57703b179afd075820570d388d298ce8600af605812"}},{"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":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23f57600ee972a1addccd3c80077fc5d43fa490312ac65eeec5cb739454b2e8"}},{"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":"internal/assets/opencode/plugins/opencode-review-transport.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8914caa5f252f5dd805adbf9e3c07503986bcced9cdb66ad51426f8c685b6ec9"}},{"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":"internal/assets/opencode/plugins/skill-registry.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3deab26274cdd41b025b2afb9047d4799ade2d4f430dcc53ea1882916175f06"}},{"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":"internal/assets/opencode/plugins/telemetry-runtime.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3267161f648ee189048fd58f677c313cd8f382eef21877450665e6a84598b646"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/app/app.go"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dbbeabd8a5fe382f5e1ff4b4dc70c64aab2094d419c7efe00944e19ed22be0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/app/app.go"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a474c35a931418622e2c9f3d02ddc9b00ab6c96c601b01903bfecdea595aaf7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/app/app.go"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad28da490a6d3ff754e8403e45d345635472ffee13bda7756ab2d1f32ae03481"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/app/app.go"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"489334d358480c5162f5c43c15d6b7056423d87ec42d04a4383a9ce9493c52ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/agents/opencode/adapter.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77d89b233d319fc4ac3e69e66d01b63d8ee87bc97050212112171cd59cbb023"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/agents/opencode/adapter.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0896915698f70bc48c9a46c63217dc54278c6f1d7e98a9e7deddd421e72d797c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060minimum, _ := parseSemanticVersion(MinimumGPT56RuntimeVersion)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060minimum\u0060 as if the call succeeded. When \u0060parseSemanticVersion\u0060 fails, \u0060minimum\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060minimum\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/codex/runtime_version.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"814af6f221b516d6cd4c72b4c477434f2d4922aff80709ed9e35f0126b715737"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/agents/codex/runtime_version.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0437001a2bc046db9d1891e5f9391d6551a43f56539876ea364ebc6a89c57b93"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: This repository commits no tsconfig, so whatever type-checks it uses tsc\u0027s own defaults, in which \u0060strict\u0060 and \u0060strictNullChecks\u0060 are OFF: \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060, and a value that is null is compiled through to the property access that throws. If the build passes \u0060--strict\u0060 on a command line instead, put it in a committed tsconfig \u2014 this check reads configuration, and configuration is all it can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060binaryVersion\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/main.go"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c17c5d08dad34b0d241c7c58fcff3e53161adf077443ac07f5df4cf90ba3ab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060envelopeName\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/record.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4bc4f8d07eedf9935b639e02ce3e486b4bdc1bb7b6fa3aba44d76ae85e2aeb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060canonicalCodeGraphRestrictedPath\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codegraph.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bafe307e0fe66583c6ca57c9a2781eea04fc09dfd81334ec134504922d2838"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060codeGraphHomeDir\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/codegraph.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87890927c48be309197178a7e905e2678edb8bf6711be2d56c11de0b4744601"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060doctorInvokedGentleAIClause\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/doctor.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adf845d595854dd78379cfd2f244895578ff784000dac3c6eb840f375bea3e4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060checkManagedReviewerAssets\u0060 turns a non-nil \u0060err\u0060 into \u0060return managedAssetProvenance{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_asset_provenance.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f670aa42ac8276b71bcae0582c793da07db6d1a35cc45370d4eb26fdf56beaf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reviewGitConfigValue\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_audit_actor.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b78fc48120c764817b750396f446c0a004d5e0aa7637bedf6324b391e0ff392"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reviewGenerateToolFaultDefectReport\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_defect_report.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c83a972659375274b9a898ebcb076ced5beb068264b791f38c516f2638b2ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reviewProviderRoleTaskSchema\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_roles.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"15612ab285917f3d8fca2d6850e4cb52b6cc4ac8bfb67e73d2990476ffc7402b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060savedCodexReviewModel\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_runtime.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b064df304f80b4756a7a377eb5ba6535d675ab6750ce262bf90487f1d1b49f32"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060savedClaudeReviewAssignment\u0060 turns a non-nil \u0060err\u0060 into \u0060return model.ClaudePhaseAssignment{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_provider_runtime.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce259ef4c17708c122fa4db5aae762a2dfd7a347cb0826805f531f38b8d532fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reviewRejectedResultClause\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/review_rejected_result.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16b4aef16cce8d3a8aba86c9122da5076d50a8e35211c8a79c46e783bb3029c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060openCodeSDKPeerConflictHint\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run.go"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"478e285b3a0f94cb34f6791b5cea7182c8e006f309e2a000cfef971592b445d6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060engramInstallDir\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022/usr/local/bin\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/download.go"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d088b6da4e2abf8eabfb8f6c6f398045d9dbaef55121fbcfcbe82f91a3d0bc86"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060stdioTimeoutFromConfig\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/engram/healthprobe.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"854c5513ef791030f175f0afa48892d10569a9cdd61b58ecb83a9fb944f85c8f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060SendClaude\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022discarded\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/claude.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c786e68fe146b36e09ceed339e8601170cb52bc83138029ef0054b065211ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060SendCodex\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022discarded\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3202307e0a8109f667e218df8216d2e5658bd0ba87c97c48fe51facbe7d49962"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readCodexAssignment\u0060 turns a non-nil \u0060err\u0060 into \u0060return telemetry.CodexAssignment{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/codex.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fd4b5522793de5aa24061da9d9b50dc21203d7b0fa905abebaab774aae4acc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060SendOpenCode\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022discarded\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/components/telemetryruntime/opencode.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee1af139419e6ef070cd542624d656312d573a0798d630b7a217754629fc31"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060DefaultSettingsPath\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/opencode/models.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba4054e051e54649602d4edeae8c9f3ef23274034bd8155a9b78fa625e92ea8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060safeAdmissionLocation\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/artifact_admission.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c26c4990d9b3335e78d854fbe4ce1ca4705399a2b2de504d0b22f191792192"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sortCompactInspection\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/compact_inspect.go"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"299753bfdc1d2c6f05691a5eb046d11c244bcd9c078e7c29c2f76fb53607d986"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060frozenRenamePairs\u0060 turns a non-nil \u0060err\u0060 into \u0060return nil, true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/reviewtransaction/risk.go"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c4ac84b5af1ea2c697e9b67389eae47ffe8d7df2dd54b2744eb7760863c8e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060userMustMainSourceStamps\u0060 turns a non-nil \u0060err\u0060 into \u0060return map[string]userStampRecord{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_main_source_cache_unix.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"263ea1bbbf8acae756c750407ca5679aebaa0e85d9c8f4238d0ffe837a0ec9fa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060userConfirmation\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_selection_windows.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeda62fca529f7f5c170ea5401764d5177c3513aac316ac17f6c8a50cf840d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060infoMode\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/shellinstaller/user_install_scope_windows.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"230cd07dd0dfaef82b8d315c3a8b675a8998ffc1314a6f3fb18f4bad19452f91"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060ComputeBundleDigest\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/state/manifest.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e564837343149c4c0b8f9b2a7fdbccaf985fb468e1d5648fb22191919b76654f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060SendRuntimeWithDeliveryID\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022discarded\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetry/runtime_send.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9946aa6a967b5a37562eaeb9e9318d38bf381e5995ac4cade5fdafb9d25f4776"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060runtimeMetricNumber\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/telemetrycollector/metrics.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"582f33c150c488c8d8bf777769087ba4813a0eba0505cf2fed6ad1e6f697863f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060detectInstalledVersion\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/detect.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7438a0891faaad6a3cef36902ff9371c0779dbfbd5e811fd3b1fb1dae1697e79"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060scoopRootWith\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/scoop.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a1ee963e5094eedc8dedc91ecf6ea7596469c544f615dc6c38a0c8f36f134c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060gentleAISourceCommandForResult\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022Beta target metadata is unavailable; rerun the update check.\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/update/upgrade/strategy.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2a7b7883ed2c339355ee31af34f04e670077a316e71c471f2bca707a61490a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060piPackageDir\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/crosslane/hostpi.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d06452cc3bdc87cbe816ea8d929de386de2181336ca29b74ab17f25ca7b6085"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(cmd, \u0022apt-get install -y golang\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(cmd, \u0022apt-get install -y golang\u0022)\u0060 also satisfies \u0060strings.Contains(cmd, \u0022apt-get install -y go\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":"internal/cli/run_integration_test.go"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3866e249a5547d6b6d27dacd402969d783c85c79079792908b64c4579611ba2b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(cmd, \u0022git\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060strings.Contains(cmd, \u0022https://github.com/Gentleman-Programming/gentleman-guardian-angel.git\u0022)\u0060 also satisfies \u0060strings.Contains(cmd, \u0022git\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cli/run_integration_test.go"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f17f28113a0fb9b8e3e0676747993ff26ef07a5662ff7253a85c47650b6d4"}}],"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-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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-22","guid":"b68d9ca7-bdde-d057-a6cc-9f8b1e739552","name":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)","shortDescription":{"text":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/22.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.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-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.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-276","guid":"4e27da05-61af-1d5c-aeb5-9f56b6ede3e3","name":"Incorrect Default Permissions","shortDescription":{"text":"Incorrect Default Permissions"},"helpUri":"https://cwe.mitre.org/data/definitions/276.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.html"},{"id":"CWE-476","guid":"df404eaf-4a12-445c-9306-241412f65220","name":"NULL Pointer Dereference","shortDescription":{"text":"NULL Pointer Dereference"},"helpUri":"https://cwe.mitre.org/data/definitions/476.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-703","guid":"fa730aa9-95e4-845e-83fa-8169f2cf339e","name":"Improper Check or Handling of Exceptional Conditions","shortDescription":{"text":"Improper Check or Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/703.html"},{"id":"CWE-704","guid":"50bd74b4-a921-5159-8671-99fd7e78c810","name":"CWE-704","shortDescription":{"text":"CWE-704"},"helpUri":"https://cwe.mitre.org/data/definitions/704.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-775","guid":"d927f6cc-6dc2-2a5d-946a-ca177830cbd7","name":"CWE-775","shortDescription":{"text":"CWE-775"},"helpUri":"https://cwe.mitre.org/data/definitions/775.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-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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"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":"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":70,"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."]}]}