{"$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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"rtk::run_cli (cyclomatic 305): rtk::run_cli has cyclomatic complexity 305 (threshold 15). Of this number, 304 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/lib.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"124f459c24a7e3c429b4003885f3b1a57b9488cfdd35cb3f3cafa2cd9d1ec376"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::condense_unified_diff_strict (cyclomatic 117): rtk::cmds::git::diff_cmd::condense_unified_diff_strict has cyclomatic complexity 117 (threshold 15). Of this number, 108 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e38bf636b00ce4ab858b4d2b8d5619de7c4d49b84aa397b1ddde036477abe2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::validate::validate (cyclomatic 68): rtk_engine::pipeline::validate::validate 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":"engine/src/pipeline/validate.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6abd420efbb096504908f9db14cc5a7c1a309ce3205fa230d9efc58f58aeb0"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::validate::validate_rule (cyclomatic 63): rtk_engine::pipeline::validate::validate_rule 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":"engine/src/pipeline/validate.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d46e4b55404acace55c0d38e19896dc2da462ba79b9fdc05b2b67727d4e5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::analytics::gain::run (cyclomatic 61): rtk::analytics::gain::run 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":"src/analytics/gain.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0929e9fd874dd8bccf52ccaab1c851168a55b62450571e9a6bdf4337dde6c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::runner::extract_test_summary (cyclomatic 54): rtk::core::runner::extract_test_summary has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e7dc4f6347d140e517618ca13facd56f0dbb73c6158bcb2bc7c0a4c7b25127"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::resolve::resolve (cyclomatic 53): rtk_engine::pipeline::resolve::resolve 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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93160ff736f42de35d951f66fea6aaa9de4358a90abe17ca633e669c6a1ef2a"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::run (cyclomatic 52): rtk::cmds::cloud::aws_cmd::run 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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087fa68a94e61f7cb32b153e2655e392b2bff035c10a270710ba36859afa98d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::lexer::tokenize_inner (cyclomatic 51): rtk::discover::lexer::tokenize_inner has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d33ef512d42379745d31ac2eb826220479c2d11e15c3f774703e2feb9c37e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::stream::run_streaming (cyclomatic 50): rtk::core::stream::run_streaming has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stream.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce393b7f97526030ceb87c30eff82faf53ddef96b5fd0f1bcac4426470cfa24"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::build_pytest_summary (cyclomatic 44): rtk::cmds::python::pytest_cmd::build_pytest_summary has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c67a4218e79f6b4011de764809be7a42c3aae6787ac674345b76b84998df50"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::uninstall_with_patch_mode (cyclomatic 44): rtk::hooks::init::uninstall_with_patch_mode has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c628b6c051e1858ce44ea63494ac3072dec19d7a757b87f79982af21b718058"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::registry::rewrite_segment_inner (cyclomatic 43): rtk::discover::registry::rewrite_segment_inner has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8868768d92f73c7513ca551929e361c4f1a0aa8198b7a2a95db5d87827b237"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::go::go_cmd::filter_go_test_json (cyclomatic 42): rtk::cmds::go::go_cmd::filter_go_test_json has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/go_cmd.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4933d8effac7cc8a3d9169d0431eba11a3cbcbb077895e25b26065af239c04"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::search::run (cyclomatic 42): rtk::cmds::system::search::run has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52531baf5f93817f5f70803e05e9834d71721253936ef54dfd1b982b3dff23d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_clippy (cyclomatic 40): rtk::cmds::rust::cargo_cmd::filter_cargo_clippy has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7b6f0056099fa4db24919e9b5b9910e41ef0362bbe51915d56a10361d5a9e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::scala::sbt_cmd::filter_sbt_test (cyclomatic 40): rtk::cmds::scala::sbt_cmd::filter_sbt_test has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/scala/sbt_cmd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1f614edd5d85d6e3d2abb1ff74784995dccc0dc1fc18f6d6bc870357f5877e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_install (cyclomatic 38): rtk::cmds::rust::cargo_cmd::filter_cargo_install has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef20725f9977282900edb6022fcad5c492c6285f18f6f93a4d0d916e8fe6c91"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_nextest (cyclomatic 38): rtk::cmds::rust::cargo_cmd::filter_cargo_nextest has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fe2558f0b63df0da14e37edc3aae84e03393e76f238ca5b87d14ad1610f7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_test (cyclomatic 38): rtk::cmds::rust::cargo_cmd::filter_cargo_test has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ed6d8660c54ec1456f23630e8d41c096ab8cfae07fcd0c7fca4ec15913701c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::search::extract_pattern_path (cyclomatic 38): rtk::cmds::system::search::extract_pattern_path has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"711951c9ccafd0d73e7aadf7cbb7fc17aeb60dee827aafd5a3f9b4517896a8a4"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::format_cmd::filter_black_output (cyclomatic 37): rtk::cmds::system::format_cmd::filter_black_output has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/format_cmd.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe547fde4eab3819b78691954b06658fe05e4e24cdefb4d645babf5470ffe8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::show_claude_config (cyclomatic 36): rtk::hooks::init::show_claude_config has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0607f825933461d299a6120bb3c134faadbeeadefc40f7b49168c8c85523e7"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_trx::parse_trx_content (cyclomatic 35): rtk::cmds::dotnet::dotnet_trx::parse_trx_content 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":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba15a778dc88df41e26f4d19245da2d1b1649ca54b5902891f25dff0aef96d5"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::php::phpt_cmd::parse (cyclomatic 33): rtk::cmds::php::phpt_cmd::parse has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/phpt_cmd.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ac3046265016a4df1fcf610dc517aab4fe0cecb006b2e43ffddc26ccb90221"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_add (cyclomatic 33): rtk::core::pipeline_cmd::run_add has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80702c77e501244227b574bb74ed04450afd68acf033d91b00559dd61a5b3be"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::binlog::parse_build_from_text (cyclomatic 32): rtk::cmds::dotnet::binlog::parse_build_from_text has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf53a4458d06df4aa364d004d6176c81dc217aa6b1d4a2a5c642fbc8ae057ea"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::js::lint_cmd::run (cyclomatic 32): rtk::cmds::js::lint_cmd::run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae24b8dd2bb2dfc0ec612885b55d4e8e3714aea9741e6f0779327fd8641d14d7"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::claude::patch_settings_json_command (cyclomatic 32): rtk::hooks::init::claude::patch_settings_json_command has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef8ec882d1f5786823ef069a3c77ca8118004709a67f66c152ea5bd2dae8f80"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::filter_pytest_output (cyclomatic 31): rtk::cmds::python::pytest_cmd::filter_pytest_output has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a925cd3cf8872e5c8078fc91cba6c155208a2f493a4cb6eb4ec0fe496b89197"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::sqlfluff_cmd::render_lint_json (cyclomatic 31): rtk::cmds::python::sqlfluff_cmd::render_lint_json has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/sqlfluff_cmd.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489b1f2da2dbbb25d3f2085e6cfb79a028b64524de14ad1d4492590a93239ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::toml_filter::apply_filter_with_info (cyclomatic 31): rtk::core::toml_filter::apply_filter_with_info has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/toml_filter.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8a25cd4a9211d6a93dc03c7ec53f865f801ca7f068bc2165cb8e2d2f353c2e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::offer_proxy_onramp (cyclomatic 31): rtk::hooks::init::offer_proxy_onramp 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":"src/hooks/init/mod.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1523d80f9fc725fdb5174429b454526f30dd29897d4d6435af651f111e4f6ca"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_log (cyclomatic 30): rtk::cmds::git::git_cmd::run_log has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"017b1fa6918e5a39b605e7fbd4be993419e81dc4d56527eb3854f1f377439aec"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::mypy_cmd::filter_mypy_output (cyclomatic 30): rtk::cmds::python::mypy_cmd::filter_mypy_output has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/mypy_cmd.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"825cb6cba70dab904ca6777a7bd23bdfa0db1a9e43dda539dd309217e09dffdd"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::run (cyclomatic 30): rtk::hooks::init::run has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5676f5158e0feceb8de71afedffb22857650b991fced3cf55348469ff3a21"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::resolve::patch_rule (cyclomatic 29): rtk_engine::pipeline::resolve::patch_rule 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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fe78a39b8223c7a87b95648340cd4ef6dc4d9c1d46dbc9fa72ee764a734419"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::analytics::gain::run_attribution (cyclomatic 29): rtk::analytics::gain::run_attribution has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee60826003cfd22b8e8636fef91803fc6a27367eece8aa1ec125d3b46b7c198e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::compact_diff (cyclomatic 29): rtk::cmds::git::git_cmd::compact_diff has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0055c6720e5d56f30b75a45e800173943a2527f62039a590d317af828c40958"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_stash (cyclomatic 29): rtk::cmds::git::git_cmd::run_stash has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cddca888b2b20888e3a48e4d34bd94981789a810bed4987489cc46ca572dad7"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_show (cyclomatic 29): rtk::core::pipeline_cmd::run_show has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"912bd3eef01fe3f376144279266bca771152cfa00264789c9a1cab23335b56b4"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::ruby::rspec_cmd::filter_rspec_text (cyclomatic 28): rtk::cmds::ruby::rspec_cmd::filter_rspec_text has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rspec_cmd.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa2a58d7ef21ef7fcbc6e5ab9099855882ac692c15ea5aa55b5450658085eae"}},{"ruleId":"D1","level":"warning","message":{"text":"SurefireBlock::step (cyclomatic 27): SurefireBlock::step has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"24584023c98daf404902cc81ed20ec880419731679cdb2e6d111349ac31458ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::env_cmd::run (cyclomatic 27): rtk::cmds::system::env_cmd::run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/env_cmd.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"802c928c142b82e4e7bedcad2ef0a46e765d1f5e6b6f901adb39af58cab8596d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::run (cyclomatic 27): rtk::discover::run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf8cb78d86eff86a434d86892acb7cef7f4d774591c892e26c6f573841aae37"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::js::next_cmd::filter_next_build (cyclomatic 25): rtk::cmds::js::next_cmd::filter_next_build has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/next_cmd.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c71dceadc37130271861b42d3204bb8b08d0affe20372de5fed449bbad359d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_compile (cyclomatic 25): rtk::cmds::jvm::mvn_cmd::filter_compile has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da99eb87534a114e3dbcbd170625f38544812b9520f4c270443a138cc398bea"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::schema::parse_rule (cyclomatic 23): rtk_engine::pipeline::schema::parse_rule has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/schema.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c124edefaa31d05f29d6c077d5da09ea97ff5224f388989a4ace970d297d853"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_proxy::context_analysis::analyze (cyclomatic 23): rtk_proxy::context_analysis::analyze 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":"proxy/src/context_analysis.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c1b7a91a9c7d454d926a787edb3d26fb258490ea7e2b3012a7682815f0a946"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::unwrap_dynamodb_value (cyclomatic 23): rtk::cmds::cloud::aws_cmd::unwrap_dynamodb_value has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b01e860f46256d48ef8c1cf8a7efb3604428e078b69bf84556b6ceaecd133"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_branch (cyclomatic 23): rtk::cmds::git::git_cmd::run_branch has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"496c8ea9e5c8e113b723c4fc2aae7f585b989333c132dcb95556bd43d2f071f1"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::arg_tokenizer::tokenize_scan (cyclomatic 23): rtk::core::arg_tokenizer::tokenize_scan has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b59b5fe8ec7a92a3e2b3a7cee3e33b3e00b39ad849098457d53bd2845284d1"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_remote::publish_repo (cyclomatic 23): rtk::core::pipeline_remote::publish_repo has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b466afdc545f788675c476c7cfadfded6ee97db4cf79fe9b289e0a01212fa006"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog (cyclomatic 22): rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog 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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"53450c624843cfa458891b43fc9ace8652512a4cc2422183ac17606b6a9f6ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_show (cyclomatic 22): rtk::cmds::git::git_cmd::run_show has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"21496895b9a1ab35fbe3988a18ea740b51616b932ab2a8ac49f954f5206218ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::php::phpt_cmd::build_summary (cyclomatic 22): rtk::cmds::php::phpt_cmd::build_summary 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":"src/cmds/php/phpt_cmd.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"540dbd547c3354d661b01f844ae25bbc04bf43f0609bf097dc9c367fd4f43d05"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::ls::compact_ls (cyclomatic 22): rtk::cmds::system::ls::compact_ls has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ls.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb189be7069e3a407332fcdc409d21aa39626f99bbe239237858dbae442812d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_cmd::print_terminal_card (cyclomatic 22): rtk::core::pipeline_cmd::print_terminal_card has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7cd6d957f3308e6d1bf7edd5dff3fe0a62bf2d90796a5d695474ee7e17e2ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::instructions_body_for (cyclomatic 22): rtk::hooks::init::instructions_body_for has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5babc4041f911a744dd47f1b9d8f24ba11a3c3a411df3b1217df0e77625aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::trust::run_trust (cyclomatic 22): rtk::hooks::trust::run_trust has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/trust.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b1a0d1fa5ea5481f1a6a46026b897ce0de53d0d1c0e8a3769715979f26102"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_proxy::run_start (cyclomatic 21): rtk_proxy::run_start 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":"proxy/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a940348a9f6baf92aef98b92bc0337825afe1d66a8744c977f9706199c15ad62"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::cloud::container::format_kubectl_pods (cyclomatic 21): rtk::cmds::cloud::container::format_kubectl_pods has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093d30e89be1f01a74615cf21fc7db083e827b86d9051e9f5e9f7d0128fb9cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::format_test_output (cyclomatic 21): rtk::cmds::dotnet::dotnet_cmd::format_test_output has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c07fcc713532cae9b2de12c2efed8018e0b9453e3b7f72506f080906cffdf0"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::js::lint_cmd::filter_pylint_json (cyclomatic 21): rtk::cmds::js::lint_cmd::filter_pylint_json 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":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b860db50288ba2e114f95858c6d5937bc943d281098ca312588765831de189c"}},{"ruleId":"D1","level":"warning","message":{"text":"SseAccumulator::feed_tool_use (cyclomatic 20): SseAccumulator::feed_tool_use 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":"proxy/src/forward.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4ff1add8ba1f415ae8a3f4f40d5689a0a6f064dcd06af336d02773aa58a6fe"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::cloud::wget_cmd::extract_filename_from_output (cyclomatic 20): rtk::cmds::cloud::wget_cmd::extract_filename_from_output has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/wget_cmd.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1066ec42a6dbca5c62809d72024c667cdda77bdecc605bc28f5f018972217a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::js::prisma_cmd::filter_migrate_dev (cyclomatic 20): rtk::cmds::js::prisma_cmd::filter_migrate_dev has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4471983bac9f9fe15e50380a56c57354bd5a0921935e3e28dbdee46b4ff6de"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::js::tsc_cmd::filter_tsc_output (cyclomatic 20): rtk::cmds::js::tsc_cmd::filter_tsc_output has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb69f665a07301fc5e051d4f3dae68d18398529ce64654e948fb3e218a0d85d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::pipe_cmd::auto_detect_filter (cyclomatic 20): rtk::cmds::system::pipe_cmd::auto_detect_filter 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: rtk::cmds::system::pipe_cmd::resolve_filter (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/pipe_cmd.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4289911e800da533aab5d6592cb2922b9464f86acff9db370431c747763aed"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::lexer::segment (cyclomatic 20): rtk::discover::lexer::segment has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccd69651cbcde3099eb276f7abd3f404f661d55c843fd05ed42e11a6e6e4997"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::registry::rewrite_multiline_block (cyclomatic 20): rtk::discover::registry::rewrite_multiline_block has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"127a9f2375d660eed9627529c7e6680512c84b19c8b6f2ab6876c5137329a506"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::antigravity::migrate_legacy_rules_at (cyclomatic 20): rtk::hooks::init::antigravity::migrate_legacy_rules_at has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/antigravity.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf48833b42d3fc7ee55cf5b0fbffc96d005da45b3edcae51e89a16d8e1b600"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::schema::parse (cyclomatic 19): rtk_engine::pipeline::schema::parse has cyclomatic complexity 19 (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":"engine/src/pipeline/schema.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8ba336a46fcabc3c9005bc01090f40036e6a2235ffa9ea0ddde20d2860d596"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_proxy::ccr_forward::run_anthropic (cyclomatic 19): rtk_proxy::ccr_forward::run_anthropic 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":"proxy/src/ccr_forward.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d43aec31ae1bd5a46824c197a05f4aca6c453b1082d3be4ca4f938882ac1c09"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::filter_s3_transfer (cyclomatic 19): rtk::cmds::cloud::aws_cmd::filter_s3_transfer 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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"808aa6151068f7f8e9c664d1234f1671a6f1403812f3f91c1f35283fe8c93ead"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::decode_backslashes (cyclomatic 19): rtk::cmds::git::diff_cmd::decode_backslashes 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":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c8ee736552a73c4a41f5f3d0d8c7239e8e98cf43daebdc7dff88c752b4a21"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::jvm::gradlew_cmd::filter_dependencies (cyclomatic 19): rtk::cmds::jvm::gradlew_cmd::filter_dependencies has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/gradlew_cmd.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3338ecb47f113239832bee926dd741a8e500d5c1ca6e8c0d8b145809bdb5998c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_package_with_cap (cyclomatic 19): rtk::cmds::jvm::mvn_cmd::filter_package_with_cap has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c52b6d51684b056a3765ee44fd200574cb646bac4b8af4291aed75d6b47f28"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::filter_ruff_check_json (cyclomatic 19): rtk::cmds::python::ruff_cmd::filter_ruff_check_json has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bd82851133bab2f81e6c2a213631b9186c9ea84ec286f7484127c3c903563e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::local_llm::detect_patterns (cyclomatic 19): rtk::cmds::system::local_llm::detect_patterns has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/local_llm.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaf76075fa57156ee43f5e858d9f5c18ba68622852a0252417feb0407bbc8e8"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::log_cmd::analyze_logs (cyclomatic 19): rtk::cmds::system::log_cmd::analyze_logs has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/log_cmd.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df1b33561090e769769277b078ea79c1849d42bb2583aaccbd21dc2a7d3732c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::classify::insert_classifier_facts (cyclomatic 19): rtk::core::classify::insert_classifier_facts has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/classify.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"324dd964259f6572e727a558c16172496dfd8773736a11769e82ffcdd046afd1"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_engine::pipeline::conditions::check_hook_key (cyclomatic 18): rtk_engine::pipeline::conditions::check_hook_key has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/conditions.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf99e18d8d37d07bef647534f9c08af8ae31535d401c6ebe8e3e3e95f4fbf4b"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::new (cyclomatic 18): AppState::new 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":"proxy/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d937e079b283305e5cb48a5483fe177655fe998ee131fd5b9411ccde3acc2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_proxy::ccr_forward::run_openai (cyclomatic 18): rtk_proxy::ccr_forward::run_openai 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":"proxy/src/ccr_forward.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c758be90101a6c1ea4e96bdf141c8723a1cbd7de29489e3ccbcd3069ebbc589"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::run_fallback (cyclomatic 18): rtk::run_fallback has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d77401bb7b5313023c5019e753818a03965165abda480ef77873082e8e49d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::binlog::parse_test_from_text (cyclomatic 18): rtk::cmds::dotnet::binlog::parse_test_from_text has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e3a61e237b89c44321997474c933421a4dff4dc032f535f5d6d2e6c8c9eae"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_worktree (cyclomatic 18): rtk::cmds::git::git_cmd::run_worktree has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8807394740aaf42ff1d57f30d3eab6138108076ee9a51c0aafc94de74e2567d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::js::prettier_cmd::filter_prettier_output (cyclomatic 18): rtk::cmds::js::prettier_cmd::filter_prettier_output has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/prettier_cmd.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5682a4dfcec8d2b4e64e2bb69263b0342950091df2c28b7e3a97796a44c2a64"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::php::phpunit_cmd::filter_phpunit_output (cyclomatic 18): rtk::cmds::php::phpunit_cmd::filter_phpunit_output has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/phpunit_cmd.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa699a539903ef7a4266329f30af545a72411f0f9efc8fba0ee936b8df957e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::filter_ruff_format (cyclomatic 18): rtk::cmds::python::ruff_cmd::filter_ruff_format has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"060edd22554c7f6e49ca9d85f221aca9c8e2de604af74f4ad4f343d5bcb906f4"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::json_cmd::extract_schema (cyclomatic 18): rtk::cmds::system::json_cmd::extract_schema has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/json_cmd.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d9b2b0958111066286c7fe7a1009ea3dc869ebd80cf15c5ec333644b0e4200"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::filter::advance_triple_quote (cyclomatic 18): rtk::core::filter::advance_triple_quote 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":"src/core/filter.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fcee12135c1fd0a0af2f8aee8e5700db7aab3ea5762356e220a98eef68443e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_cmd::share_card (cyclomatic 18): rtk::core::pipeline_cmd::share_card has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe8c746a04345a61aa3a6eba73cc5a7f67d4c06d0cd2c2130020557c84b8144"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_explain (cyclomatic 18): rtk::core::pipeline_cmd::run_explain 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":"src/core/pipeline_cmd.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31b0e98005861797afcb1d995df038592a990f1fac4b29aff314a56aead73a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::retriever::run_recall (cyclomatic 18): rtk::core::retriever::run_recall has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retriever.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1dd67f89ba4239adde8e5baf32a5dc06951514a5ce73a1361bc6d6c25fa7c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::registry::classify_command (cyclomatic 18): rtk::discover::registry::classify_command has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75897100c8f82ae9fbf5047186bc61e2516b047703e68847e938cdc2a58dfa2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::registry::analyze_pipeline (cyclomatic 18): rtk::discover::registry::analyze_pipeline has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81494daf250801c26f5869a1aa7f0f285d0700bb6843dd4c88df7f5be74fa77"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::agents_md::patch_agents_md (cyclomatic 18): rtk::hooks::init::agents_md::patch_agents_md has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/agents_md.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"455f93db06b9fafa1e1296b493e3cd0b662324dc12c77b9e6e561fd462ad9d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeProvider::extract_commands (cyclomatic 17): ClaudeProvider::extract_commands has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/provider.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d073f488c815ef1e7fdd38d2de7c2f11cb26870806cbe5bb2289950d9aeb5f10"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::jvm::gradlew_cmd::filter_test (cyclomatic 17): rtk::cmds::jvm::gradlew_cmd::filter_test has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/gradlew_cmd.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd381073f49d58dae9fc832aa48cc58552c100eb12ad8567c212efa1a4462509"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::ruby::rspec_cmd::build_rspec_summary (cyclomatic 17): rtk::cmds::ruby::rspec_cmd::build_rspec_summary has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rspec_cmd.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c6fb2200e4f4ae730d042d5c8ba7be9cce260c5a8669dd724df48613c06e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::format_cmd::run (cyclomatic 17): rtk::cmds::system::format_cmd::run 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":"src/cmds/system/format_cmd.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac150348b49af240a7801ec737dc8bfcdb2fb9f927843210f9c69a50ce53db93"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::call_context::pieces (cyclomatic 17): rtk::core::call_context::pieces has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/call_context.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"909b3a780488f1d2ccabd07bed65a0ce4fe8b314fe7e0572f05cafd04f3e1086"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_remote::select_menu (cyclomatic 17): rtk::core::pipeline_remote::select_menu has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3a74743c60255ca52f9ae1bcd9f9db30a7ca87e9b97ffb302b7e36585ae602"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::report::format_text (cyclomatic 17): rtk::discover::report::format_text has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/report.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f52744803a71c540d4892f2e0bc5c2238de3404a123c340003dada29fd5d31e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::claude::run_default_mode (cyclomatic 17): rtk::hooks::init::claude::run_default_mode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58f376bcaa7bf1988b672a516f1a9f24614fe465b79d79d1e09e63b00df9cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk_proxy::forward::relay (cyclomatic 16): rtk_proxy::forward::relay 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":"proxy/src/forward.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e34a4774c5bb384c933d7510f5dfd55e65d3293f28e6a23f0abbfd0f56ac0b"}},{"ruleId":"D1","level":"warning","message":{"text":"TscHandler::format_summary (cyclomatic 16): TscHandler::format_summary has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f707724d0e6ff54c2e38295b80e309b71b69be67fb4185f8907416829aad5796"}},{"ruleId":"D1","level":"warning","message":{"text":"MinimalFilter::filter (cyclomatic 16): MinimalFilter::filter has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/filter.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93eddec486411fe58023d3fdd73fc63d927d7c9a9c0861398d4f2c109ce5bff"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::analytics::cc_economics::compute_totals (cyclomatic 16): rtk::analytics::cc_economics::compute_totals has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad66b37e04d9dc419f045165ad6389bc52e266d95be0ef15fdd66432f14d6c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::analytics::gain::run_pipeline_detail (cyclomatic 16): rtk::analytics::gain::run_pipeline_detail has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac5aa7fc5bd56e71ca2cb6419c358e7ab5418d12ea7f7e5618c1af6caa195db"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::analytics::gain::print_efficiency_ledger (cyclomatic 16): rtk::analytics::gain::print_efficiency_ledger has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f37a3fa62492bd79c00ccc3121ffad6b471e0f6a10bfb35c67e0458396b0c74"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::binlog::parse_event_record (cyclomatic 16): rtk::cmds::dotnet::binlog::parse_event_record has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc568789be2e108f49c1ddc7d5edc3ec6f1e51aadda73f0b750f88d71e6401"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir (cyclomatic 16): rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf0478ce41f6596a1062ed8f85a540504ef7871ca33521984829086b4de816a"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_diff (cyclomatic 16): rtk::cmds::git::git_cmd::run_diff has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53dfff12a4f7efad7f014e13848508aecb2a9f051af35c0e17b9266b6a0fe77"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_pull (cyclomatic 16): rtk::cmds::git::git_cmd::run_pull has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b440d6f713e2f5a4c5dd19652620bf57655988d4852e70229f9de7a715efca"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_surefire_with_cap (cyclomatic 16): rtk::cmds::jvm::mvn_cmd::filter_surefire_with_cap has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a5e69bda872954962d92b23dbacf7d25f15bf472f2e63ae09cd7847ce907b9"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::ruby::rake_cmd::filter_minitest_output (cyclomatic 16): rtk::cmds::ruby::rake_cmd::filter_minitest_output has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rake_cmd.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0352e53483c86f67a74d8d6274f7b9ef076adc6b09bd401499d70fa2af5561"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::json_cmd::compact_json (cyclomatic 16): rtk::cmds::system::json_cmd::compact_json has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/json_cmd.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cfdbaf9a25194726af610c51ffa6465ebd2249b8db5cdf8fe50e8378e2f97c"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::summary::summarize_tests (cyclomatic 16): rtk::cmds::system::summary::summarize_tests has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/summary.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b37480a684a9b5b6865779942111c89021f8a4eacfc1a95e01f46cff910ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::summary::summarize_build (cyclomatic 16): rtk::cmds::system::summary::summarize_build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/summary.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5f4e8cb9cf9db283fefd42251963fc363c785b9c2dfe1d5f10039d3e55becc"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::pipeline_config::load_from (cyclomatic 16): rtk::core::pipeline_config::load_from 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":"src/core/pipeline_config.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfa2ec6dc90ef1fdcd74b8debee536750ed2ef3ae1cbd6a96b9b717dbb8f27a"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::permissions::check_command_with_rules_and_prefixes (cyclomatic 16): rtk::hooks::permissions::check_command_with_rules_and_prefixes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc13ae33709fdb9d6a3128dc102dc36560de376f2f150a716cb6c06c8ad1e2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::run_cli (cognitive 276): rtk::run_cli has cognitive complexity 276 (threshold 15). Drivers by points: if/else 93 (164 pts), match/switch 37 (87 pts), loops 6 (15 pts), boolean chains 10 (nesting depth added 130). Of this number, 274 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3b89f4d5451318cfc838e41c11fb907e664acaab2a8192f2ac5e7c01280798"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::condense_unified_diff_strict (cognitive 245): rtk::cmds::git::diff_cmd::condense_unified_diff_strict has cognitive complexity 245 (threshold 15). Drivers by points: if/else 75 (201 pts), boolean chains 34, match/switch 5 (21 pts), loops 3 (5 pts) (nesting depth added 144). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (rtk::cmds::git::diff_cmd::condense_unified_diff_strict::flush) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d89069afe301bcde7dc0ba19db4c1d75fc9ec54bb67d47686b27c51a29f57f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::validate::validate (cognitive 157): rtk_engine::pipeline::validate::validate has cognitive complexity 157 (threshold 15). Drivers by points: if/else 39 (115 pts), loops 13 (27 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/validate.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0422e12a61daff67ec0885fb793112702e89828fbf85af9c0248a3f94e9b4799"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::gain::run (cognitive 118): rtk::analytics::gain::run has cognitive complexity 118 (threshold 15). Drivers by points: if/else 42 (88 pts), loops 4 (13 pts), boolean chains 12, match/switch 3 (5 pts) (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e802c579c2bb0afc9be8913cda963c51521f1aaa01a79c449c09b095b90b73"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::resolve::resolve (cognitive 115): rtk_engine::pipeline::resolve::resolve has cognitive complexity 115 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 26 (50 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/resolve.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06a0a8fd01698ea0c3d53115170b8a5fa15aed6a129231ad53b381d062d0770"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::validate::validate_rule (cognitive 114): rtk_engine::pipeline::validate::validate_rule has cognitive complexity 114 (threshold 15). Drivers by points: if/else 37 (79 pts), match/switch 6 (17 pts), boolean chains 14, loops 3 (4 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/validate.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa62feaac20a6805db430e5916ecb2c5c9d256ef47452f75ebeceae72370339"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::stream::run_streaming (cognitive 114): rtk::core::stream::run_streaming has cognitive complexity 114 (threshold 15). Drivers by points: if/else 30 (72 pts), match/switch 9 (23 pts), loops 7 (17 pts), boolean chains 2 (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stream.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96e922ce2f883a77e6977be175fe18e5b7c5adac83050ef25a6818efd50ef08"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::runner::extract_test_summary (cognitive 107): rtk::core::runner::extract_test_summary has cognitive complexity 107 (threshold 15). Drivers by points: if/else 33 (84 pts), boolean chains 12, loops 5 (9 pts), match/switch 1 (2 pts) (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"712044604d168195b38e94148bf94431962fadecb6fb7cfb008427806efd2271"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::lexer::tokenize_inner (cognitive 107): rtk::discover::lexer::tokenize_inner has cognitive complexity 107 (threshold 15). Drivers by points: if/else 33 (81 pts), loops 4 (13 pts), boolean chains 11, match/switch 1 (2 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c400564e4c689118a475776860bbd9a2af3384e076917c990446cae32630019d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::search::extract_pattern_path (cognitive 93): rtk::cmds::system::search::extract_pattern_path has cognitive complexity 93 (threshold 15). Drivers by points: if/else 25 (66 pts), match/switch 5 (17 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ccabbcf04424c88d4a9bc78bbaf6365c9cc41e07b944a88d0e87d8c151c5bf"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::uninstall_with_patch_mode (cognitive 91): rtk::hooks::init::uninstall_with_patch_mode has cognitive complexity 91 (threshold 15). Drivers by points: if/else 48 (80 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bbf2973c3a954c6dc4d6d3077a6d5c1294afc23a4d0a803c31b672421493e6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::build_pytest_summary (cognitive 85): rtk::cmds::python::pytest_cmd::build_pytest_summary has cognitive complexity 85 (threshold 15). Drivers by points: if/else 28 (57 pts), boolean chains 12, match/switch 3 (11 pts), loops 3 (5 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee404b108a2142ba89233f73685800ce8406dcc5d77688ad150a547d3375e454"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::format_cmd::filter_black_output (cognitive 84): rtk::cmds::system::format_cmd::filter_black_output has cognitive complexity 84 (threshold 15). Drivers by points: if/else 20 (52 pts), loops 6 (20 pts), boolean chains 12 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/format_cmd.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2be991abe2eb5bcf4c8dacf8906f9e95c4f4dc6a532991e8ec18737aabca85"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::scala::sbt_cmd::filter_sbt_test (cognitive 81): rtk::cmds::scala::sbt_cmd::filter_sbt_test has cognitive complexity 81 (threshold 15). Drivers by points: if/else 31 (65 pts), loops 6 (11 pts), boolean chains 5 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/scala/sbt_cmd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0057d8f63b52f7ff127f81b09e9e2f3520416cd2b01265800703e379c6c5de"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::go::go_cmd::filter_go_test_json (cognitive 78): rtk::cmds::go::go_cmd::filter_go_test_json has cognitive complexity 78 (threshold 15). Drivers by points: if/else 21 (52 pts), loops 8 (13 pts), boolean chains 7, match/switch 3 (6 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/go_cmd.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1615e7ca599eb030ed90a46fddfc254c55d8b3f4e64d5ba519fe2a553f0b9ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_clippy (cognitive 78): rtk::cmds::rust::cargo_cmd::filter_cargo_clippy has cognitive complexity 78 (threshold 15). Drivers by points: if/else 28 (59 pts), boolean chains 10, loops 5 (9 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a35e359046233b8f9a68c4c9b9a0ef5558afde1c662232885a05ab2d18d4cb4"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_install (cognitive 75): rtk::cmds::rust::cargo_cmd::filter_cargo_install has cognitive complexity 75 (threshold 15). Drivers by points: if/else 29 (62 pts), boolean chains 9, loops 3 (4 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b46fae07eb586f114cc113de47ce922a74a8e64c70c6c2b658883493bc0519a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::show_claude_config (cognitive 73): rtk::hooks::init::show_claude_config has cognitive complexity 73 (threshold 15). Drivers by points: if/else 45 (66 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51303ebd7172be2cbc10529d4bfac86719c272584b3146b685eb9069cb0cb11"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::context_analysis::analyze (cognitive 66): rtk_proxy::context_analysis::analyze has cognitive complexity 66 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 5 (25 pts), loops 4 (16 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":"proxy/src/context_analysis.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3f855ea41ce0fa7f8ad567e6740fa6cc99745bed0a31f4c3412dcceb733c47"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_nextest (cognitive 65): rtk::cmds::rust::cargo_cmd::filter_cargo_nextest has cognitive complexity 65 (threshold 15). Drivers by points: if/else 29 (53 pts), boolean chains 5, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21937267616036a5d1b40d388062139133df79a848b54d192562ac70a35f884"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::search::run (cognitive 65): rtk::cmds::system::search::run has cognitive complexity 65 (threshold 15). Drivers by points: if/else 30 (47 pts), boolean chains 11, loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"91adedefcbefd0309b68592beefdc36ed53b8cd208f6687aff4b2b83db89bc51"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::run (cognitive 64): rtk::discover::run has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (40 pts), match/switch 7 (16 pts), loops 4 (8 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a223b3005f4744e13504004ad5f9b4f9885b9e6a9d27e91707e5433a2d656e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_test (cognitive 62): rtk::cmds::rust::cargo_cmd::filter_cargo_test has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 11, loops 6 (10 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e34aa5ec4e5a323186f3c2fc891420b5cda9fdd071569cb77f1a1ecb5e5e68"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::arg_tokenizer::tokenize_scan (cognitive 62): rtk::core::arg_tokenizer::tokenize_scan has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (43 pts), match/switch 2 (10 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"173a457fb8f8a37db6f8e7fe496044a2f0818a859cddee3ba9e3772b8f36c781"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::gain::run_attribution (cognitive 61): rtk::analytics::gain::run_attribution has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 8 (19 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0e7e04f02d19efc1e46cb5cc5cce62da2cbdb775c680bed271013b59a69b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::compact_diff (cognitive 60): rtk::cmds::git::git_cmd::compact_diff has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (54 pts), boolean chains 5, 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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c101c79b5f782dd2fb4e076b096284f5d3c399e34f104898562fd3f96d1ca43"}},{"ruleId":"D2","level":"warning","message":{"text":"SseAccumulator::feed_tool_use (cognitive 58): SseAccumulator::feed_tool_use has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (46 pts), loops 3 (11 pts), match/switch 1 (nesting depth added 40). 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":"proxy/src/forward.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b60de3dd082edc970a46df3a31331f26598dc9ae2ec5190e6047411c1ce12"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::mypy_cmd::filter_mypy_output (cognitive 56): rtk::cmds::python::mypy_cmd::filter_mypy_output has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 8 (16 pts), boolean chains 7 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/mypy_cmd.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbfd22e167d09641a9ff745566e5ce954602dd95a376d8a4e036b5312c472e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_segment_inner (cognitive 56): rtk::discover::registry::rewrite_segment_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (41 pts), boolean chains 12, loops 2, 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":"src/discover/registry.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ba8ce52e9117eeffd7ad4cc08cbbef2ac85da2f418b703a979170b1a65aeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_show (cognitive 54): rtk::core::pipeline_cmd::run_show has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 6 (12 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95c80848b88f35ed6114f031925a4d1b2ea499c2686e5534d8d580c514843b2"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::binlog::parse_build_from_text (cognitive 53): rtk::cmds::dotnet::binlog::parse_build_from_text has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 6 (15 pts), boolean chains 8, match/switch 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e49c335e1669e391df009d8da4edce2f43590a288aebd59d0647e3d507ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::claude::patch_settings_json_command (cognitive 52): rtk::hooks::init::claude::patch_settings_json_command has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (41 pts), loops 4 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3aa4c7555f5d2b09c6176555feb51a24f3d7acab2a125bee38cb7473eb3606"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::ruby::rspec_cmd::filter_rspec_text (cognitive 50): rtk::cmds::ruby::rspec_cmd::filter_rspec_text has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 3 (4 pts), boolean chains 3, 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":"src/cmds/ruby/rspec_cmd.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0db55cbf7c991b6b56626db490aa554da2b71f797e5702493425841863ae450"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_trx::parse_trx_content (cognitive 49): rtk::cmds::dotnet::dotnet_trx::parse_trx_content has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 5 (14 pts), boolean chains 2, 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":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce06c50a8b9352035cebc1a8d5476937b0e8038838eda2db0782f0b978daaa2"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::filter_pytest_output (cognitive 48): rtk::cmds::python::pytest_cmd::filter_pytest_output has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 10, 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":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"419910a44bb89d0a256b8ed4ae5585fb715bc56fe92b3d552b17cde43e149b98"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_stash (cognitive 47): rtk::cmds::git::git_cmd::run_stash has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 3 (6 pts), boolean chains 5, match/switch 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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"316a35f6932e9c51035f125aba8dc04986421705b50669823822c911ef2fded5"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::sqlfluff_cmd::render_lint_json (cognitive 47): rtk::cmds::python::sqlfluff_cmd::render_lint_json has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 8 (12 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/sqlfluff_cmd.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df6ccd90fda2d6d60bce2599fd8632a4e06120ab2bae149432ac0195ae038a0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_add (cognitive 46): rtk::core::pipeline_cmd::run_add has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (29 pts), match/switch 5 (7 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"274309cd1b5de1e25171b2e4f984c0f71d75bd561f0b9d7f7770a0e68254030b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::env_cmd::run (cognitive 45): rtk::cmds::system::env_cmd::run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 7 (15 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/env_cmd.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebd8a8a717029f259ab8b15f219c8cda27b905bf9a56c8b4d8b28976ab2e73f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::resolve::patch_rule (cognitive 44): rtk_engine::pipeline::resolve::patch_rule has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 5 (8 pts), match/switch 2 (4 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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"782e660d7f6d9c5d15619fd00cc4465276654f63e7129a6b5174e6efa8adbd41"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_log (cognitive 44): rtk::cmds::git::git_cmd::run_log has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (32 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede56326656bc0a430f2d9b7cc23a0b291732ae599067cbe6ec99381889ab27b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_compile (cognitive 44): rtk::cmds::jvm::mvn_cmd::filter_compile has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 8, 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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7a503e8c5cfde717f218a93622fc3773da605f4f24b00ee8084683c866a651"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::filter_ruff_format (cognitive 44): rtk::cmds::python::ruff_cmd::filter_ruff_format has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 4 (12 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"854303d7342ed4139f6ebf168c8174c80976a5db1622dd4a719da11d7215fbf8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::write_if_changed_internal (cognitive 43): rtk::hooks::init::write_if_changed_internal has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 1 (2 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":"src/hooks/init/mod.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ea2aa7e43e3569c48348eb35b7caea885f33efe6452d939d2f4534c056e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::ccr_forward::run_anthropic (cognitive 42): rtk_proxy::ccr_forward::run_anthropic has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/ccr_forward.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cab8d7f9873738fe3129ec3816baa3e3e4030bfffcc60b63d6ade62a24effe1"}},{"ruleId":"D2","level":"warning","message":{"text":"SurefireBlock::step (cognitive 42): SurefireBlock::step has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 9 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"de66f60b39aa51a7140c571bf03f185f551f4bb03a34c247c5d8fb673d7cbc1f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::unwrap_dynamodb_value (cognitive 42): rtk::cmds::cloud::aws_cmd::unwrap_dynamodb_value has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e57bfb73f809ec8ba21e66979c7081c97f75c93c5f2570bc47b5ae88d6ce1a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::trust::run_trust (cognitive 42): rtk::hooks::trust::run_trust has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 4 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/trust.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f55ca239fa747ef163286c849d425c02ded9f7f4fd6423ba87660d8cfd5a18"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::ccr_forward::run_openai (cognitive 41): rtk_proxy::ccr_forward::run_openai has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/ccr_forward.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ae17159a8b0765e9f77c4b7d629e58428d1e675b2d8d0b36347391fdc40fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::lint_cmd::run (cognitive 41): rtk::cmds::js::lint_cmd::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feaf16cd39ed685d44f7be72563dec1109a0152d2666e8942232cb6557f336e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::share_card (cognitive 40): rtk::core::pipeline_cmd::share_card has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"043383b2154ec3f512efce01de99867def2bffbed73ffe4c37c0422e59124922"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::extract_assume_principals (cognitive 39): rtk::cmds::cloud::aws_cmd::extract_assume_principals has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (13 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f428b8229361b8dbaaa8cf9295e8603b814662d6e9e91d857492e1ee0eb66c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::binlog::parse_test_from_text (cognitive 39): rtk::cmds::dotnet::binlog::parse_test_from_text has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"202b0c440b1bac7d16e911bad19b7268d081a538b3034b0442fa646cd5c6f643"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::next_cmd::filter_next_build (cognitive 39): rtk::cmds::js::next_cmd::filter_next_build has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/next_cmd.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc918551aac00d32520318f70169eb858e25090b9b09d7b1a2f30e30e01f2977"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::log_cmd::analyze_logs (cognitive 39): rtk::cmds::system::log_cmd::analyze_logs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/log_cmd.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f748aa7b6b703de235adf90a1165359937e668be3eb4ed50d7dd477977903d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::toml_filter::apply_filter_with_info (cognitive 39): rtk::core::toml_filter::apply_filter_with_info has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 7, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/toml_filter.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"268f9d42732d11a788cb085dcb2471f203599c2ab2a866eca0c91a2eef8f858a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::run (cognitive 39): rtk::hooks::init::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (31 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58de54c8a595c62c84638e2d80f44917e9d66857c232f38493e7c76deafc3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::extract::tool_calls_from_response (cognitive 38): rtk_proxy::extract::tool_calls_from_response has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 3 (9 pts), match/switch 1 (nesting depth added 26). 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":"proxy/src/extract.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a68311c463ddc0bf31805459fadf5da64d94770e8e718973441640dc417789"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::format_test_output (cognitive 38): rtk::cmds::dotnet::dotnet_cmd::format_test_output has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (12 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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"73231c2fdfc62c6ce865657cf562c3733bf0720c5a29af6e3317830e58956986"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeProvider::extract_commands (cognitive 37): ClaudeProvider::extract_commands has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (10 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/provider.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"689446a94f13e0c5b98d5b4176e691ee9161434485d18ba6ad39f3b1712a4d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_pull (cognitive 37): rtk::cmds::git::git_cmd::run_pull has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44e8d2872a9311a0a3de58850a596cd898a614018146a363982b3459963b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::php::phpt_cmd::parse (cognitive 37): rtk::cmds::php::phpt_cmd::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (6 pts), boolean chains 3, 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":"src/cmds/php/phpt_cmd.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f5fa5e7d756edc46a5f274f9ba5a511e149703bcf914ef09ac19a054761542"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::offer_proxy_onramp (cognitive 37): rtk::hooks::init::offer_proxy_onramp has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (27 pts), match/switch 5 (6 pts), boolean chains 4 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b56b892ebec122645da0256cee23241acbbee65763bdf914b999aa6ffe91c7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::agents_md::patch_agents_md (cognitive 37): rtk::hooks::init::agents_md::patch_agents_md has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/agents_md.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44874b6274193f75e1cc389b65f041c1da1b27c89ec4cbe5acd1a6a796a5251"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::tsc_cmd::filter_tsc_output (cognitive 36): rtk::cmds::js::tsc_cmd::filter_tsc_output has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 9 (17 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2765d4beecc596c11063fcf90c69a3dbac24761a9fc4d0e09c68671abe057b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::ls::compact_ls (cognitive 36): rtk::cmds::system::ls::compact_ls has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, loops 4, 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":"src/cmds/system/ls.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e3a2bd9a562ab281f6289fe758152ebfd54775bee730c3789e00186e9b256"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::classify::insert_classifier_facts (cognitive 36): rtk::core::classify::insert_classifier_facts has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (6 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/classify.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6e9a9c8cd6219c07f83f4ec52d4de458a32f4c7ad67c8ba4f114eace48a62c"}},{"ruleId":"D2","level":"warning","message":{"text":"TscHandler::format_summary (cognitive 35): TscHandler::format_summary has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 4 (9 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1cef05a9766d0a577a8230a199731b738a3731ecc6bcf7e48ac5aeb720403b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::container::format_kubectl_pods (cognitive 35): rtk::cmds::cloud::container::format_kubectl_pods has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d27a9f45344e09b5746f78c50eabe594142289e3953dfaaf2be4dd6685e554"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_branch (cognitive 35): rtk::cmds::git::git_cmd::run_branch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 3 (5 pts), boolean chains 3, match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99d6336c506c9b5f40c346c2cddfaf4ca3cf58762a86bde912e39bf7ec8e42a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::antigravity::migrate_legacy_rules_at (cognitive 35): rtk::hooks::init::antigravity::migrate_legacy_rules_at has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 2, loops 2, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/antigravity.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbd151b6a0ef69a177b25a77006e5d4b57d3f7fb10c9bb687730424e56da987"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::run_fallback (cognitive 34): rtk::run_fallback has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"010342cf087137fa28b55094d8dca334222eee85af536f308fa0da2e10eaa8f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_show (cognitive 34): rtk::cmds::git::git_cmd::run_show has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe50299a5a5474a616dfec094242944c571637778cd2e6d694f2c64084b61038"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::schema::parse_rule (cognitive 33): rtk_engine::pipeline::schema::parse_rule has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 6 (11 pts), loops 2 (3 pts) (nesting depth added 19). 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":"engine/src/pipeline/schema.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf46814e80f1af2a5440e71e6afd6ac68b72da32798f4b554c79ce98cd7d54ff"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::wget_cmd::extract_filename_from_output (cognitive 33): rtk::cmds::cloud::wget_cmd::extract_filename_from_output has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/wget_cmd.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d191fc5f361c4b9bd8790050063105eefe054fa0bd068571de0698e1b72e103d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::print_terminal_card (cognitive 33): rtk::core::pipeline_cmd::print_terminal_card has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (28 pts), loops 3, 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":"src/core/pipeline_cmd.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4798d71ca0e65a3123bffddcd724f6a647f181230cb02caab31844a93ba127be"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::classify_command (cognitive 33): rtk::discover::registry::classify_command has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (28 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":"src/discover/registry.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2659a1572d4c9a586bb37a66bee3334271a57351b5e990571d4bdc3e2aab904"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_multiline_block (cognitive 33): rtk::discover::registry::rewrite_multiline_block has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f449a6096710f89bf6ffaa0156d926f1b125e78fd702efeaa0c7190ce85d03"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::instructions_body_for (cognitive 33): rtk::hooks::init::instructions_body_for has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"348d5c8eed185e08d86ad67cca45749449b6db3e4239f26114a7b3739d637c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::claude::migrate_old_hook_script (cognitive 33): rtk::hooks::init::claude::migrate_old_hook_script has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (32 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":"src/hooks/init/claude.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d2e64761b9949bd46095be55afe5b620c19283d369c2c936d9ef5416e671e"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineMethodsTransform::on_request (cognitive 32): EngineMethodsTransform::on_request has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/engine_methods.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d55d3d9f651c7042916de8d9e5e6cd68951e26ea8973ff6fc8ac2f66ad32c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_worktree (cognitive 32): rtk::cmds::git::git_cmd::run_worktree has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6372d020f8b8a4f4786fcccf73a5ede7f7c832f032844a214bd60c9bf6e318fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::json_cmd::compact_json (cognitive 32): rtk::cmds::system::json_cmd::compact_json has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/json_cmd.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd9a04ffb152c1f252ee30421a530c23a0b8379358357df4e38db8a5ed7d2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::extract::image_count (cognitive 31): rtk_proxy::extract::image_count has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (12 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":"proxy/src/extract.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f8bf7ba668702805b531a85aacc99e5fba5a831ec7716ada2545ce7c7949e6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::filter_branch_output (cognitive 31): rtk::cmds::git::git_cmd::filter_branch_output has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea36e41dbd7742f3b06fa4b19bd808e6fbc0dcfe4aa8c29ff64ffc01752ccd6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::lexer::segment (cognitive 31): rtk::discover::lexer::segment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4cd95bc5502b00d083d4700d2971241b88928986cf6fd7c91f5faeee819f69"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::extract::tool_results_from_request (cognitive 30): rtk_proxy::extract::tool_results_from_request has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (8 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/extract.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"291cbc7b2bff1bfc3f2690228abed21e5385175fe443b4471dd6a48b001f7b52"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::forward::relay (cognitive 30): rtk_proxy::forward::relay has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/forward.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"59df4e80a63976616b792d6a4cc4e64b667f48da4ddc2f6321a74beed87c7f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_package_with_cap (cognitive 30): rtk::cmds::jvm::mvn_cmd::filter_package_with_cap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, 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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b87592a3fed3ffeda5bf23d5c0b1382bb2c58e870c3119d46ae5eff19b45de5"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::php::phpunit_cmd::filter_phpunit_output (cognitive 30): rtk::cmds::php::phpunit_cmd::filter_phpunit_output has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/phpunit_cmd.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f2ea14cf81c844fd488fe0b8f51228b7caf8a0ae2b622e4a346469235b52d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_remote::publish_repo (cognitive 30): rtk::core::pipeline_remote::publish_repo has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (24 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b36517398259689678c289720653fef289b165163926a219bad3ac64f4428cd"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimalFilter::filter (cognitive 29): MinimalFilter::filter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/filter.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8e1fb7d093fcae7e8b2b01934d3357b86a076895f174505f1e3af6eb10cf2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::json_cmd::extract_schema (cognitive 29): rtk::cmds::system::json_cmd::extract_schema has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/json_cmd.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"255b7c45f86df010a6500d6d188b4ae864ed009d07b1b741137a488429f4c5b8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::run (cognitive 28): rtk::cmds::cloud::aws_cmd::run has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 27, match/switch 1. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e67d2a90a7eecad7a7e06351332aa7c54622fb408484161fe16bcef256c08ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog (cognitive 28): rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, loops 1, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44d3e1d676638589725fbbed4cba953886b9aaca1689f55bfcc260642663e84"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::unquote_shell (cognitive 28): rtk::cmds::git::diff_cmd::unquote_shell has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 3 (12 pts), if/else 8 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd08c6003f72c00e12e821da3d8c3e74f67f00a0b758dd84d753c39c66ca1d33"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::myers_ops (cognitive 27): rtk::cmds::git::diff_cmd::myers_ops has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f87960bcb0ab015c012cd5cc7b2185a5b966fa72be6d6928df8ccffcdc314"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::prettier_cmd::filter_prettier_output (cognitive 27): rtk::cmds::js::prettier_cmd::filter_prettier_output has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/prettier_cmd.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"141c006b1586ae09cc1e7cf3157b21a44dfae54d47ed43b7c63af9dce03fbc91"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::gradlew_cmd::filter_test (cognitive 27): rtk::cmds::jvm::gradlew_cmd::filter_test has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 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":"src/cmds/jvm/gradlew_cmd.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4f5104512a16c4b5a69fd014fb091a5c6149edb9432d8cce2b81cb123ab891"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::filter_ruff_check_json (cognitive 27): rtk::cmds::python::ruff_cmd::filter_ruff_check_json has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 7 (10 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ba138075d16f7cf232d1b695da5693128f10ca7018f7bbf2b33caaca3664d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_explain (cognitive 27): rtk::core::pipeline_cmd::run_explain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (8 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"0013c6f74ecc8c657c5831aadbae365d5c0a3da6a6ace194b57bb24fcd618da8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::gemini::uninstall_gemini (cognitive 27): rtk::hooks::init::gemini::uninstall_gemini has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/gemini.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c034f166559dfc0516c3f08867a41af5e8ceb7e9a7e691988c1f5f0aba82f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::gain::run_pipeline_detail (cognitive 26): rtk::analytics::gain::run_pipeline_detail has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0517ddf383ce8bce91aecc0be01574b1f9b782d0d38a0212530bbb176d7f6d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir (cognitive 26): rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"007f8e55b1beb25f67518bd347e256c30e17f6a8eae58baa57ca24d4adbffe03"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::gradlew_cmd::filter_dependencies (cognitive 26): rtk::cmds::jvm::gradlew_cmd::filter_dependencies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/gradlew_cmd.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611e125f8ac9160d7af981aa6fe6217d74dbfab2990bec1d5707470dcc7e2b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::ruby::rubocop_cmd::filter_rubocop_text (cognitive 26): rtk::cmds::ruby::rubocop_cmd::filter_rubocop_text has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 5, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rubocop_cmd.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf1186a9b0ce9dd3b02034eb39b1dc1baa78109a969ce42194dec81d7d63597"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::summary::summarize_tests (cognitive 26): rtk::cmds::system::summary::summarize_tests has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/summary.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c87f1eab75e1822e1f0dc2447120218f0470046d503d6a101f91cb332e995a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::filter::advance_triple_quote (cognitive 26): rtk::core::filter::advance_triple_quote has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/filter.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4e2700a06126d2685d1f35faf6eeba5c57b2b081e9f668564fcd79d795955"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::analyze_pipeline (cognitive 26): rtk::discover::registry::analyze_pipeline has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92934e8f1b347840c3473f280219fe3f13b3bf5453f58dae44d8457b0b5006c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::eval::resolve_chain (cognitive 25): rtk_engine::pipeline::eval::resolve_chain has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (5 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":"engine/src/pipeline/eval.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9159ee577aa685a86d2bd99a8d92c9728fe2a4c8b5b56110e1c6dde33948575"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::shape::strip_ansi (cognitive 25): rtk_engine::shape::strip_ansi has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/shape.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02ecb2d2527238eb5a1b3e26a9c3545a2f152bf99721b80b7d62e6c3542196"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::new (cognitive 25): AppState::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e3e4e8492b177034a021d22966e7256ecdee59c947d8742c2e7f73422ef2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_quiet (cognitive 25): rtk::cmds::jvm::mvn_cmd::filter_quiet has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"58921e0dbb9617b48be9753ec31ff2638075f2e98426367d28b03aeb4b4ac02f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::php::phpt_cmd::build_summary (cognitive 25): rtk::cmds::php::phpt_cmd::build_summary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (22 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/phpt_cmd.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ffc8952d16526e878a402fdcc6e04c20c10d9ba3c889bc50b30f5f7511f95d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_config::load_from (cognitive 25): rtk::core::pipeline_config::load_from has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (8 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_config.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"23568ee8be551917e3b1a78071987dc221f5ba37da66a044af5d350c875f1ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::claude::patch_claude_md (cognitive 25): rtk::hooks::init::claude::patch_claude_md has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (25 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bebc90340790252acaea99bbdf98cf8f0a84da5ad88142353005c4b61ee1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SseAccumulator::feed_text (cognitive 24): SseAccumulator::feed_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/forward.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4342dd6c8c54aa284de7795634c80eb8e9043896fa6294efabab15b7a7171"}},{"ruleId":"D2","level":"warning","message":{"text":"AggressiveFilter::filter (cognitive 24): AggressiveFilter::filter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 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":"src/core/filter.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c15367680189881327915cabc110054d1b8a4a5e029410c45f282194c4df92"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::build_effective_dotnet_args (cognitive 24): rtk::cmds::dotnet::dotnet_cmd::build_effective_dotnet_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e7dc75579b0114db2aced317a8fec6a5c93d139579e6645abfc8eea83497a6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_trx::parse_trx_files_in_dir_since (cognitive 24): rtk::cmds::dotnet::dotnet_trx::parse_trx_files_in_dir_since has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c848ca3c43140cc99be5428c10782bb999af811dbd526b41de590f7be379a75"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::pnpm_cmd::format_dependency_listing (cognitive 24): rtk::cmds::js::pnpm_cmd::format_dependency_listing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/pnpm_cmd.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"06717c32fdb9d74ade99e3bcc0ae0862184c8b62183cd2b1b2dddb6eb5cf4da1"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::ruby::rspec_cmd::build_rspec_summary (cognitive 24): rtk::cmds::ruby::rspec_cmd::build_rspec_summary has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rspec_cmd.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bd4f863c2863e33d3b55dd3deb460069f805e238d12ab8e6a0e79092efa80e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::wc_cmd::format_multi_line (cognitive 24): rtk::cmds::system::wc_cmd::format_multi_line has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/wc_cmd.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7e25366ec0a54827d5fb32ba367c07e19d1b1fea79bacfeeddd80614f11f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::gemini::patch_gemini_settings (cognitive 24): rtk::hooks::init::gemini::patch_gemini_settings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/gemini.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab14883c7f085ad6b7474e1c12a2692eb0a682b462ca1be5ca78a373a1154ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::permissions::glob_matches (cognitive 24): rtk::hooks::permissions::glob_matches has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"33489b9c9c082a5f89facd072ac76cd546d90c2d13ebb10bd6f5b55e76aed0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Structural::kept_mask (cognitive 23): Structural::kept_mask has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/strategy.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded3fefea932acbe852861d1fd8fb603ca58b0695d67d2601df832a1310d53f0"}},{"ruleId":"D2","level":"warning","message":{"text":"IcmMemory::recall_relevant (cognitive 23): IcmMemory::recall_relevant has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/memory.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"761fbc87685b4ebbb2b49d200308ed80953c554348cf398f1a46b00359259c57"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::extract::count_rtk_rewrites (cognitive 23): rtk_proxy::extract::count_rtk_rewrites has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/extract.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb6c05018ca221ba23e448de4b54cf7299efefb5b693480479f173ad622d7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::run_start (cognitive 23): rtk_proxy::run_start has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (6 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19609399ae595658fedb33f45cf6aae0d514d9ff3e4e1647dee0cfec17f9577"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::pipeline::normalize::strip_ansi (cognitive 23): rtk_proxy::pipeline::normalize::strip_ansi has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (7 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":"proxy/src/pipeline/normalize.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"06efcdfa37c52912a26355498c5145c666c97e88ada2f7bb2e242a35549f07b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_diff (cognitive 23): rtk::cmds::git::git_cmd::run_diff has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e52c189f0bec777bcbd7fe0912dfad5c0a8449ef2e2ab109ec67f041341497"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::fold_ls_tree_paths (cognitive 23): rtk::cmds::git::git_cmd::fold_ls_tree_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f863abe23e651bb9894fde2dfd90b0e3fbecb43f1e9d29619eb81cbefda2c490"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::lint_cmd::filter_eslint_json (cognitive 23): rtk::cmds::js::lint_cmd::filter_eslint_json has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 6 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7b45de70a5da4fddee7ab90f4f60c32b1e1080f43c9e31a8b83bcc11acbdf6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::lint_cmd::filter_pylint_json (cognitive 23): rtk::cmds::js::lint_cmd::filter_pylint_json has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 6 (8 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b564a9377bc480d98ff4b66d5ead4f78663af0fc5e82d0abe840b4fed88a43e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::ruby::rake_cmd::filter_minitest_output (cognitive 23): rtk::cmds::ruby::rake_cmd::filter_minitest_output has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rake_cmd.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6996f98f776535452fce61ee92cd267191c9f00846a5348d2a35b0a4f72efb08"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_build_labeled (cognitive 23): rtk::cmds::rust::cargo_cmd::filter_cargo_build_labeled has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1b64d02d7235dde7622423419b91e90ac902709414b8c157fdc90b09eefe97"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::scala::sbt_cmd::filter_sbt_compile (cognitive 23): rtk::cmds::scala::sbt_cmd::filter_sbt_compile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 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":"src/cmds/scala/sbt_cmd.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a9aff9d4c4e9724f76c5242cbd6d5083e38f23dc5d4542d2d8b675b1db6229"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::call_context::pieces (cognitive 23): rtk::core::call_context::pieces has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/call_context.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed2916e410ecca5199d7c1cf1bc9a9511318f84453dabea4a207f1674708da1"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::claude::run_default_mode (cognitive 23): rtk::hooks::init::claude::run_default_mode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"977ecd90b8972ec4f452af57e0addfc5f81d91d320149270133ef5a92bb13f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::pi::uninstall_omp_with_patch_mode (cognitive 23): rtk::hooks::init::pi::uninstall_omp_with_patch_mode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (23 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/pi.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea900afb72fbbfba8c154ca16e73ec3aae2944ac03b09418728bb3763ae65c6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::trae::patch_trae_hooks_json_paths (cognitive 23): rtk::hooks::init::trae::patch_trae_hooks_json_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/trae.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb94cb862a42370c5292ab8293d2c62a047963a9f5e2740521f3b011e487022d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::gain::print_efficiency_ledger (cognitive 22): rtk::analytics::gain::print_efficiency_ledger has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, 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":"src/analytics/gain.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"df125a9ef821a8e6fb755895800209ce70c2aa101d796b8d1b7feefb9a77d44f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::format_sg_rule (cognitive 22): rtk::cmds::cloud::aws_cmd::format_sg_rule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (6 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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04cadca92a9608d486a609460f152cdb17d91ad3901bddca304c5b0129c1d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::psql_cmd::filter_expanded (cognitive 22): rtk::cmds::cloud::psql_cmd::filter_expanded has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/psql_cmd.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cca0af31d81a508b53507d6b193b127cb8ba71e0b81996c5cde8f370c7504c7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::gradlew_cmd::filter_lint (cognitive 22): rtk::cmds::jvm::gradlew_cmd::filter_lint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/gradlew_cmd.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"01875016ad5262f7c75b1748df7eda6393357a8366ff1096e8b099d4dd18d148"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::jvm::mvn_cmd::filter_surefire_with_cap (cognitive 22): rtk::cmds::jvm::mvn_cmd::filter_surefire_with_cap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, 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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9bda2da2f11e6ddc30a4e9281159be2c11805bb67a1544924e000375312f47"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::find_cmd::disclose_filtered (cognitive 22): rtk::cmds::system::find_cmd::disclose_filtered has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/find_cmd.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"96baa9d4fdd42acba030970a05570f1af6ae184a485d8f8cb9f1c19e859ff877"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::runner::push_coverage_table (cognitive 22): rtk::core::runner::push_coverage_table has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e672bb80669949f8958453219b1611857d2836d46871e930a7b399a76fb6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_compound (cognitive 22): rtk::discover::registry::rewrite_compound has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc173a8b6419791489150f2ff7b4553e1bf02cd667500d41d033c9d0291570f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::hermes::uninstall_hermes_at (cognitive 22): rtk::hooks::init::hermes::uninstall_hermes_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (22 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/hermes.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f52c7046da6695f953f48a56267a6990415d5ec1b21af97b55fe0a14417c22b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::permissions::check_command_with_rules_and_prefixes (cognitive 22): rtk::hooks::permissions::check_command_with_rules_and_prefixes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 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":"src/hooks/permissions.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2e0c438c71d61b0841c50e3b56fe47d9a626cf17dcb9df007c07cc7a11cb44"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::posthook::process_websearch (cognitive 22): rtk::hooks::posthook::process_websearch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/posthook.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7d51e95a830e98340abb1c4557b2650b60fa0b40d91790850a64332d49ff32"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSkeleton::skel (cognitive 21): JsonSkeleton::skel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/strategy.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e05ec720a23b509f63474ad4a668305ef5ac29430bb4c3ad8611997b4e9d880"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::harness::plan_hooks (cognitive 21): rtk_engine::harness::plan_hooks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (7 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":"engine/src/harness.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9a222c36647965e544afeed06af25bdda206bf4805b2418b5e81c5570d77ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::schema::override_replaces_when (cognitive 21): rtk_engine::pipeline::schema::override_replaces_when has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/schema.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"abceee9bf9d3d9e077e8325fa4975083456828812858172e97ff2a63113eb16d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::pipeline::normalize::tool_by_id (cognitive 21): rtk_proxy::pipeline::normalize::tool_by_id has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (6 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/normalize.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e467673f1de70e2fac50275b9d87ac52a0d0c36afd8e50c98f5496dcd77be7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::pipeline::normalize::normalise_tool_result (cognitive 21): rtk_proxy::pipeline::normalize::normalise_tool_result has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/normalize.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"99895070031ae06424d156599854e956181a55934f050374737c4c1ae15a3c21"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoTestHandler::compute_test_summary (cognitive 21): CargoTestHandler::compute_test_summary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457df17a8d329b58da3b0afbd0ed90fc233c0953107b7219ad43fa0a3c816de"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::cc_economics::display_summary (cognitive 21): rtk::analytics::cc_economics::display_summary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1315e4377e5587a6366ef604959b96d51784adf368309322e7efef64d4ff1a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::container::docker_images (cognitive 21): rtk::cmds::cloud::container::docker_images has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f9eaee56ebd2da408abd445bb359343962c69f81740fdb2fbbcb410704de04"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_add (cognitive 21): rtk::cmds::git::git_cmd::run_add 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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4874303c3ab5c6aa6163a5ee4862642c403c80c687991df2cfe9b862cc9574b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::go::golangci_cmd::filter_golangci_json (cognitive 21): rtk::cmds::go::golangci_cmd::filter_golangci_json has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (6 pts), match/switch 2 (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":"src/cmds/go/golangci_cmd.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d7dd0afa9cd578eb05ed1e60e286b9b0f29ec0198a13b8c820aa2223f44f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::prisma_cmd::filter_migrate_dev (cognitive 21): rtk::cmds::js::prisma_cmd::filter_migrate_dev has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 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":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a87a6efdb094a82937533ab09472573f3d73e0ec8acbc3942e92f02eb645486"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::find_cmd::dispatch (cognitive 21): rtk::cmds::system::find_cmd::dispatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/find_cmd.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d264f6f28a93dc882909f286a3d4e00f674c7bc724c66b6429edd99fbf307a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::find_cmd::native_walk (cognitive 21): rtk::cmds::system::find_cmd::native_walk 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":"src/cmds/system/find_cmd.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d7598fff2440ac0faadbf1d12a31237905dcc8677ab11d808a4a6f4ca6856f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::local_llm::detect_patterns (cognitive 21): rtk::cmds::system::local_llm::detect_patterns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, 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":"src/cmds/system/local_llm.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"849654f8dfb07d00d9427807227bcf62cafd005d66f73c7933986625f223cb2d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::summary::summarize_build (cognitive 21): rtk::cmds::system::summary::summarize_build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/summary.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f948022946ff221d738e81ff3fe35149e2e3383e7ca4ed56bd87ac5dca673f6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::referenced_plugin_methods (cognitive 21): rtk::core::pipeline_cmd::referenced_plugin_methods has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9858b55794a801a7ebd0b048f07bebda71956092d40d4ac70d6dfab5e8edea85"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_remote::select_menu (cognitive 21): rtk::core::pipeline_remote::select_menu has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c66c93a596057dba9ea435c88e11f8d393e346d62fc4b24c44b354e024a27"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::collect_shell_wrapper_positions (cognitive 21): rtk::discover::registry::collect_shell_wrapper_positions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"57760f4de7fb5a6270ae80ba97f1f21f16d9779abc2219d474cf71ff78c059f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::report::format_text (cognitive 21): rtk::discover::report::format_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/report.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fbe2bcd879e1aa3ddbbbbcf184956753320bbfb608e00dbbf28d30cdcb88f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::vibe::patch_vibe_hooks_toml (cognitive 21): rtk::hooks::init::vibe::patch_vibe_hooks_toml has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (21 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/vibe.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a2bb902f9e6ce9495be3bbbde65dc017aa58d1bac90763e5338ffe85bcf541"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalizeTransform::on_request (cognitive 20): NormalizeTransform::on_request has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 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":"proxy/src/pipeline/normalize.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c64f299ccd307edc67d8f8eaa4d7de4cee8878a6c7b7ee0cff45963d8e1784"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::pipeline::pixel_compress::draw_glyph (cognitive 20): rtk_proxy::pipeline::pixel_compress::draw_glyph has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/pixel_compress.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86fdc6c9f986a3054c9386be3c3ddbb55b56c707ffa4bcc51ee578c3189af7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::filter_logs_query_results (cognitive 20): rtk::cmds::cloud::aws_cmd::filter_logs_query_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f891f74c216c2a1673ddbc89942254b3359004664a819a99c023310120467aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::container::docker_ps_all (cognitive 20): rtk::cmds::cloud::container::docker_ps_all has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), boolean chains 1, 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":"src/cmds/cloud/container.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"473330d971287e6af898b3686e194134f77d7939b438597d9965fc1a833b39a3"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::myers_backtrack (cognitive 20): rtk::cmds::git::diff_cmd::myers_backtrack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 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":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0970ec66a4911b8a503009d1c7785b6ab875212ec1ac2a1ca9ad59f44012eecf"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::gt_cmd::filter_gt_sync (cognitive 20): rtk::cmds::git::gt_cmd::filter_gt_sync has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gt_cmd.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fd2c960e0a57dff57621da933e351ca376d01c953c9fc12150eb299b71a09a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::pnpm_cmd::extract_list_text (cognitive 20): rtk::cmds::js::pnpm_cmd::extract_list_text 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":"src/cmds/js/pnpm_cmd.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6002246d36f21e498cc5e50630fdaab1996db8b8bf243a264c1ae478a5ccaf"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::find_cmd::render (cognitive 20): rtk::cmds::system::find_cmd::render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/find_cmd.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b11bd003104f992957461ab3c520c1fd6d15e8ba7817bef202efa5ae911c4fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_remote::line_diff (cognitive 20): rtk::core::pipeline_remote::line_diff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"186430a04225c1a6c071f111d6628b0264cbfa090be698cc0ea67beb2b8809c7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::pi::uninstall_pi_with_patch_mode (cognitive 20): rtk::hooks::init::pi::uninstall_pi_with_patch_mode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (20 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/pi.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"534113c2df7b4305bab96cf53d0c9c3523ed2d32923a665f167ccf3cb28cd156"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::container::format_compose_build (cognitive 19): rtk::cmds::cloud::container::format_compose_build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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":"src/cmds/cloud/container.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b90d29038dcd26db31b44d4e43635b24517e774bf0a0786fd48c1922218908"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::ruby::rake_cmd::build_minitest_summary (cognitive 19): rtk::cmds::ruby::rake_cmd::build_minitest_summary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rake_cmd.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e23977a7e6f888d25f58d23788c273412b12aae22ef29fa9a8f5443089657"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::deps::summarize_gomod_str (cognitive 19): rtk::cmds::system::deps::summarize_gomod_str has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9760237289e360a2f0809cdb281714311291584c8f385a90b7f6a990440b06"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::pipe_cmd::auto_detect_filter (cognitive 19): rtk::cmds::system::pipe_cmd::auto_detect_filter has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/pipe_cmd.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76648ec7b77506c18a641c5dd37b32b2873bf995cd2431e124cf2a507510d45"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::search::clean_line (cognitive 19): rtk::cmds::system::search::clean_line 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":"src/cmds/system/search.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a5552f4e5b23f0b447cbf6a8dc4708c07996d7875f3eae782ac4615ae7dfae"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_config::subject_facts (cognitive 19): rtk::core::pipeline_config::subject_facts has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 5 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_config.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d0ff24fb9f28ddf3542628d35e815009c0b19e306dbaf4b84881ae38120f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::retriever::run_recall (cognitive 19): rtk::core::retriever::run_recall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retriever.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea25dbfb212664bc006c81215d55abf6961c4e31c980d77a06858c1c62e23bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::wrapper_inner_command (cognitive 19): rtk::discover::registry::wrapper_inner_command has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 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":"src/discover/registry.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db5365dd4336833156e54ccc451044d894cf8bc7c1c0b8bad452486d2e6aa2b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::codex::show_codex_config (cognitive 19): rtk::hooks::init::codex::show_codex_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (19 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/codex.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ff1ec02bf506f9f6a482a947b3688e3b389d9298df284df0fd7d6d359c0ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::codex::uninstall_codex_with_paths (cognitive 19): rtk::hooks::init::codex::uninstall_codex_with_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/codex.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a001ef8c225f48c7d978d68fb31315190f782222c430494c1239cf9a14e155"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::instructions_agents::run_kilocode_mode_at (cognitive 19): rtk::hooks::init::instructions_agents::run_kilocode_mode_at has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddac7a7f6d6176faaaa9793f5bcc0d4970e6071760d9375a52c32fbf8b760713"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::permissions::check_shell_wrapper_permissions (cognitive 19): rtk::hooks::permissions::check_shell_wrapper_permissions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cb48b3a15f63ec403503985fc7eb1976b57971733c9082e5e513fe2011d582"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::resolve::extends_closure (cognitive 18): rtk_engine::pipeline::resolve::extends_closure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"84497e89f9422023f6fd8abb2f377b2901340d1350f988f833326b457c8302a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeProvider::discover_sessions_in_projects_dir (cognitive 18): ClaudeProvider::discover_sessions_in_projects_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"src/discover/provider.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84610cbfb471c8a51b134917c1c04e79b49a2c546c43226b166ef0b76d41a51"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::ccusage::fetch (cognitive 18): rtk::analytics::ccusage::fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/ccusage.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b9f167b6c391c87ebdce72835957de0ef510d1d3246809cc9abd7725f7976d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::filter_cfn_events (cognitive 18): rtk::cmds::cloud::aws_cmd::filter_cfn_events has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c8afc4e2026f244d4f218d9156508cd33517da0783d377f6d34481f305b088"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::format_build_output (cognitive 18): rtk::cmds::dotnet::dotnet_cmd::format_build_output has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rtk::cmds::dotnet::dotnet_cmd::format_restore_output) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c89cc8d0a00c6ceeff31df8c2a9b66291c42bc8700f22a88d33c8d9eab0c38"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::format_restore_output (cognitive 18): rtk::cmds::dotnet::dotnet_cmd::format_restore_output has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rtk::cmds::dotnet::dotnet_cmd::format_build_output) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a6870c2babac44c15435bf7a880861f02b5f21868af863194c1b85696afb0c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::pair_rewrites (cognitive 18): rtk::cmds::git::diff_cmd::pair_rewrites has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f829a3c3a4600dd65cd9b52fff81c60fedafedb28aadb3470df46fa5680adc"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::decode_backslashes (cognitive 18): rtk::cmds::git::diff_cmd::decode_backslashes has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 3 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7bcf763c3bda3e63b95f58b6959e741b56faf71988339a50a8233e1d7b77c4"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::gh_cmd::format_pr_view (cognitive 18): rtk::cmds::git::gh_cmd::format_pr_view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (3 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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b5a0cfff755d1e3dcb85880d93765173569b9ccd0f2adc6b74a8e339dd2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::filter_checkout_failure (cognitive 18): rtk::cmds::git::git_cmd::filter_checkout_failure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a6e59a8a4d7ab2891a0de66a5e9fb8775fa72850b249e674045c3f4b659dce"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::glab_cmd::filter_release_view (cognitive 18): rtk::cmds::git::glab_cmd::filter_release_view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd81dc27fd3d8f14664f7eddeb9cbb7c9fe66dfd056e3ed7ab1f173b94d674d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::route_ruff_args (cognitive 18): rtk::cmds::python::ruff_cmd::route_ruff_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008ef61d949daa19db516e830ad8d0b5c51e09052fdb886ebbe30c918df5123"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::extract_json_diagnostics (cognitive 18): rtk::cmds::rust::cargo_cmd::extract_json_diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"80325dcd8134025171726eb8c3ba5d74a8471d7eab97daa7cad7e15c3dca0025"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::ast_grep_cmd::filter_ast_grep (cognitive 18): rtk::cmds::system::ast_grep_cmd::filter_ast_grep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ast_grep_cmd.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"df056d422619ef56470660644295ddc2801e09fe3afb33049fdb055553102d34"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::deps::summarize_pyproject_str (cognitive 18): rtk::cmds::system::deps::summarize_pyproject_str has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f5d6941e726b8f5eb1c8dbdaa3d891a5d2c706eae2c4f154774247e0b80d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::ls::build_child_args (cognitive 18): rtk::cmds::system::ls::build_child_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ls.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e57f593716f729fdaeed92b8e0340dabe2f3e9ea0e47857d663edcc3e9cbe13"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::runner::run_captured_filter (cognitive 18): rtk::core::runner::run_captured_filter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa52bf3768c0d5e45bbf71e958dcf5ddf67f9e85a0caa9537a221195f4c80c00"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::parse_golangci_run_parts (cognitive 18): rtk::discover::registry::parse_golangci_run_parts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d600dcfb2d7a28d9ae594234e21264b5bc278c16d39f501ad526add0794ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::instructions_agents::run_cline_mode (cognitive 18): rtk::hooks::init::instructions_agents::run_cline_mode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rtk::hooks::init::instructions_agents::run_windsurf_mode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"69397823396aa1a8583c39fd5eca6fbe94e8a0817781ceb13881fd8cab7fbd90"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::instructions_agents::run_windsurf_mode (cognitive 18): rtk::hooks::init::instructions_agents::run_windsurf_mode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rtk::hooks::init::instructions_agents::run_cline_mode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9758d7a2db27b9803c3d6ddd34bbd0913b7499fbe628a8d76051e5f1133e95"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::learn::detector::find_corrections (cognitive 18): rtk::learn::detector::find_corrections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/learn/detector.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c9341ce8484fc0c989308b206105001111f99a0990545740af0940381390cf"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::schema::parse_directives (cognitive 17): rtk_engine::pipeline::schema::parse_directives has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/schema.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c657b27e408cb7446aa3993fc960ea91b981810d0a267bc6e54586c738f5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyState::format_verbose (cognitive 17): DependencyState::format_verbose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/formatter.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c331cfddd396cb1616bfa579bff5fcffb82a726b67c40972270f5e038fb1ec00"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::cc_economics::compute_totals (cognitive 17): rtk::analytics::cc_economics::compute_totals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"608733d1396466f70ecdd33806aec2dc32f7bf8808bb76a77186e75ba15e5415"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::filter_s3_transfer (cognitive 17): rtk::cmds::cloud::aws_cmd::filter_s3_transfer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9316e21652a49b15cfb0f2e176f1d7e42d0c403713b1a880a856bf063acafb"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::wget_cmd::parse_error (cognitive 17): rtk::cmds::cloud::wget_cmd::parse_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/wget_cmd.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c729be9728699b046053460ade1da5916b82f521a798011bf91c0339eac29d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::gh_cmd::format_run_view (cognitive 17): rtk::cmds::git::gh_cmd::format_run_view 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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a239d248c81d3b4fa53bef2b164f8f756061354deeb7db6522dd54d1a1baa"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::filter_log_output (cognitive 17): rtk::cmds::git::git_cmd::filter_log_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2911}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5561cb31f3c28d50c50730e05f07498dd0cacb90914e0ce2eada23788a799"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_status (cognitive 17): rtk::cmds::git::git_cmd::run_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"025c92da2123cc45c9a45b0970f5b95151622de00bd98c27d50f48509e756c62"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::glab_cmd::format_ci_status (cognitive 17): rtk::cmds::git::glab_cmd::format_ci_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48cccc8505bd03615a7b448052e5b87d27b6f066eaecc36b53c1266ab77987b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::gt_cmd::filter_gt_submit (cognitive 17): rtk::cmds::git::gt_cmd::filter_gt_submit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gt_cmd.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abebba49f57a542cd3bf7cc0ad915746cd2d5a47cdadb81d0172d3065cb6eda"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::js::playwright_cmd::run (cognitive 17): rtk::cmds::js::playwright_cmd::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/playwright_cmd.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e6b7b30b8829be7ec90561767a35d8b2e5e07e81cfc18aef974ce4aed59a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::parse_summary_line (cognitive 17): rtk::cmds::python::pytest_cmd::parse_summary_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99057fb10b219ae5c51b9eb57ca4f81d5e54b285b1b14fa6451c251dab4f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::deps::summarize_cargo_str (cognitive 17): rtk::cmds::system::deps::summarize_cargo_str has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"87faabd05c243ab0e671866b78c1e2446e906dfd0e76f7619e44bbe07d51417f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_cmd::run_status (cognitive 17): rtk::core::pipeline_cmd::run_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4581c2138b2e1a31f74151db0d110f03d390ea097d6035f9b5ff519c58429b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::fish_script::strip_comments (cognitive 17): rtk::discover::fish_script::strip_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/fish_script.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da430e7d9aeae64f57c6d9d11aba19818d706ac5563dd71a5d51b741729333a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::fish_script::classify_tokens (cognitive 17): rtk::discover::fish_script::classify_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/fish_script.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c97e59003592badc19f93af527314f82c441b34f456ac569ced5eef0514c9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::lexer::resolve_word_text (cognitive 17): rtk::discover::lexer::resolve_word_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f89c6ebf805cc43c507ca175e3c0dc9d0c688a53d55d9436994e12c11a1975"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_command_part (cognitive 17): rtk::discover::registry::rewrite_command_part 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":"src/discover/registry.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5e07b622556b862dc1fd2c57102edee5502d71ff80b10afdc0e7960d7af28"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::hook_audit_cmd::run (cognitive 17): rtk::hooks::hook_audit_cmd::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_audit_cmd.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ccd9579fc96bd60ce9533a46e484bdd03b17619fd78eca2c1806e040eb9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::learn::run (cognitive 17): rtk::learn::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/learn/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"920eb94079ee2caadb9a3add0a7c64aef23bb6444a2f3665412d87ada029e54c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::methods::lockfile::summarize_npm (cognitive 16): rtk_engine::methods::lockfile::summarize_npm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/methods/lockfile.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"34201de7609f1efa1ae54dc3322fb85610eaa64bb9dbd5cc4683e418b79beba1"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::schema::parse (cognitive 16): rtk_engine::pipeline::schema::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/schema.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dbf8264d017946f900a67d602309fc0b36e311c20b1644817b17d1ce7460b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_engine::pipeline::schema::parse_classifier (cognitive 16): rtk_engine::pipeline::schema::parse_classifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/schema.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0106523ad120cdd64a972b3a298c5210dd984091efc903f6603d6200e3b0be6"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::run_stats (cognitive 16): rtk_proxy::run_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 1 (4 pts), match/switch 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":"proxy/src/main.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef8540c50a99f5f295fc73498459f42862f05f44dec0437ab319f7086939cf"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::pipeline::cache_align::has_cache_control (cognitive 16): rtk_proxy::pipeline::cache_align::has_cache_control has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/cache_align.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"911ae8e306f4b5f70060b1f80c0d18a1cccba66bec45af1a006739615f5ed243"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk_proxy::pipeline::ccr::openai::compress_request (cognitive 16): rtk_proxy::pipeline::ccr::openai::compress_request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/ccr/openai.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c805cfac196bfbd7abcf2aaa092e7b0b273112a350dc01b544a77c25661ea32"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyState::format_compact (cognitive 16): DependencyState::format_compact has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/formatter.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc79447256971d41485a931a36cca224e38a03d3919dadd4858102b702ca40cb"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::psql_cmd::filter_table (cognitive 16): rtk::cmds::cloud::psql_cmd::filter_table 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":"src/cmds/cloud/psql_cmd.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"14babe33ad00c770c0534996699cbeb28166b1c64477a6d8792ddd416edd8b73"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::binlog::parse_event_record (cognitive 16): rtk::cmds::dotnet::binlog::parse_event_record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ce789b039193c68ceaa6b846681f2e330702ebaa4c072e4ddca6bc0b8744f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::compute_diff (cognitive 16): rtk::cmds::git::diff_cmd::compute_diff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a953c4acecbf588d866aff15014745c0a172e56f28d6abbac3dfaf77f5d4232"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::diff_cmd::condense_unified_diff_strict::flush (cognitive 16): rtk::cmds::git::diff_cmd::condense_unified_diff_strict::flush has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rtk::cmds::git::diff_cmd::condense_unified_diff_strict) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6666a93ff61c136421e819db1795a53185559d301f90beeb3e5a322cbf28b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::glab_cmd::format_mr_view (cognitive 16): rtk::cmds::git::glab_cmd::format_mr_view has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 1 (3 pts), boolean chains 2, 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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"14faccab6fff0acaab9480486ab3ec7d083c6e846774b77677d8a16185ad373e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::go::go_cmd::run_go_tool_golangci_lint (cognitive 16): rtk::cmds::go::go_cmd::run_go_tool_golangci_lint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/go_cmd.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae2b4247ae518d5eb4632c4491e2353861ebf789b11f094b202340770558ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::scala::sbt_cmd::filter_sbt_run (cognitive 16): rtk::cmds::scala::sbt_cmd::filter_sbt_run 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":"src/cmds/scala/sbt_cmd.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"786cdf9cd88f96712d5a2737c75651126004a527911fdd02331ec9dbde4ff27f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::ctest_cmd::build_logical_lines (cognitive 16): rtk::cmds::system::ctest_cmd::build_logical_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ctest_cmd.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"655c39bf9992e16931a87d32ad839af6bacdd68b33a57c6f81a51bf432d193d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_config::before_tool_decision (cognitive 16): rtk::core::pipeline_config::before_tool_decision has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_config.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ccfc0fd14933cd48802bf7aa696ec4824e2364b2493241b553b4464c8270ae"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::pipeline_config::trust_summary (cognitive 16): rtk::core::pipeline_config::trust_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 6 (7 pts), 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":"src/core/pipeline_config.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d99f1be16451584527bd529ad3b50a234c2dbb2455a8dfd30dcad2a435d76b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::task_cmd::run_task (cognitive 16): rtk::core::task_cmd::run_task has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 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":"src/core/task_cmd.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e724e41cf3b90bb02687ea877dd058c9b38d7fd2785c28b966dc8d14fea5d94"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_line_range (cognitive 16): rtk::discover::registry::rewrite_line_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), 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":"src/discover/registry.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad679ff6c1f252c9330152e0142ba1bbc2db1dfb419bd06f3549fb5e6e37c192"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::hermes::rewrite_inline_hermes_enabled (cognitive 16): rtk::hooks::init::hermes::rewrite_inline_hermes_enabled 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":"src/hooks/init/hermes.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d74742f30bbb540ed7bb67866039b671644853605d4923f043ed4b4940843c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::posthook::run_selected (cognitive 16): rtk::hooks::posthook::run_selected has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/posthook.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a89f0e641677ed83cc39d19a02f155b408d00bb828314a2a74bf4bc9adf724"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::posthook::process_shell (cognitive 16): rtk::hooks::posthook::process_shell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/posthook.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9502420274d283792973474bc76a232bdc1718daeb1eb503066c2795ef8de36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::run_cli: FunctionTooLong \u2014 rtk::run_cli runs 1128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1028 over it, 11.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18b9febe9e9e90a78cef9c77509aff771626fecb8457e60bab482b06743b399"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2051 over it, 5.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":"src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1dad5908b747bfb241f824bad89a171d16266749f9b9389507378dc4db8a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/git_cmd.rs: FileTooLong \u2014 2523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 136 free functions. The bar is 500 significant lines; this is 2023 over it, 5.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c58628d0b446015cdd18fb5dddc19f5363e39aa26e9997860eb87b63fc17da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::git::diff_cmd::condense_unified_diff_strict: FunctionTooLong \u2014 rtk::cmds::git::diff_cmd::condense_unified_diff_strict runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9697d412324bff093c4c1d7d9e1b3cf0574b1a1e3c93fbae177a136dbc82ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::analytics::gain::run: FunctionTooLong \u2014 rtk::analytics::gain::run runs 358 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 258 over it, 3.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f7eef88825cf75649e2342fb7954511c3012afb65f37ed7d8f3d94d9bb9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/mod.rs: FileTooLong \u2014 1555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 1055 over it, 3.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":"src/hooks/init/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b305ad35047f000fdc61ef79644567d2a9b95f00bd57ac5c890b7745a8840099"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/pipeline_cmd.rs: FileTooLong \u2014 1509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 1009 over it, 3.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbe44710d2863bd03780313572e1eefd7e91400abdfbde00c6d3a50af495865"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: discover/registry.rs: FileTooLong \u2014 1427 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 78 free functions. The bar is 500 significant lines; this is 927 over it, 2.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21b5432fedc5dc55afb6e77227893c5b74bf3b5121064cea32a9de73e88c03b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk_engine::pipeline::validate::validate_rule: FunctionTooLong \u2014 rtk_engine::pipeline::validate::validate_rule runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\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":"engine/src/pipeline/validate.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b2a29fd494454d560a41833e557e3d8e8904788b6005915ea53ec5a3839455"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analytics/gain.rs: FileTooLong \u2014 1331 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 831 over it, 2.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c9d3e4a8bf26cb62eee6db1a4eb728ef6abc395f609e97d53ac098fdb4c14d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/diff_cmd.rs: FileTooLong \u2014 1325 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 825 over it, 2.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeebdbab102d3cb74c47b7a1f3cbe9b72663fbeff6e5e3540cb4737be967de5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/tracking.rs: FileTooLong \u2014 1237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Tracker (2 blocks, 98-1958). The bar is 500 significant lines; this is 737 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":"src/core/tracking.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c187e02de732dc9b277d853ea12267b0e6f7a4f88c5939299167b1c8156ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk_engine::pipeline::validate::validate: FunctionTooLong \u2014 rtk_engine::pipeline::validate::validate runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\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":"engine/src/pipeline/validate.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd53cb8681307f51f27cdca78643b90cbd4670354753956438e2abe5ed4d5ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::discover::lexer::tokenize_inner: FunctionTooLong \u2014 rtk::discover::lexer::tokenize_inner runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.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":"src/discover/lexer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b1166d0b51a7a1d27a31aeda0d355b8b1ab9c55c33e438a5c1c12e637b9436"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::discover::run: FunctionTooLong \u2014 rtk::discover::run runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"52650bfb74b51e9d67e5f2792548647798101e2e262e14a40953b5f9e1813a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk_engine::pipeline::resolve::resolve: FunctionTooLong \u2014 rtk_engine::pipeline::resolve::resolve runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e179142e08c62aca3a244af33692ee6b45f796b5e5d5abb95265d673cb602a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/aws_cmd.rs: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 526 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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc26a13205cacfcc91d2da2727597db8091b4047c30e36f5b05ac2d9b3d2a36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotnet/dotnet_cmd.rs: FileTooLong \u2014 979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 64 free functions. The bar is 500 significant lines; this is 479 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b210ad1c21d6d19004cee3e16d36fd1c0ff663e83fde49563628f3ba6ce1ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/cargo_cmd.rs: FileTooLong \u2014 962 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 462 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29da0368f6e7963b58b69142528509aca9a228e8dd54f33ce71d831ddffa51e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::stream::run_streaming: FunctionTooLong \u2014 rtk::core::stream::run_streaming runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stream.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7e81b4a740e3ad097d00ad1838ce2be27591bd7a49a5c33ae49bf43f445068"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tracker: ClassTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 2 blocks, lines 98-1958. The bar is 400 significant lines; this is 351 over it, 1.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f34c38f84cf2b9cdfad57614baea5f5fb856069a84897ed7ff60f8ddd17205"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::pipeline_cmd::run_add: FunctionTooLong \u2014 rtk::core::pipeline_cmd::run_add runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a0df156d83bc433b772968b44158c2f39ce185cd2f9eccc74f302885871a9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::init::show_claude_config: FunctionTooLong \u2014 rtk::hooks::init::show_claude_config runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"692c7d2b30098f2376932fa716dfbd7d2c5aea0a54fcdeaa97684ee837f5ab45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::system::search::run: FunctionTooLong \u2014 rtk::cmds::system::search::run runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"a593968b781add784479a6290cac0843af1148b27349ff61ef17cbfe8f65f5b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::init::uninstall_with_patch_mode: FunctionTooLong \u2014 rtk::hooks::init::uninstall_with_patch_mode runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"d789ca104d69a6fd7d869b02c2669f8a8a14845a083dbf1852dca22f87a420cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotnet/binlog.rs: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d803cc77ea4cb6cb4e5193af13ea54d31823ad10d6761b9fc0d22a390cc73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jvm/mvn_cmd.rs: FileTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 317 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5144a64bf02ec2caa68f6e8fbb74a475a1df33641f42b0814e616116aede33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: UsageRecord: TooManyFields \u2014 49 stored fields. The bar is 30 stored fields; this is 19 over it, 1.63\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/model.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"036a8ebe298b5d4950dee4224a0c9e3cf2600d28fa0e3b13290e2c1579285d0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/runner.rs: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 316 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6509bf96e51868b532f194e13435083cd9aa2e64e176dce18d1ecc229af8370a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::pipeline_cmd::print_terminal_card: FunctionTooLong \u2014 rtk::core::pipeline_cmd::print_terminal_card runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/core/pipeline_cmd.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c986a880a1ae91944c5c6db838e6a4cc008c8652c2a6b9b8e61151633bbf0d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::pipeline_remote::publish_repo: FunctionTooLong \u2014 rtk::core::pipeline_remote::publish_repo runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/core/pipeline_remote.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba661de466585b8e2e2168de5c1eb3072e3f52c4628c0dcb8feddab38a79789b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/gh_cmd.rs: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. 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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68214178d5ebfb7dbf00cb10e451580369f65f865fb16f364b1961d17be0433"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/posthook.rs: FileTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 253 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/posthook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"669296a37d48be07ae217174c525afa06b3788cfe4ce6d62e35c4a5e27c7d75e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/harness.rs: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 251 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":"engine/src/harness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0740b73a35af63643bc06693641f91981b7f35b5946c6a90cc33b1a26da6acbc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tracker: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a8c335863a53b1381649129f1a7d6fe6bfedd6af50b06b7cacfc90905627f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::analytics::gain::run_attribution: FunctionTooLong \u2014 rtk::analytics::gain::run_attribution runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e08b3bc5b5d59482f4106cd84718182ed3ade34cacf35d7df7eff22aae6a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::dotnet::binlog::parse_build_from_text: FunctionTooLong \u2014 rtk::cmds::dotnet::binlog::parse_build_from_text runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313fb0e428ded01a1a1a7862ac12e65ebb06f8112dddf7ce71ceed6616f77ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: system/search.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"449f31f1ebfa382c7c34848687088e7e92c89a90434f6a1c8ead3f3a6d25f3e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rtk::core::utils: TooManyFunctions \u2014 43 free functions. The bar is 30 free functions; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/utils.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a904155803248a70fe7057e6cd520b1c78d3cd68d6ae6546eccf280db19325"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/glab_cmd.rs: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea06711c89f254840b911c299a43f936931ae197b52c7faf3e2539fa70206d6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/hook_cmd.rs: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 207 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0b53de731b682621d0233499f5d3fe5407f8dfcf5c8b93355c3256be5fc14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::rust::cargo_cmd::filter_cargo_nextest: FunctionTooLong \u2014 rtk::cmds::rust::cargo_cmd::filter_cargo_nextest runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a466d4c47e4a2e4e8f0bd5d44739e5b9acdfbd2eefcef7a78f8466efed77efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/pipeline_remote.rs: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"120315ff47b52298e74e0a4797517e33ef5f59e4d4f815c813545f80de8af2d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::git::git_cmd::run_show: FunctionTooLong \u2014 rtk::cmds::git::git_cmd::run_show runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ce4ddd8a97fff96248fdf788dcd4fc707231fa43151ffe8fc8b0ac0d835885"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/pipeline_config.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 174 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":"src/core/pipeline_config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b62b91d7a74f41682ec6916a7523b55c465eadbb3d30a490b21fe46670384e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/validate.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dbbdfe1780408508264a8bf9b4ac83afaa5bca8e5e234233b8896b43392931"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk_proxy::ccr_forward::synthesize_anthropic_sse: FunctionTooLong \u2014 rtk_proxy::ccr_forward::synthesize_anthropic_sse runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"proxy/src/ccr_forward.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce2a9cb9b812c869b42f4f1270783a9f8c5e1d94413079c5de14eb715a2d71a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::scala::sbt_cmd::filter_sbt_test: FunctionTooLong \u2014 rtk::cmds::scala::sbt_cmd::filter_sbt_test runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/scala/sbt_cmd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d3a84d3e665c7a88325a97e1aef41aac4ee59ca8e8e4b5a9cfed7419b2702b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/claude.rs: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 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":"src/hooks/init/claude.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"208a1472e0b582812fdcc1b5d3db83d55b6f64c5f8d60943b73beaf9ab1cd132"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::python::sqlfluff_cmd::render_lint_json: FunctionTooLong \u2014 rtk::cmds::python::sqlfluff_cmd::render_lint_json runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/python/sqlfluff_cmd.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979aa9b7d65af1c7589c48f6e8d39e1271414ede5b0ff2a6539373e5a83ba1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::analytics::gain::run_pipeline_detail: FunctionTooLong \u2014 rtk::analytics::gain::run_pipeline_detail runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/analytics/gain.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e10075298bc6f1a9aead166b61aaa77f758888c9c916efca58a210f457e12c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::python::pytest_cmd::build_pytest_summary: FunctionTooLong \u2014 rtk::cmds::python::pytest_cmd::build_pytest_summary runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25c175a2b62d0b44322e2edbaea434595fe5a5d0f507e196ae129236153effc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::posthook::process_shell: FunctionTooLong \u2014 rtk::hooks::posthook::process_shell runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/hooks/posthook.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"62801a82d12c3595eaa2b5388aaab64982335cfb5b86485ed0407029ff65d308"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::init::claude::patch_settings_json_command: FunctionTooLong \u2014 rtk::hooks::init::claude::patch_settings_json_command runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d139e6953edb7e6ba6104266800a6390c24f1acd82880bc67c4af59d6706c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/pi.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 119 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/pi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d3b862a2a38689181876a5cf579cd84892bb5139a03d1df8b744a0e0178f73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/schema.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/pipeline/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8abae9f01acf1c30ae3f7db8023080ab7c2b85c4d5721bcd9c9681526ac47d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::cloud::aws_cmd::run: FunctionTooLong \u2014 rtk::cmds::cloud::aws_cmd::run runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43be56b7c248341f5e760c92cee0d7fff4507d056be245622b335276c4b3b6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::go::go_cmd::filter_go_test_json: FunctionTooLong \u2014 rtk::cmds::go::go_cmd::filter_go_test_json runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/go_cmd.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfccd3344846c48af4ebd7f441090261255b3c5e3276f2584247103e520b8481"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::runner::extract_test_summary: FunctionTooLong \u2014 rtk::core::runner::extract_test_summary runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1cbe170055e5c694bf8c6df66a3a05a76995bfcb9a875f2e862e21b24d965"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/resolve.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 98 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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9761714a82a96f1a95fa24c5dcede379edebd96992020c1e6e81e4a5e402c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: go/go_cmd.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 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":"src/cmds/go/go_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8455db4e85e9c5578e1f96d40a4912a0b607f5bb1599fc58e7287d1ecbe714a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::system::search::extract_pattern_path: FunctionTooLong \u2014 rtk::cmds::system::search::extract_pattern_path runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"32448e57c7e964380983d0956e78c5c20306fdd242c2d9d32ba8053a71f72e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::git::git_cmd::run_log: FunctionTooLong \u2014 rtk::cmds::git::git_cmd::run_log runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f6c8e16377d06ba12a7c2f53c6cc26bf36fc8e7d63c30b92cec3b023757cf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::pipeline_cmd::run_explain: FunctionTooLong \u2014 rtk::core::pipeline_cmd::run_explain runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"84093495a8b313d1f1361eeb6c9ced0a43527a182aecc5322effe85a350898a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::run_fallback: FunctionTooLong \u2014 rtk::run_fallback runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d3aba693472056ff6c9072af3fa76212882dcce4a67c09505439a74f4eeb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/codex.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 84 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":"src/hooks/init/codex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7deb92e1e1c1a7f91c7418df9c8ed4ba71a0d8f3b8006ad10fbd5178b6ec34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/container.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a36c836f1eb619f4eb9c1aef1090c2653115b0aea03d26aacb25c8bab765dc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analytics/cc_economics.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 77 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6a517443dd8e39918da96ce4511a272940db0d8aeab466bbd1ffc048c2d943"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::init::offer_proxy_onramp: FunctionTooLong \u2014 rtk::hooks::init::offer_proxy_onramp runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3089c79ab9e46e382fd70facef8e36292cb821f46d613a634df16b2afe8d1ccd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: system/find_cmd.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/find_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47edcd5db8be5a2eec9b2224f19a8c0419826a74952aa6d434d98c381e37ab3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/retriever.rs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retriever.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2479be73b70a98e9fab11c184a9b79cc68fa31d1834623f8acc32a348fa02558"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::git::git_cmd::run_stash: FunctionTooLong \u2014 rtk::cmds::git::git_cmd::run_stash runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"4777d9d15b60852da7c6fd4113ecad222f08660f06cc7ffb1053778b21481f8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::rust::cargo_cmd::filter_cargo_install: FunctionTooLong \u2014 rtk::cmds::rust::cargo_cmd::filter_cargo_install runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d95ae006b23192b5f8094a9051c5ba7886263d76b6f4a7e6520516a9c9c222"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: system/ctest_cmd.rs: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 55 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":"src/cmds/system/ctest_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e42a8e5c3c8658a57468d07f5406b205e39ebe59cc3c18e091980df9d6cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: discover/lexer.rs: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 51 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":"src/discover/lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c0fbf8852d4f241d264f932972eb2af1f9eba920ba6e1bf1650d1f892c0473"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::dotnet::dotnet_trx::parse_trx_content: FunctionTooLong \u2014 rtk::cmds::dotnet::dotnet_trx::parse_trx_content runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"272956d833602f042df8579a24d105ab114f9de60f01298fb9c65da878bceeda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::git::git_cmd::compact_diff: FunctionTooLong \u2014 rtk::cmds::git::git_cmd::compact_diff runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbcfd751aa699c8ea4ccd990684f732f22e9f2ea4e6beee3f73dda61ebb4a95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::rust::cargo_cmd::filter_cargo_clippy: FunctionTooLong \u2014 rtk::cmds::rust::cargo_cmd::filter_cargo_clippy runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"890f6479c30c1048a0b78dabdc1594a03e9c0873ec3c0e3d48097abb92217e64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/task_cmd.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce70b8464e6bd62940f6194094efb2b5e721587ca25a72a985afc41999f248f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::dotnet::dotnet_cmd::format_test_output: FunctionTooLong \u2014 rtk::cmds::dotnet::dotnet_cmd::format_test_output runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26e6e166d9210653a63db4e460aae636e6b300832b94f3a23255cfac758cac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::pipeline_cmd::run_show: FunctionTooLong \u2014 rtk::core::pipeline_cmd::run_show runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/core/pipeline_cmd.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0b168771b18a4320bf2c78bfb36cb3a141a024fc598bce0779e6f7f9499515"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog: FunctionTooLong \u2014 rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4031da401c5ef36089d50edd7751e0346937bfcf621a36445d9a4225b30c72a6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Commands: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7d983eade0a32eaad2b0a2486138075b64480bcf333bd021723800d2d3ff45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::python::mypy_cmd::filter_mypy_output: FunctionTooLong \u2014 rtk::cmds::python::mypy_cmd::filter_mypy_output runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/python/mypy_cmd.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f83317304717eb038194e4e1e1c1b1de863564e5bbbc96b3eab87ba0683672"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::cmds::python::ruff_cmd::filter_ruff_check_json: FunctionTooLong \u2014 rtk::cmds::python::ruff_cmd::filter_ruff_check_json runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df6b2dd14c12dc5b4632f7a4c9ae2438da1d7aa9c0f369abff2f5eeddd5c08a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.new: MethodTooLong \u2014 new runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"proxy/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"72257c3cbb9b93f2aaa5d55f6efc11fcdd235f4d403ea75896e09414db8769eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/toml_filter.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.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":"src/core/toml_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3e7123974705d375214cf5add030d772b5050c4487ab37aeec0939ed0a6660"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rtk_proxy::pipeline::ccr: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\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":"proxy/src/pipeline/ccr/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d941c7e228c8191352c6c85becdc3c6dda71755903e00c237bd63d0362930b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rtk::hooks::permissions: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27f9750d24a1f8befbac7ce7e5ff2d36fdbcd692efd1adc239dec05b342c11c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/llm_proxy.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/llm_proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48b8d41bf9d0e2ef3514912c82071d0b9de7173b2d93d001bf92d7105d155c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): src/cmds/js/lint_cmd.rs:252-348 | src/cmds/js/lint_cmd.rs:351-477 \u2014 These two members are variants of one another: 35 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":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c958ea23ae4b5f8dde91290c737ab2788bca0086f6abb40082add8da9322a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/cmds/cloud/aws_cmd.rs:826-853 | src/cmds/cloud/aws_cmd.rs:946-983 | src/cmds/cloud/aws_cmd.rs:985-1008 | src/cmds/cloud/aws_cmd.rs:1136-1188 | src/cmds/cloud/aws_cmd.rs:1239-1283 \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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda9e30b8ec1b267a2de1e27ef7033ebe157b073c0187320509e3722786216f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cmds/git/gh_cmd.rs:352-392 | src/cmds/git/gh_cmd.rs:751-789 | src/cmds/git/glab_cmd.rs:426-464 | src/cmds/git/glab_cmd.rs:663-704 \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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b71b03eb293b16d795b5519218bff2bf15fdbe0fa1ff1dcd0a8b3daad9e30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cmds/git/git_cmd.rs:330-452 | src/cmds/git/git_cmd.rs:502-786 | src/cmds/git/git_cmd.rs:3148-3233 | src/cmds/git/git_cmd.rs:3775-3916 \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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"542db487d6ede23d7b20cb7c7e5f05031b6b31df2aed90450b75e13b50f3981f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cmds/system/deps.rs:83-138 | src/cmds/system/deps.rs:181-208 | src/cmds/system/deps.rs:210-245 | src/cmds/system/deps.rs:247-289 \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":"src/cmds/system/deps.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e913b332768aea499755582c8d9ea4600c4e0855df8957e2d54dad6b854ab6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/hooks/hook_cmd.rs:69-98 | src/hooks/hook_cmd.rs:800-866 | src/hooks/hook_cmd.rs:921-942 | src/hooks/hook_cmd.rs:1046-1082 \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":"src/hooks/hook_cmd.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30558e05a41a1ca46cb93c6804eb4c0ecac972c4e257edc2c92b37e3c2a1caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): proxy/src/ccr_forward.rs:80-191 | proxy/src/ccr_forward.rs:208-300 \u2014 These two members are one piece of code written twice and then edited apart: 93 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":"proxy/src/ccr_forward.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a818c993e3bf41827640d2b80c8b7509e71e56d2c5c35888ab43b1a6feb5263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): src/cmds/dotnet/dotnet_cmd.rs:1222-1302 | src/cmds/dotnet/dotnet_cmd.rs:1495-1567 \u2014 These two members are one piece of code written twice and then edited apart: 73 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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"605ee5736074dc94e3f2221b0810fa20019e78538e24bfac097163ec09380396"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (100 corresponding lines): src/cmds/jvm/mvn_cmd.rs:1397-1496 | src/cmds/jvm/mvn_cmd.rs:1646-1749 \u2014 These two members are one piece of code written twice and then edited apart: 100 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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcc701bde621058362e1e13b7ba1297d5488c88807b6f5a383b9b0a7af6ea9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 58\u002B corresponding lines): src/core/tracking.rs:1393-1450 | src/core/tracking.rs:1475-1534 | src/core/tracking.rs:1559-1616 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 58 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":"src/core/tracking.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"04542540632f93c8975fd8503f1377185680187d2a4569a0624600743fe98081"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/core/task_cmd.rs:526-567 | src/core/task_cmd.rs:573-610 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcfefea3bae294d745d5d4482ee3057350b6d020ea5866a4a1a20363388020c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/cmds/cloud/aws_cmd.rs:375-418 | src/cmds/cloud/aws_cmd.rs:421-467 \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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a62ae2f61363447bb88b296b09afb0cc4d0b86b7df51e84fab25bfeaea9263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/cmds/git/gh_cmd.rs:817-849 | src/cmds/git/glab_cmd.rs:716-748 \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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb18e9d9b9c3c138d79e27d71a206f495da2d70416fc846bed23cfa32c523a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/core/tracking.rs:1690-1713 | src/core/tracking.rs:1753-1775 \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":"src/core/tracking.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad8122f51fd9b3a85739a82504593be333ef7dfcd93fe9133429d8f69b70bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): proxy/src/extract.rs:205-240 | proxy/src/extract.rs:261-298 \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":"proxy/src/extract.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cd75c7c45027c525be52ce478d3903e127e182e59958189c0c2d72f707588e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): src/cmds/go/go_cmd.rs:769-809 | src/cmds/go/go_cmd.rs:899-937 | src/cmds/js/lint_cmd.rs:480-520 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 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":"src/cmds/go/go_cmd.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"219c570c8afb44e1ddc3b46085bf35c85f470bbb6cc1111ca89cb837eb080397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/cmds/js/prisma_cmd.rs:43-79 | src/cmds/js/prisma_cmd.rs:141-176 \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":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"526fba60495e2a7499ed148ac1dd94afc9c75d5c01aacaf276b534e95c36b7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 46\u002B corresponding lines): src/hooks/init/copilot.rs:149-195 | src/hooks/init/copilot.rs:278-323 | src/hooks/init/hermes.rs:99-155 | src/hooks/init/vibe.rs:259-310 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 46 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":"src/hooks/init/copilot.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ccd33fafa3bdb98cea2a68d680ee178ab2e85a6f72435e49fc4079b79b4ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): proxy/src/pipeline/ccr/anthropic.rs:301-331 | proxy/src/pipeline/ccr/openai.rs:107-141 \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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2c3991a5be173f229e68c3470f0c9f8af502aa544b9632262c15ddd4e2b301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 46\u002B corresponding lines): src/hooks/init/instructions_agents.rs:26-71 | src/hooks/init/instructions_agents.rs:73-119 | src/hooks/init/instructions_agents.rs:127-178 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 46 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":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a286c7ecc012be81da070127765ac14526729afa319ead8267ba261a9e155"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): src/cmds/cloud/aws_cmd.rs:577-602 | src/cmds/cloud/aws_cmd.rs:604-631 | src/cmds/cloud/aws_cmd.rs:658-689 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ae5a629c98870f9d5b569ca8534112e0519da2e3443f539fb031fe827f51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/cmds/dotnet/dotnet_cmd.rs:92-123 | src/cmds/go/go_cmd.rs:144-186 \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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"157342a93499df559c8ede2b7a4be61a4908973d4e6ec4500eb3307d32acb657"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/cmds/cloud/aws_cmd.rs:1285-1310 | src/cmds/cloud/aws_cmd.rs:1329-1353 \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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5107ffb6e327f2c653670bbded348175dfc145b898552603d4a554d3164cb54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): src/analytics/cc_economics.rs:201-229 | src/analytics/cc_economics.rs:231-265 | src/analytics/cc_economics.rs:267-294 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f84e31c4452f91fc8be033989431c232422dcd394d79aa1e56d3538d010b683"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): src/hooks/init/pi.rs:613-660 | src/hooks/init/pi.rs:724-771 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"src/hooks/init/pi.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"3776364bf9317290ae8ceadf8048875a940a02f9a98dfce690193879ef8fdb73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/cmds/system/local_llm.rs:131-160 | src/cmds/system/local_llm.rs:170-198 \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":"src/cmds/system/local_llm.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41c07c1d2fe76ce5645a0512eff51696db91378b08a51097533fd617e424b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 25\u002B corresponding lines): src/cmds/git/gh_cmd.rs:428-455 | src/cmds/git/gh_cmd.rs:791-815 | src/cmds/git/gh_cmd.rs:911-943 | src/cmds/git/glab_cmd.rs:543-570 | src/cmds/git/glab_cmd.rs:750-776 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 25 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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1102003ec8af770cd923b58cf471c47a993c3b4232dc5278401058ed43235189"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): proxy/src/pipeline/ingest_filter.rs:280-315 | proxy/src/pipeline/ingest_filter.rs:328-354 \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":"proxy/src/pipeline/ingest_filter.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"725cfaa4cafe83ca9f5c4dff9bd97010230a4665e759324910d30cc68c555b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/hooks/init/copilot.rs:80-118 | src/hooks/init/copilot.rs:211-248 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/copilot.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc5a60b32f5ec6e45c1ce8e56ef6d6bc5af0d3235a7386a7a976ec6ec05a574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/hooks/init/mod.rs:1870-1902 | src/hooks/init/mod.rs:1905-1939 \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":"src/hooks/init/mod.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"25efd1e3d30cdab03b6ee1d62da60fb46b252868c4860b8d55b6eb59425b06c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): proxy/src/pipeline/ccr/anthropic.rs:51-73 | proxy/src/pipeline/engine_methods.rs:193-214 | proxy/src/pipeline/ingest_filter.rs:464-483 | proxy/src/pipeline/normalize.rs:344-363 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a83e7f3266ecf51d518c3b48f1cf05018579efece23920600cddd4f7d7f54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/cmds/python/ruff_cmd.rs:522-536 | src/cmds/system/format_cmd.rs:270-284 \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":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"28823b6ce9eb3f788f208de3164b814262b3873d382bd95f69f2d7206d482736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/cmds/system/ctest_cmd.rs:561-587 | src/cmds/system/ctest_cmd.rs:778-799 \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":"src/cmds/system/ctest_cmd.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"590ac38f45f67c0651ae87666cf9dbcfa1d53d285e52a2d072624f87ff497681"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/cmds/rust/runner.rs:13-28 | src/cmds/rust/runner.rs:34-53 \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":"src/cmds/rust/runner.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacccec0e2456f706feee76f3a25404aeec85ad62d940fceb325b477851b8d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): proxy/src/pipeline/ccr/anthropic.rs:27-47 | proxy/src/pipeline/ccr/openai.rs:40-60 \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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bf4d29c4839474302a14dab0f94f343f063a576fb3ab5524b40ea45a20ae28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): proxy/src/store.rs:347-365 | proxy/src/store.rs:409-427 \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":"proxy/src/store.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"004627e0781183fd2587cdd2bfc472caad43338f797279aeca948e489adc7555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/cmds/cloud/container.rs:339-364 | src/cmds/cloud/container.rs:520-548 \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":"src/cmds/cloud/container.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e0c25f95db782fd05a257898d1f753cf5255aa86191a4242976527ce0600c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/cmds/python/pip_cmd.rs:68-94 | src/cmds/python/pip_cmd.rs:96-125 | src/cmds/python/pip_cmd.rs:127-151 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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":"src/cmds/python/pip_cmd.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69bd9f463686fa01e7d85eb10a66ee90833e909f5fc12092f05df123e727093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/cmds/js/playwright_cmd.rs:91-123 | src/cmds/js/pnpm_cmd.rs:59-97 \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":"src/cmds/js/playwright_cmd.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f2360b8d539c8fbe65fd0e7bdb242d8bc1911c2d3190457383ca8cbc4feae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/analytics/gain.rs:543-558 | src/analytics/gain.rs:1343-1360 \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":"src/analytics/gain.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc490c6beef3cf0e77710e5c785ae0816f186cb02abe891b3138fb9151545e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): proxy/src/memory.rs:103-122 | proxy/src/memory.rs:206-218 \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":"proxy/src/memory.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f42260caa4f03c8378eb8828f498c96714db58f1fa9887e23cbf3df0084d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): proxy/src/store.rs:283-305 | proxy/src/store.rs:318-344 \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":"proxy/src/store.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4659d51ced6a99e8f4b12d3a97ce8f0c3e4a2eea706a5d3d409196a40547f9a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/cmds/git/gh_cmd.rs:1014-1036 | src/cmds/git/glab_cmd.rs:572-595 \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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fb92236ea1b0c3bd21ca486e3c00ed661227b9947708afcbbb94443cff60fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/cmds/git/git_cmd.rs:3112-3146 | src/cmds/js/npm_cmd.rs:178-210 \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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edc83210d432fe7278750e348882cdfcc39e7bfce4d91bc59e5c86df0fd0ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/analytics/gain.rs:1796-1817 | src/hooks/init/mod.rs:852-873 \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":"src/analytics/gain.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"084435f902b2f3b36106095c38af8bfc941fff2f250ee5f5db020499fc9b58aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): proxy/src/pipeline/ccr/mod.rs:94-104 | proxy/src/pipeline/ccr/mod.rs:141-151 \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":"proxy/src/pipeline/ccr/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aafb4f2d31b06777cdf9acaebff6916d51629593c9bea719fde16cc78eb7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): src/cmds/rust/cargo_cmd.rs:274-294 | src/cmds/rust/cargo_cmd.rs:306-326 | src/cmds/rust/cargo_cmd.rs:333-353 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"054acc61a6dfdbce7d9aad339cae5f927f35b8dc8626cf097235fb7a1958b8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/hooks/init/cursor.rs:80-108 | src/hooks/init/droid.rs:204-228 \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":"src/hooks/init/cursor.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7278c713ddbc3a964ce45d1c0c8af652297ca793c5dead281566f48007af47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/cmds/go/golangci_cmd.rs:452-466 | src/cmds/js/lint_cmd.rs:523-536 \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":"src/cmds/go/golangci_cmd.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"399e831d2769849b06d21093fdf5bdf5531bc6424fa5cbf475341e233b860046"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/hooks/init/droid.rs:307-336 | src/hooks/init/vibe.rs:222-254 \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":"src/hooks/init/droid.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efac66d317232dc9589b3ca1c26a5f8d1ae8da1a4698a37bd978ca2ec809ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/cmds/go/go_cmd.rs:96-118 | src/cmds/go/go_cmd.rs:120-142 \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":"src/cmds/go/go_cmd.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29494db09b210ecc969d3e12470a64020466d58fd3c930f43035f520c38d887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/cmds/js/prisma_cmd.rs:413-427 | src/cmds/js/prisma_cmd.rs:430-444 \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":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1846a717dab1579aa1a3b53bdf9561d92049d4fbcafa9fe04f2e68a4c531f5df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/core/pipeline_config.rs:344-360 | src/core/pipeline_log.rs:53-69 \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":"src/core/pipeline_config.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6181bb51da2892e3a84e9c34b1b580b5fa16e290c1e4eba0372a9f8a1b3ce74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/cmds/js/bun_cmd.rs:153-170 | src/cmds/js/deno_cmd.rs:24-46 \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":"src/cmds/js/bun_cmd.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"291569619577e81e110a4750819b2ce00c460d3a10ec677a10d6ba980690f9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/hooks/init/copilot.rs:121-146 | src/hooks/init/copilot.rs:250-276 \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":"src/hooks/init/copilot.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"75087604327618bda629164ae230aa01b80a3f59ec80e030192c654ae9d723f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/cmds/cloud/container.rs:756-777 | src/cmds/cloud/container.rs:779-796 \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":"src/cmds/cloud/container.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892cd75e249f89b72f906d0e22e633821a0940bf971b0c045744d5d1dbf2eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): proxy/src/memory.rs:87-100 | proxy/src/memory.rs:189-202 | proxy/src/memory.rs:221-232 \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":"proxy/src/memory.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e32b0572bbaf4a00ed50de3bfcc78c941070a9a476160a1873582a5fc24f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/cmds/system/json_cmd.rs:42-57 | src/cmds/system/log_cmd.rs:26-39 \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":"src/cmds/system/json_cmd.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"998ca33c200b8254a443dc5420a1cbd69ba3609b25d46f5525d6c2537bc76edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/cmds/system/local_llm.rs:200-215 | src/cmds/system/local_llm.rs:217-229 \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":"src/cmds/system/local_llm.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ba248731f0d17328a7429ba32f9e400e4597fc73706939f3c6ca9b938f097"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/hooks/init/hermes.rs:276-290 | src/hooks/init/hermes.rs:383-406 \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":"src/hooks/init/hermes.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a08499f96cdef28c2e3080034355f03ab6854bfa6ead9728ce2db7a6313d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/cmds/git/git_cmd.rs:2692-2703 | src/cmds/git/git_cmd.rs:2708-2719 \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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccce250b57d36fbd027b9db762b54be93af795d0b2d00d9f4a3d131d2122bdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): src/cmds/php/paratest_cmd.rs:9-32 | src/cmds/php/pest_cmd.rs:9-32 | src/cmds/php/phpt_cmd.rs:102-128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"src/cmds/php/paratest_cmd.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"167a6a4722f55da8d20cda0bbe7e43aa8d9e2c6904b7964d6b541d54dbd097c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/core/utils.rs:200-216 | src/core/utils.rs:221-237 \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":"src/core/utils.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f4452d80e6b0e623658c6fbef1a4199165a6219f31b6a66469ff63e82a8d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/analytics/gain.rs:1288-1299 | src/analytics/gain.rs:1378-1389 \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":"src/analytics/gain.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b842dd6cf9b03afb49827c7e0dd59fccc3d219d7bc71ff287ad6d2e2c19d480b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/cmds/dotnet/binlog.rs:260-270 | src/cmds/dotnet/binlog.rs:272-282 \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":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fb5cb435b72456a8aff057c8f9278e5494cdbcdfbb3bdd22aa6929e53b5002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/cmds/git/gh_cmd.rs:180-204 | src/cmds/git/glab_cmd.rs:213-233 \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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35e1d789e1e8874d5ecd1d5c6765b7fe26af864bea6c9f66a86ddc8f94b44a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/cmds/go/go_cmd.rs:190-205 | src/cmds/go/golangci_cmd.rs:180-195 \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":"src/cmds/go/go_cmd.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a7e996b20f8104847f2eec02b6e88ba636ee668dde283a8a96f970c8f8303d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/hooks/hook_cmd.rs:308-326 | src/hooks/hook_cmd.rs:1237-1250 \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":"src/hooks/hook_cmd.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddabadb0457b6031c000836ad78dcd083e579ac6aba3bc81a0bc657c021bfa38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/cmds/git/gh_cmd.rs:104-111 | src/cmds/git/glab_cmd.rs:109-116 | src/cmds/php/artisan_cmd.rs:15-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c162483888ef86a085b4b4dd53988167f8be47ad61e229ebc16c2ec6aaf6767a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/src/pipeline/resolve.rs:838-849 | engine/src/pipeline/resolve.rs:855-868 \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":"engine/src/pipeline/resolve.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a66660322e6fcc3750a12653a5887f84d62a874aba6717c5f5382599753a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/core/tracking.rs:1881-1891 | src/core/tracking.rs:1937-1947 \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":"src/core/tracking.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"726c6d58c4072dd8c5dff7743b85a3cda790f1d629c49bc8edf8c53f0539586d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/hooks/init/codex.rs:1001-1012 | src/hooks/init/cursor.rs:250-261 \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":"src/hooks/init/codex.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3e4be47eb1d8f65b282c3dbcdafd75c4ac5a652cfe769900d3e4591115d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/core/tracking.rs:2248-2262 | src/core/tracking.rs:2269-2283 \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":"src/core/tracking.rs"},"region":{"startLine":2248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7202cf67e4b87e6b03253b37901f667ff814e847ef5028d203b15543cd33069"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/cmds/git/glab_cmd.rs:597-616 | src/cmds/git/glab_cmd.rs:1032-1045 \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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"758cf3ee53db300b86e95ad49e8d805e9638db5804c6e726feb806fbe57ed710"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/analytics/cc_economics.rs:528-540 | src/analytics/cc_economics.rs:542-554 | src/analytics/cc_economics.rs:556-568 \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":"src/analytics/cc_economics.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edb78f34d73475748921d26877cd328a2539f52553cd226ae128d69ff19c779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/core/retriever.rs:173-186 | src/core/tee_file.rs:105-113 \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":"src/core/retriever.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7de5f338d91d49bd953fca1cfda67aac0e48996fa48ef55badbf8fd421885d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): proxy/src/pipeline/ccr/anthropic.rs:335-345 | proxy/src/pipeline/ccr/anthropic.rs:349-361 | proxy/src/pipeline/ccr/openai.rs:144-153 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"97debb73c9bbd2fad6a4b6be88e986757f3be3a953c2c420dbebbcfe57165cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/cmds/cloud/container.rs:41-57 | src/cmds/git/gh_cmd.rs:250-263 | src/cmds/git/glab_cmd.rs:298-311 \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":"src/cmds/cloud/container.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"845802871c04af91da15fd11747ce5898407afb5a47c56779420dc90253d8dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/hooks/hook_cmd.rs:24-34 | src/hooks/hook_cmd/claude_pipeline.rs:12-22 \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":"src/hooks/hook_cmd.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd066ac417742808a2e832db3424c87e83271237777e8c3cbd23d1500c965ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): engine/src/strategy.rs:15-24 | proxy/src/pipeline/ccr/mod.rs:116-125 | proxy/src/pipeline/ccr/mod.rs:163-172 | proxy/src/pipeline/ccr/mod.rs:184-192 | proxy/src/pipeline/ccr/mod.rs:216-224 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/strategy.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1379f294386cd88563a7110896f3ba86fc8f01c4c09fcf81d01211aabcde355c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/hooks/init/droid.rs:457-470 | src/hooks/init/trae.rs:357-371 \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":"src/hooks/init/droid.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b99853cc0d148be2375f63b183ac95338c770101e5d322309d732b0970c2b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): src/cmds/git/gh_cmd.rs:1139-1144 | src/cmds/git/gh_cmd.rs:1146-1150 | src/cmds/git/glab_cmd.rs:1121-1125 | src/cmds/git/glab_cmd.rs:1127-1132 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e4013542d24ea2b3f5e8e6a36da8db6c7e84e8dbf4e8333622ac93a0dfcc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/cmds/dotnet/dotnet_cmd.rs:1100-1116 | src/cmds/dotnet/dotnet_cmd.rs:1176-1191 \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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6629a81d08c06412a8e6e9bd9d64f7d6d13ec7c4cb8efb2055aeaaaaa6fd0fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/cmds/git/gh_cmd.rs:137-144 | src/cmds/git/gh_cmd.rs:169-176 | src/cmds/git/glab_cmd.rs:170-177 | src/cmds/git/glab_cmd.rs:181-188 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a1d4ca4c207328e5c11cf63505eacf8a503e5af4ed8a5a36d9c7215b16f90e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/core/retriever.rs:87-95 | src/hooks/init/codex.rs:50-57 \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":"src/core/retriever.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff59fbeebe4b317b789de31041a8c6c550e15af6e060d084eb298e0dafed47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): proxy/src/service/mod.rs:67-73 | src/llm_proxy.rs:95-101 \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":"proxy/src/service/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"34924aa15ad984d6655b6215dec22942f67f8dbb6dee848a05b27ddbfbd25f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): proxy/src/pipeline/ccr/anthropic.rs:8-24 | proxy/src/pipeline/ccr/openai.rs:18-37 \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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e16f8bd8852a8993ee9d05212171e15b5bf950c55faa33b39c7673af12a4ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): src/cmds/git/gt_cmd.rs:179-183 | src/cmds/go/go_cmd.rs:50-54 | src/cmds/js/bun_cmd.rs:203-210 | src/cmds/js/deno_cmd.rs:58-62 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gt_cmd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1840540991167c6154631f44c194543ee4767a3a0eb5201e7e1f7bc3b92874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/cmds/system/ls.rs:424-432 | src/core/utils.rs:90-98 \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":"src/cmds/system/ls.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"414ee29911d1085e8b5276e8dcf9696bed15cd366d8eb789e9c9e30a5dc2aff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): proxy/src/pipeline/ingest_filter.rs:241-246 | src/core/tracking.rs:581-586 \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":"proxy/src/pipeline/ingest_filter.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d595dcc03ab544b827613546dc82fa50ad98697fbe0cd776b0ecea14f1ab3c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/cmds/git/glab_cmd.rs:143-148 | src/cmds/git/gt_cmd.rs:394-400 \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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce852dde22e3c0e164e91bfb8c0177d8181acc4dddfe553bbf5ea4514f112ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/cmds/git/git_cmd.rs:854-861 | src/cmds/jvm/mvn_cmd.rs:211-217 \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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f37368414c0c9dcb08b8ff31c679072c7dcca20014664d09457e02e46c0dd08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): engine/src/pipeline/builtins.rs:36-41 | engine/src/registry.rs:184-189 | proxy/src/model.rs:117-123 | proxy/src/server.rs:473-479 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 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":"engine/src/pipeline/builtins.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7427e6425b2155a1064f3c35a8391b158182a70a171eb79851a261ebd9335932"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/hooks/init/claude.rs:887-891 | src/hooks/init/cursor.rs:176-180 \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":"src/hooks/init/claude.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a3a4bbdaa3e03bc58045afdc1c23936fad4aa7b726c87542fd463d0000af86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): proxy/src/pipeline/engine_methods.rs:216-220 | src/hooks/posthook.rs:105-109 \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":"proxy/src/pipeline/engine_methods.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad83051501e47fa0df993c02e80e7ffabe76388a900fc0628f924f257beffd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60\u201370 lines \u00D7 2): src/cmds/git/gh_cmd.rs:32-101 | src/cmds/git/glab_cmd.rs:47-106 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ab93c765d962dc981bfe211aeab24e037eedc61738b1a0898110ae26e49a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201365 lines \u00D7 2): proxy/src/ccr_forward.rs:90-154 | proxy/src/ccr_forward.rs:215-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/ccr_forward.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/ccr_forward.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d32d36c812ae984d524cbbdf030b81c7f3a60e97f6f3d15555b5a8603f5439f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): src/hooks/init/copilot.rs:155-195 | src/hooks/init/copilot.rs:283-323 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/copilot.rs:155\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":"src/hooks/init/copilot.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"452c7d8b7b361dc7b19befba661118cc14102fa660effa73e5a9564f7b806437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): src/hooks/init/claude.rs:700-738 | src/hooks/init/claude.rs:922-960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4688acef44fb114161f9d0cc941411b757f2273f4ba4802b5f7b127079dea89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201337 lines \u00D7 2): src/cmds/jvm/mvn_cmd.rs:1595-1631 | src/cmds/jvm/mvn_cmd.rs:1713-1743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/jvm/mvn_cmd.rs:1595\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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b903c52dc5ebe695251e300bf7bd9880a05f2128e9e900c7a48426d882760ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/cmds/git/git_cmd.rs:4143-4171 | src/cmds/git/git_cmd.rs:4185-4213 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/git_cmd.rs:4143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmds/git/git_cmd.rs:4182\u0060 calls \u0060Some\u0060, \u0060arg\u0060 and \u0060src/cmds/git/git_cmd.rs:4142\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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":4143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff96cba2ca1f8c79ae75d81406f6b8302237c832884619de9648c78bbb42b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): src/cmds/jvm/mvn_cmd.rs:1445-1472 | src/cmds/jvm/mvn_cmd.rs:1691-1714 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/jvm/mvn_cmd.rs:1445\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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8518d9d842d40bb4b282110679378a9828d6c71476970f6efd68b3927ce6232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): proxy/src/ccr_forward.rs:163-188 | proxy/src/ccr_forward.rs:272-297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/ccr_forward.rs:163\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":"proxy/src/ccr_forward.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"00436d4db5156582a4a79e814e2797a10c7e5b454e1bef8698bd6badd31a53e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): src/discover/lexer.rs:343-365 | src/discover/lexer.rs:384-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/discover/lexer.rs:343\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9761b76d561d5ecfe0b5390da1904c3e27c2c0940fb41525329062698c1c75c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201323 lines \u00D7 2): proxy/src/pipeline/ingest_filter.rs:293-315 | proxy/src/pipeline/ingest_filter.rs:339-354 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/pipeline/ingest_filter.rs:293\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":"proxy/src/pipeline/ingest_filter.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff4b6283b587251693dd45039e1de4c32a8621dc4899f7c877be4189b78a8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/cmds/git/gh_cmd.rs:214-235 | src/cmds/git/glab_cmd.rs:243-264 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aa3f9a7f93a355aaaaec090d19b432ecc0d45f0c741ece8fcf58164e4beae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/cmds/system/log_cmd.rs:141-162 | src/cmds/system/log_cmd.rs:183-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/system/log_cmd.rs:141\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":"src/cmds/system/log_cmd.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c798b8fc438a15a3d5d79c704e105cc4ac1394a4e5636d3b2869282c00fce34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/core/pipeline_config.rs:603-621 | src/core/pipeline_config.rs:733-751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_config.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe918fb38f5397f8fe9c236d974d18e4cfbd1f6aaddf697decea0c67b6c40009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/hooks/init/trae.rs:149-166 | src/hooks/init/trae.rs:301-318 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/trae.rs:149\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":"src/hooks/init/trae.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"99592bab364a479ceeed6cfa9cee315d29127be6f1f732e8e2f0c863b4b559e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/hooks/posthook.rs:773-790 | src/hooks/posthook.rs:820-837 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/posthook.rs:773\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":"src/hooks/posthook.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43f5ca5343f5ee857e34e586236d13aa7f56bf50fc35d4f6e5cfa330fe148b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/cmds/dotnet/dotnet_trx.rs:256-272 | src/cmds/dotnet/dotnet_trx.rs:296-311 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/dotnet/dotnet_trx.rs:256\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":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8cc642a87dc1cec8da1d62611f61972c724c8e8aba0eb044337f01391a687e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/cmds/rust/cargo_cmd.rs:166-181 | src/cmds/rust/cargo_cmd.rs:1234-1250 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/rust/cargo_cmd.rs:166\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":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b705127982c02032ee94b41ac74b43c96014dd4771bb91564475ca538f42369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/core/tracking.rs:1435-1450 | src/core/tracking.rs:1519-1534 | src/core/tracking.rs:1601-1616 \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 \u0060src/core/tracking.rs:1435\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/core/tracking.rs:1517\u0060 calls \u0060get\u0060 and \u0060src/core/tracking.rs:1433\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":"src/core/tracking.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b262489c5843ce6291d31b2db05727e3a8b68135d6dc4b06630082f83f61adda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cmds/js/pnpm_cmd.rs:315-330 | src/cmds/js/pnpm_cmd.rs:340-355 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/js/pnpm_cmd.rs:315\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":"src/cmds/js/pnpm_cmd.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54cccb7ebfe56bafc25c867b9a0dd897d91fc540a1e94b3576675e9b2af3c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cmds/system/read.rs:107-122 | src/cmds/system/read.rs:195-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/read.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c481e0f20ab84b3a14a717260cc729763bc851ee820ac4a9f0dc4ba9306ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): proxy/src/ccr_forward.rs:494-509 | proxy/src/ccr_forward.rs:563-577 \u2014 both copies are in the same file, so extract the block 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":"proxy/src/ccr_forward.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1dd7d38bc3d731676dbe1b5047b45c6e568abb088b182e7aa325bef99976d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/cmds/cloud/aws_cmd.rs:343-357 | src/cmds/cloud/aws_cmd.rs:442-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fab3026be9d3e6a7aac1b13c9959cad238a6b7d29ec935586bbb1484a74a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/cmds/dotnet/binlog.rs:689-701 | src/cmds/dotnet/binlog.rs:1016-1030 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/dotnet/binlog.rs:689\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e727bc3d3796869b1bd70a7253db2d5031352ae2137bc5bc2905cb75c5235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cmds/js/lint_cmd.rs:302-316 | src/cmds/js/lint_cmd.rs:426-440 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/js/lint_cmd.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2992c85d09322468b2162488dd1c2dac277e47343f5dc5182516d4f4753c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cmds/php/ecs_cmd.rs:47-61 | src/cmds/php/php_cmd.rs:72-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/php/ecs_cmd.rs:47\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":"src/cmds/php/ecs_cmd.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f083d71c4d6197590ad3b55d3b939772dd3446a261d18ce7037ed32815fbcd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/core/telemetry_cmd.rs:166-180 | src/hooks/init/mod.rs:1374-1388 \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":"src/core/telemetry_cmd.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"12462048ed98eef929ad635be0ddf0c27a9bad3bf03ba2c4d59e7ff669d54e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): src/analytics/cc_economics.rs:202-215 | src/analytics/cc_economics.rs:232-244 | src/analytics/cc_economics.rs:268-281 \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 \u0060src/analytics/cc_economics.rs:202\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rtk\u0060 to \u0060Vec\u003CDayStats\u003E\u0060 in one and \u0060Vec\u003CWeekStats\u003E\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":"src/analytics/cc_economics.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c708bb43183ac6f644161a7d101174d2a914b2ca99e32c4ca5cfb66d1fdbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): proxy/src/main.rs:325-338 | proxy/src/main.rs:412-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3592a618b5208feac2581bde573cc2a2c65543bc2a0b2d362c035df82aa83e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): proxy/src/pipeline/ccr/anthropic.rs:28-41 | proxy/src/pipeline/ccr/openai.rs:41-54 \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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1691eff99fcc6027e2d8be66bfb7f9f805fb35d98731266b1eb65212d1a1515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/analytics/cc_economics.rs:582-594 | src/analytics/cc_economics.rs:620-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/analytics/cc_economics.rs:582\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":"src/analytics/cc_economics.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65000cfc503359aa912e034e8dd0794761c6b7d5e3ff6b54b4e743c9bf8c9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/cmds/git/gh_cmd.rs:269-281 | src/cmds/git/glab_cmd.rs:325-338 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c044aaba84b339de29cd7fdbb0afbd670c0c72de62e166b481ffcd94c28548c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmds/git/gh_cmd.rs:496-509 | src/cmds/git/gh_cmd.rs:704-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42726f7f9b9890b45a5e5a382c55a74ec38c1062a0644d0152bad38c44002eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/cmds/git/gh_cmd.rs:752-763 | src/cmds/git/glab_cmd.rs:664-677 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs:752\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e011f85a6bb95711800d7604fb08e87a914749306e272f3700adfc085f5fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/cmds/js/lint_cmd.rs:327-336 | src/cmds/js/lint_cmd.rs:452-465 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/js/lint_cmd.rs:327\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":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9e47fd17c4d5cf0549fc8ddeffd8cf03e5bd85adea38e846beeb72dfbb3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmds/system/read.rs:370-383 | src/core/retriever.rs:126-139 \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":"src/cmds/system/read.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9a04ff124c5044a6a796d26f4252da2f107ceedc0bd0ac53ed62d21a03803c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/discover/lexer.rs:288-301 | src/discover/lexer.rs:360-369 \u2014 both copies are in the same file, so extract the block 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 \u0060src/discover/lexer.rs:288\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":"src/discover/lexer.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d635760d9ead9117b3068bcf44d060ae15a59ce902269068abcdca4129a3603c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/hooks/init/mod.rs:1019-1032 | src/hooks/init/mod.rs:1271-1280 \u2014 both copies are in the same file, so extract the block 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":"src/hooks/init/mod.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"a740d6a8f5d8f4300febcc3cd2cd0eb75c734c89be250b0c816f7835422ff426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/lib.rs:3958-3971 | src/lib.rs:3980-3993 \u2014 both copies are in the same file, so extract the block 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 \u0060src/lib.rs:3958\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":"src/lib.rs"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"524dc279172b8d89f9ff7cca26dbceccbf4f10559d1b0e927ecdfcbc88d91a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/core/tracking.rs:1411-1431 | src/core/tracking.rs:1494-1514 | src/core/tracking.rs:1577-1597 \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 \u0060src/core/tracking.rs:1411\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, \u0060src/core/tracking.rs:1518\u0060 calls \u0060get\u0060 and \u0060src/core/tracking.rs:1435\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":"src/core/tracking.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad118c10f2fde38ba6faea306272ea7ecd39cc87ecd2ab7b21368c2d2f40bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): proxy/src/memory.rs:145-157 | proxy/src/memory.rs:162-173 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/memory.rs:145\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":"proxy/src/memory.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d10df94493cfb8acd58f1f3b7e005d8d1f59e596840204e89d16bd6d9492019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cmds/system/read.rs:62-75 | src/cmds/system/read.rs:166-178 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/system/read.rs:62\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":"src/cmds/system/read.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f69f1e08f34d7bddda4fde6f0fb80058aeb8f27e98385dce190a8782732722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/cmds/system/read.rs:123-135 | src/cmds/system/read.rs:213-224 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/system/read.rs:123\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":"src/cmds/system/read.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf947c234e1a617a95341e8bb38f8596ebb9df5bf11185daac9f48a81188f764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/cmds/git/git_cmd.rs:409-420 | src/cmds/git/git_cmd.rs:700-711 | src/cmds/git/git_cmd.rs:3158-3169 | src/cmds/git/git_cmd.rs:3891-3902 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f429eaf47c70662e4e9116e783edb2e56b3fca0e43f2ef42462fe9b70a42e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/hooks/hook_cmd.rs:74-85 | src/hooks/hook_cmd.rs:808-819 | src/hooks/hook_cmd.rs:923-934 | src/hooks/hook_cmd.rs:1054-1065 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e606e3666a84390039f4b9c5312d6fe66abe3715e2af9803fda079253120a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): proxy/src/pipeline/ingest_filter.rs:331-342 | proxy/src/pipeline/ingest_filter.rs:365-376 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/pipeline/ingest_filter.rs:365\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":"proxy/src/pipeline/ingest_filter.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"593a485e4f58224205ff6d7c8f6cff2ef4f2f174d8e95dc56fb1239aaa936811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmds/dotnet/binlog.rs:763-774 | src/cmds/dotnet/binlog.rs:788-799 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/dotnet/binlog.rs:763\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, \u0060src/cmds/dotnet/binlog.rs:800\u0060 calls \u0060captures_iter\u0060, \u0060count\u0060 and \u0060src/cmds/dotnet/binlog.rs:775\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":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ca2d1121c848c3df7024649dd5726554047bed1e013c77c52debf9303faa37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): src/cmds/git/gh_cmd.rs:372-383 | src/cmds/git/glab_cmd.rs:447-453 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs:372\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdec40b90408624bbf8f91fcf70e6faeda7515a2c8fa9352a70a8ab05ec19fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmds/git/gh_cmd.rs:768-779 | src/cmds/git/glab_cmd.rs:682-693 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs:768\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"da403631f4bc8df9c1a784919be3438442ac4c396227ae190199e1b7c3966aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/hooks/init/mod.rs:618-629 | src/hooks/init/mod.rs:644-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed15fef5a2c747993a99a45d1c169975fb8da60ac239e1a9a92c58a6dbe1a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/hooks/posthook.rs:333-344 | src/hooks/posthook.rs:396-407 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/posthook.rs:333\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":"src/hooks/posthook.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e2c4d29b68ff488da7e6924412d2f8fa0c903c0fa2b1dca97aa1b78f67a7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/cmds/rust/cargo_cmd.rs:275-285 | src/cmds/rust/cargo_cmd.rs:307-317 | src/cmds/rust/cargo_cmd.rs:334-344 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fe69f4a132f8d39dcc1958852aec27349c8863e5c284e1c32cfb109e0a822c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): proxy/src/extract.rs:210-221 | proxy/src/extract.rs:266-277 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/extract.rs:210\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":"proxy/src/extract.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7626fbe4b526e32335c82814fdc5ba667c15119b0ce34aadfe79606f25f92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): proxy/src/pipeline/image_opt.rs:244-254 | proxy/src/pipeline/pixel_compress.rs:326-336 \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 \u0060proxy/src/pipeline/image_opt.rs:244\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":"proxy/src/pipeline/image_opt.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6833a8c1c9002c035fb97b045f58c4a8404a608c7d2c72dfbb470a2af81ca358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/analytics/gain.rs:71-81 | src/analytics/gain.rs:178-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/analytics/gain.rs:71\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":"src/analytics/gain.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2323f7633a516e8f2913a92f82c7617f1def90571ff97d40341abda36218639e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/cloud/aws_cmd.rs:637-647 | src/cmds/cloud/aws_cmd.rs:662-672 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/cloud/aws_cmd.rs:637\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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc85bb4dbc12d271999242094aa64234e13d366e1849c047a4a55896ca53e960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/dotnet/dotnet_cmd.rs:181-191 | src/cmds/dotnet/dotnet_cmd.rs:213-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b9a7d19111597bb0b087bcdafccaa03e5d4e3a04f3f4a6efbd4f02e2121d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/git/git_cmd.rs:370-380 | src/cmds/git/git_cmd.rs:4360-4370 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/git_cmd.rs:370\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmds/git/git_cmd.rs:369\u0060 calls \u0060success\u0060 and \u0060src/cmds/git/git_cmd.rs:4359\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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1484bdb58cde5440ea748782f584386cf5b294a9fdbdca122c66c0f4eae47b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/git/git_cmd.rs:3292-3302 | src/cmds/git/git_cmd.rs:3739-3749 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/git_cmd.rs:3292\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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"779eda39a853f2081f822cfe15143235d1f7eac158514d253957ed6131aa8671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/js/tsc_cmd.rs:325-335 | src/cmds/python/mypy_cmd.rs:180-190 \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":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee55365f47b17fe425c5682e87839198f299501230f318f128022c2e63425b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/cmds/jvm/mvn_cmd.rs:1398-1407 | src/cmds/jvm/mvn_cmd.rs:1647-1657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff09cb0f19da2625f8c6ba06be0c10b55657fb471392b1c54f0a07297e94d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/core/stream.rs:615-625 | src/core/stream.rs:640-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stream.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b68e26b34f70845de9b502f56bea4a6e1a763e1c41cdb8997438087171f1110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/discover/lexer.rs:253-263 | src/discover/lexer.rs:308-318 \u2014 both copies are in the same file, so extract the block 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 \u0060src/discover/lexer.rs:253\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":"src/discover/lexer.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c46bec457433b11368bb47011efcb708270dd9dcaeae95da8d92e2af0a8bb8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/hooks/hook_cmd.rs:309-319 | src/hooks/hook_cmd.rs:377-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39e4e3ff3f3484f9cc15c252172fe3c969eb5ef6932b893884a0f507fe7a187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): src/cmds/git/gh_cmd.rs:376-385 | src/cmds/git/gh_cmd.rs:773-781 | src/cmds/git/glab_cmd.rs:447-455 | src/cmds/git/glab_cmd.rs:687-695 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs:376\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04f7cf186831dfd12e73535f62e50e69eb02cac19b334308de5f5513cad6ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/pipeline/conditions.rs:202-211 | engine/src/pipeline/conditions.rs:234-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"engine/src/pipeline/conditions.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60c99b13c3ecb4976121481683d2179d804857a459ab747a6934841f3ccc0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/core/tracking.rs:1697-1709 | src/core/tracking.rs:1759-1771 \u2014 both copies are in the same file, so extract the block 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 \u0060src/core/tracking.rs:1697\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":"src/core/tracking.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"47746d0c074ec4eabbbb6de2e088043882e02ac2d607babe51f15870850114ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/cmds/python/ruff_cmd.rs:457-465 | src/cmds/system/format_cmd.rs:168-176 | src/cmds/system/format_cmd.rs:181-189 | src/cmds/system/format_cmd.rs:197-205 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bf68e624a3611b3d4c3b1be226a9df2a6904b4d058f535ed9d60e28a973c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/cmds/js/prisma_cmd.rs:60-68 | src/cmds/js/prisma_cmd.rs:115-123 | src/cmds/js/prisma_cmd.rs:157-165 \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 \u0060src/cmds/js/prisma_cmd.rs: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":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"427f40dee4c3daed2ae9d8e5e3d7a7a65fd53f160f8f25da7625d8d70baa500a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/cmds/system/deps.rs:116-124 | src/cmds/system/deps.rs:235-243 | src/cmds/system/deps.rs:279-287 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmds/system/deps.rs:276\u0060 calls \u0060is_empty\u0060, \u0060push_str\u0060 and \u0060src/cmds/system/deps.rs:113\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":"src/cmds/system/deps.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ffef4445cd56802958b838e210d3c8d37d140f4631733f20648853ad4f5945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/src/memory.rs:92-100 | proxy/src/memory.rs:194-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/memory.rs:92\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":"proxy/src/memory.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff814c8de1e94599d06e06713bc3f5ea9554f5b059f97123c6d3a5d8f8923ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/src/store.rs:357-365 | proxy/src/store.rs:419-427 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/store.rs:357\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":"proxy/src/store.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca96e929ce232a4871fc1ccfde5ac16cc40a2763c76f3d1a65d68f382e7c171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmds/cloud/container.rs:170-178 | src/cmds/cloud/container.rs:182-192 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/cloud/container.rs:182\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":"src/cmds/cloud/container.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bd4d73dcf6a3212a136b6b8620c7b3ff4830123879c44a07e1a03685d995b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/cmds/git/gh_cmd.rs:519-526 | src/cmds/git/glab_cmd.rs:529-537 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs:519\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, \u0060src/cmds/git/gh_cmd.rs:528\u0060 calls \u0060push_str\u0060 and \u0060src/cmds/git/glab_cmd.rs:538\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c37494168eb921908d124b2d87419cae8fa6ef5380c66bb6a69180d573fdffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/cmds/git/gh_cmd.rs:831-843 | src/cmds/git/glab_cmd.rs:731-744 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs:831\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, \u0060src/cmds/git/gh_cmd.rs:845\u0060 calls \u0060push_str\u0060 and \u0060src/cmds/git/glab_cmd.rs:745\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e6475afe0a441dc770bf079ddfcd4c6d5362429700267a0c24c805381bd266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmds/system/local_llm.rs:207-215 | src/cmds/system/local_llm.rs:221-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 \u0060src/cmds/system/local_llm.rs:207\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":"src/cmds/system/local_llm.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6441c05fd1cfc967ddc9e0f1e6fc290b10b337b176139f45f5163c54ce5dc97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/core/task_cmd.rs:555-563 | src/core/task_cmd.rs:639-647 \u2014 both copies are in the same file, so extract the block 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 \u0060src/core/task_cmd.rs:555\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":"src/core/task_cmd.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"28894ff58df5892e55b9e9ee811abb119af30379c077d031795108092f4340d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/discover/lexer.rs:366-374 | src/discover/lexer.rs:413-420 \u2014 both copies are in the same file, so extract the block 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 \u0060src/discover/lexer.rs:366\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":"src/discover/lexer.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1eb40eba7b9471fd4e2d529cab33307074589df7edb48f1d8e6bd1cfb813b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/hooks/init/agents_md.rs:125-133 | src/hooks/init/agents_md.rs:318-326 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/agents_md.rs:125\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":"src/hooks/init/agents_md.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad1e83845e767d58e700f133bde4dd00bcb8c784eeb61824a9c4c3ede92d275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/hooks/init/antigravity.rs:401-409 | src/hooks/init/antigravity.rs:468-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/hooks/init/antigravity.rs:468\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":"src/hooks/init/antigravity.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d346a520dc06bf1a8366f42ed262d874cefbff7fa597cb302f69d29910781a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/hooks/init/hermes.rs:277-285 | src/hooks/init/hermes.rs:386-394 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/hermes.rs:277\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":"src/hooks/init/hermes.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"af949d4170a96d7706f937986b2138afedc00dc12675061f8bce4343e1614734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/analytics/cc_economics.rs:222-229 | src/analytics/cc_economics.rs:258-265 | src/analytics/cc_economics.rs:287-294 \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 \u0060src/analytics/cc_economics.rs:222\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":"src/analytics/cc_economics.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8046dcbac6886edcfd59be69e14eae5131b2b79da65d7efbd3b34808e81a728c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/cmds/git/git_cmd.rs:3292-3299 | src/cmds/git/git_cmd.rs:3739-3746 | src/cmds/git/git_cmd.rs:3867-3874 \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 \u0060src/cmds/git/git_cmd.rs:3292\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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"260514712f551807c0dd62bb023c5495214509884b5860629dca4b1f217ad245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 3): proxy/src/engine_rules.rs:58-65 | src/core/pipeline_config.rs:119-121 | src/hooks/trust.rs:222-229 \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 \u0060proxy/src/engine_rules.rs:58\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":"proxy/src/engine_rules.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e4617b562ea31e41116b2f4fa9e48c17641a6c8355f35187806578056b1d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/src/pipeline/engine_methods.rs:243-250 | proxy/src/pipeline/normalize.rs:424-431 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/pipeline/engine_methods.rs: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":"proxy/src/pipeline/engine_methods.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e723939f46c9468d3d5b8b1d4f207ceeddd7b70193dbd36d0c11515a8179ab2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/git/glab_cmd.rs:558-565 | src/cmds/git/glab_cmd.rs:764-771 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/glab_cmd.rs:558\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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4714a0d129c8d0f6e5ef0c4f3c8872b285f467891ca50e236df9a38cee077d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/python/ruff_cmd.rs:526-536 | src/cmds/system/format_cmd.rs:274-284 \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 \u0060src/cmds/python/ruff_cmd.rs:526\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":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1be63eee040ab22e16ecb6e3e5386a79afb7fb3d72acdbde7b2b4e34f88a334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/core/pipeline_config.rs:571-578 | src/hooks/posthook.rs:272-279 \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":"src/core/pipeline_config.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff64cfd85440b3ef131a41efbc016c627892992417e442b71cbfb369aa960f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/hooks/posthook.rs:904-911 | src/hooks/posthook.rs:924-931 \u2014 both copies are in the same file, so extract the block 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":"src/hooks/posthook.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c308aa8f016ce126e152b1c2dd6d4b65e388a2b088ff5ec09716ddae062691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/src/extract.rs:162-168 | proxy/src/forward.rs:694-700 \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 \u0060proxy/src/extract.rs:162\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":"proxy/src/extract.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1779ac452f23eca49a3341333f1db2b49abde56904d65fa6b40876c02093f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/src/pipeline/cache_align.rs:79-85 | proxy/src/pipeline/cache_align.rs:88-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/pipeline/cache_align.rs:79\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":"proxy/src/pipeline/cache_align.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b43beca8fdbf170111d6ff3831de1eebfe9fd0f58059e642504aa4794dfcc80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/src/pipeline/ccr/anthropic.rs:53-60 | proxy/src/pipeline/ccr/anthropic.rs:137-144 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/pipeline/ccr/anthropic.rs: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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff4081e8cc3cabe3595715d043facc0570f288759c55803e22e36ea1ef612bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/src/pipeline/ccr/anthropic.rs:57-63 | proxy/src/pipeline/ingest_filter.rs:466-472 \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 \u0060proxy/src/pipeline/ccr/anthropic.rs: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. The matched lines also transfer control out of the body holding them, 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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b030e54e3a6f8d036ff56f538e500246754d06ac205b3a1edff8de335ddd8625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/src/pipeline/ccr/anthropic.rs:65-71 | proxy/src/pipeline/normalize.rs:352-358 \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 \u0060proxy/src/pipeline/ccr/anthropic.rs:65\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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a136d15435caad034506a4d7b3ae374053f1b7d83e4efa73b5242718d8da0baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/js/prisma_cmd.rs:251-257 | src/cmds/js/prisma_cmd.rs:321-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"993e7762116211e40428ebd9d1937530fd5c605c56bdebba6fd21591ea7be538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/core/tracking.rs:1252-1258 | src/core/tracking.rs:1325-1331 \u2014 both copies are in the same file, so extract the block 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 \u0060src/core/tracking.rs:1252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd588cd9fba002b59267ff47819728c1e372003db2994aca115e6dfe04ea11d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/hooks/init/claude.rs:251-257 | src/hooks/init/gemini.rs:129-135 \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 \u0060src/hooks/init/claude.rs: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":"src/hooks/init/claude.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf82960416070be071366b5d9fcc2f9283b0d746004e18f7b5cba758e9d62c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/cmds/system/deps.rs:118-123 | src/cmds/system/deps.rs:201-206 | src/cmds/system/deps.rs:237-242 | src/cmds/system/deps.rs:281-286 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cmds/system/deps.rs:116\u0060 calls \u0060is_empty\u0060 and \u0060src/cmds/system/deps.rs:198\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":"src/cmds/system/deps.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c7fa197ac777830c6ae3ee9df943a258bf9c43ef3be31e8706447e4f0e8f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): proxy/src/pipeline/ccr/anthropic.rs:64-70 | proxy/src/pipeline/engine_methods.rs:206-212 | proxy/src/pipeline/normalize.rs:351-357 \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 \u0060proxy/src/pipeline/ccr/anthropic.rs:64\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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"162152c51f17c32dfe112d61308a587f433e3d5d0f5be3e020e22c302cad79d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/src/pipeline/engine_methods.rs:271-276 | proxy/src/pipeline/normalize.rs:380-385 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/pipeline/engine_methods.rs:271\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":"proxy/src/pipeline/engine_methods.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1e1090029952e0cf93804d6c0f64fe750872426dbe7b3fda03f944aaed39b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/go/go_cmd.rs:790-796 | src/cmds/go/go_cmd.rs:827-833 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/go/go_cmd.rs:790\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":"src/cmds/go/go_cmd.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e8757f053104936f6dfeb65383125e67ddcd804870c806f068216da37fefbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/go/golangci_cmd.rs:382-387 | src/cmds/js/lint_cmd.rs:403-408 \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 \u0060src/cmds/go/golangci_cmd.rs:382\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":"src/cmds/go/golangci_cmd.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"442cb3a5725923074a87412c9cb93b942ab028963b1599dd348e8a27215527d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/js/tsc_cmd.rs:350-356 | src/cmds/python/mypy_cmd.rs:194-199 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/js/tsc_cmd.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cmds/python/mypy_cmd.rs:200\u0060 calls \u0060is_empty\u0060 and \u0060src/cmds/js/tsc_cmd.rs:357\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":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39da223b553dd592892cf617fc6ea809ba7e2202bcab2ee738e57b30e7828a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/python/pytest_cmd.rs:124-129 | src/cmds/ruby/rake_cmd.rs:109-114 \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 \u0060src/cmds/python/pytest_cmd.rs:124\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":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1a813a0cd5720bb1265b3138c5fbad5c3944a3a35ea9a0e3fe4146de46ce16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/rust/cargo_cmd.rs:1065-1070 | src/cmds/rust/cargo_cmd.rs:1439-1444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/rust/cargo_cmd.rs:1065\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":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"e059432ca47a55c348411dd064f3f1b9dfbf178fdaeec11ac3b20baa918a1f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/core/pipeline_cmd.rs:492-498 | src/core/pipeline_remote.rs:734-740 \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 \u0060src/core/pipeline_cmd.rs:492\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":"src/core/pipeline_cmd.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5d7e68a6af24600871e1d4e0886f75cc7b2a67976e514bad4e729fda9c4ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/core/retriever.rs:323-328 | src/core/retriever.rs:747-752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/core/retriever.rs:323\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":"src/core/retriever.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f679a270acf47855059db6388306dd3851e54c1997903e960f1d7cfffcaf91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): proxy/src/pipeline/ccr/anthropic.rs:56-60 | proxy/src/pipeline/ccr/anthropic.rs:140-144 | proxy/src/pipeline/ingest_filter.rs:465-469 \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 \u0060proxy/src/pipeline/ccr/anthropic.rs:56\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":"proxy/src/pipeline/ccr/anthropic.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c355b3ede94d714007112739f9d71e2e6878b194202ca3aa45346f8e314bed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cmds/cloud/container.rs:98-102 | src/cmds/cloud/container.rs:170-177 | src/cmds/cloud/container.rs:182-191 \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 \u0060src/cmds/cloud/container.rs:98\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":"src/cmds/cloud/container.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a544a963e8569003bebee4de5f8dd1907424cebd7f20d66617b6fadfc4b84936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cmds/js/lint_cmd.rs:525-529 | src/cmds/python/ruff_cmd.rs:523-527 | src/cmds/system/format_cmd.rs:271-275 \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 \u0060src/cmds/js/lint_cmd.rs:525\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6685789a3c76b1a488e07e81e9acdba5880c6106bf9b077ac999028584c613ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/git/gh_cmd.rs:105-111 | src/cmds/git/glab_cmd.rs:110-116 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1e8f7ce56f435fb24486d499b322f2da1fc8c66cacb84e1967a9ac0c26da8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/gh_cmd.rs:362-367 | src/cmds/git/gh_cmd.rs:761-766 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/gh_cmd.rs:362\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfc091b4bd93fb2067d67b9245e1b2867e0a6432e051b6869022a678268d00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/glab_cmd.rs:438-443 | src/cmds/git/glab_cmd.rs:675-680 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/glab_cmd.rs:438\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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b16e70ad7f925f0f846605c8fe4d3faaddfea7331e8e2d0f49c59e1ac5e768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/js/lint_cmd.rs:441-445 | src/cmds/python/ruff_cmd.rs:350-354 \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":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed4bdcdcb4dfee44c6aedf09fd5f339f123dc6a9aea75c136e21b2931fdca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/js/tsc_cmd.rs:43-49 | src/cmds/js/tsc_cmd.rs:51-57 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/js/tsc_cmd.rs:43\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":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ad62dc16a6364985e61086cbaeea0c5182b3c51a425d20a96b7ec8b6681d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/system/find_cmd.rs:740-744 | src/hooks/hook_audit_cmd.rs:165-169 \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":"src/cmds/system/find_cmd.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"35836d3edae8c6bd1a3bb01862716f8e7b291b7786171849e89613aae9378565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/git/gh_cmd.rs:239-245 | src/cmds/git/glab_cmd.rs:268-274 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25aa7457339036a58ce7f7e4d437e92d214a56b12959a8234b49cc9b4fc608a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmds/git/gh_cmd.rs:309-317 | src/cmds/git/glab_cmd.rs:377-385 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"19869369f61110d9e5a0cf6ef6201915431c97e6008cb80c1cae3b7d563f7c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/hooks/init/pi.rs:573-590 | src/hooks/init/pi.rs:817-831 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/pi.rs:573\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":"src/hooks/init/pi.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"707c5b93793c1cb9426c0b410ddadbaa57664a7670c95574ab97b3f3038895c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/hooks/init/agents_md.rs:155-168 | src/hooks/init/claude.rs:68-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 \u0060src/hooks/init/agents_md.rs:155\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":"src/hooks/init/agents_md.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbcadba924a26b264da6e4179657f6e364a8d0588e4b58c968e933a23aad3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/hooks/init/copilot.rs:83-97 | src/hooks/init/copilot.rs:213-224 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/copilot.rs:83\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":"src/hooks/init/copilot.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75c19b6ec1a438a7decd8854ef91577705c6e3e24506dc08d834901ac2b2b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmds/php/paratest_cmd.rs:13-26 | src/cmds/php/pest_cmd.rs:13-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/php/paratest_cmd.rs:13\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":"src/cmds/php/paratest_cmd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f5107c02ff88b3f4890b03168575912a4da3b0abcb3ef9b9b43aaf9b8e3b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/core/tracking.rs:1248-1257 | src/core/tracking.rs:1347-1360 \u2014 both copies are in the same file, so extract the block 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 \u0060src/core/tracking.rs:1248\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"517c6487f5764c4b3bfcdfbb9ed7c9d5174e1e09adb03724f09c3d479b8ab099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/hooks/init/mod.rs:1881-1893 | src/hooks/init/mod.rs:1918-1930 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/mod.rs:1881\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":"src/hooks/init/mod.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd33141caf5f94e2f11e3c093d987f0c7589d96d6e0f8c842a16ccea81769b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/hooks/init/instructions_agents.rs:41-53 | src/hooks/init/instructions_agents.rs:89-101 | src/hooks/init/instructions_agents.rs:143-155 \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 \u0060src/hooks/init/instructions_agents.rs:41\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":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"85baa0aeea53e91465ff4c092d50620f4c7553b5df76a8467b68a2f515d4ad5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/cloud/container.rs:760-772 | src/cmds/cloud/container.rs:781-791 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/cloud/container.rs:760\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":"src/cmds/cloud/container.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbe7c980f31ac76ebd170a6b878b0f53b77d838484c484deaf1568e63c0e54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/hooks/hook_cmd.rs:728-740 | src/hooks/hook_cmd.rs:1012-1024 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/hook_cmd.rs:728\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/hooks/hook_cmd.rs:741\u0060 calls \u0060AllowRewrite\u0060, \u0060Some\u0060, \u0060AskRewrite\u0060 and \u0060src/hooks/hook_cmd.rs:1025\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":"src/hooks/hook_cmd.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2bf2d0f4052c1f553cbfe6fe8bae67aebb606ff0b6ae4fa65aa502c758c12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cmds/js/lint_cmd.rs:354-366 | src/cmds/python/ruff_cmd.rs:266-278 \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 \u0060src/cmds/js/lint_cmd.rs:354\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":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a32daca85327128affe4e8174c21bbc4cc18e28e2326abd506ce85deafc1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/git/git_cmd.rs:359-370 | src/cmds/git/git_cmd.rs:550-557 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/git_cmd.rs:359\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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5676cfae346a2c240626b2bf847f2c6a3851dcfa3dff993cd36704f96600fa57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/js/playwright_cmd.rs:291-301 | src/cmds/js/pnpm_cmd.rs:455-465 \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 \u0060src/cmds/js/playwright_cmd.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/playwright_cmd.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f18c98fc8e14ee0e2341c938f817cea06ce6dc72bf72c42e105104cf821da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/git/gh_cmd.rs:253-263 | src/cmds/git/glab_cmd.rs:301-311 \u2014 before extracting anything, compare \u0060src/cmds/git/gh_cmd.rs\u0060 and \u0060src/cmds/git/glab_cmd.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 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 \u0060src/cmds/git/gh_cmd.rs: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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"081bb5e0fd9036876c04c430aa473c789a06ff6b2861e543ef2c9477b5a3e8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/js/prisma_cmd.rs:417-427 | src/cmds/js/prisma_cmd.rs:434-444 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/js/prisma_cmd.rs:417\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":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c041b008e9b1ebf3fcd04dadc6bdc7570d05b743c451e4006536b18665d6b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/analytics/gain.rs:1804-1813 | src/hooks/init/mod.rs:859-868 \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":"src/analytics/gain.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebe54268d5b8face1e7bc0cd17d228e925c4a2c2464adf1c6aada09bc2ecb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/core/task_cmd.rs:544-553 | src/core/task_cmd.rs:593-602 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4147d0f8565d220bfaa8315dffca22051fafdb25c6e31c3f34c0ec28eb2ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmds/js/lint_cmd.rs:339-348 | src/cmds/js/lint_cmd.rs:468-477 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/js/lint_cmd.rs:339\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":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b189ca5c06e7884e69ab72d9fb81b9ac9a3fe80be92de73b4f809ff3ec8c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/hooks/init/instructions_agents.rs:27-35 | src/hooks/init/instructions_agents.rs:74-83 \u2014 both copies are in the same file, so extract the block 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 \u0060src/hooks/init/instructions_agents.rs:27\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":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"01597a03b5e091f824116fe0504172fe200b725cbc2413bd2e765eb30c56bf5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/src/extract.rs:150-158 | proxy/src/extract.rs:169-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/src/extract.rs:150\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":"proxy/src/extract.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad72969898a446612df9304d8291e1c83c3ef1e458952db2a7aa283b3f467e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmds/php/phpstan_cmd.rs:225-234 | src/cmds/ruby/rubocop_cmd.rs:233-242 \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":"src/cmds/php/phpstan_cmd.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f80ce688a582f4a795b156081652f3988e3d3fe2e2e6f6c4e6fd731fd59afd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/analytics/cc_economics.rs:600-608 | src/analytics/cc_economics.rs:631-639 \u2014 both copies are in the same file, so extract the block 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 \u0060src/analytics/cc_economics.rs:600\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":"src/analytics/cc_economics.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a024cc3dfe3f1c1aaf330b3397c2985b602dc27aa8680f30946a92452fe8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/core/tracking.rs:1883-1891 | src/core/tracking.rs:1939-1947 \u2014 both copies are in the same file, so extract the block 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 \u0060src/core/tracking.rs:1883\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":"src/core/tracking.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a1c5ec28210a00bcd312f29bd2134528546490ce285ea5bbc6ade1fa1b4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmds/system/summary.rs:131-139 | src/cmds/system/summary.rs:181-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cmds/system/summary.rs:131\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":"src/cmds/system/summary.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"93054a69112239d020e58183aae020070ef409163c48ae363070a045f101e3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/discover/registry.rs:1402-1409 | src/discover/registry.rs:1426-1433 \u2014 both copies are in the same file, so extract the block 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 \u0060src/discover/registry.rs:1402\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":"src/discover/registry.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd5ffb9225f07d7fd1d26d47906edb43d78b78ae6c7bb3124a769aa207393b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/dotnet/dotnet_cmd.rs:114-119 | src/cmds/go/go_cmd.rs:172-179 \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 \u0060src/cmds/go/go_cmd.rs:172\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":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b2c7e04ab7bbb7284942ed3e5deac90dad08ba35af34c95cdbc560803977a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/go/golangci_cmd.rs:390-397 | src/cmds/js/lint_cmd.rs:299-306 \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 \u0060src/cmds/go/golangci_cmd.rs:390\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":"src/cmds/go/golangci_cmd.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"da23e7f26922cc4ae4b9ef02defec166e63474797155f4d2e7d365d3165746c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/system/env_cmd.rs:83-89 | src/cmds/system/env_cmd.rs: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 \u0060src/cmds/system/env_cmd.rs: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":"src/cmds/system/env_cmd.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8057f3780802119510df79c535a011675ab29a79c2ab9e6f5546eab95cf4c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/git/gh_cmd.rs:541-547 | src/cmds/git/gh_cmd.rs:924-930 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/gh_cmd.rs:541\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, \u0060src/cmds/git/gh_cmd.rs:933\u0060 calls \u0060unwrap_or_default\u0060 and \u0060src/cmds/git/gh_cmd.rs:550\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":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b8f056519b1d39c32fd7128033304c5b0a48f9eb3b9272a320fa4a3911538c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/cloud/aws_cmd.rs:1288-1294 | src/cmds/cloud/aws_cmd.rs:1332-1338 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/cloud/aws_cmd.rs:1288\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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c293964268636857001438bd619b33b198d86720126559be9d6d484654b6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/cmds/cloud/aws_cmd.rs:828-834 | src/cmds/cloud/aws_cmd.rs:948-954 | src/cmds/cloud/aws_cmd.rs:987-993 | src/cmds/cloud/aws_cmd.rs:1138-1144 | src/cmds/cloud/aws_cmd.rs:1241-1247 \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 \u0060src/cmds/cloud/aws_cmd.rs:828\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cmds/cloud/aws_cmd.rs:1146\u0060 calls \u0060shorten_arn\u0060 and \u0060src/cmds/cloud/aws_cmd.rs:1249\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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6fdb5a9d1ec5ac583cf65df822577b0c01d5f38143529d69c9c79803a03d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/git/glab_cmd.rs:548-554 | src/cmds/git/glab_cmd.rs:754-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, 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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d683d5089e4c96daf188896dac46386b021665ead97133eafb0609d098725cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/cloud/container.rs:104-110 | src/cmds/cloud/container.rs:200-206 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/cloud/container.rs:104\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":"src/cmds/cloud/container.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc264c18cdff31d2a227fc72ff786fb5d113a12b5197d1c4e6a2da63b3ecce54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/git_cmd.rs:3707-3712 | src/cmds/git/git_cmd.rs:3713-3718 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/git_cmd.rs:3707\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":"src/cmds/git/git_cmd.rs"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897e1ef8999dab3044b7ad0ce0ae60bdbe2484280e9a4183ed49582669b7e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/cmds/cloud/aws_cmd.rs:559-564 | src/cmds/cloud/aws_cmd.rs:579-584 | src/cmds/cloud/aws_cmd.rs:606-611 | src/cmds/cloud/aws_cmd.rs:635-640 | src/cmds/cloud/aws_cmd.rs:660-665 \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 \u0060src/cmds/cloud/aws_cmd.rs:559\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":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e869ecf24b9fa254490784a529b6fcf92dcaa1304a27af8701cf39d6307cb73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/system/log_cmd.rs:131-136 | src/cmds/system/log_cmd.rs:174-178 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/system/log_cmd.rs:131\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":"src/cmds/system/log_cmd.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbefce258b00024b9d4eda09785ce5eda41a6c5fd5662d74431462a750d1a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cmds/js/tsc_cmd.rs:234-239 | src/cmds/js/tsc_cmd.rs:330-335 | src/cmds/python/mypy_cmd.rs:185-190 \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 \u0060src/cmds/js/tsc_cmd.rs:234\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":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac9342d596a789f2422fa4ba7ea3ac9f986cd192af82540233074d5a8d71ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/system/ctest_cmd.rs:575-580 | src/cmds/system/ctest_cmd.rs:786-791 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/system/ctest_cmd.rs: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":"src/cmds/system/ctest_cmd.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4afe2e8835c602d2ddc5873fdfec8d6b82fc7faa6dc120f62c07f021c6d283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/diff_cmd.rs:2434-2438 | src/cmds/git/diff_cmd.rs:2444-2448 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cmds/git/diff_cmd.rs:2434\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":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1889763f1df79ea60926c3f07fb4ede8efa74ae492b8de563e40a560885f2e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/lib.rs:3481-3485 | src/lib.rs:3487-3491 | src/lib.rs:3494-3498 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/lib.rs:3492\u0060 calls \u0060run_compile\u0060 and \u0060src/lib.rs:3486\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":"src/lib.rs"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b18d013d9377daa19d46cb41b73bb4540d09e617b96dc0d93e2a2add22bdc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): proxy/src/pipeline/cache_align.rs:45-49 | proxy/src/pipeline/cache_align.rs:50-54 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/pipeline/cache_align.rs:45\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":"proxy/src/pipeline/cache_align.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3844a0386db7b5702f5bdd421eaff987f5db888190ac2e4bd89bf59c94799a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): proxy/src/pipeline/ccr/mod.rs:96-100 | proxy/src/pipeline/ccr/mod.rs:143-147 \u2014 both copies are in the same file, so extract the block 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 \u0060proxy/src/pipeline/ccr/mod.rs: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":"proxy/src/pipeline/ccr/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbcbee9a78acd9eb67c08c105c0a9aeececaed72bb6f91e6526f2e8cd0148cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): proxy/src/pipeline/ccr/mod.rs:96-100 | proxy/src/pipeline/ccr/mod.rs:118-122 | proxy/src/pipeline/ccr/mod.rs:143-147 \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 \u0060proxy/src/pipeline/ccr/mod.rs: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":"proxy/src/pipeline/ccr/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9939bbb07d561acc2519f1712b9cae59cf5e64ceaf46c1ff5f62a26d3b8dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/core/telemetry.rs:504-508 | src/core/telemetry.rs:514-518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/core/telemetry.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff13a2c481db14a41a2046e3c32c64eab51f2eff8bcc733fe6d61a8456afc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/gh_cmd.rs:458-463 | src/cmds/git/gh_cmd.rs:818-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bcae2f10c60cc9540363c797057d98340b6f37e8089656f332794b073bcb7c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/analytics/cc_economics.rs: 36.6% line coverage (201/549)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d92cbfb7d362e7e931201758ff21fba45f5b5f921863277a4aa8e758e07a2e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/analytics/gain.rs: 4.6% line coverage (63/1378)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c0c8c856dc2f6c0a1443987354c3463dde3c6beabeba7b5999624750adcd20"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/analytics/gain_tui.rs: 0.0% line coverage (0/409)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain_tui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fad66f1ce393a122558d2eb5411e9f49f820048f7987814254b7faf66ad5dd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/analytics/session_cmd.rs: 21.1% line coverage (26/123)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/session_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba70e74bb58658c50883a64d9bd0908c759903dfb3195129eaa4ede27384ea1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/cloud/container.rs: 20.8% line coverage (138/662)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beedee6a9b544bc9542ae8f397a30d0c8e4b68a4c99ecc0f315890142ee6e36e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/cloud/curl_cmd.rs: 38.4% line coverage (28/73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/curl_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b160b686a3a63eab17258398cb375badc6ce59c5823adae251c39d43e56c58f9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/cloud/wget_cmd.rs: 34.6% line coverage (71/205)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/wget_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"218992cd011fb1e4a905814bee22b31e0f48dc98c48529db26577358b7038945"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/git/gh_cmd.rs: 39.5% line coverage (349/883)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd084b26eab0778eeb20351d151cac146758ceb68b88bdea810d23aa3e34be88"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/js/deno_cmd.rs: 24.2% line coverage (16/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/deno_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1291bb0a54d7d040dde9220e508a05e78468943ab86669d89339a1fde0385e4e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/js/lint_cmd.rs: 47.5% line coverage (154/324)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f03c07d171f49a0c3206a001bee950b0c459fdb861f8e57ee900252ad20d89"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/js/npm_cmd.rs: 31.9% line coverage (22/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/npm_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331bc57daf1a22342a1cd08734d8a2d676840ab17d0402cf1192fa8563639c1d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/js/pnpm_cmd.rs: 44.9% line coverage (159/354)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/pnpm_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0bcedc361e10a4f773a91a277cc71c9f5360bdf1de7127a01c61b75a09d227"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/js/prisma_cmd.rs: 45.1% line coverage (143/317)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/prisma_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ea94a82ed7128de186348be79642885bd7876858dc2c47a1b65d632fcc247e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/php/ecs_cmd.rs: 43.9% line coverage (18/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/ecs_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5b6a099bbb3440114e573817aea076767696f5bb038b3e371bee35bb6f6079"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/php/paratest_cmd.rs: 21.7% line coverage (5/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/paratest_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"025a0009162f66ddbdf2158f3c6b3af0b772f552a6a162d8c1093b5ee1c7655a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/php/pest_cmd.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/pest_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4d444d4fbc3eb4ce5d7dcdb5b9a1741006f8f94ba33c0d343fffee086a4e4c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/php/php_cmd.rs: 26.9% line coverage (18/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/php_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"616567dc4689bf8d85684635153690727f8ae818b1cfbb0b37d6ba9bcf91f0bf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/php/utils.rs: 19.4% line coverage (6/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cfb0d8b658548c8691b5f87812a561211ccbc2c40ca92dd85d258c3373e2c2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/python/pip_cmd.rs: 36.6% line coverage (52/142)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pip_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7b23fbcb4618320d9664cbcf029969417846595da5e6dad7ea0986f3eb49cf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/rust/runner.rs: 0.0% line coverage (0/27)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602d601759ce0d96272a827d80b59f46956def8b61ef2f6ff583be66730eaed"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/system/deps.rs: 9.5% line coverage (23/241)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98ca09ba6540a6c6910f6e74a666a8876d8d73abf369b4089234d70482c9836"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/system/env_cmd.rs: 32.1% line coverage (45/140)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/env_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca1dc78c50ac9e8b3d1e0575588ce74a3f999bb7dc1b1521c5b2848c0c3c360"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/system/summary.rs: 0.0% line coverage (0/230)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/summary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e78022100e2cfe8f73ca769e0aee9d9e956cf3cf283b8f73dfd8a10c02ce59"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cmds/system/tree.rs: 36.5% line coverage (19/52)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe6bbb38b63999a3f372efef05b838a908fc334471340c1e465c019257bcec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/core/pipeline_cmd.rs: 12.2% line coverage (203/1668)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f7f52b40b1c87a57df6438614f60cb60daef19cbb18bb1e6a1cc9f9b767f4b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/core/pipeline_log.rs: 32.6% line coverage (31/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df812270dd7fc5927877f13fe563eec0356bcfbce82862b4b65f278d89cd650"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/core/pipeline_remote.rs: 28.9% line coverage (213/736)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9b1bd64fc9286ec7c43e21fa10af1392d5b5ad5be70c5692db034034edc395"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/core/plugins_cmd.rs: 0.0% line coverage (0/176)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugins_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf10e79ce2011be699aaf34cd7c7deef6046d3e6e4db0d75990acb16905fb09"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/core/task_cmd.rs: 37.9% line coverage (227/599)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a401d6542fba8d1416bae45cf829ab3ae8255a35d42c65ddf2999c98e20a88"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/core/telemetry_cmd.rs: 23.1% line coverage (37/160)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/telemetry_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6f9be576fce673d0aaea26f283af429ce3a3a3ab8518724b42db680516ab4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/discover/mod.rs: 28.8% line coverage (96/333)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e049a84bc31e46850d167251e988e7f6644357f6d39c04ac07bddf7c16a874"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/hook_audit_cmd.rs: 26.9% line coverage (32/119)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_audit_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4423dc260cf5715dc28938fa9b42417188962c8314c85cea70e9d982c112553"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/hook_cmd/claude_pipeline.rs: 32.0% line coverage (77/241)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd/claude_pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5db702d1ff9cb9764cc3617f3c7a538ef9291103726ace7f7830e54b415d98"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/init/cursor.rs: 48.9% line coverage (87/178)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ceeedd4c0e1dd900a818464e6c6db573e11f6ddfb0be5822c4ccdf2ebe28d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/init/instructions_agents.rs: 40.6% line coverage (54/133)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f3c9bc8b5708091236b3feb82f7fea21aea07a2d2482c6f1b139e2659a9555"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/init/mod.rs: 48.0% line coverage (694/1447)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6685e8d7d59eaf3b5d414ffe51c2aabb7bc0da447f1ef7ca5bda1cdef37dc164"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/integrity.rs: 46.0% line coverage (98/213)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/integrity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"304445961e06bc356ab74387c5aa740521791ea7fc28474cfbff63b6d6b75867"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/trust.rs: 32.9% line coverage (102/310)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/trust.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f1629085826ac0ae17941efecaf9205a476e3da5d73c608dac5d77ba7f1577"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hooks/verify_cmd.rs: 0.0% line coverage (0/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/verify_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a4a5851c9fbbda23700a60069f78de2d6f563edf92c152bf387d6612b2263"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/learn/mod.rs: 0.0% line coverage (0/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/learn/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d6af8100c99b2538003625305fe71592b63feac03bc6a40d7e8198d2ec0ac1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/lib.rs: 14.3% line coverage (212/1485)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce9f8274cc4d800626ff6e948d4bb46616bf1ffe78b5881f7d9d912723fed6f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/llm_proxy.rs: 43.5% line coverage (202/464)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/llm_proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39678cf90b6f6894bc4de5826131daa8fca6bace1a4249e83fd72c0b514fabb5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/parser/formatter.rs: 29.8% line coverage (34/114)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/formatter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccf2c231f15138590a821b5d5b5b97e6a39adea09f96bdba43375e40a8068c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/git/diff_cmd.rs: src/cmds/git/diff_cmd.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in rtk::cmds::git::diff_cmd::condense_unified_diff_strict at line 2127. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/git/diff_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e034f0ecf6d203731da910b17efb63ab7916cc91aa5f890b5a8e8124912d318"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lib.rs: src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 305 in rtk::run_cli at line 2536. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c530fbeeba83c04da61dff30496df913b8ad97db9ae2ce4ec912d047bc7cc0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/registry.rs: src/discover/registry.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in rtk::discover::registry::rewrite_segment_inner at line 1871. 49 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/discover/registry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace5e3449fb9db77b60eff1c89faf1ed5d9e1049d30a04a3178a77c47b44088b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/git/git_cmd.rs: src/cmds/git/git_cmd.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in rtk::cmds::git::git_cmd::run_log at line 2396. 12 of those changes were fix/bug commits, and the other 75 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/git/git_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d2d8902db7bee2723c7ea18b5b4c007871c7f09bee38b1365a9ba04cedabf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/runner.rs: src/core/runner.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in rtk::core::runner::extract_test_summary at line 1208. 22 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b65e268ea018f83483d498112276d480ed07c9ebdf72f60b2b570ec4c00e3ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/search.rs: src/cmds/system/search.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in rtk::cmds::system::search::run at line 680. 22 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/search.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb29ccf377b792979bfba7fa1158e85a68548ca17f357057abae489133d52f22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/analytics/gain.rs: src/analytics/gain.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in rtk::analytics::gain::run at line 601. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/analytics/gain.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ded1973646712e5bf671c6c38794ec3caac2507fe95c384e8d2eba092007d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/lexer.rs: src/discover/lexer.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in rtk::discover::lexer::tokenize_inner at line 175. 12 of those changes were fix/bug commits, and the other 12 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/discover/lexer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd31c80d3feb7f1b69fe369d89f66de2398b58c582a4e878ae6df9c9beafd1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/dotnet/dotnet_cmd.rs: src/cmds/dotnet/dotnet_cmd.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog at line 125. 28 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/dotnet/dotnet_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb05f4c07edb8bdd272affb7adb0556d0ed36f9707acdd7ba3ac8c4d2c0ca303"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/pytest_cmd.rs: src/cmds/python/pytest_cmd.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rtk::cmds::python::pytest_cmd::build_pytest_summary at line 227. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/python/pytest_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"157d7964a62d4873d32d44114f9476c23454b2ca2c95ed9c33f1bf474d7ade42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/stream.rs: src/core/stream.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in rtk::core::stream::run_streaming at line 425. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stream.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ec344926156d111c7e9647437339d3976116d84db2f689a4b4eb521e04ac76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/init/mod.rs: src/hooks/init/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rtk::hooks::init::uninstall_with_patch_mode at line 1438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/init/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa945ecb48fad8e465bf2d0925da1fa690ba14a2e5657c758c2fe5d303fc7137"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/arg_tokenizer.rs: src/core/arg_tokenizer.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rtk::core::arg_tokenizer::tokenize_scan at line 472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/arg_tokenizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"657037bbf33dc773553ee6d0d48359b5b9a3c031807db4bb9f1cb2d03feae2b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/go/go_cmd.rs: src/cmds/go/go_cmd.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in rtk::cmds::go::go_cmd::filter_go_test_json at line 458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/go/go_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/go_cmd.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ba65f5f34c28ed3611568255de252eba67912944aafeb24b1ff762f43d5f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/mod.rs: src/discover/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rtk::discover::run at line 330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/discover/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcee8913d153e875d54654e78018b4afe1a21bdde753c9f95d85449144d4f01a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/rust/cargo_cmd.rs: src/cmds/rust/cargo_cmd.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rtk::cmds::rust::cargo_cmd::filter_cargo_nextest at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/rust/cargo_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0338775ea6157c4653b68295c5446dfe799ce509d87b6f9cd15eb192e65f94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/jvm/mvn_cmd.rs: src/cmds/jvm/mvn_cmd.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SurefireBlock::step at line 682. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/jvm/mvn_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0da333de50a871bf4c7cdd3b7a6a0ad8fad49967f97813b4b66bcfd4eb64d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/permissions.rs: src/hooks/permissions.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rtk::hooks::permissions::check_command_with_rules_and_prefixes at line 250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/permissions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"11176d4573d36f288857bd56cbeb20691a46949cfc8e4236b4342ca421841361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/retriever.rs: src/core/retriever.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rtk::core::retriever::run_recall at line 658. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/retriever.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retriever.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca62e070100e5b3576870df8d36ecbf977a2cc3cecdac2757a837be11b411390"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/ruff_cmd.rs: src/cmds/python/ruff_cmd.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rtk::cmds::python::ruff_cmd::filter_ruff_check_json at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/python/ruff_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc222f6ff8822ec1ea518fdf550e108a929bc6bc47dee6363fb6b236ac4c16f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/js/lint_cmd.rs: src/cmds/js/lint_cmd.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rtk::cmds::js::lint_cmd::run at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/js/lint_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"998e0b2cb74c3d7026c2be122df1948408b76e7c6f962f535478c56da6596c58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/sqlfluff_cmd.rs: src/cmds/python/sqlfluff_cmd.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rtk::cmds::python::sqlfluff_cmd::render_lint_json at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/python/sqlfluff_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/sqlfluff_cmd.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4484420e36bd07f30edb3d9f7925c7be16ba4c5616b5c5a64bff3aca0942f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/ls.rs: src/cmds/system/ls.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rtk::cmds::system::ls::compact_ls at line 540. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/ls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ls.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4020c69e884d76e790d3482f9b060369ba45e77b473359b96caaace11b808e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/scala/sbt_cmd.rs: src/cmds/scala/sbt_cmd.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in rtk::cmds::scala::sbt_cmd::filter_sbt_test at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/scala/sbt_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/scala/sbt_cmd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2576e7f7d3489645d36707f3018cbf058494deb478ed79362851d32fbd7dd1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/js/tsc_cmd.rs: src/cmds/js/tsc_cmd.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rtk::cmds::js::tsc_cmd::filter_tsc_output 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/js/tsc_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b4c62b85b65014690034eae82d1580c6480eef4f52f1141a8d6b21f279639"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/init/claude.rs: src/hooks/init/claude.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rtk::hooks::init::claude::run_default_mode at line 639. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/init/claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bfe4e96fd03a503480a992dbb12c259a7429e19653e96b3003e6e4d89dd73a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/php/phpt_cmd.rs: src/cmds/php/phpt_cmd.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in rtk::cmds::php::phpt_cmd::parse at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/php/phpt_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/phpt_cmd.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"933edbb28d9909d8e91269371c68850e19398adb9f5bcdeaf69302e5a0303530"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/json_cmd.rs: src/cmds/system/json_cmd.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rtk::cmds::system::json_cmd::extract_schema at line 220. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/json_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/json_cmd.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"320eae14de62d03a6666ad3778b44e4420eae6b1e2e63ea7966769668fb91765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/dotnet/dotnet_trx.rs: src/cmds/dotnet/dotnet_trx.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rtk::cmds::dotnet::dotnet_trx::parse_trx_content at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/dotnet/dotnet_trx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ac8261f8e0fe096e91764e20226e5f269fe4b2a29096496d2945c6cb5e4ce1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/init/antigravity.rs: src/hooks/init/antigravity.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rtk::hooks::init::antigravity::migrate_legacy_rules_at at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/init/antigravity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/antigravity.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb257c52e0a195c1f20e2e8cf08e88952250d6a328cd997e7a53fc71d5958c39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/report.rs: src/discover/report.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rtk::discover::report::format_text 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/discover/report.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/report.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b718bb440f6086598a47106aae459d934227866d1e32dd3fe650a599db38ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/cloud/container.rs: src/cmds/cloud/container.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rtk::cmds::cloud::container::format_kubectl_pods at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/cloud/container.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"364d3ac66aa6cc4dfff286eab23edd70c95c6aa2c7409d225b6b369781fc519c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/provider.rs: src/discover/provider.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ClaudeProvider::extract_commands at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/discover/provider.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/provider.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a77700f7aa4ec1ffc630020ad8fd26b1e1ca2296aa05d8598bcd3af1188cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main.rs: src/main.rs changed 73 times in last 90 days and 39 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 rtk::main at line 6), 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(hook): defer when a prefixed shell wrapper\u0027s script hits a deny rule\u201D; \u201Cfix(core): keep the usage guard off RTK\u0027s own probes and argv\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(init/opencode): drop the legacy plugin, floor at 1.18.29\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1315f334a694b17696c6816055ebfc749cec4e4f7ae0392e067e3e567d591bd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/hook_cmd.rs: src/hooks/hook_cmd.rs changed 49 times in last 90 days and 29 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is rtk::hooks::hook_cmd::heal_legacy_hook_file at line 188), 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(hook): preserve fish-wrap decisions and reuse permission scans\u201D; \u201Cfix(hooks): ask for a wrap only when RTK built it, and attest only where one can be\u201D; \u201Cfix(hooks): make the fish wrap opt-in, and ask for it explicitly\u201D; \u201Cfix(hooks): keep the fish wrap off wherever a deny rule could match\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/hook_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"355a44376edad18bfaa94de232a34f1515a849868ab8616cfef708cc05224673"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/tracking.rs: src/core/tracking.rs changed 42 times in last 90 days and 26 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 rtk::core::tracking::categorize_command at line 1961), 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(tracking): guard configured retention cutoffs and pin config loading\u201D; \u201Cfix(tracking): match historical passthrough suffix exactly\u201D; \u201Cfix(gain): classify legacy passthrough timings\u201D; \u201Cfix(gain): distinguish filtered timings from passthrough lifetimes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/tracking.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8c0af32a2bd9c704cd7215d831f1544aaa4c63d82c6630919de2dcbd0fca2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/find_cmd.rs: src/cmds/system/find_cmd.rs changed 28 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::cmds::system::find_cmd::dispatch 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(core): emit one trailing newline, not one on top of the output\u0027s own\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D; \u201Crefactor(cli): narrow the help-flag fix to code, and read -h per tool\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/find_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/find_cmd.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f3c6445ca16061d3ffd6dd5593e9461280882d023d2b9415595eb82a23878c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/go/golangci_cmd.rs: src/cmds/go/golangci_cmd.rs changed 29 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::cmds::go::golangci_cmd::filter_golangci_json at line 343), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): keep the usage guard off RTK\u0027s own probes and argv\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(core): read a usage request through the tokenizer, and catch it in capture too\u201D; \u201Crefactor(cli): narrow the help-flag fix to code, and read -h per tool\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/go/golangci_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/golangci_cmd.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05f3c928a2cbcf8eeb6b5e690ce8fedd1cf65545e83fa14f1b8a8b5caad3029"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/utils.rs: src/core/utils.rs changed 22 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is rtk::core::utils::tool_exec at line 438), 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(core): encode sha2 digests as hex\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D; \u201Cfix(core): quote child arguments so MSYS children receive them intact\u201D; \u201Cfix(recall): byte-faithful --grep, cached store connection, serialized env tests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/utils.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"067c46387bce0bd186bf017aaa6034c0776121cc04e03af4c69117aeb4467bb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/decision.rs: src/hooks/decision.rs changed 21 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is AgentPath::lookup at line 488), 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(hook): preserve fish-wrap decisions and reuse permission scans\u201D; \u201Cfix(hooks): ask for a wrap only when RTK built it, and attest only where one can be\u201D; \u201Cfix(hooks): make the fish wrap opt-in, and ask for it explicitly\u201D; \u201Cfix(hooks): keep the fish wrap off wherever a deny rule could match\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/decision.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/decision.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd2db92eb45db8a44d2e4ca1d2f9bd400a394d19b1e55d0fa360ff71705e9c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/read.rs: src/cmds/system/read.rs changed 19 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is rtk::cmds::system::read::run at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(read): route stdin through the same raw-byte gate\u201D; \u201Cfix(read): fall back to raw bytes when a plain read is not valid UTF-8\u201D; \u201Cfix(read): book the span that was shown, and test the booked row\u201D; \u201Cfix(read): separate line numbers with a tab\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/read.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/read.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2487247f7029077818fc551db2f8ad757b3a76eeec27c714ab909a798218ca48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/js/bun_cmd.rs: src/cmds/js/bun_cmd.rs changed 19 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::cmds::js::bun_cmd::filter_bun_pkg 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(core): keep the usage guard off RTK\u0027s own probes and argv\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D; \u201Cfix(js): correct bun and deno runtime behavior\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/js/bun_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/bun_cmd.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a6bb95edb3ccde1fad0bb8991de03c257eb1bc5c180e38439f0c789aa0a8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: hooks/opencode/rtk.ts: hooks/opencode/rtk.ts changed 18 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk.resolveRtkPath 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(hooks): pipeline hook rules act on Claude Code only; the shared hook core is develop\u0027s again\u201D; \u201Cfix(hooks/opencode): judge only the rules OpenCode applies, and keep init honest\u201D; \u201Cfix(hooks/opencode): say which RTK_DISABLED is which\u201D; \u201Cfix(init/opencode): drop the legacy plugin, floor at 1.18.29\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- hooks/opencode/rtk.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":"hooks/opencode/rtk.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aa23505ce5f7ca26fa510a47b5158bc4bddee1562761969a0972e8670c64c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/hook_cmd/claude_pipeline.rs: src/hooks/hook_cmd/claude_pipeline.rs changed 17 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is rtk::hooks::hook_cmd::claude_pipeline::shell_gate at line 133), 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(hooks): honour exclude_commands for a swapped program called by path\u201D; \u201Cfix(pipeline): let an allow rule on rtk cover a swapped command\u201D; \u201Cfix(pipeline): keep a line that runs rtk anywhere out of the swap\u201D; \u201Cfix(pipeline): keep an excluded command out of the swap behind a wrapper\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/hook_cmd/claude_pipeline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd/claude_pipeline.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b613282599006d7d59691375894bfe77ea49594e413af99817dc4f20d4c18dc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/config.rs: src/core/config.rs changed 18 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Config::migrate_legacy_tee at line 375), 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(hooks): make the fish wrap opt-in, and ask for it explicitly\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D; \u201Cfix(init): scope guidance to external commands\u201D; \u201Cfix: scope suppress_hook_warning to missing hooks and parse the env override\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/config.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa932373c4bc0c99160613a41dfb01073856120889a0aba4e01a40d87279d63a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/git/gh_cmd.rs: src/cmds/git/gh_cmd.rs changed 16 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::cmds::git::gh_cmd::format_pr_view at line 457), 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(gh): keep a lone escaped flag behind the boundary too\u201D; \u201Cfix(gh): keep an escaped flag behind the boundary\u201D; \u201Cfix(gh): drop rtk\u0027s own \u0060--\u0060, keep the user\u0027s\u201D; \u201Cfix(gh): restore \u0060--\u0060 over the whole subcommand region\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/git/gh_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a2b730162cd4726a7a063ab9d3c5fca7ca5cfa9825bcfe1dd3a516ebc66b14"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/tee.rs: src/core/tee.rs changed 16 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 7 (its worst body is rtk::core::tee::tee_and_hint_with at line 31), 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(tests): keep the test suite and the developer\u0027s environment apart\u201D; \u201Cfix(recall): keep tee mode free of any sqlite artifact\u201D; \u201Cfix(git): harden blob-show decode, metrics, recovery, and stderr (review non-blockers)\u201D; \u201Cfix(recall): keep legacy tee always semantics, sqlite stays failure driven\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/tee.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tee.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bb87d79d6ccefce6ef5943d35dd2d4d8c483b728946515b794595483f35914"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/telemetry.rs: src/core/telemetry.rs changed 14 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::core::telemetry::maybe_ping at line 34), 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(core): send the classifier key and reach local hosts directly on ureq 3\u201D; \u201Cfix(core): encode sha2 digests as hex\u201D; \u201Cfix(deps): migrate ureq 3 API usage\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/telemetry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/telemetry.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"113aeabdfc160f2a73355f8da8caca6c1fa55e8e0b12a877b9fc1c737aced7c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/js/deno_cmd.rs: src/cmds/js/deno_cmd.rs changed 13 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is rtk::cmds::js::deno_cmd::run_filtered_subcmd at line 24), 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(core): keep the usage guard off RTK\u0027s own probes and argv\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D; \u201Cfix(js): correct bun and deno runtime behavior\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/js/deno_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/deno_cmd.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead664f46221ccee9d4b93208ed9bf3d51f70b49ce3b3bd17e340aee47e9a128"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/ctest_cmd.rs: src/cmds/system/ctest_cmd.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is rtk::cmds::system::ctest_cmd::dashboard_action_changes_output at line 133), 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(tracking): store commands so they read back as the same words\u201D; \u201Cfix(recall): adapt upstream ctest/ls/tsc integration after rebase\u201D; \u201Cfix(ctest): validate the summary, keep reasons and trailers intact, size the caps\u201D; \u201Cfix(ctest): take the run total from the first result line and keep unparsed failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/ctest_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ctest_cmd.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbcb63c62d8e60d1256afee9a35285c43d3bf2cb8170cdde1fc4c3e36d7456b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/hook_check.rs: src/hooks/hook_check.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is rtk::hooks::hook_check::check_and_warn at line 70), 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(hooks): preserve Claude status semantics and refine agent hook probes\u201D; \u201Cfix(hooks): pipeline hook rules act on Claude Code only; the shared hook core is develop\u0027s again\u201D; \u201Cfix(hooks): recognize configured agent hooks in warning check (#913)\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/hook_check.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_check.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71aa687a511a686de9ceaec3d1b61d264f09562107872093d30b8c4b5fe2d33"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/rust/runner.rs: src/cmds/rust/runner.rs 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 4 (its worst body is rtk::cmds::rust::runner::run_err at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): keep the usage guard off RTK\u0027s own probes and argv\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(cli): answer for a program that cannot run, not just an unresolvable name\u201D; \u201Cfix(cli)!: preserve argv boundaries in generic runners\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/rust/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/runner.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a55cb5ccef8198c0cdb07fa3c5a85651c6eec19dc91841efb37e685689abac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/init/codex.rs: src/hooks/init/codex.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is rtk::hooks::init::codex::uninstall_codex_with_paths at line 832), 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(core): encode sha2 digests as hex\u201D; \u201Cfix(init): return exit code 2 when codex uninstall guard refuses hook (fixes #4164)\u201D; \u201Cfix(hooks): preserve Claude status semantics and refine agent hook probes\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/init/codex.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/codex.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"60776ab566f932d5cc1633d11b5abf56c2df55e9e08c91afac986ea14c810a58"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/mod.rs: src/hooks/mod.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is rtk::hooks::is_rtk_hook_command 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(hooks): pipeline hook rules act on Claude Code only; the shared hook core is develop\u0027s again\u201D; \u201Cfix(hooks): judge OpenCode against its own permission rules\u201D; \u201Cfix(hooks): address Trae portability and partial install diagnostics\u201D; \u201Cfix(codex): adapt upstream changes and explain sandbox tracking access\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea2a3a377eecee91b09a5e2a51944267e9d3611a27cdde562d20d972859c800"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/php/pint_cmd.rs: src/cmds/php/pint_cmd.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::cmds::php::pint_cmd::run at line 38), 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(tracking): store commands so they read back as the same words\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D; \u201Cfix(ruff): bypass never_worse only for the format rtk injected\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/php/pint_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/php/pint_cmd.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf872241021d08b8571997c658157404b7ecac1dba7ed2c7f5fa87759efd09e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/telemetry_cmd.rs: src/core/telemetry_cmd.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::core::telemetry_cmd::run_forget at line 199), 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(core): send the classifier key and reach local hosts directly on ureq 3\u201D; \u201Cfix(deps): migrate ureq 3 API usage\u201D; \u201Cfix(tests): keep the test suite and the developer\u0027s environment apart\u201D; \u201Cfix(telemetry): treat an empty RTK_TELEMETRY_URL as no endpoint\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/telemetry_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/telemetry_cmd.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"094a60a5c13950913d1ce5bc55a225050adeb4fd49e17362b47b54a111b25033"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/init/opencode.rs: src/hooks/init/opencode.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is rtk::hooks::init::opencode::ensure_opencode_plugin_installed_for at line 119), 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(init): install the OpenCode plugin independently of agent setup\u201D; \u201Cfix(hooks/opencode): judge only the rules OpenCode applies, and keep init honest\u201D; \u201Cfix(init/opencode): drop the floor helper the refactor orphaned\u201D; \u201Cfix(init/opencode): leave the plugin alone on an OpenCode that cannot load it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/init/opencode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/opencode.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"925611155d74b83cbd7c7459bb9de06d3177358ce505a757d5791e0fe98175ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/llm_proxy.rs: src/llm_proxy.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is rtk::llm_proxy::run 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(core): send the classifier key and reach local hosts directly on ureq 3\u201D; \u201Cfix(deps): migrate ureq 3 API usage\u201D; \u201Cfix(init): require the rtk-proxy binary for the on-ramp, gate binary_available, name the removed base URL\u201D; \u201Cfix(init): only offer the proxy when rtk-proxy can run, and remove its base URL on uninstall\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/llm_proxy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/llm_proxy.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d054746fa9ae6a015490168909ae6d72d35c5b054b7ddbdde0d2517afbe1c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/discover/fish_script.rs: src/discover/fish_script.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::discover::fish_script::strip_comments at line 177), 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(hook): preserve fish-wrap decisions and reuse permission scans\u201D; \u201Cfix(hooks): make the fish wrap opt-in, and ask for it explicitly\u201D; \u201Cfix(hooks): keep the fish wrap off wherever a deny rule could match\u201D; \u201Cfix(hooks): refuse where the shells disagree about a comment\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/discover/fish_script.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/fish_script.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5f691316c0a09442b8a5ab28214f9b575f63fa6057c88543a185fb623a6e7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/task_cmd.rs: src/core/task_cmd.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::core::task_cmd::run_task at line 203), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): send the classifier key and reach local hosts directly on ureq 3\u201D; \u201Cfix(deps): migrate ureq 3 API usage\u201D; \u201Cfix(pipeline): run the command when a swap\u0027s task cannot wrap it\u201D; \u201Cfix(task): honor custom claude config directory in transcript resolution\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/task_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0384966d39f3c3d21320780d45aa3ab2ce2c9699eb7975cc3c0614c7eb6e67a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: hooks/hermes/rtk-rewrite/__init__.py: hooks/hermes/rtk-rewrite/__init__.py changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is rtk-rewrite._pre_tool_call at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hermes): preserve earlier hook command directives\u201D; \u201Cfix(hermes): preserve legacy rewrites and other plugin directives\u201D; \u201Cfix(hooks): pipeline hook rules act on Claude Code only; the shared hook core is develop\u0027s again\u201D; \u201Cfix(hermes): isolate rewrite stdin and make timeout configurable\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- hooks/hermes/rtk-rewrite/__init__.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hooks/hermes/rtk-rewrite/__init__.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"372fb20f9f1dd53619446815bd0a688119223f20de7dcac7c5e6ac1b22183025"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/ast_grep_cmd.rs: src/cmds/system/ast_grep_cmd.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is rtk::cmds::system::ast_grep_cmd::filter_ast_grep at line 188), 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(ast-grep): route subcommands by the grammar ast-grep actually has\u201D; \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(ast-grep): account for every match line and stop capturing other subcommands\u201D; \u201Cfix(ast-grep): account for every dropped line and stop wrecking scan output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/ast_grep_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ast_grep_cmd.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78c3710e19b26b012825559f360d2fe1421a7fa11123844488aaed427cd7659"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/permissions_opencode.rs: src/hooks/permissions_opencode.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is rtk::hooks::permissions_opencode::glob_match 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(hooks/opencode): judge only the rules OpenCode applies, and keep init honest\u201D; \u201Cfix(hooks/opencode): read OpenCode\u0027s rules the way OpenCode resolves them\u201D; \u201Cfix(hooks/opencode): read OpenCode 2.x\u0027s native permission rules\u201D; \u201Cfix(hooks): skip the OpenCode rewrite when it would change the verdict\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/permissions_opencode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions_opencode.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"df16728928af706d1c5fa0c8c97c9d41f038bea257eade47000afbd6c78da80d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/js/npm_cmd.rs: src/cmds/js/npm_cmd.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is rtk::cmds::js::npm_cmd::filter_npm_output at line 178), 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(tracking): store commands so they read back as the same words\u201D; \u201Cfix(tracking): keep the user\u0027s arguments out of the telemetry command label\u201D; \u201Cfix(js): correct bun and deno runtime behavior\u201D; \u201Cfix(js): correct bun and deno filtering, routing, and accounting\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/js/npm_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/npm_cmd.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f037314f9be29e9f23cd6f6717fd929dbf4559869f0f0c1891f86a32f8a104b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/tree.rs: src/cmds/system/tree.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::cmds::system::tree::filter_tree_output 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(tracking): store commands so they read back as the same words\u201D; \u201Crefactor(cli): narrow the help-flag fix to code, and read -h per tool\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D; \u201Cfix(core): quote child arguments so MSYS children receive them intact\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/tree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/tree.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e64b162591b7374f225eb8bc353f153f193e71fc2398ad078279be567be527"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/wc_cmd.rs: src/cmds/system/wc_cmd.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::cmds::system::wc_cmd::detect_mode at line 60), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Crefactor(cli): narrow the help-flag fix to code, and read -h per tool\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D; \u201Cfix(core): quote child arguments so MSYS children receive them intact\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/system/wc_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/wc_cmd.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fe8e5a6dfd69fa0e0d6f6d6a6724f6ea0c8c32148b4d6524ecd60639f83205"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/guard.rs: src/core/guard.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is rtk::core::guard::never_worse at line 27), 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(json): print --keys-only schemas compactly\u201D; \u201Cfix(json): stop --keys-only from printing the values it strips\u201D; \u201Cfix(ruff): bypass never_worse only for the format rtk injected\u201D; \u201Cfix(diff): align by LCS and name the cause of an invisible difference\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/guard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/guard.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e49cd83ee467f0ee400e3b0a3235eacb0d926b714bfefbc3ea08ca82b71f5a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/cloud/curl_cmd.rs: src/cmds/cloud/curl_cmd.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is rtk::cmds::cloud::curl_cmd::filter_curl_output at line 111), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tracking): store commands so they read back as the same words\u201D; \u201Cfix(curl): forward stdin to curl so -d @- bodies are not dropped\u201D; \u201Cfix(core): decode per line, cover OEM code pages, and centralize on exec_capture\u201D; \u201Cfix(core): route all child-process output decoding through decode_process_output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/cloud/curl_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/curl_cmd.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"875067b9ede184f4f8d3c13cc4dd7bef1ef7402278c3e9c4b7e7ba6ec4b39481"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/shell.rs: src/core/shell.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is rtk::core::shell::direct_command 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(tracking): store commands so they read back as the same words\u201D; \u201Cfix(shell): run unresolvable single-string commands through the platform shell\u201D; \u201Cfix(cli): scope the --shell guard to test, and compose the group strip\u201D; \u201Cfix(cli): answer for a program that cannot run, not just an unresolvable name\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/core/shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shell.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556f86fe1e7352f94ed65751422ce48dcd7c400a02acb6a26e4dd3f6d643ba0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/integrity.rs: src/hooks/integrity.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is rtk::hooks::integrity::report_hook_status at line 209), 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(core): encode sha2 digests as hex\u201D; \u201Cfix(hook): preserve unresolved-directory fallback and pin dispatch gates\u201D; \u201Cfix(init,utils): propagate Gemini settings parse errors, add from_json_str wrapper\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/integrity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/integrity.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bbc9c9cd6f4a1253bc8f1ad9231b6a0244e97bc0e3c995cad7bba5a377c9bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/js/vitest_cmd.rs: src/cmds/js/vitest_cmd.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is rtk::cmds::js::vitest_cmd::extract_failures_regex at line 168), 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(core): emit one trailing newline, not one on top of the output\u0027s own\u201D; \u201Cfix(jest): run the hook integrity check for rtk jest, and pin what vitest and jest spawn\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/js/vitest_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/vitest_cmd.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f16863248e43ffef449deace1c0053ffc85ada28f38add06842b8198873251"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/analytics/ccusage.rs: src/analytics/ccusage.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is rtk::analytics::ccusage::fetch at line 131), 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(analytics): sum per-project ccusage rows in monthly economics\u201D; \u201Cfix(analytics): degrade unsupported weekly retry without losing report sections\u201D; \u201Cfix(analytics): align weekly economics and aggregate project rows\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/analytics/ccusage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/ccusage.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d337c4f5568578bf4eb356d9e1ce2b5a49fad859870bc04de661615df62512"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/ruby/rubocop_cmd.rs: src/cmds/ruby/rubocop_cmd.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is rtk::cmds::ruby::rubocop_cmd::filter_rubocop_text at line 223), 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(tracking): store commands so they read back as the same words\u201D; \u201Crefactor(cli): narrow the help-flag fix to code, and read -h per tool\u201D; \u201Cfix(cli): hand -h, --help and help to the tool each subcommand wraps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/cmds/ruby/rubocop_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/ruby/rubocop_cmd.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"63987ca8ae11525479ea91dc0583d87242daefc0e13a631d2a09084d6508f21b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/session_start.rs: src/hooks/session_start.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is rtk::hooks::session_start::ensure_proxy_impl at line 39), 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(hook): warn when a port set up for RTK does not answer as RTK\u201D; \u201Cfix(hook): skip proxy autostart on occupied loopback ports\u201D; \u201Cfix(proxy): honour RTK_PROXY_BIND in \u0060llm-proxy start\u0060 and the agent launchers\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 03:57:20 \u002B01:00\u0027 --until=\u00272026-11-12 03:57:20 \u002B01:00\u0027 --full-history --no-merges -- src/hooks/session_start.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/session_start.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e2448d54e043ba95e9a171c962012b2b70b7789f0437c8a55d891d200369ce"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 6 significant file(s) lose their only recent owner: engine/src/pipeline/validate.rs, src/core/pipeline_config.rs, engine/src/pipeline/eval.rs, src/analytics/gain_tui.rs, proxy/src/main.rs, scripts/benchmark-sessions/lib/runner.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8fbd1df6f1b125013d12ffbaf4a395e598c8865b37face1d4cad864c6d5d38d0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: src/core/arg_tokenizer.rs, src/core/arg_tokenizer/frozen.rs, src/core/user_dirs.rs, src/core/arg_tokenizer/differential.rs, src/core/user_env.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ee764f2195a9eb00a9447d3699433f2e19d9921c96ab6295731ea0443c211657"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: scripts/benchmark/lib/vm.ts, scripts/benchmark/lib/test.ts, scripts/benchmark/lib/report.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"03b6258e6901af976a586a834e3cd5cc9ecfa44f1e3b59bf157655e8feede695"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 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 (18 single-owned of 222 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; 222 of the 268 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)), anonymized user #7 (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: src/cmds/js/bun_cmd.rs, src/cmds/js/ng_cmd.rs, src/discover/shell_wrapper.rs, src/cmds/php/paratest_cmd.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if filters are present, we should find out which workspaces are selected before running rtk dedicated commands \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"53df4c6d72fd9d1b4dcfbc8fb55145800bf3f5ead8a28be86d9e091a81814ed4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: grep pipe filter below 60% target \u2014 improve grouping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/pipe_cmd.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b35272a75f49a0abc4903fb6db66fe5b9c325cbbdfc5b6989de8228d73a4a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find pipe filter below 60% target \u2014 improve grouping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/pipe_cmd.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc75fe7e93cfc73bc2c38114155f88cef9f6d279f8ccc18c2e3d7f39c4307b3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is \u0060(repository root)\u0060 (154122 LoC, 317 module-visible types across 30 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c91d8b31053294e8dc247bc431eb2a6d238396f54361a1310c336b91bd1a444"},"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":"739c40cb4745841ba2a75d32315bc25c6affab52676932b9e58dcfaa8fb9d62e"},"taxa":[{"id":"CWE-250","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":"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":"735f3c9d3ef6e14871342c689b75afa919b5e25045e58c3545882e2313f5d117"},"taxa":[{"id":"CWE-250","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":"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":"2badb6f0abba604fb15f7ade25fe81bd3d940f0b8684356e503c10a8ef67c500"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40eacf4c9661dde5370cef87da9c1e9ecbd3e4c37321ed6a3eee0061349745e5"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99c8716916ca0dd9ddee8302208a5745bab6513f34ca12c2672d93f07c07be5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b81debfdf26ad72c8d0b6ae327091ed6b094389fdb86a94cad6363ea8f38e48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"233c283afabc3cbe9e1fb2c663cda67ee401e34fde1c1baa92c564e85ddd0b79"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f052e3b915703ce74dbe254ce3507080529b36b18c985045e6219d12e5a0d05"},"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":"188873ea835dc52cc485ec42ea6cf8bf733ee9c1d3e7cc9c14003318673e56ad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9b79a42c1353f66f0a4d39600ecafc51a05b89031e98896312f2acc981a4331"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8358801f39b00898552496f70ea14d5cd30197b985656c6109c836b3d66a18b"},"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":"3201d96c22701464fab0a72f27abdf0ecf51d5c02b6e33fe8232cd4ebe925766"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3963d9f0883390ef6e4c8eabbc4ed639a70f4e279e5af657cd708e720b9fb41"},"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":"4026f2ae5829c9ee6016d2289476bc6b9d069f22ca6e7b51c1f2cca18e7e1f59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df38043f089cc380f0507d28c25a6e9fb75594e3ba57309dfa9892cd52cb6a01"},"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":"f7493bb85aa2303f31804b6ff88c48fe50f76a3545417f12a1295f805c1a6f8d"},"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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":"04b15c1d822501a1f3b0513e178960337673a790f4f183f2453907ced2d2833f"},"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":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"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":"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":"a5926b418345a7818e483301c7a520775e3e82d494f1330f6423d501456f0220"},"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":"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":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.32.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"916bcd834716a8f5fe878dd5bda107af0a19c06664a34ae0d1a5977ff6d7808b"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.32.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"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":"052bd8149352eca99f74f1c31d39ed9d909081af3e89af9988c41ede3e1c32ba"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.18","advisory":"RUSTSEC-2026-0523","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0524"],"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":"a435eb7cbd06e02b65e65ed4aeacd22c2bdf219ceca6723f93907291d7a30e72"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbe4420be6abee265cc311b2b244d8119c93ab6d26457d6ca502002518cb0673"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"235a4aa11b9ef75e9ede5d8fd4c592dc567682548c9c0da721b2f27963f8e8a6"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"f8120a93d84eaba5aaeda89c971d7fa64f5dd04d99666d7c2112370bdaf2a565"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"9c1f2949445846f4885d8279d76aff64fce4c9c3c8b99929bcc83fb6a00490ba"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","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":"1de33ab7116ee7453844482989b9959e6065f923d1d85c91452b959fd56d39a3"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 222 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; 222 of the 268 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/learn/report.rs, src/learn/mod.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/learn/report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd43d633408d311d828d002001e0fc15e5329cd500531397297530c124e9038"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/learn/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f527d942cad1e8c4970c5e0ff7db99d51be9a424276b16d27f5c7bed3d9dd066"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/before-after.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a6f9d83359a860740637a8b34301af4170e5ec7c035587d8d0a9ec3b8f626d"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/before-after.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"23786a14237ba04997473aa83d0279d8eeb837dbdeaead04e66b4517a906887c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/before-after.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb97649a715069d358f44ca6b910de59eae1d9b08e33cddebe40a822c24e9897"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/companies.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4819ce61380d70eb56c4b6f86e28ab0d3f97bb08f9d9b97e820213bac1d5c1c3"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/companies.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"98da02ba820e2207345f882d18d1f7165c3c2cd569c903cbb1908b9d3ddda912"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/companies.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"09429e2a347374c7e81c75018e4525c4153117a2b4364a85edad19245bd18fe2"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/go-further.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be12a4ee85e1f614272ed982173c730aa24dddb1480ff86ef13a8b2c94ec73d"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/go-further.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44f6d905bfa3f89fae11d97052e26290df9fadc8d33e71c2f565080cfb52a00"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/go-further.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec378dab009fd337b3ea2d35516069d441e5cacb6c4761a1519db3a5d00f72ab"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-banner.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8193c5623d936fde3e387a96587ca44badb804beff233f82f036f931edadad67"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-banner.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba5c55579819f46904b63cae6670f12f01e1f14ffe7468569b87b2b950fa1e6"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-banner.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4669067b4c8ac14c25bc08ce19088f0b916db43040b762b6dca4cf5480b8f4cc"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-pro.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"62690161d8270c7113f1dcd20cd6073103f06706b0d3a808855edae34cd05d28"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-pro.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4e4bba13b92f78366120ede78495ddad7e3a322eaabdc7bbf41add64a06d32"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-pro.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f2660bb159cdbd9a4449e660c2e5c560a57186fdbc190adf99e3ede0d2456"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/assets/src/rtk-pro.html"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b279935dc12013cd4c0ff9c4dcb3574a7b4993546b71070a45b67eec2bf5a2"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060docs/contributing/ARCHITECTURE.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/maven: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060maven\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b7913598bca56c64397ce3f0ed5ef2c45e6bdb90f584892ffcc029d4cdccde"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dad9daea02b0822f1eb2254de0c9bee1985122d467048f964baa29475b19ee"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f8560e385541aa521f7312721d13f64e7b6924d3f421c64e90c4e5dd341567"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e5420d53c388f1f7151098efdcb1f63cd3011a9eec37b9517ecba0658a658a"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b482014fc0fd1620742256d0255454b126af4bbe388afa0d7c900851e3631ea0"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c79358bd17895125cbd5e3ef070f1facaf203d715efac6b5b4d84e78aae7b9"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bae8b2caf5300d292cafd7653b2f7d80582ed36b54df82d83030ce59fb2a1d3"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/classify.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4865a5def51bb983ed734b959a264972e4e02e954bf4ddaa887bffeff9fc78a1"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eff103c3fa639df4862f232ffc262d2cac1ca38bceaa855e04e3cc61544a80"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task_cmd.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50f598261ece4a044fb21f6ea2324d44f1f0242ddc8f18ea7a4873f71a4fb02"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/telemetry.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc3ad32736e89646e57bc6dadd54b18563637654b468c6818b8c1e19d2824be"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/telemetry_cmd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7403a3f7c902c5b55622f2f305b3cfd37ee7944c734e2be242d2a2b88b3906a2"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/llm_proxy.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"819153ea6d06b390fcbefaadb94dafc3521a18816c83fba4e809370eda7f2b13"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (proxy/src/main.rs:230)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (proxy/src/main.rs:230)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!rest.is_empty() \u0026\u0026 !name_part.contains(\u0027/\u0027)\u0060 appears character-identically in 2 files \u2014 src/core/arg_tokenizer.rs, src/core/arg_tokenizer/frozen.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"97505ba5d01e2fa0853aebfd97c67949dd88444c1af85ba796f88f4b660962e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attached.is_none() \u0026\u0026 prefix != FlagPrefix::Slash\u0060 appears character-identically in 2 files \u2014 src/core/arg_tokenizer.rs, src/core/arg_tokenizer/frozen.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"573effa0068ac9a1af42ec11aee731accf7f0c6873941b551c15b7350529f7bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_ascii_alphanumeric() || c == \u0027-\u0027 || c == \u0027_\u0027\u0060 appears character-identically in 2 files \u2014 src/core/pipeline_cmd.rs, src/core/pipeline_remote.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9302cfda3fcea053a2a03c0ce4618bb39183911da5db61d8b19f3287d5a2e0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deny.is_empty() \u0026\u0026 ask.is_empty() \u0026\u0026 allow.is_empty()\u0060 appears character-identically in 2 files \u2014 src/hooks/decision.rs, src/hooks/permissions.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/decision.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5081f5cc113861e2fa8c81939672df103c586daefc66958ee13b65d81ae237f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.is_empty() || line.starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 src/cmds/system/deps.rs, src/discover/registry.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9d74b428b230cdfb1d80da71f3e4f38c2533cfd9113d8b61b3ebaf99cd7db2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.starts_with(\u0027 \u0027) || line.starts_with(\u0027\\t\u0027)\u0060 appears character-identically in 2 files \u2014 src/core/runner.rs, src/core/stream.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23ba159d2499bd74597c043322031267cca4556ec84fdd57df7cc4eeb12af1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next.as_ref() == \u0022--\u0022 \u0026\u0026 !self.emitted_dash_dash \u0026\u0026 !spec.claims_dash_dash\u0060 appears character-identically in 2 files \u2014 src/core/arg_tokenizer.rs, src/core/arg_tokenizer/frozen.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2b0996605a57eabe83e91c7887bc1fda4728f2e98d157745fda88b3d912298"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parts.len() == 3 \u0026\u0026 parts[1].parse::\u003Cusize\u003E().is_ok()\u0060 appears character-identically in 2 files \u2014 engine/src/methods/grep_group.rs, src/cmds/system/pipe_cmd.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/methods/grep_group.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5ca6a12c07d75e4f9bebbd97aafd695d74b451c539bd388c301f6d16459d80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.kind == TokenKind::Positional \u0026\u0026 self.linked.is_none()\u0060 appears character-identically in 2 files \u2014 src/core/arg_tokenizer.rs, src/core/arg_tokenizer/frozen.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"45460fab6b2764be81059ba3e400c742e336d15d45bd1c2b4bce002b9800cc7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.starts_with(\u0022http://\u0022) || source.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 src/core/pipeline_cmd.rs, src/hooks/posthook.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_cmd.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceb18a3c1935fdc17f2db784748b9e2d1af522aae2fb8b013b6de133f3b73f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.kind == TokenKind::Long \u0026\u0026 t.double_dash \u0026\u0026 flag_name_matches(t.text, name, dialect)\u0060 appears character-identically in 2 files \u2014 src/core/arg_tokenizer.rs, src/core/arg_tokenizer/frozen.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b0866c5db5c73a87335517d9f5f5d9adb67f3ecfb234708c8772dcde3d7ce8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 172 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcaa1a91c5400692c83da0a4b5d9b1b3ed8a2df68e1f0d4c0d568ec4a5647f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 233 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/main.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eae0be0f6f4164c7f9474e6a7789ae463ec75cb3dd4f1e6ea151ed61d24bba"}},{"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 Err: \u0060http_client_with\u0060 turns every \u0060Err\u0060 into \u0060reqwest::Client::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"54deaaf859d2ecf8cd91caba9de609f0b1c9b49bbd6ddda50c98b6621fbb379c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060family\u0060 turns every \u0060Err\u0060 into \u0060\u0022other\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/models.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb524f1babcb21d35145941e1a740cdeb121a37030b5c2e4bc85ecca0fcc65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060optimize_image_block\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/src/pipeline/image_opt.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"451c6832af74c85b674669a71a1dc15442695b10f703e0ba1fd1ec5ed99ba471"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sorted_toml_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_config.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"04998c32629e6c11ad7f0603f4c334876ee75b3da823eb77c28411cd7810c19a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_last\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline_log.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"239d7436ff14bb1d542a5a5442d003c10f14b54da381b4b384de57173b2dd885"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_install_method\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/telemetry.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4129411a265b7f6f7fa995893c228c1a8662530f4e7046f14756c51cb4a20a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/report.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ae9418980c0a7ad3aa144b0fae7d8e3eb520e3c60c78b5cfca6a4bf7d6567e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060claude_hook_gaps\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"df85d45ad67c99d0c126703801fa2dcba09be0707db0a1f30cb7383912087654"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022failed\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022failed\u0022)\u0060 also satisfies \u0060lower.contains(\u0022fail\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":"src/cmds/system/summary.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4e9ddb0aa4124f25b3ca4b6afd6c3023ca95ddc0fc88249688d15210827294"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060t.contains(\u0022no offenses\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060t.contains(\u0022no offenses\u0022)\u0060 also satisfies \u0060t.contains(\u0022offense\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":"src/cmds/ruby/rubocop_cmd.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef24cb8c54c10ef5b8b32c244a2dd45c7b0c51687d0b87415f2a0d1b9b5844aa"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022Success: no issues found\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022Success: no issues found\u0022)\u0060 also satisfies \u0060output.contains(\u0022no issues found\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":"src/cmds/python/mypy_cmd.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"538b470be9f6867d784284d83ca6f700cfbcb1d866e158a8176dcd052d071987"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060task.contains(\u0022ktlint\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060task.contains(\u0022ktlint\u0022)\u0060 also satisfies \u0060task.contains(\u0022lint\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":"src/cmds/jvm/gradlew_cmd.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31d958060a337c1cef454dc94eabc8a3f25136cb0f67fe588c6597d4703637f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060o.contains(\u0022MultiFailTest.second\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060o.contains(\u0022at com.example.rtk.MultiFailTest.second(MultiFailTest.java:30)\u0022)\u0060 also satisfies \u0060o.contains(\u0022MultiFailTest.second\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":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e802560aecf898f4db4b01d09b2aa35d6ff41ec8f0fb743a5ccca0ded01975"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060line.contains(\u0022ERROR\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060line.contains(\u0022ERROR\u0022)\u0060 also satisfies \u0060line.contains(\u0022ERR\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":"src/cmds/js/pnpm_cmd.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"194583a90f48242aa50de6fcf3d37466bf4061d7622781e1155e4e1c6c1c93e4"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022unexpected\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022unexpected\u0022)\u0060 also satisfies \u0060lower.contains(\u0022expected\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":"src/cmds/go/go_cmd.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d221d0fd39b8f2d148b69a78e6597bae50f01c4af2aa3aebf616faff6c714c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060trimmed.starts_with(\u0022Running on runner-\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060trimmed.starts_with(\u0022Running on runner-\u0022)\u0060 also satisfies \u0060trimmed.starts_with(\u0022Running on \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":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2940d25a3f92b2ade4a31ca6c1b32c20d1ccca43171f6f8666c6da8776b8316"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-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":59,"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."]}]}