{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-1059"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"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":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"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 267): rtk::run_cli has cyclomatic complexity 267 (threshold 15). Of this number, 266 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/main.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb84fa59b16f80842facc26086f3d0a6ecbd258eaa7238390f56fec1fc418006"}},{"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":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e38bf636b00ce4ab858b4d2b8d5619de7c4d49b84aa397b1ddde036477abe2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::run (cyclomatic 53): rtk::cmds::cloud::aws_cmd::run has cyclomatic complexity 53 (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":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087fa68a94e61f7cb32b153e2655e392b2bff035c10a270710ba36859afa98d"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::core::runner::extract_test_summary (cyclomatic 51): rtk::core::runner::extract_test_summary 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/core/runner.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e7dc4f6347d140e517618ca13facd56f0dbb73c6158bcb2bc7c0a4c7b25127"}},{"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::discover::registry::rewrite_segment_inner (cyclomatic 49): rtk::discover::registry::rewrite_segment_inner has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8868768d92f73c7513ca551929e361c4f1a0aa8198b7a2a95db5d87827b237"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::lexer::tokenize_inner (cyclomatic 42): rtk::discover::lexer::tokenize_inner 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/discover/lexer.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d33ef512d42379745d31ac2eb826220479c2d11e15c3f774703e2feb9c37e"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::uninstall_with_patch_mode (cyclomatic 42): rtk::hooks::init::uninstall_with_patch_mode 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/hooks/init/mod.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c628b6c051e1858ce44ea63494ac3072dec19d7a757b87f79982af21b718058"}},{"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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52531baf5f93817f5f70803e05e9834d71721253936ef54dfd1b982b3dff23d"}},{"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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1f614edd5d85d6e3d2abb1ff74784995dccc0dc1fc18f6d6bc870357f5877e"}},{"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":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7b6f0056099fa4db24919e9b5b9910e41ef0362bbe51915d56a10361d5a9e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_trx::parse_trx_content (cyclomatic 40): rtk::cmds::dotnet::dotnet_trx::parse_trx_content 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/dotnet/dotnet_trx.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba15a778dc88df41e26f4d19245da2d1b1649ca54b5902891f25dff0aef96d5"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::go::go_cmd::filter_go_test_json (cyclomatic 39): rtk::cmds::go::go_cmd::filter_go_test_json has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/go_cmd.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4933d8effac7cc8a3d9169d0431eba11a3cbcbb077895e25b26065af239c04"}},{"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":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef20725f9977282900edb6022fcad5c492c6285f18f6f93a4d0d916e8fe6c91"}},{"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":1139}}}],"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"711951c9ccafd0d73e7aadf7cbb7fc17aeb60dee827aafd5a3f9b4517896a8a4"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::analytics::gain::run (cyclomatic 38): rtk::analytics::gain::run 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/analytics/gain.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0929e9fd874dd8bccf52ccaab1c851168a55b62450571e9a6bdf4337dde6c"}},{"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":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe547fde4eab3819b78691954b06658fe05e4e24cdefb4d645babf5470ffe8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_nextest (cyclomatic 35): rtk::cmds::rust::cargo_cmd::filter_cargo_nextest 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/rust/cargo_cmd.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fe2558f0b63df0da14e37edc3aae84e03393e76f238ca5b87d14ad1610f7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::show_claude_config (cyclomatic 34): rtk::hooks::init::show_claude_config has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0607f825933461d299a6120bb3c134faadbeeadefc40f7b49168c8c85523e7"}},{"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":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ac3046265016a4df1fcf610dc517aab4fe0cecb006b2e43ffddc26ccb90221"}},{"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":644}}}],"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":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae24b8dd2bb2dfc0ec612885b55d4e8e3714aea9741e6f0779327fd8641d14d7"}},{"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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8a25cd4a9211d6a93dc03c7ec53f865f801ca7f068bc2165cb8e2d2f353c2e"}},{"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":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a925cd3cf8872e5c8078fc91cba6c155208a2f493a4cb6eb4ec0fe496b89197"}},{"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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"825cb6cba70dab904ca6777a7bd23bdfa0db1a9e43dda539dd309217e09dffdd"}},{"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":1373}}}],"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":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cddca888b2b20888e3a48e4d34bd94981789a810bed4987489cc46ca572dad7"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::sqlfluff_cmd::render_lint_json (cyclomatic 28): rtk::cmds::python::sqlfluff_cmd::render_lint_json 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/python/sqlfluff_cmd.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489b1f2da2dbbb25d3f2085e6cfb79a028b64524de14ad1d4492590a93239ba"}},{"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":275}}}],"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":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"24584023c98daf404902cc81ed20ec880419731679cdb2e6d111349ac31458ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::hooks::init::run (cyclomatic 27): rtk::hooks::init::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/hooks/init/mod.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5676f5158e0feceb8de71afedffb22857650b991fced3cf55348469ff3a21"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::build_pytest_summary (cyclomatic 27): rtk::cmds::python::pytest_cmd::build_pytest_summary 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/python/pytest_cmd.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c67a4218e79f6b4011de764809be7a42c3aae6787ac674345b76b84998df50"}},{"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 26): rtk::discover::run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":258}}}],"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":43}}}],"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":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da99eb87534a114e3dbcbd170625f38544812b9520f4c270443a138cc398bea"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.run_benchmark (cyclomatic 24): runner.run_benchmark has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmark-sessions/lib/runner.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf956c51ede0bc42e2e184d84e3dbcb6a2073c55fd42fb7e1e12375d9f825e9"}},{"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":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b59b5fe8ec7a92a3e2b3a7cee3e33b3e00b39ad849098457d53bd2845284d1"}},{"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":1011}}}],"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":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"496c8ea9e5c8e113b723c4fc2aae7f585b989333c132dcb95556bd43d2f071f1"}},{"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":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"540dbd547c3354d661b01f844ae25bbc04bf43f0609bf097dc9c367fd4f43d05"}},{"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":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"21496895b9a1ab35fbe3988a18ea740b51616b932ab2a8ac49f954f5206218ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::discover::registry::rewrite_compound (cyclomatic 22): rtk::discover::registry::rewrite_compound 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/discover/registry.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"222b1db9a4199bd830c154953a9bc4bd4bbe91a83134c9339fd0a40648912bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::ls::compact_ls (cyclomatic 21): rtk::cmds::system::ls::compact_ls 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/system/ls.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb189be7069e3a407332fcdc409d21aa39626f99bbe239237858dbae442812d"}},{"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":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b860db50288ba2e114f95858c6d5937bc943d281098ca312588765831de189c"}},{"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":373}}}],"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":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c07fcc713532cae9b2de12c2efed8018e0b9453e3b7f72506f080906cffdf0"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::json_cmd::extract_schema (cyclomatic 20): rtk::cmds::system::json_cmd::extract_schema 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/system/json_cmd.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d9b2b0958111066286c7fe7a1009ea3dc869ebd80cf15c5ec333644b0e4200"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::ls::run (cyclomatic 20): rtk::cmds::system::ls::run 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/system/ls.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54f9a7cf68268b52eab9e3e187f412f490d2cea910361b65f5423aff4537089"}},{"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":120}}}],"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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb69f665a07301fc5e051d4f3dae68d18398529ce64654e948fb3e218a0d85d"}},{"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":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"127a9f2375d660eed9627529c7e6680512c84b19c8b6f2ab6876c5137329a506"}},{"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":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3338ecb47f113239832bee926dd741a8e500d5c1ca6e8c0d8b145809bdb5998c"}},{"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":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df1b33561090e769769277b078ea79c1849d42bb2583aaccbd21dc2a7d3732c"}},{"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::python::ruff_cmd::run (cyclomatic 19): rtk::cmds::python::ruff_cmd::run 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/python/ruff_cmd.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0895ade0a74c16b400a0edd1d2dfd1919d71e985c899cfc5a51113c5a1484e81"}},{"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":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"808aa6151068f7f8e9c664d1234f1671a6f1403812f3f91c1f35283fe8c93ead"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog (cyclomatic 19): rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog 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/dotnet/dotnet_cmd.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"53450c624843cfa458891b43fc9ace8652512a4cc2422183ac17606b6a9f6ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir (cyclomatic 19): rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir 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/dotnet/dotnet_cmd.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf0478ce41f6596a1062ed8f85a540504ef7871ca33521984829086b4de816a"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::system::pipe_cmd::auto_detect_filter (cyclomatic 19): rtk::cmds::system::pipe_cmd::auto_detect_filter has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: 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::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":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c8ee736552a73c4a41f5f3d0d8c7239e8e98cf43daebdc7dff88c752b4a21"}},{"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":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c52b6d51684b056a3765ee44fd200574cb646bac4b8af4291aed75d6b47f28"}},{"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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fcee12135c1fd0a0af2f8aee8e5700db7aab3ea5762356e220a98eef68443e"}},{"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":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e3a61e237b89c44321997474c933421a4dff4dc032f535f5d6d2e6c8c9eae"}},{"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":41}}}],"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":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"060edd22554c7f6e49ca9d85f221aca9c8e2de604af74f4ad4f343d5bcb906f4"}},{"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":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5682a4dfcec8d2b4e64e2bb69263b0342950091df2c28b7e3a97796a44c2a64"}},{"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":"rtk::cmds::git::git_cmd::run_log (cyclomatic 18): rtk::cmds::git::git_cmd::run_log 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":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"017b1fa6918e5a39b605e7fbd4be993419e81dc4d56527eb3854f1f377439aec"}},{"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":3592}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8807394740aaf42ff1d57f30d3eab6138108076ee9a51c0aafc94de74e2567d"}},{"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":633}}}],"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":176}}}],"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":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81494daf250801c26f5869a1aa7f0f285d0700bb6843dd4c88df7f5be74fa77"}},{"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":167}}}],"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":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd381073f49d58dae9fc832aa48cc58552c100eb12ad8567c212efa1a4462509"}},{"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":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac150348b49af240a7801ec737dc8bfcdb2fb9f927843210f9c69a50ce53db93"}},{"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c6fb2200e4f4ae730d042d5c8ba7be9cce260c5a8669dd724df48613c06e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::run_fallback (cyclomatic 17): rtk::run_fallback 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/main.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cab4695ba778a01f8a3d6e5e48258437cad58092e4fd1142431e50553d5bf7"}},{"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":157}}}],"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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93eddec486411fe58023d3fdd73fc63d927d7c9a9c0861398d4f2c109ce5bff"}},{"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":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cfdbaf9a25194726af610c51ffa6465ebd2249b8db5cdf8fe50e8378e2f97c"}},{"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":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc568789be2e108f49c1ddc7d5edc3ec6f1e51aadda73f0b750f88d71e6401"}},{"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":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0352e53483c86f67a74d8d6274f7b9ef076adc6b09bd401499d70fa2af5561"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::filter_ruff_check_json (cyclomatic 16): rtk::cmds::python::ruff_cmd::filter_ruff_check_json has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/ruff_cmd.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bd82851133bab2f81e6c2a213631b9186c9ea84ec286f7484127c3c903563e"}},{"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::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":261}}}],"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":2924}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b440d6f713e2f5a4c5dd19652620bf57655988d4852e70229f9de7a715efca"}},{"ruleId":"D1","level":"warning","message":{"text":"rtk::cmds::git::gh_cmd::format_pr_view (cyclomatic 16): rtk::cmds::git::gh_cmd::format_pr_view 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/gh_cmd.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bcb00654adc7ecfabe2497c7e589bbb58f4857e2580f8b1973e3ea147a133b"}},{"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":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a5e69bda872954962d92b23dbacf7d25f15bf472f2e63ae09cd7847ce907b9"}},{"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":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad66b37e04d9dc419f045165ad6389bc52e266d95be0ef15fdd66432f14d6c5c"}},{"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":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d89069afe301bcde7dc0ba19db4c1d75fc9ec54bb67d47686b27c51a29f57f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::run_cli (cognitive 244): rtk::run_cli has cognitive complexity 244 (threshold 15). Drivers by points: if/else 87 (154 pts), match/switch 28 (68 pts), loops 6 (15 pts), boolean chains 7 (nesting depth added 116). Of this number, 242 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/main.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"5083b6f6426eca0c7ec28c3ff8a0bf9f6a6f464599b309153eceb6f00643d2a0"}},{"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 96): rtk::core::runner::extract_test_summary has cognitive complexity 96 (threshold 15). Drivers by points: if/else 29 (73 pts), boolean chains 12, loops 5 (9 pts), match/switch 1 (2 pts) (nesting depth added 49). 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":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"712044604d168195b38e94148bf94431962fadecb6fb7cfb008427806efd2271"}},{"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ccabbcf04424c88d4a9bc78bbaf6365c9cc41e07b944a88d0e87d8c151c5bf"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::uninstall_with_patch_mode (cognitive 88): rtk::hooks::init::uninstall_with_patch_mode has cognitive complexity 88 (threshold 15). Drivers by points: if/else 47 (79 pts), loops 4 (9 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bbf2973c3a954c6dc4d6d3077a6d5c1294afc23a4d0a803c31b672421493e6"}},{"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":142}}}],"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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0057d8f63b52f7ff127f81b09e9e2f3520416cd2b01265800703e379c6c5de"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::lexer::tokenize_inner (cognitive 81): rtk::discover::lexer::tokenize_inner has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (61 pts), boolean chains 9, loops 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c400564e4c689118a475776860bbd9a2af3384e076917c990446cae32630019d"}},{"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":1279}}}],"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":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b46fae07eb586f114cc113de47ce922a74a8e64c70c6c2b658883493bc0519a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::go::go_cmd::filter_go_test_json (cognitive 71): rtk::cmds::go::go_cmd::filter_go_test_json has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 8 (13 pts), boolean chains 6, match/switch 3 (6 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/go/go_cmd.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1615e7ca599eb030ed90a46fddfc254c55d8b3f4e64d5ba519fe2a553f0b9ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::run (cognitive 69): rtk::discover::run has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (46 pts), match/switch 6 (15 pts), loops 4 (8 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a223b3005f4744e13504004ad5f9b4f9885b9e6a9d27e91707e5433a2d656e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_segment_inner (cognitive 69): rtk::discover::registry::rewrite_segment_inner has cognitive complexity 69 (threshold 15). Drivers by points: if/else 33 (53 pts), boolean chains 11, loops 3, match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ba8ce52e9117eeffd7ad4cc08cbbef2ac85da2f418b703a979170b1a65aeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::show_claude_config (cognitive 66): rtk::hooks::init::show_claude_config has cognitive complexity 66 (threshold 15). Drivers by points: if/else 42 (59 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51303ebd7172be2cbc10529d4bfac86719c272584b3146b685eb9069cb0cb11"}},{"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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"91adedefcbefd0309b68592beefdc36ed53b8cd208f6687aff4b2b83db89bc51"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::rust::cargo_cmd::filter_cargo_nextest (cognitive 64): rtk::cmds::rust::cargo_cmd::filter_cargo_nextest has cognitive complexity 64 (threshold 15). Drivers by points: if/else 28 (54 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21937267616036a5d1b40d388062139133df79a848b54d192562ac70a35f884"}},{"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":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e34aa5ec4e5a323186f3c2fc891420b5cda9fdd071569cb77f1a1ecb5e5e68"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::core::arg_tokenizer::tokenize_scan (cognitive 61): rtk::core::arg_tokenizer::tokenize_scan has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 1 (6 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/arg_tokenizer.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"173a457fb8f8a37db6f8e7fe496044a2f0818a859cddee3ba9e3772b8f36c781"}},{"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":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c101c79b5f782dd2fb4e076b096284f5d3c399e34f104898562fd3f96d1ca43"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::analytics::gain::run (cognitive 58): rtk::analytics::gain::run has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 7, loops 2 (7 pts), match/switch 3 (6 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/analytics/gain.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e802c579c2bb0afc9be8913cda963c51521f1aaa01a79c449c09b095b90b73"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_trx::parse_trx_content (cognitive 56): rtk::cmds::dotnet::dotnet_trx::parse_trx_content has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (38 pts), match/switch 6 (15 pts), boolean chains 2, loops 1 (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/dotnet/dotnet_trx.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce06c50a8b9352035cebc1a8d5476937b0e8038838eda2db0782f0b978daaa2"}},{"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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbfd22e167d09641a9ff745566e5ce954602dd95a376d8a4e036b5312c472e0"}},{"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":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e49c335e1669e391df009d8da4edce2f43590a288aebd59d0647e3d507ab5"}},{"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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0db55cbf7c991b6b56626db490aa554da2b71f797e5702493425841863ae450"}},{"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":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"316a35f6932e9c51035f125aba8dc04986421705b50669823822c911ef2fded5"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::registry::rewrite_compound (cognitive 45): rtk::discover::registry::rewrite_compound has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/registry.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc173a8b6419791489150f2ff7b4553e1bf02cd667500d41d033c9d0291570f2"}},{"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::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":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"854303d7342ed4139f6ebf168c8174c80976a5db1622dd4a719da11d7215fbf8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::build_pytest_summary (cognitive 44): rtk::cmds::python::pytest_cmd::build_pytest_summary has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee404b108a2142ba89233f73685800ce8406dcc5d77688ad150a547d3375e454"}},{"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":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7a503e8c5cfde717f218a93622fc3773da605f4f24b00ee8084683c866a651"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::json_cmd::extract_schema (cognitive 43): rtk::cmds::system::json_cmd::extract_schema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/json_cmd.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"255b7c45f86df010a6500d6d188b4ae864ed009d07b1b741137a488429f4c5b8"}},{"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":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ea2aa7e43e3569c48348eb35b7caea885f33efe6452d939d2f4534c056e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::filter_pytest_output (cognitive 43): rtk::cmds::python::pytest_cmd::filter_pytest_output has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 12, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/pytest_cmd.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"419910a44bb89d0a256b8ed4ae5585fb715bc56fe92b3d552b17cde43e149b98"}},{"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":592}}}],"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":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e57bfb73f809ec8ba21e66979c7081c97f75c93c5f2570bc47b5ae88d6ce1a"}},{"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":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feaf16cd39ed685d44f7be72563dec1109a0152d2666e8942232cb6557f336e"}},{"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":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"202b0c440b1bac7d16e911bad19b7268d081a538b3034b0442fa646cd5c6f643"}},{"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":71}}}],"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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"268f9d42732d11a788cb085dcb2471f203599c2ab2a866eca0c91a2eef8f858a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::sqlfluff_cmd::render_lint_json (cognitive 39): rtk::cmds::python::sqlfluff_cmd::render_lint_json has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 8 (12 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/sqlfluff_cmd.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df6ccd90fda2d6d60bce2599fd8632a4e06120ab2bae149432ac0195ae038a0"}},{"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":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc918551aac00d32520318f70169eb858e25090b9b09d7b1a2f30e30e01f2977"}},{"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":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f428b8229361b8dbaaa8cf9295e8603b814662d6e9e91d857492e1ee0eb66c"}},{"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":1252}}}],"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":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"689446a94f13e0c5b98d5b4176e691ee9161434485d18ba6ad39f3b1712a4d6e"}},{"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":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f5fa5e7d756edc46a5f274f9ba5a511e149703bcf914ef09ac19a054761542"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::run (cognitive 37): rtk::hooks::init::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/mod.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58de54c8a595c62c84638e2d80f44917e9d66857c232f38493e7c76deafc3f8"}},{"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::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":2924}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44e8d2872a9311a0a3de58850a596cd898a614018146a363982b3459963b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir (cognitive 37): rtk::cmds::dotnet::dotnet_cmd::detect_test_runner_mode_in_dir has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"007f8e55b1beb25f67518bd347e256c30e17f6a8eae58baa57ca24d4adbffe03"}},{"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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2765d4beecc596c11063fcf90c69a3dbac24761a9fc4d0e09c68671abe057b"}},{"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":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1cef05a9766d0a577a8230a199731b738a3731ecc6bcf7e48ac5aeb720403b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::ls::compact_ls (cognitive 35): rtk::cmds::system::ls::compact_ls has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, loops 4, 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/cmds/system/ls.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e3a2bd9a562ab281f6289fe758152ebfd54775bee730c3789e00186e9b256"}},{"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":373}}}],"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":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99d6336c506c9b5f40c346c2cddfaf4ca3cf58762a86bde912e39bf7ec8e42a"}},{"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":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe50299a5a5474a616dfec094242944c571637778cd2e6d694f2c64084b61038"}},{"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":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d191fc5f361c4b9bd8790050063105eefe054fa0bd068571de0698e1b72e103d"}},{"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":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d2e64761b9949bd46095be55afe5b620c19283d369c2c936d9ef5416e671e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::run_fallback (cognitive 33): rtk::run_fallback has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (8 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/main.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bc56032f6b2a3f112117ddd9ee9068a293b74e52e0461d25301d1a534687a7"}},{"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":176}}}],"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":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f449a6096710f89bf6ffaa0156d926f1b125e78fd702efeaa0c7190ce85d03"}},{"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":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd9a04ffb152c1f252ee30421a530c23a0b8379358357df4e38db8a5ed7d2fc"}},{"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":3592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6372d020f8b8a4f4786fcccf73a5ede7f7c832f032844a214bd60c9bf6e318fa"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.run_benchmark (cognitive 32): runner.run_benchmark has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 3 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmark-sessions/lib/runner.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b216ceca20131783ee1fcfaeb48f5a5a6878f5447ba67eb3fa10abe9c9e83f"}},{"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":3185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea36e41dbd7742f3b06fa4b19bd808e6fbc0dcfe4aa8c29ff64ffc01752ccd6"}},{"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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f2ea14cf81c844fd488fe0b8f51228b7caf8a0ae2b622e4a346469235b52d"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::cloud::aws_cmd::run (cognitive 30): rtk::cmds::cloud::aws_cmd::run has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 27, if/else 2, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e67d2a90a7eecad7a7e06351332aa7c54622fb408484161fe16bcef256c08ac"}},{"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":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b87592a3fed3ffeda5bf23d5c0b1382bb2c58e870c3119d46ae5eff19b45de5"}},{"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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8e1fb7d093fcae7e8b2b01934d3357b86a076895f174505f1e3af6eb10cf2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::ls::run (cognitive 28): rtk::cmds::system::ls::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/ls.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd20b714cb1a8594ae612d1fa778d7981e9ca7320a7b6075cf952186ef8bd67"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::run (cognitive 28): rtk::cmds::python::ruff_cmd::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 8, loops 2 (4 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/cmds/python/ruff_cmd.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1bd341d2090401ed94a9623b119225c92097b5a9571d3f0182270adbd6fef8"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::permissions::check_command_with_rules (cognitive 28): rtk::hooks::permissions::check_command_with_rules has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/permissions.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"356b103b423bdb5bf113af7bec704f6e9e7774884b77e7f1980903cba2c7fb42"}},{"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":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd08c6003f72c00e12e821da3d8c3e74f67f00a0b758dd84d753c39c66ca1d33"}},{"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":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4f5104512a16c4b5a69fd014fb091a5c6149edb9432d8cce2b81cb123ab891"}},{"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::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":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"141c006b1586ae09cc1e7cf3157b21a44dfae54d47ed43b7c63af9dce03fbc91"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_status (cognitive 27): rtk::cmds::git::git_cmd::run_status has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"025c92da2123cc45c9a45b0970f5b95151622de00bd98c27d50f48509e756c62"}},{"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":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f87960bcb0ab015c012cd5cc7b2185a5b966fa72be6d6928df8ccffcdc314"}},{"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":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611e125f8ac9160d7af981aa6fe6217d74dbfab2990bec1d5707470dcc7e2b3"}},{"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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4e2700a06126d2685d1f35faf6eeba5c57b2b081e9f668564fcd79d795955"}},{"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::cmds::git::gh_cmd::format_pr_view (cognitive 26): rtk::cmds::git::gh_cmd::format_pr_view has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b5a0cfff755d1e3dcb85880d93765173569b9ccd0f2adc6b74a8e339dd2ef"}},{"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":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf1186a9b0ce9dd3b02034eb39b1dc1baa78109a969ce42194dec81d7d63597"}},{"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":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92934e8f1b347840c3473f280219fe3f13b3bf5453f58dae44d8457b0b5006c"}},{"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":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ffc8952d16526e878a402fdcc6e04c20c10d9ba3c889bc50b30f5f7511f95d"}},{"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":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bebc90340790252acaea99bbdf98cf8f0a84da5ad88142353005c4b61ee1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog (cognitive 25): rtk::cmds::dotnet::dotnet_cmd::run_dotnet_with_binlog has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, 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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44d3e1d676638589725fbbed4cba953886b9aaca1689f55bfcc260642663e84"}},{"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":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"58921e0dbb9617b48be9753ec31ff2638075f2e98426367d28b03aeb4b4ac02f"}},{"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":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c15367680189881327915cabc110054d1b8a4a5e029410c45f282194c4df92"}},{"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::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":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7e25366ec0a54827d5fb32ba367c07e19d1b1fea79bacfeeddd80614f11f4"}},{"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bd4f863c2863e33d3b55dd3deb460069f805e238d12ab8e6a0e79092efa80e"}},{"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::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":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c848ca3c43140cc99be5428c10782bb999af811dbd526b41de590f7be379a75"}},{"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":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e7dc75579b0114db2aced317a8fec6a5c93d139579e6645abfc8eea83497a6"}},{"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":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"33489b9c9c082a5f89facd072ac76cd546d90c2d13ebb10bd6f5b55e76aed0d3"}},{"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":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a9aff9d4c4e9724f76c5242cbd6d5083e38f23dc5d4542d2d8b675b1db6229"}},{"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":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1b64d02d7235dde7622423419b91e90ac902709414b8c157fdc90b09eefe97"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::trust::run_trust (cognitive 23): rtk::hooks::trust::run_trust 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/hooks/trust.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f55ca239fa747ef163286c849d425c02ded9f7f4fd6423ba87660d8cfd5a18"}},{"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":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6996f98f776535452fce61ee92cd267191c9f00846a5348d2a35b0a4f72efb08"}},{"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":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea900afb72fbbfba8c154ca16e73ec3aae2944ac03b09418728bb3763ae65c6"}},{"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":255}}}],"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":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b564a9377bc480d98ff4b66d5ead4f78663af0fc5e82d0abe840b4fed88a43e"}},{"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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb94cb862a42370c5292ab8293d2c62a047963a9f5e2740521f3b011e487022d"}},{"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":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e52c189f0bec777bcbd7fe0912dfad5c0a8449ef2e2ab109ec67f041341497"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::filter_log_output (cognitive 23): rtk::cmds::git::git_cmd::filter_log_output has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5561cb31f3c28d50c50730e05f07498dd0cacb90914e0ce2eada23788a799"}},{"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":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"01875016ad5262f7c75b1748df7eda6393357a8366ff1096e8b099d4dd18d148"}},{"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":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"96baa9d4fdd42acba030970a05570f1af6ae184a485d8f8cb9f1c19e859ff877"}},{"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":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cca0af31d81a508b53507d6b193b127cb8ba71e0b81996c5cde8f370c7504c7"}},{"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":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04cadca92a9608d486a609460f152cdb17d91ad3901bddca304c5b0129c1d3e"}},{"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":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f52c7046da6695f953f48a56267a6990415d5ec1b21af97b55fe0a14417c22b"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::git::git_cmd::run_log (cognitive 22): rtk::cmds::git::git_cmd::run_log has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede56326656bc0a430f2d9b7cc23a0b291732ae599067cbe6ec99381889ab27b"}},{"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":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9bda2da2f11e6ddc30a4e9281159be2c11805bb67a1544924e000375312f47"}},{"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":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457df17a8d329b58da3b0afbd0ed90fc233c0953107b7219ad43fa0a3c816de"}},{"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":147}}}],"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":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d7598fff2440ac0faadbf1d12a31237905dcc8677ab11d808a4a6f4ca6856f"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::find_cmd::render (cognitive 21): rtk::cmds::system::find_cmd::render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 2 (3 pts), loops 2, 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":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b11bd003104f992957461ab3c520c1fd6d15e8ba7817bef202efa5ae911c4fa"}},{"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::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":342}}}],"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::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":239}}}],"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":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4874303c3ab5c6aa6163a5ee4862642c403c80c687991df2cfe9b862cc9574b"}},{"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":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1315e4377e5587a6366ef604959b96d51784adf368309322e7efef64d4ff1a"}},{"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":"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::core::runner::run_captured_filter (cognitive 20): rtk::core::runner::run_captured_filter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa52bf3768c0d5e45bbf71e958dcf5ddf67f9e85a0caa9537a221195f4c80c00"}},{"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":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"534113c2df7b4305bab96cf53d0c9c3523ed2d32923a665f167ccf3cb28cd156"}},{"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":1380}}}],"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":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"473330d971287e6af898b3686e194134f77d7939b438597d9965fc1a833b39a3"}},{"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":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fd2c960e0a57dff57621da933e351ca376d01c953c9fc12150eb299b71a09a"}},{"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":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0970ec66a4911b8a503009d1c7785b6ab875212ec1ac2a1ca9ad59f44012eecf"}},{"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::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":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e23977a7e6f888d25f58d23788c273412b12aae22ef29fa9a8f5443089657"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::ruff_cmd::filter_ruff_check_json (cognitive 19): rtk::cmds::python::ruff_cmd::filter_ruff_check_json has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 7 (8 pts), match/switch 1 (nesting depth added 4). 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/cmds/python/ruff_cmd.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ba138075d16f7cf232d1b695da5693128f10ca7018f7bbf2b33caaca3664d"}},{"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":720}}}],"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":816}}}],"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. This shape REPEATS in the file: one other method here (rtk::hooks::init::instructions_agents::run_antigravity_mode_at) 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":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddac7a7f6d6176faaaa9793f5bcc0d4970e6071760d9375a52c32fbf8b760713"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::instructions_agents::run_antigravity_mode_at (cognitive 19): rtk::hooks::init::instructions_agents::run_antigravity_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. This shape REPEATS in the file: one other method here (rtk::hooks::init::instructions_agents::run_kilocode_mode_at) 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":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2302d983d92ecbb0aa33037c260738e57ca5b8c0897b08c01aecba1181e9c3"}},{"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":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b90d29038dcd26db31b44d4e43635b24517e774bf0a0786fd48c1922218908"}},{"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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea25dbfb212664bc006c81215d55abf6961c4e31c980d77a06858c1c62e23bd"}},{"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":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a5552f4e5b23f0b447cbf6a8dc4708c07996d7875f3eae782ac4615ae7dfae"}},{"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":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db5365dd4336833156e54ccc451044d894cf8bc7c1c0b8bad452486d2e6aa2b"}},{"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":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84610cbfb471c8a51b134917c1c04e79b49a2c546c43226b166ef0b76d41a51"}},{"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::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":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"80325dcd8134025171726eb8c3ba5d74a8471d7eab97daa7cad7e15c3dca0025"}},{"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":25}}}],"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":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9758d7a2db27b9803c3d6ddd34bbd0913b7499fbe628a8d76051e5f1133e95"}},{"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":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c8afc4e2026f244d4f218d9156508cd33517da0783d377f6d34481f305b088"}},{"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":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd81dc27fd3d8f14664f7eddeb9cbb7c9fe66dfd056e3ed7ab1f173b94d674d"}},{"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":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"df056d422619ef56470660644295ddc2801e09fe3afb33049fdb055553102d34"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::discover::report::format_text (cognitive 18): rtk::discover::report::format_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/report.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fbe2bcd879e1aa3ddbbbbcf184956753320bbfb608e00dbbf28d30cdcb88f0"}},{"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":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a6e59a8a4d7ab2891a0de66a5e9fb8775fa72850b249e674045c3f4b659dce"}},{"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::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":1133}}}],"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":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a6870c2babac44c15435bf7a880861f02b5f21868af863194c1b85696afb0c"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::system::pipe_cmd::auto_detect_filter (cognitive 18): rtk::cmds::system::pipe_cmd::auto_detect_filter has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, 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::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":1405}}}],"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":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7bcf763c3bda3e63b95f58b6959e741b56faf71988339a50a8233e1d7b77c4"}},{"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":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d600dcfb2d7a28d9ae594234e21264b5bc278c16d39f501ad526add0794ab"}},{"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::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::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":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e6b7b30b8829be7ec90561767a35d8b2e5e07e81cfc18aef974ce4aed59a2a"}},{"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":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ccd9579fc96bd60ce9533a46e484bdd03b17619fd78eca2c1806e040eb9d8"}},{"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":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f89c6ebf805cc43c507ca175e3c0dc9d0c688a53d55d9436994e12c11a1975"}},{"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":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c729be9728699b046053460ade1da5916b82f521a798011bf91c0339eac29d"}},{"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":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9316e21652a49b15cfb0f2e176f1d7e42d0c403713b1a880a856bf063acafb"}},{"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":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abebba49f57a542cd3bf7cc0ad915746cd2d5a47cdadb81d0172d3065cb6eda"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::claude::run_claude_md_mode_with (cognitive 17): rtk::hooks::init::claude::run_claude_md_mode_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d2ef114207392e6a353b6da67a9bb78d4aa3478e62ce59bd17a392db8ccb9"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::hooks::init::claude::run_default_mode (cognitive 17): rtk::hooks::init::claude::run_default_mode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/claude.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"977ecd90b8972ec4f452af57e0addfc5f81d91d320149270133ef5a92bb13f9c"}},{"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":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48cccc8505bd03615a7b448052e5b87d27b6f066eaecc36b53c1266ab77987b"}},{"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":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a239d248c81d3b4fa53bef2b164f8f756061354deeb7db6522dd54d1a1baa"}},{"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":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"920eb94079ee2caadb9a3add0a7c64aef23bb6444a2f3665412d87ada029e54c"}},{"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":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"608733d1396466f70ecdd33806aec2dc32f7bf8808bb76a77186e75ba15e5415"}},{"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::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":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"786cdf9cd88f96712d5a2737c75651126004a527911fdd02331ec9dbde4ff27f"}},{"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":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ce789b039193c68ceaa6b846681f2e330702ebaa4c072e4ddca6bc0b8744f"}},{"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":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"14babe33ad00c770c0534996699cbeb28166b1c64477a6d8792ddd416edd8b73"}},{"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":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"655c39bf9992e16931a87d32ad839af6bacdd68b33a57c6f81a51bf432d193d3"}},{"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":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae2b4247ae518d5eb4632c4491e2353861ebf789b11f094b202340770558ea"}},{"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":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d74742f30bbb540ed7bb67866039b671644853605d4923f043ed4b4940843c"}},{"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":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"14faccab6fff0acaab9480486ab3ec7d083c6e846774b77677d8a16185ad373e"}},{"ruleId":"D2","level":"warning","message":{"text":"rtk::cmds::python::pytest_cmd::parse_summary_line (cognitive 16): rtk::cmds::python::pytest_cmd::parse_summary_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99057fb10b219ae5c51b9eb57ca4f81d5e54b285b1b14fa6451c251dab4f6c"}},{"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":924}}}],"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":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6666a93ff61c136421e819db1795a53185559d301f90beeb3e5a322cbf28b0"}},{"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":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad679ff6c1f252c9330152e0142ba1bbc2db1dfb419bd06f3549fb5e6e37c192"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::run_cli: FunctionTooLong \u2014 rtk::run_cli runs 981 significant 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 881 over it, 9.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df6baec1616adc996cbaa42e0127cd63dc5ecef302ca785526e6ab8bd608a29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 2138 significant 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 1638 over it, 4.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051fac64e936f7c1865babf7d506a8673f918fe3a29b7d5daf1e9c85ef2e6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/git_cmd.rs: FileTooLong \u2014 2111 significant 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 104 free functions. The bar is 500 significant lines; this is 1611 over it, 4.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9697d412324bff093c4c1d7d9e1b3cf0574b1a1e3c93fbae177a136dbc82ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/diff_cmd.rs: FileTooLong \u2014 1322 significant 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 822 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/diff_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeebdbab102d3cb74c47b7a1f3cbe9b72663fbeff6e5e3540cb4737be967de5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::analytics::gain::run: FunctionTooLong \u2014 rtk::analytics::gain::run runs 250 significant 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 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f7eef88825cf75649e2342fb7954511c3012afb65f37ed7d8f3d94d9bb9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: discover/registry.rs: FileTooLong \u2014 1195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 695 over it, 2.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/discover/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21b5432fedc5dc55afb6e77227893c5b74bf3b5121064cea32a9de73e88c03b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/mod.rs: FileTooLong \u2014 1121 significant 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 621 over it, 2.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/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b305ad35047f000fdc61ef79644567d2a9b95f00bd57ac5c890b7745a8840099"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::discover::run: FunctionTooLong \u2014 rtk::discover::run runs 211 significant 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 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"52650bfb74b51e9d67e5f2792548647798101e2e262e14a40953b5f9e1813a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/aws_cmd.rs: FileTooLong \u2014 1025 significant 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 525 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":"FunctionTooLong: rtk::discover::lexer::tokenize_inner: FunctionTooLong \u2014 rtk::discover::lexer::tokenize_inner runs 195 significant 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 95 over it, 1.95\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":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b1166d0b51a7a1d27a31aeda0d355b8b1ab9c55c33e438a5c1c12e637b9436"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/tracking.rs: FileTooLong \u2014 974 significant 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 63% of them inside a single declaration: Tracker (2 blocks, 93-1578). The bar is 500 significant lines; this is 474 over it, 1.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c187e02de732dc9b277d853ea12267b0e6f7a4f88c5939299167b1c8156ef"}},{"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":"FileTooLong: rust/cargo_cmd.rs: FileTooLong \u2014 937 significant 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 437 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/rust/cargo_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29da0368f6e7963b58b69142528509aca9a228e8dd54f33ce71d831ddffa51e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotnet/dotnet_cmd.rs: FileTooLong \u2014 924 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 424 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b210ad1c21d6d19004cee3e16d36fd1c0ff663e83fde49563628f3ba6ce1ad"}},{"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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a593968b781add784479a6290cac0843af1148b27349ff61ef17cbfe8f65f5b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotnet/binlog.rs: FileTooLong \u2014 821 significant 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 321 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d803cc77ea4cb6cb4e5193af13ea54d31823ad10d6761b9fc0d22a390cc73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::init::uninstall_with_patch_mode: FunctionTooLong \u2014 rtk::hooks::init::uninstall_with_patch_mode runs 162 significant 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 62 over it, 1.62\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":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d789ca104d69a6fd7d869b02c2669f8a8a14845a083dbf1852dca22f87a420cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::hooks::init::show_claude_config: FunctionTooLong \u2014 rtk::hooks::init::show_claude_config runs 158 significant 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 58 over it, 1.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/hooks/init/mod.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"692c7d2b30098f2376932fa716dfbd7d2c5aea0a54fcdeaa97684ee837f5ab45"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tracker: ClassTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 2 blocks, lines 93-1578. The bar is 400 significant lines; this is 217 over it, 1.54\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f34c38f84cf2b9cdfad57614baea5f5fb856069a84897ed7ff60f8ddd17205"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jvm/mvn_cmd.rs: FileTooLong \u2014 770 significant 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 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/jvm/mvn_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5144a64bf02ec2caa68f6e8fbb74a475a1df33641f42b0814e616116aede33"}},{"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":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313fb0e428ded01a1a1a7862ac12e65ebb06f8112dddf7ce71ceed6616f77ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/gh_cmd.rs: FileTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 236 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/gh_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68214178d5ebfb7dbf00cb10e451580369f65f865fb16f364b1961d17be0433"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rtk::core::utils: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/utils.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a904155803248a70fe7057e6cd520b1c78d3cd68d6ae6546eccf280db19325"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: system/search.rs: FileTooLong \u2014 729 significant 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 229 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":"FunctionTooLong: rtk::cmds::git::git_cmd::run_show: FunctionTooLong \u2014 rtk::cmds::git::git_cmd::run_show runs 145 significant 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 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ce4ddd8a97fff96248fdf788dcd4fc707231fa43151ffe8fc8b0ac0d835885"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tracker: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracking.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a8c335863a53b1381649129f1a7d6fe6bfedd6af50b06b7cacfc90905627f0"}},{"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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d3a84d3e665c7a88325a97e1aef41aac4ee59ca8e8e4b5a9cfed7419b2702b"}},{"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 129 significant 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 29 over it, 1.29\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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a466d4c47e4a2e4e8f0bd5d44739e5b9acdfbd2eefcef7a78f8466efed77efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/glab_cmd.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 143 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/cmds/git/glab_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea06711c89f254840b911c299a43f936931ae197b52c7faf3e2539fa70206d6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analytics/gain.rs: FileTooLong \u2014 638 significant 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 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/gain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c9d3e4a8bf26cb62eee6db1a4eb728ef6abc395f609e97d53ac098fdb4c14d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/runner.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6509bf96e51868b532f194e13435083cd9aa2e64e176dce18d1ecc229af8370a"}},{"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 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/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"272956d833602f042df8579a24d105ab114f9de60f01298fb9c65da878bceeda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/hook_cmd.rs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0b53de731b682621d0233499f5d3fe5407f8dfcf5c8b93355c3256be5fc14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/pi.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/pi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d3b862a2a38689181876a5cf579cd84892bb5139a03d1df8b744a0e0178f73"}},{"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":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43be56b7c248341f5e760c92cee0d7fff4507d056be245622b335276c4b3b6a"}},{"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"32448e57c7e964380983d0956e78c5c20306fdd242c2d9d32ba8053a71f72e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analytics/cc_economics.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/analytics/cc_economics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6a517443dd8e39918da96ce4511a272940db0d8aeab466bbd1ffc048c2d943"}},{"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 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/python/sqlfluff_cmd.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979aa9b7d65af1c7589c48f6e8d39e1271414ede5b0ff2a6539373e5a83ba1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/container.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a36c836f1eb619f4eb9c1aef1090c2653115b0aea03d26aacb25c8bab765dc5"}},{"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":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4777d9d15b60852da7c6fd4113ecad222f08660f06cc7ffb1053778b21481f8f"}},{"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 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/go/go_cmd.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfccd3344846c48af4ebd7f441090261255b3c5e3276f2584247103e520b8481"}},{"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":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d95ae006b23192b5f8094a9051c5ba7886263d76b6f4a7e6520516a9c9c222"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/codex.rs: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/codex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7deb92e1e1c1a7f91c7418df9c8ed4ba71a0d8f3b8006ad10fbd5178b6ec34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/retriever.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 35 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/core/retriever.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2479be73b70a98e9fab11c184a9b79cc68fa31d1834623f8acc32a348fa02558"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: system/ctest_cmd.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 54 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: system/find_cmd.rs: FileTooLong \u2014 550 significant 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 50 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/cmds/system/find_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47edcd5db8be5a2eec9b2224f19a8c0419826a74952aa6d434d98c381e37ab3a"}},{"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":1373}}}],"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":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"890f6479c30c1048a0b78dabdc1594a03e9c0873ec3c0e3d48097abb92217e64"}},{"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":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26e6e166d9210653a63db4e460aae636e6b300832b94f3a23255cfac758cac5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Commands: ClassTooLong \u2014 431 significant 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 31 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"911360bc99b358d2f226396c935025c5f7a4179857bfcb40456632b748e1c6b8"}},{"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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f83317304717eb038194e4e1e1c1b1de863564e5bbbc96b3eab87ba0683672"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rtk::core::runner::extract_test_summary: FunctionTooLong \u2014 rtk::core::runner::extract_test_summary 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":"src/core/runner.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1cbe170055e5c694bf8c6df66a3a05a76995bfcb9a875f2e862e21b24d965"}},{"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 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_cmd.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4031da401c5ef36089d50edd7751e0346937bfcf621a36445d9a4225b30c72a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 5 shared lines): src/cmds/js/lint_cmd.rs:255-351 | src/cmds/js/lint_cmd.rs:354-480 | src/cmds/python/ruff_cmd.rs:131-266 \u2014 These 3 members are variants of one another: a block of 5 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"691223aa72bc89942a6691f8c7e18292f73ffb4a4184097cdda0bad90e1c4369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/cmds/python/ruff_cmd.rs:360-374 | src/cmds/system/format_cmd.rs:272-286 \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":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"076e3079d1a0c5cef00c3adebfe768945cca99794a85e6c1008b64bfe3bb313e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/cmds/cloud/aws_cmd.rs:825-852 | src/cmds/cloud/aws_cmd.rs:945-982 | src/cmds/cloud/aws_cmd.rs:984-1007 | src/cmds/cloud/aws_cmd.rs:1135-1187 | src/cmds/cloud/aws_cmd.rs:1238-1282 \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":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"9362481d7f2ea2b8ca8c5d284d3d17c4d1f648d507ad91c16bef2196586fb9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cmds/git/gh_cmd.rs:244-292 | src/cmds/git/gh_cmd.rs:670-710 | src/cmds/git/glab_cmd.rs:299-345 | src/cmds/git/glab_cmd.rs:537-580 \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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75099744abb832528e282540ca72b9330aa7bedc52e2566a17ecfac2a5eccd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/hooks/hook_cmd.rs:63-92 | src/hooks/hook_cmd.rs:691-747 | src/hooks/hook_cmd.rs:802-823 | src/hooks/hook_cmd.rs:923-959 \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":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b857878ded0110b1335bc28130e5cf9232bb9b0f0368f4dfe1f57758b53d3d9"}},{"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":"dba896f4ce46263329949ebc2389fb4121fdcbc93cfbc7056b98eea1f7def4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60\u201370 lines \u00D7 2): src/cmds/git/gh_cmd.rs:29-98 | src/cmds/git/glab_cmd.rs:44-103 \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 12 separate duplicated blocks between them, totalling at least 193 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":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ab93c765d962dc981bfe211aeab24e037eedc61738b1a0898110ae26e49a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): src/hooks/init/copilot.rs:149-189 | src/hooks/init/copilot.rs:277-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/copilot.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"452c7d8b7b361dc7b19befba661118cc14102fa660effa73e5a9564f7b806437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201337 lines \u00D7 2): src/cmds/jvm/mvn_cmd.rs:1505-1541 | src/cmds/jvm/mvn_cmd.rs:1623-1653 \u2014 both copies are in the same file, so extract the block into one function there 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":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b903c52dc5ebe695251e300bf7bd9880a05f2128e9e900c7a48426d882760ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/cmds/git/gh_cmd.rs:133-162 | src/cmds/git/glab_cmd.rs:185-214 \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 12 separate duplicated blocks between them, totalling at least 193 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":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc46baaf76b57d2fc47a9cd315ab9c6934e1f712e9f9b30e3c5250a2f5cd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/cmds/git/git_cmd.rs:3410-3438 | src/cmds/git/git_cmd.rs:3452-3480 \u2014 both copies are in the same file, so extract the block into one function there 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/git_cmd.rs"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff96cba2ca1f8c79ae75d81406f6b8302237c832884619de9648c78bbb42b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): src/cmds/jvm/mvn_cmd.rs:1355-1382 | src/cmds/jvm/mvn_cmd.rs:1601-1624 \u2014 both copies are in the same file, so extract the block into one function there 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":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8518d9d842d40bb4b282110679378a9828d6c71476970f6efd68b3927ce6232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/cmds/system/read.rs:98-123 | src/cmds/system/read.rs:177-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/read.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ed42f28da9664c5ac2057fa7dd37661fc1f0fabe92b10be9240e4339e8f81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/hooks/init/claude.rs:374-398 | src/hooks/init/claude.rs:574-598 \u2014 both copies are in the same file, so extract the block into one function there 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":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c907434e967de2a8f11677eb136fcd47972fbedf6463527764b5b092d757193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/cmds/system/log_cmd.rs:146-167 | src/cmds/system/log_cmd.rs:188-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/log_cmd.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c798b8fc438a15a3d5d79c704e105cc4ac1394a4e5636d3b2869282c00fce34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/cmds/rust/cargo_cmd.rs:165-180 | src/cmds/rust/cargo_cmd.rs:1198-1214 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cargo_cmd.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b705127982c02032ee94b41ac74b43c96014dd4771bb91564475ca538f42369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/hooks/init/trae.rs:149-165 | src/hooks/init/trae.rs:301-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/trae.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4824db7a453d915059d05b101a546e0e2aa63726f969320104a3c20523f83a5f"}},{"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."},"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 (15\u201316 lines \u00D7 2): src/hooks/init/instructions_agents.rs:140-155 | src/hooks/init/instructions_agents.rs:199-213 \u2014 both copies are in the same file, so extract the block into one function there 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/instructions_agents.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b7a7bc740d0d5039a9bfea1c741c029b5dd13aabb44ae9f1136e19f47a0130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): src/analytics/cc_economics.rs:202-215 | src/analytics/cc_economics.rs:232-246 | src/analytics/cc_economics.rs:270-283 \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/analytics/cc_economics.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89e0ccf394aacfa070b911ef4d2029a64e6e37da4bee4b1ac3c501335eae2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/cmds/cloud/aws_cmd.rs:342-356 | src/cmds/cloud/aws_cmd.rs:441-454 \u2014 both copies are in the same file, so extract the block into one function there 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/cloud/aws_cmd.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fab3026be9d3e6a7aac1b13c9959cad238a6b7d29ec935586bbb1484a74a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/cmds/dotnet/binlog.rs:686-698 | src/cmds/dotnet/binlog.rs:1013-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/binlog.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e727bc3d3796869b1bd70a7253db2d5031352ae2137bc5bc2905cb75c5235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cmds/js/lint_cmd.rs:305-319 | src/cmds/js/lint_cmd.rs:429-443 \u2014 both copies are in the same file, so extract the block into one function there 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/lint_cmd.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2992c85d09322468b2162488dd1c2dac277e47343f5dc5182516d4f4753c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/core/telemetry_cmd.rs:164-178 | src/hooks/init/mod.rs:780-794 \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":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41a1889637bfb796fe20f1134870b2d688e9ceee3ea2563f8f374377626ce8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cmds/php/ecs_cmd.rs:46-60 | src/cmds/php/php_cmd.rs:71-85 \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":"src/cmds/php/ecs_cmd.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f083d71c4d6197590ad3b55d3b939772dd3446a261d18ce7037ed32815fbcd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/cmds/dotnet/dotnet_trx.rs:232-246 | src/cmds/dotnet/dotnet_trx.rs:272-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/dotnet/dotnet_trx.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ef25a5297dbf20ff50766f5fc56485ae797d701d0995e2df4515eca7fb3e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/core/tracking.rs:1099-1112 | src/core/tracking.rs:1174-1187 | src/core/tracking.rs:1247-1260 \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/core/tracking.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b138c48e6a8a18e47fd6b8a17dd473eef741504a8aa556abbba8bf23ccddce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/analytics/cc_economics.rs:596-608 | src/analytics/cc_economics.rs:634-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analytics/cc_economics.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65000cfc503359aa912e034e8dd0794761c6b7d5e3ff6b54b4e743c9bf8c9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmds/git/gh_cmd.rs:405-418 | src/cmds/git/gh_cmd.rs:621-634 \u2014 both copies are in the same file, so extract the block into one function there 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":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42726f7f9b9890b45a5e5a382c55a74ec38c1062a0644d0152bad38c44002eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/cmds/git/gh_cmd.rs:671-682 | src/cmds/git/glab_cmd.rs:538-551 \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 12 separate duplicated blocks between them, totalling at least 193 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":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e011f85a6bb95711800d7604fb08e87a914749306e272f3700adfc085f5fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmds/system/read.rs:291-304 | src/core/retriever.rs:124-137 \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/read.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9a04ff124c5044a6a796d26f4252da2f107ceedc0bd0ac53ed62d21a03803c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/discover/lexer.rs:175-188 | src/discover/lexer.rs:214-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/lexer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7551720111930f0db9154502384cb982d97d7401adca0999eb59c654ed4284b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/hooks/hook_cmd.rs:68-79 | src/hooks/hook_cmd.rs:694-705 | src/hooks/hook_cmd.rs:804-815 | src/hooks/hook_cmd.rs:931-942 \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":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e606e3666a84390039f4b9c5312d6fe66abe3715e2af9803fda079253120a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmds/dotnet/binlog.rs:760-771 | src/cmds/dotnet/binlog.rs:785-796 \u2014 both copies are in the same file, so extract the block into one function there 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/binlog.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ca2d1121c848c3df7024649dd5726554047bed1e013c77c52debf9303faa37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): src/cmds/git/gh_cmd.rs:272-283 | src/cmds/git/glab_cmd.rs:328-334 \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 12 separate duplicated blocks between them, totalling at least 193 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":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdec40b90408624bbf8f91fcf70e6faeda7515a2c8fa9352a70a8ab05ec19fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmds/git/gh_cmd.rs:689-700 | src/cmds/git/glab_cmd.rs:558-569 \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 12 separate duplicated blocks between them, totalling at least 193 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":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"da403631f4bc8df9c1a784919be3438442ac4c396227ae190199e1b7c3966aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/cmds/js/lint_cmd.rs:331-339 | src/cmds/js/lint_cmd.rs:457-468 \u2014 both copies are in the same file, so extract the block into one function there 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/lint_cmd.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9e47fd17c4d5cf0549fc8ddeffd8cf03e5bd85adea38e846beeb72dfbb3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/hooks/init/mod.rs:475-486 | src/hooks/init/mod.rs:501-512 \u2014 both copies are in the same file, so extract the block into one function there 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":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed15fef5a2c747993a99a45d1c169975fb8da60ac239e1a9a92c58a6dbe1a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cmds/dotnet/dotnet_trx.rs:297-308 | src/cmds/dotnet/dotnet_trx.rs:310-321 \u2014 both copies are in the same file, so extract the block into one function there 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_trx.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2560fe7cdd0b339f6f95a872018b91bf13fe10ec2817d6a455ad5798529ce2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/cmds/rust/cargo_cmd.rs:274-284 | src/cmds/rust/cargo_cmd.rs:306-316 | src/cmds/rust/cargo_cmd.rs:333-343 \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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dffa4e943981e5e042189e41ce04b6390376ccc99b44c655fd033caabb85e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/cloud/aws_cmd.rs:636-646 | src/cmds/cloud/aws_cmd.rs:661-671 \u2014 both copies are in the same file, so extract the block into one function there 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/cloud/aws_cmd.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc85bb4dbc12d271999242094aa64234e13d366e1849c047a4a55896ca53e960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/dotnet/dotnet_cmd.rs:163-173 | src/cmds/dotnet/dotnet_cmd.rs:193-203 \u2014 both copies are in the same file, so extract the block into one function there 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":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b9a7d19111597bb0b087bcdafccaa03e5d4e3a04f3f4a6efbd4f02e2121d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/git/git_cmd.rs:2546-2556 | src/cmds/git/git_cmd.rs:2997-3007 \u2014 both copies are in the same file, so extract the block into one function there 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/git_cmd.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"779eda39a853f2081f822cfe15143235d1f7eac158514d253957ed6131aa8671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/js/tsc_cmd.rs:324-334 | src/cmds/python/mypy_cmd.rs:179-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee55365f47b17fe425c5682e87839198f299501230f318f128022c2e63425b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/cmds/jvm/mvn_cmd.rs:1308-1317 | src/cmds/jvm/mvn_cmd.rs:1557-1567 \u2014 both copies are in the same file, so extract the block into one function there 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":1308}}}],"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/hooks/hook_cmd.rs:273-283 | src/hooks/hook_cmd.rs:340-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/hook_cmd.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39e4e3ff3f3484f9cc15c252172fe3c969eb5ef6932b893884a0f507fe7a187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): src/cmds/git/gh_cmd.rs:276-285 | src/cmds/git/gh_cmd.rs:694-702 | src/cmds/git/glab_cmd.rs:328-336 | src/cmds/git/glab_cmd.rs:563-571 \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 12 separate duplicated blocks between them, totalling at least 193 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":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04f7cf186831dfd12e73535f62e50e69eb02cac19b334308de5f5513cad6ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmds/git/git_cmd.rs:2438-2447 | src/cmds/git/git_cmd.rs:2469-2478 \u2014 both copies are in the same file, so extract the block into one function there 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/git_cmd.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89de17e455b22dbdc46444add8835eded676c3505f80385259876b59a2f58f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/discover/mod.rs:273-281 | src/learn/mod.rs:27-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/discover/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc98beb86727e2e55181060cfb183e8c66ba319ce847788eb77e98837b0f8028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmds/system/json_cmd.rs:169-178 | src/cmds/system/json_cmd.rs:257-266 \u2014 both copies are in the same file, so extract the block into one function there 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/json_cmd.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c34b866e30263bdfd784de663c20cc4aa0e171da382929af9ff0fa2ce4542c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/cmds/python/ruff_cmd.rs:295-303 | src/cmds/system/format_cmd.rs:170-178 | src/cmds/system/format_cmd.rs:183-191 | src/cmds/system/format_cmd.rs:199-207 \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":295}}}],"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."},"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a8524a780fc9e0b7666e808cd9c24f99cc651d325c770a6e52013f354608ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmds/cloud/container.rs:169-177 | src/cmds/cloud/container.rs:181-191 \u2014 both copies are in the same file, so extract the block into one function there 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/cloud/container.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da994a5767c2c9570310325b18dbb2a2c4bfe04fe61e46b3e43751036a6041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/cmds/git/gh_cmd.rs:436-443 | src/cmds/git/glab_cmd.rs:410-418 \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 12 separate duplicated blocks between them, totalling at least 193 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":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c37494168eb921908d124b2d87419cae8fa6ef5380c66bb6a69180d573fdffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/cmds/git/gh_cmd.rs:757-764 | src/cmds/git/glab_cmd.rs:614-622 \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 12 separate duplicated blocks between them, totalling at least 193 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":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb3bedd0b9d8c03d2329b73c1f9abf4c2883270694933c668ecca39961a6ab"}},{"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."},"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/hooks/init/agents_md.rs:125-133 | src/hooks/init/agents_md.rs:316-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"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/main.rs:3310-3318 | src/main.rs:3332-3340 \u2014 both copies are in the same file, so extract the block into one function there 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/main.rs"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cccbff2b36952d90d6599ac2ce3abdf5ea37c1687daaeecb9b248be0bc3ac10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/analytics/cc_economics.rs:222-229 | src/analytics/cc_economics.rs:260-267 | src/analytics/cc_economics.rs:289-296 \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/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:2546-2553 | src/cmds/git/git_cmd.rs:2997-3004 | src/cmds/git/git_cmd.rs:3134-3141 \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/git/git_cmd.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"260514712f551807c0dd62bb023c5495214509884b5860629dca4b1f217ad245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/python/ruff_cmd.rs:367-374 | src/cmds/system/format_cmd.rs:279-286 \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/python/ruff_cmd.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1be63eee040ab22e16ecb6e3e5386a79afb7fb3d72acdbde7b2b4e34f88a334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/git/glab_cmd.rs:439-446 | src/cmds/git/glab_cmd.rs:642-649 \u2014 both copies are in the same file, so extract the block into one function there 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/glab_cmd.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61d3ab882e3f44dc163bbdce93f92c985c382ece4739f44ef7e3d9639d05662"}},{"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 (6\u20137 lines \u00D7 2): src/core/toml_filter.rs:208-213 | src/core/toml_filter.rs:743-749 \u2014 both copies are in the same file, so extract the block into one function there 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/toml_filter.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f251e75914cda74cfa0e4d67f07b5250785d143f5d1be0f08540ce2b54ae23e9"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ddef60ff1f941971569fcad55e47bcc17c44cebd2c9caf9dd5b8e9aa8df9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cmds/go/golangci_cmd.rs:381-386 | src/cmds/js/lint_cmd.rs:406-411 | src/cmds/python/ruff_cmd.rs:170-175 \u2014 before extracting anything, compare \u0060src/cmds/js/lint_cmd.rs\u0060 and \u0060src/cmds/python/ruff_cmd.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/go/golangci_cmd.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"442cb3a5725923074a87412c9cb93b942ab028963b1599dd348e8a27215527d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/go/go_cmd.rs:589-594 | src/cmds/go/go_cmd.rs:626-631 \u2014 both copies are in the same file, so extract the block into one function there 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/go/go_cmd.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e8757f053104936f6dfeb65383125e67ddcd804870c806f068216da37fefbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/js/tsc_cmd.rs:349-355 | src/cmds/python/mypy_cmd.rs:193-198 \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":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39da223b553dd592892cf617fc6ea809ba7e2202bcab2ee738e57b30e7828a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/python/pytest_cmd.rs:81-86 | src/cmds/ruby/rake_cmd.rs:108-113 \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/python/pytest_cmd.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1a813a0cd5720bb1265b3138c5fbad5c3944a3a35ea9a0e3fe4146de46ce16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/rust/cargo_cmd.rs:1029-1034 | src/cmds/rust/cargo_cmd.rs:1403-1408 \u2014 both copies are in the same file, so extract the block into one function there 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/rust/cargo_cmd.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"e059432ca47a55c348411dd064f3f1b9dfbf178fdaeec11ac3b20baa918a1f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main.rs:3298-3303 | src/main.rs:3320-3325 \u2014 both copies are in the same file, so extract the block into one function there 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/main.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"23df5efa5c51a805d429a53089c21365dbadd5fbe97a758ef0d1b3ff6a21e8ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cmds/cloud/container.rs:97-101 | src/cmds/cloud/container.rs:169-176 | src/cmds/cloud/container.rs:181-190 \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/cloud/container.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6acbe7b08d51ca6a36238c301b0b88beb108336961f722b41e340bf8f284092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cmds/js/lint_cmd.rs:330-334 | src/cmds/js/lint_cmd.rs:455-460 | src/cmds/python/ruff_cmd.rs:212-217 \u2014 before extracting anything, compare \u0060src/cmds/js/lint_cmd.rs\u0060 and \u0060src/cmds/python/ruff_cmd.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"540d8b425a077448438a06f343162907fc65cb1fe22d89d32a0c96183bb05835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cmds/js/lint_cmd.rs:528-532 | src/cmds/python/ruff_cmd.rs:361-365 | src/cmds/system/format_cmd.rs:273-277 \u2014 before extracting anything, compare \u0060src/cmds/js/lint_cmd.rs\u0060 and \u0060src/cmds/python/ruff_cmd.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6685789a3c76b1a488e07e81e9acdba5880c6106bf9b077ac999028584c613ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/core/tracking.rs:1078-1082 | src/core/tracking.rs:1152-1156 | src/core/tracking.rs:1226-1230 \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/core/tracking.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ede1f4c07d01ce339a3031fa0ffc8a71217bc3c529951f5ff91caaac501e63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/gh_cmd.rs:104-108 | src/cmds/git/glab_cmd.rs:109-113 \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 12 separate duplicated blocks between them, totalling at least 193 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":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1e8f7ce56f435fb24486d499b322f2da1fc8c66cacb84e1967a9ac0c26da8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/gh_cmd.rs:262-266 | src/cmds/git/gh_cmd.rs:680-684 \u2014 both copies are in the same file, so extract the block into one function there 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":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfc091b4bd93fb2067d67b9245e1b2867e0a6432e051b6869022a678268d00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/js/lint_cmd.rs:444-448 | src/cmds/python/ruff_cmd.rs:202-206 \u2014 before extracting anything, compare \u0060src/cmds/js/lint_cmd.rs\u0060 and \u0060src/cmds/python/ruff_cmd.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed4bdcdcb4dfee44c6aedf09fd5f339f123dc6a9aea75c136e21b2931fdca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/js/tsc_cmd.rs:44-48 | src/cmds/js/tsc_cmd.rs:52-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ad62dc16a6364985e61086cbaeea0c5182b3c51a425d20a96b7ec8b6681d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/system/find_cmd.rs:710-714 | src/hooks/hook_audit_cmd.rs:164-168 \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":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"35836d3edae8c6bd1a3bb01862716f8e7b291b7786171849e89613aae9378565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/core/retriever.rs:324-328 | src/core/retriever.rs:722-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retriever.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f679a270acf47855059db6388306dd3851e54c1997903e960f1d7cfffcaf91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/glab_cmd.rs:319-323 | src/cmds/git/glab_cmd.rs:549-553 \u2014 both copies are in the same file, so extract the block into one function there 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/glab_cmd.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b16e70ad7f925f0f846605c8fe4d3faaddfea7331e8e2d0f49c59e1ac5e768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/gh_cmd.rs:167-172 | src/cmds/git/glab_cmd.rs:219-224 \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 12 separate duplicated blocks between them, totalling at least 193 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":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c043686f078c51115998b1bda938a112c4ec67dfe0548bab21e4951cd48f2bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/hooks/init/pi.rs:568-585 | src/hooks/init/pi.rs:811-825 \u2014 both copies are in the same file, so extract the block into one function there 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/pi.rs"},"region":{"startLine":568}}}],"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:87-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/agents_md.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbcadba924a26b264da6e4179657f6e364a8d0588e4b58c968e933a23aad3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/core/tracking.rs:987-1001 | src/core/tracking.rs:1018-1031 \u2014 both copies are in the same file, so extract the block into one function there 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/tracking.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f31e77cc1a062ae9287fedb116a6ac6875c7f90619b658defd97277b9f00136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/hooks/init/copilot.rs:77-91 | src/hooks/init/copilot.rs:207-218 \u2014 both copies are in the same file, so extract the block into one function there 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/copilot.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75c19b6ec1a438a7decd8854ef91577705c6e3e24506dc08d834901ac2b2b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cmds/php/paratest_cmd.rs:12-25 | src/cmds/php/pest_cmd.rs:12-25 \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":"src/cmds/php/paratest_cmd.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e79b61d09dfe0bb3eba2d40a833a75cc0029b0b31179afca5cb1171713a657d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/hooks/init/instructions_agents.rs:40-52 | src/hooks/init/instructions_agents.rs:88-100 | src/hooks/init/instructions_agents.rs:142-154 | src/hooks/init/instructions_agents.rs:201-213 \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/init/instructions_agents.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"85baa0aeea53e91465ff4c092d50620f4c7553b5df76a8467b68a2f515d4ad5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/hooks/hook_cmd.rs:618-630 | src/hooks/hook_cmd.rs:889-901 \u2014 both copies are in the same file, so extract the block into one function there 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":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2bf2d0f4052c1f553cbfe6fe8bae67aebb606ff0b6ae4fa65aa502c758c12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cmds/js/lint_cmd.rs:357-369 | src/cmds/python/ruff_cmd.rs:134-146 \u2014 before extracting anything, compare \u0060src/cmds/js/lint_cmd.rs\u0060 and \u0060src/cmds/python/ruff_cmd.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a32daca85327128affe4e8174c21bbc4cc18e28e2326abd506ce85deafc1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/git/git_cmd.rs:294-305 | src/cmds/git/git_cmd.rs:489-496 \u2014 both copies are in the same file, so extract the block into one function there 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/git_cmd.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d10ae8760314a3debe09f3866de98829e8181f354f7577c62e060779a6f582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/js/playwright_cmd.rs:290-300 | 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/playwright_cmd.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f18c98fc8e14ee0e2341c938f817cea06ce6dc72bf72c42e105104cf821da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cmds/git/gh_cmd.rs:180-190 | src/cmds/git/glab_cmd.rs:249-259 \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 12 separate duplicated blocks between them, totalling at least 193 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":180}}}],"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."},"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 (9 lines \u00D7 3): src/cmds/git/git_cmd.rs:339-347 | src/cmds/git/git_cmd.rs:634-643 | src/cmds/git/git_cmd.rs:3153-3161 \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/git/git_cmd.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"55188238ad1879b839f2711f1b6c050da542f39d4c580250f447b6a878ef9f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/analytics/gain.rs:889-898 | src/hooks/init/mod.rs:716-725 \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":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"271143677e85032ef3a5ce463cffec367fce5977cdd7c4c8fbe547ec18e0e687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cmds/js/lint_cmd.rs:342-351 | src/cmds/js/lint_cmd.rs:471-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/lint_cmd.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b189ca5c06e7884e69ab72d9fb81b9ac9a3fe80be92de73b4f809ff3ec8c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/hooks/init/instructions_agents.rs:26-34 | src/hooks/init/instructions_agents.rs:73-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/init/instructions_agents.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"01597a03b5e091f824116fe0504172fe200b725cbc2413bd2e765eb30c56bf5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cmds/php/phpstan_cmd.rs:225-233 | src/cmds/ruby/rubocop_cmd.rs:233-241 \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/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:614-622 | src/analytics/cc_economics.rs:645-653 \u2014 both copies are in the same file, so extract the block into one function there 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/analytics/cc_economics.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a024cc3dfe3f1c1aaf330b3397c2985b602dc27aa8680f30946a92452fe8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/core/tracking.rs:1503-1511 | src/core/tracking.rs:1559-1567 \u2014 both copies are in the same file, so extract the block into one function there 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/tracking.rs"},"region":{"startLine":1503}}}],"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."},"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/cmds/dotnet/dotnet_cmd.rs:1151-1158 | src/cmds/dotnet/dotnet_cmd.rs:1178-1185 \u2014 both copies are in the same file, so extract the block into one function there 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":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2978a75aae17a0c2c75d80334793b9e58f27b1d98e694b30a4cd0eb7aa48598a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/discover/registry.rs:1351-1358 | src/discover/registry.rs:1375-1382 \u2014 both copies are in the same file, so extract the block into one function there 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/discover/registry.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd5ffb9225f07d7fd1d26d47906edb43d78b78ae6c7bb3124a769aa207393b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/go/golangci_cmd.rs:389-396 | src/cmds/js/lint_cmd.rs:302-309 \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/go/golangci_cmd.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"da23e7f26922cc4ae4b9ef02defec166e63474797155f4d2e7d365d3165746c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/git/glab_cmd.rs:426-433 | src/cmds/git/glab_cmd.rs:630-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/glab_cmd.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d4e9eafb9f5bb8ad4d0fb67af0236d2fda191d592cc9ebf952c2f456284674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cmds/git/gh_cmd.rs:457-464 | src/cmds/git/gh_cmd.rs:858-865 \u2014 both copies are in the same file, so extract the block into one function there 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":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9201b100bfb46d4f567a6c6500db6df25c59919dbfb0dc72dcddb70d008ad1c"}},{"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."},"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/cloud/aws_cmd.rs:1287-1293 | src/cmds/cloud/aws_cmd.rs:1331-1337 \u2014 both copies are in the same file, so extract the block into one function there 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/cloud/aws_cmd.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c293964268636857001438bd619b33b198d86720126559be9d6d484654b6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/cmds/cloud/aws_cmd.rs:827-833 | src/cmds/cloud/aws_cmd.rs:947-953 | src/cmds/cloud/aws_cmd.rs:986-992 | src/cmds/cloud/aws_cmd.rs:1137-1143 | src/cmds/cloud/aws_cmd.rs:1240-1246 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6fdb5a9d1ec5ac583cf65df822577b0c01d5f38143529d69c9c79803a03d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/cloud/container.rs:103-109 | src/cmds/cloud/container.rs:199-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/container.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc264c18cdff31d2a227fc72ff786fb5d113a12b5197d1c4e6a2da63b3ecce54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cmds/dotnet/dotnet_cmd.rs:101-107 | src/cmds/go/go_cmd.rs:155-161 \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/dotnet/dotnet_cmd.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d939c9535414a0729e79e6095069106a0031c38ba3c981e6947d29d9a24d99d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/git_cmd.rs:2961-2966 | src/cmds/git/git_cmd.rs:2967-2972 \u2014 both copies are in the same file, so extract the block into one function there 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/git_cmd.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897e1ef8999dab3044b7ad0ce0ae60bdbe2484280e9a4183ed49582669b7e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/cmds/cloud/aws_cmd.rs:558-563 | src/cmds/cloud/aws_cmd.rs:578-583 | src/cmds/cloud/aws_cmd.rs:605-610 | src/cmds/cloud/aws_cmd.rs:634-639 | src/cmds/cloud/aws_cmd.rs:659-664 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/cloud/aws_cmd.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e869ecf24b9fa254490784a529b6fcf92dcaa1304a27af8701cf39d6307cb73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/system/log_cmd.rs:136-141 | src/cmds/system/log_cmd.rs:179-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/log_cmd.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbefce258b00024b9d4eda09785ce5eda41a6c5fd5662d74431462a750d1a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cmds/js/tsc_cmd.rs:233-238 | src/cmds/js/tsc_cmd.rs:329-334 | src/cmds/python/mypy_cmd.rs:184-189 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/js/tsc_cmd.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac9342d596a789f2422fa4ba7ea3ac9f986cd192af82540233074d5a8d71ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/system/ctest_cmd.rs:574-579 | src/cmds/system/ctest_cmd.rs:785-790 \u2014 both copies are in the same file, so extract the block into one function there 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/ctest_cmd.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4afe2e8835c602d2ddc5873fdfec8d6b82fc7faa6dc120f62c07f021c6d283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/gh_cmd.rs:752-756 | src/cmds/git/glab_cmd.rs:609-613 \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 12 separate duplicated blocks between them, totalling at least 193 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":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e6475afe0a441dc770bf079ddfcd4c6d5362429700267a0c24c805381bd266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/diff_cmd.rs:2430-2434 | src/cmds/git/diff_cmd.rs:2440-2444 \u2014 both copies are in the same file, so extract the block into one function there 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/diff_cmd.rs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d100e58a10aa61fa6df9204d4a1935bd0bde428075223c1e6a257edb68d9a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main.rs:2841-2845 | src/main.rs:2847-2851 | src/main.rs:2854-2858 \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/main.rs"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f272adb71f0bdf0b93ff8b80bde465d8e4eda1d7f4b0d0aa723f004865ba97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/core/telemetry.rs:510-514 | src/core/telemetry.rs:520-524 \u2014 both copies are in the same file, so extract the block into one function there 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/telemetry.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff13a2c481db14a41a2046e3c32c64eab51f2eff8bcc733fe6d61a8456afc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cmds/git/gh_cmd.rs:367-372 | src/cmds/git/gh_cmd.rs:739-744 \u2014 both copies are in the same file, so extract the block into one function there 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":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bcae2f10c60cc9540363c797057d98340b6f37e8089656f332794b073bcb7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cmds/git/glab_cmd.rs:358-362 | src/cmds/git/glab_cmd.rs:595-599 \u2014 both copies are in the same file, so extract the block into one function there 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/glab_cmd.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dbd2bf74d847bca8696cd4ac67552693ec637dc72cbe415abeb3e17512f46c"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: rtk::pipeline_stdin_test.wc_preserves_native_failure_exit_code: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3547e3b221e1d6b2f85095a1cb42408bb108b16d7d46f30bfe61b734e6283c88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main.rs: src/main.rs changed 59 times in last 90 days, max cyclomatic complexity 267 in rtk::run_cli at line 2055. 27 of those changes were fix/bug commits, and the other 32 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4bd697ce412d5d6af59543f06e4a0481b7a56e4bd52631de4c8462fa4ed51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/git/diff_cmd.rs: src/cmds/git/diff_cmd.rs changed 34 times in last 90 days, max cyclomatic complexity 117 in rtk::cmds::git::diff_cmd::condense_unified_diff_strict at line 2123. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e034f0ecf6d203731da910b17efb63ab7916cc91aa5f890b5a8e8124912d318"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/registry.rs: src/discover/registry.rs changed 69 times in last 90 days, max cyclomatic complexity 49 in rtk::discover::registry::rewrite_segment_inner at line 1619. 40 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace5e3449fb9db77b60eff1c89faf1ed5d9e1049d30a04a3178a77c47b44088b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/git/git_cmd.rs: src/cmds/git/git_cmd.rs changed 77 times in last 90 days, max cyclomatic complexity 29 in rtk::cmds::git::git_cmd::compact_diff at line 1373. 2 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d2d8902db7bee2723c7ea18b5b4c007871c7f09bee38b1365a9ba04cedabf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/search.rs: src/cmds/system/search.rs changed 38 times in last 90 days, max cyclomatic complexity 42 in rtk::cmds::system::search::run at line 678. 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb29ccf377b792979bfba7fa1158e85a68548ca17f357057abae489133d52f22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/rust/cargo_cmd.rs: src/cmds/rust/cargo_cmd.rs changed 31 times in last 90 days, max cyclomatic complexity 40 in rtk::cmds::rust::cargo_cmd::filter_cargo_clippy at line 1279. 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0338775ea6157c4653b68295c5446dfe799ce509d87b6f9cd15eb192e65f94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/runner.rs: src/core/runner.rs changed 18 times in last 90 days, max cyclomatic complexity 51 in rtk::core::runner::extract_test_summary at line 876. 14 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b65e268ea018f83483d498112276d480ed07c9ebdf72f60b2b570ec4c00e3ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/stream.rs: src/core/stream.rs changed 17 times in last 90 days, max cyclomatic complexity 50 in rtk::core::stream::run_streaming at line 425. 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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/cmds/dotnet/dotnet_cmd.rs: src/cmds/dotnet/dotnet_cmd.rs changed 36 times in last 90 days, max cyclomatic complexity 21 in rtk::cmds::dotnet::dotnet_cmd::format_test_output at line 1252. 19 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb05f4c07edb8bdd272affb7adb0556d0ed36f9707acdd7ba3ac8c4d2c0ca303"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/arg_tokenizer.rs: src/core/arg_tokenizer.rs changed 30 times in last 90 days, max cyclomatic complexity 23 in rtk::core::arg_tokenizer::tokenize_scan at line 366. 14 of those changes were fix/bug commits, and the other 16 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"657037bbf33dc773553ee6d0d48359b5b9a3c031807db4bb9f1cb2d03feae2b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/toml_filter.rs: src/core/toml_filter.rs changed 21 times in last 90 days, max cyclomatic complexity 31 in rtk::core::toml_filter::apply_filter_with_info at line 579. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/core/toml_filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/toml_filter.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7d9c3e182ec6421d0fe32cc4c8912dad571359c1aac0936df0524f582bdbdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/lexer.rs: src/discover/lexer.rs changed 14 times in last 90 days, max cyclomatic complexity 42 in rtk::discover::lexer::tokenize_inner at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd31c80d3feb7f1b69fe369d89f66de2398b58c582a4e878ae6df9c9beafd1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/analytics/gain.rs: src/analytics/gain.rs changed 13 times in last 90 days, max cyclomatic complexity 38 in rtk::analytics::gain::run at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ded1973646712e5bf671c6c38794ec3caac2507fe95c384e8d2eba092007d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/cloud/aws_cmd.rs: src/cmds/cloud/aws_cmd.rs changed 9 times in last 90 days, max cyclomatic complexity 53 in rtk::cmds::cloud::aws_cmd::run at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/cloud/aws_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/aws_cmd.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"41665b3957ae9771f914a5fdd66db5194e69dd6639c5480dc92c9a336dc4105f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/jvm/mvn_cmd.rs: src/cmds/jvm/mvn_cmd.rs changed 17 times in last 90 days, max cyclomatic complexity 27 in SurefireBlock::step at line 592. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0da333de50a871bf4c7cdd3b7a6a0ad8fad49967f97813b4b66bcfd4eb64d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/scala/sbt_cmd.rs: src/cmds/scala/sbt_cmd.rs changed 9 times in last 90 days, max cyclomatic complexity 40 in rtk::cmds::scala::sbt_cmd::filter_sbt_test at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2576e7f7d3489645d36707f3018cbf058494deb478ed79362851d32fbd7dd1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/retriever.rs: src/core/retriever.rs changed 19 times in last 90 days, max cyclomatic complexity 18 in rtk::core::retriever::run_recall at line 633. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca62e070100e5b3576870df8d36ecbf977a2cc3cecdac2757a837be11b411390"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/find_cmd.rs: src/cmds/system/find_cmd.rs changed 21 times in last 90 days, max cyclomatic complexity 15 in rtk::cmds::system::find_cmd::render at line 622. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f372d54f86ce0c22a26a4f5c08f97d70ad93cb5fa6927e93ede355de23d6fc54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/mod.rs: src/discover/mod.rs changed 12 times in last 90 days, max cyclomatic complexity 26 in rtk::discover::run at line 258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcee8913d153e875d54654e78018b4afe1a21bdde753c9f95d85449144d4f01a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/permissions.rs: src/hooks/permissions.rs changed 20 times in last 90 days, max cyclomatic complexity 15 in rtk::hooks::permissions::check_command_with_rules at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"11176d4573d36f288857bd56cbeb20691a46949cfc8e4236b4342ca421841361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/js/lint_cmd.rs: src/cmds/js/lint_cmd.rs changed 7 times in last 90 days, max cyclomatic complexity 32 in rtk::cmds::js::lint_cmd::run at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"998e0b2cb74c3d7026c2be122df1948408b76e7c6f962f535478c56da6596c58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/js/tsc_cmd.rs: src/cmds/js/tsc_cmd.rs changed 10 times in last 90 days, max cyclomatic complexity 20 in rtk::cmds::js::tsc_cmd::filter_tsc_output at line 244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b4c62b85b65014690034eae82d1580c6480eef4f52f1141a8d6b21f279639"}},{"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, max cyclomatic complexity 33 in rtk::cmds::php::phpt_cmd::parse 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"933edbb28d9909d8e91269371c68850e19398adb9f5bcdeaf69302e5a0303530"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/pipe_cmd.rs: src/cmds/system/pipe_cmd.rs changed 7 times in last 90 days, max cyclomatic complexity 24 in rtk::cmds::system::pipe_cmd::resolve_filter at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/system/pipe_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/pipe_cmd.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba97bccf0f20eee5e6c69f7326ac926916c691dd7ff91b4f1d1e936a3ccef172"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/go/go_cmd.rs: src/cmds/go/go_cmd.rs changed 4 times in last 90 days, max cyclomatic complexity 39 in rtk::cmds::go::go_cmd::filter_go_test_json at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ba65f5f34c28ed3611568255de252eba67912944aafeb24b1ff762f43d5f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/ruff_cmd.rs: src/cmds/python/ruff_cmd.rs changed 8 times in last 90 days, max cyclomatic complexity 19 in rtk::cmds::python::ruff_cmd::run at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc222f6ff8822ec1ea518fdf550e108a929bc6bc47dee6363fb6b236ac4c16f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/ls.rs: src/cmds/system/ls.rs changed 7 times in last 90 days, max cyclomatic complexity 21 in rtk::cmds::system::ls::compact_ls at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4020c69e884d76e790d3482f9b060369ba45e77b473359b96caaace11b808e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/git/gh_cmd.rs: src/cmds/git/gh_cmd.rs changed 8 times in last 90 days, max cyclomatic complexity 16 in rtk::cmds::git::gh_cmd::format_pr_view at line 366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db76102f2fdae565bb35fd575b6758f74fbba1a72d73734dd5bb47f132d5851"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/init/mod.rs: src/hooks/init/mod.rs changed 3 times in last 90 days, max cyclomatic complexity 42 in rtk::hooks::init::uninstall_with_patch_mode at line 844. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa945ecb48fad8e465bf2d0925da1fa690ba14a2e5657c758c2fe5d303fc7137"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/dotnet/dotnet_trx.rs: src/cmds/dotnet/dotnet_trx.rs changed 3 times in last 90 days, max cyclomatic complexity 40 in rtk::cmds::dotnet::dotnet_trx::parse_trx_content at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ac8261f8e0fe096e91764e20226e5f269fe4b2a29096496d2945c6cb5e4ce1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/json_cmd.rs: src/cmds/system/json_cmd.rs changed 6 times in last 90 days, max cyclomatic complexity 20 in rtk::cmds::system::json_cmd::extract_schema at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"320eae14de62d03a6666ad3778b44e4420eae6b1e2e63ea7966769668fb91765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/sqlfluff_cmd.rs: src/cmds/python/sqlfluff_cmd.rs changed 4 times in last 90 days, max cyclomatic complexity 28 in rtk::cmds::python::sqlfluff_cmd::render_lint_json at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4484420e36bd07f30edb3d9f7925c7be16ba4c5616b5c5a64bff3aca0942f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/discover/provider.rs: src/discover/provider.rs changed 6 times in last 90 days, max cyclomatic complexity 17 in ClaudeProvider::extract_commands at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a77700f7aa4ec1ffc630020ad8fd26b1e1ca2296aa05d8598bcd3af1188cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/dotnet/binlog.rs: src/cmds/dotnet/binlog.rs changed 3 times in last 90 days, max cyclomatic complexity 32 in rtk::cmds::dotnet::binlog::parse_build_from_text at line 644. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/dotnet/binlog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/binlog.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4af690d02b1117e011705ca64438201f25cb45604a60975c4b64bef17aa9f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/pytest_cmd.rs: src/cmds/python/pytest_cmd.rs changed 3 times in last 90 days, max cyclomatic complexity 31 in rtk::cmds::python::pytest_cmd::filter_pytest_output at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"157d7964a62d4873d32d44114f9476c23454b2ca2c95ed9c33f1bf474d7ade42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/filter.rs: src/core/filter.rs changed 5 times in last 90 days, max cyclomatic complexity 18 in rtk::core::filter::advance_triple_quote at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/core/filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/filter.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc68b9c69222a33bfffb6f741b8a1cba11db641c580a22275eec4ae356e66e62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/python/mypy_cmd.rs: src/cmds/python/mypy_cmd.rs changed 3 times in last 90 days, max cyclomatic complexity 30 in rtk::cmds::python::mypy_cmd::filter_mypy_output at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/python/mypy_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/mypy_cmd.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce381f10238c5b66271b2a40ea8ee72d2c0e5a9526466241c27a624436a5a94d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/trust.rs: src/hooks/trust.rs changed 6 times in last 90 days, max cyclomatic complexity 15 in rtk::hooks::trust::run_trust at line 241. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/hooks/trust.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/trust.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"84370715f22451491a5cc20f7573252c797f70f917a54326ba5f8b7ec223fb50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/ruby/rspec_cmd.rs: src/cmds/ruby/rspec_cmd.rs changed 3 times in last 90 days, max cyclomatic complexity 28 in rtk::cmds::ruby::rspec_cmd::filter_rspec_text at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/ruby/rspec_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/rspec_cmd.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce713a2092d865bd622567c2dc745ed077f0ce8b6c4c51fbca22d7f0e6539a3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/php/phpunit_cmd.rs: src/cmds/php/phpunit_cmd.rs changed 4 times in last 90 days, max cyclomatic complexity 18 in rtk::cmds::php::phpunit_cmd::filter_phpunit_output at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/php/phpunit_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/phpunit_cmd.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0f3a43ac93e0c56c1917f5b4964b764a653311ba547e82a2a9ba4883a06bd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/summary.rs: src/cmds/system/summary.rs changed 4 times in last 90 days, max cyclomatic complexity 16 in rtk::cmds::system::summary::summarize_tests at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/system/summary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/summary.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39bfdb66b82261db1357caa0b16f4c0cd7b59a11ef669bb566c2eb0117afb41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/deps.rs: src/cmds/system/deps.rs changed 4 times in last 90 days, max cyclomatic complexity 15 in rtk::cmds::system::deps::summarize_gomod_str at line 247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/system/deps.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/system/deps.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d84972a7fed4f6f5d2ceba464e7a45fd7c5c1cc3d6a72fcd5db06f4042f4e9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/js/next_cmd.rs: src/cmds/js/next_cmd.rs changed 2 times in last 90 days, max cyclomatic complexity 25 in rtk::cmds::js::next_cmd::filter_next_build at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/js/next_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/next_cmd.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0881f79188d037d07285370092e61372975ca950c1f571cae33a6f1450530ff5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/cloud/container.rs: src/cmds/cloud/container.rs changed 2 times in last 90 days, max cyclomatic complexity 21 in rtk::cmds::cloud::container::format_kubectl_pods at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"364d3ac66aa6cc4dfff286eab23edd70c95c6aa2c7409d225b6b369781fc519c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/cloud/wget_cmd.rs: src/cmds/cloud/wget_cmd.rs changed 2 times in last 90 days, max cyclomatic complexity 20 in rtk::cmds::cloud::wget_cmd::extract_filename_from_output at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/cloud/wget_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/wget_cmd.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e12828d6e43949fc44af8ddab7a5ebd10ba0d02c506ff8faa0b487be104f0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/js/prisma_cmd.rs: src/cmds/js/prisma_cmd.rs changed 2 times in last 90 days, max cyclomatic complexity 20 in rtk::cmds::js::prisma_cmd::filter_migrate_dev at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/js/prisma_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/prisma_cmd.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"929683858fb577766e1968ee1f61ffd8b7991dcb1a3ef0cab41b3e1c481f75d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/jvm/gradlew_cmd.rs: src/cmds/jvm/gradlew_cmd.rs changed 2 times in last 90 days, max cyclomatic complexity 19 in rtk::cmds::jvm::gradlew_cmd::filter_dependencies at line 446. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/jvm/gradlew_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/gradlew_cmd.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ef32d850cfb6076da0e898233dabd27a93f1b5a257e153548ab01f1f4cdcf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/system/log_cmd.rs: src/cmds/system/log_cmd.rs changed 2 times in last 90 days, max cyclomatic complexity 19 in rtk::cmds::system::log_cmd::analyze_logs at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/system/log_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/log_cmd.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d076a429eb5d90d4d94d582dc81f65a4970f5cd9d618930dc572b6756100f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/analytics/cc_economics.rs: src/analytics/cc_economics.rs changed 2 times in last 90 days, max cyclomatic complexity 16 in rtk::analytics::cc_economics::compute_totals at line 312. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/analytics/cc_economics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cc_economics.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9852b7874526c6be9db0eaf2c639e69ddef71a65f9701afd1b6977bc328de201"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cmds/ruby/rake_cmd.rs: src/cmds/ruby/rake_cmd.rs changed 2 times in last 90 days, max cyclomatic complexity 16 in rtk::cmds::ruby::rake_cmd::filter_minitest_output at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/ruby/rake_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/rake_cmd.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfe463d8c38abd93d39bd2e4fe8708ddb011287abdb16f675f95b8283f8f14b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/hook_cmd.rs: src/hooks/hook_cmd.rs changed 57 times in last 90 days and 36 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 182), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hooks): address Trae portability and partial install diagnostics\u201D; \u201Cfix(hooks): honor audit directory override for portable Trae tests\u201D; \u201Cfix(codex): use shared hook decisions and preserve audit reasons\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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"355a44376edad18bfaa94de232a34f1515a849868ab8616cfef708cc05224673"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/utils.rs: src/core/utils.rs changed 26 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is rtk::core::utils::tool_exec at line 449), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): quote child arguments so MSYS children receive them intact\u201D; \u201Cfix(recall): byte-faithful --grep, cached store connection, serialized env tests\u201D; \u201Cfix(js): correct bun and deno runtime behavior\u201D; \u201Cfix(js): keep each caller\u0027s behavior for a missing 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-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"067c46387bce0bd186bf017aaa6034c0776121cc04e03af4c69117aeb4467bb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/tracking.rs: src/core/tracking.rs changed 26 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is rtk::core::tracking::categorize_command at line 1581), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): keep the user\u0027s arguments out of the telemetry command label\u201D; \u201Cfix(tracking): align the telemetry rates with rtk gain and pin them in memory\u201D; \u201Cfix(telemetry): let savings assertions tolerate honest negative savings\u201D; \u201Cfix(tracking): record negative savings instead of clamping to zero\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8c0af32a2bd9c704cd7215d831f1544aaa4c63d82c6630919de2dcbd0fca2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/tee.rs: src/core/tee.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 7 (its worst body is rtk::core::tee::tee_and_hint_with at line 31), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \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; \u201Cfix(recall): hidden-lines hint reflects what recall can actually return\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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/cmds/go/golangci_cmd.rs: src/cmds/go/golangci_cmd.rs changed 23 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 14 (its worst body is rtk::cmds::go::golangci_cmd::filter_golangci_json at line 342), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(git,search,go,dotnet): adapt the consumers tuned to the old parse\u201D; \u201Cfix(dotnet,go,search): make the probes and lists say what they mean\u201D; \u201Cfix(search,git,go): honour the engines\u0027 own flag arbitration\u201D; \u201Cfix(git,search,go): drop the header\u0027s rival flags instead of outranking them\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05f3c928a2cbcf8eeb6b5e690ce8fedd1cf65545e83fa14f1b8a8b5caad3029"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/js/bun_cmd.rs: src/cmds/js/bun_cmd.rs changed 15 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::cmds::js::bun_cmd::filter_bun_pkg at line 31), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(js): correct bun and deno runtime behavior\u201D; \u201Cfix(js): run tools through the runner the user named\u201D; \u201Cfix(js): correct bun and deno filtering, routing, and accounting\u201D; \u201Cfix(bun): route pkg and pm ls through the core runner\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a6bb95edb3ccde1fad0bb8991de03c257eb1bc5c180e38439f0c789aa0a8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/telemetry.rs: src/core/telemetry.rs changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::core::telemetry::maybe_ping at line 33), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(telemetry): drop the stale \u003E= 0 floor on the signed saved-token sums\u201D; \u201Cfix(telemetry): let savings assertions tolerate honest negative savings\u201D; \u201Crevert(recall): drop tee_on_success, recovery stays failure and truncation driven\u201D; \u201Cfix(recall): review nits \u2014 literal-grep note, dead aws hint branch, doc drift, sorted families\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"113aeabdfc160f2a73355f8da8caca6c1fa55e8e0b12a877b9fc1c737aced7c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/hook_check.rs: src/hooks/hook_check.rs changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::hooks::hook_check::status at line 26), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): reach deployed hooks with the host scrub, and pin it\u201D; \u201Cfix: scope suppress_hook_warning to missing hooks and parse the env override\u201D; \u201Cfix(init,utils): propagate Gemini settings parse errors, add from_json_str wrapper\u201D; \u201Cfix(security): store history db, tee logs and audit log owner-only\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71aa687a511a686de9ceaec3d1b61d264f09562107872093d30b8c4b5fe2d33"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/system/ctest_cmd.rs: src/cmds/system/ctest_cmd.rs changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is rtk::cmds::system::ctest_cmd::dashboard_action_changes_output at line 132), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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; \u201Cfix(ctest): validate result lines by run total and bypass dashboard modes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbcb63c62d8e60d1256afee9a35285c43d3bf2cb8170cdde1fc4c3e36d7456b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/config.rs: src/core/config.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Config::migrate_legacy_tee at line 339), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: scope suppress_hook_warning to missing hooks and parse the env override\u201D; \u201Cfix(recall): keep tee mode free of any sqlite artifact\u201D; \u201Cfix(recall): keep legacy tee always semantics, sqlite stays failure driven\u201D; \u201Cfix(config): single shared legacy-tee mapping for load and config recall\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa932373c4bc0c99160613a41dfb01073856120889a0aba4e01a40d87279d63a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/js/deno_cmd.rs: src/cmds/js/deno_cmd.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::cmds::js::deno_cmd::run_filtered_subcmd at line 23), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(js): correct bun and deno runtime behavior\u201D; \u201Cfix(js): correct bun and deno filtering, routing, and accounting\u201D; \u201Cfix(deno): route lint/check through core runner\u201D; \u201Cfix(runner): parse current deno test output format\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead664f46221ccee9d4b93208ed9bf3d51f70b49ce3b3bd17e340aee47e9a128"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/integrity.rs: src/hooks/integrity.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 10 (its worst body is rtk::hooks::integrity::report_hook_status at line 208), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(init,utils): propagate Gemini settings parse errors, add from_json_str wrapper\u201D; \u201Cfix(security): address followup review comments on private-file hardening\u201D; \u201Cfix(security): create data files owner-only instead of chmod after write\u201D; \u201Cfix(init): strip UTF-8 BOM when parsing hand-edited JSON config files\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bbc9c9cd6f4a1253bc8f1ad9231b6a0244e97bc0e3c995cad7bba5a377c9bd"}},{"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 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is rtk::cmds::php::pint_cmd::run at line 36), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ruff): bypass never_worse only for the format rtk injected\u201D; \u201Cfmt: fix line length in pint_cmd.rs\u201D; \u201Cfix: allow clean-run summaries to bypass never_worse guard for injected JSON\u201D; \u201Cfix(php): default pint applied_fixers when key is absent\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf872241021d08b8571997c658157404b7ecac1dba7ed2c7f5fa87759efd09e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/mod.rs: src/hooks/mod.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is rtk::hooks::is_rtk_hook_command at line 25), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): address Trae portability and partial install diagnostics\u201D; \u201Cfix(codex): adapt upstream changes and explain sandbox tracking access\u201D; \u201Cfix(hooks): address Codex integration review feedback\u201D; \u201Cfix(hooks): route rtk hook check through the real decision\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea2a3a377eecee91b09a5e2a51944267e9d3611a27cdde562d20d972859c800"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/rust/runner.rs: src/cmds/rust/runner.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is rtk::cmds::rust::runner::run_err at line 13), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): answer for a program that cannot run, not just an unresolvable name\u201D; \u201Cfix(cli)!: preserve argv boundaries in generic runners\u201D; \u201Cfix(js): correct bun and deno filtering, routing, and accounting\u201D; \u201Cfix(runner): parse current deno test output format\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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/cmds/system/read.rs: src/cmds/system/read.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is rtk::cmds::system::read::run at line 11), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): stop the head window reading past the lines it was asked for\u201D; \u201Cfix(read): preserve non-UTF-8 head and tail windows\u201D; \u201Cfix(read): make head/tail rewrites faithful to the native commands\u201D; \u201Cfix(core): decode per line, cover OEM code pages, and centralize on exec_capture\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2487247f7029077818fc551db2f8ad757b3a76eeec27c714ab909a798218ca48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/telemetry_cmd.rs: src/core/telemetry_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 8 (its worst body is rtk::core::telemetry_cmd::run_forget at line 197), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(telemetry): treat an empty RTK_TELEMETRY_URL as no endpoint\u201D; \u201Cfix(telemetry): label the missing salt by the gate that actually fired\u201D; \u201Cfix(telemetry): distinguish \u0022consent not given\u0022 from missing salt in status (#1656)\u201D; \u201Ctest(telemetry): move env opt-out regression test\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"094a60a5c13950913d1ce5bc55a225050adeb4fd49e17362b47b54a111b25033"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/discover/report.rs: src/discover/report.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is rtk::discover::report::format_text at line 149), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(discover): address /code-review max findings (correctly-scoped rerun)\u201D; \u201Cfix(discover): address code-review findings on the prior fixup\u201D; \u201Cfix(discover): address hook-decision-log review findings\u201D; \u201Cfix(discover): log real hook decisions instead of guessing coverage retroactively\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"313fbd210903f3e1d339f53ab9403c867f79025569bfe9f040ff779642b534bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/decision.rs: src/hooks/decision.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 AgentPath::lookup at line 278), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): reach deployed hooks with the host scrub, and pin it\u201D; \u201Cfix(openclaw): let the host own approval without losing RTK\u0027s gates\u201D; \u201Cfix(codex): use shared hook decisions and preserve audit reasons\u201D; \u201Cfix(hooks): route rtk hook check through the real decision\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd2db92eb45db8a44d2e4ca1d2f9bd400a394d19b1e55d0fa360ff71705e9c7"}},{"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 177), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file 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): 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; \u201Cfix(npm): recognize extended subcommands\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02: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":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f037314f9be29e9f23cd6f6717fd929dbf4559869f0f0c1891f86a32f8a104b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/analytics/session_cmd.rs: src/analytics/session_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 10 (its worst body is rtk::analytics::session_cmd::run at line 62), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(analytics): stop counting rtk proxy as adopted rtk usage\u201D; \u201Cfix(discover): log real hook decisions instead of guessing coverage retroactively\u201D; \u201Cfix(analytics): floor prefix slices to char boundary instead of full-string fallback\u201D; \u201Cfix(analytics): truncate display strings on UTF-8 char boundaries\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/analytics/session_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/analytics/session_cmd.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"166944806fd40ea02bcdc63de4a968c58084018c30245614eaf9e19dbe53b8a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cmds/php/phpstan_cmd.rs: src/cmds/php/phpstan_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 11 (its worst body is rtk::cmds::php::phpstan_cmd::filter_phpstan_json at line 138), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(php): detect phpstan analyse after global flags; avoid duplicate format\u201D; \u201Cfix(php): address phpstan review feedback (resolution, text fallback, path compaction)\u201D; \u201Cfix(php): align pint/phpstan parsers with current tool schemas\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-28..2026-09-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-28 23:26:25 \u002B02:00\u0027 --until=\u00272026-09-26 23:26:25 \u002B02:00\u0027 --full-history --no-merges -- src/cmds/php/phpstan_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/phpstan_cmd.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"469328070273edfd7a5de9ea45f924155e1d60e9c7ea0a3b95d336d88950003e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 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":"de64d41573538f5410ff36a0eb959e6de095bd1ff09595d8d555dfe32a80c78d"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (6 single-owned of 124 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 124 of the 157 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"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/main.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6dfed9e8412b5a6aaed0ad278f9aea4360b396cc6c6f5485802acb10836e35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(after #3681): replace this short-cluster walk with the ValueSpec factorization;"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6334790eba03fad55be30bbd6964578fe3d9f8a9f2cfadfbf9e4a76fe8c3b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(after #3681): once ValueSpec factorization lands, a flag pre-filter can avoid"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmds/git/git_cmd.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b235c119fafe30911b9bce2fab7299d360d20d7895e14bebbb88a8365990c3d"}},{"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":642}}}],"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":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc75fe7e93cfc73bc2c38114155f88cef9f6d279f8ccc18c2e3d7f39c4307b3"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The opening paragraph is an image caption (\u0027High-performance CLI proxy that cuts up to 90% of the bash output your agent reads\u0027) with no description of what RTK does or its scope. Expand the overview to state what RTK is, its main value proposition (up to 90% token savings), and which directories it documents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"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"}}]},{"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":"4f01b04fd99c76d9c14ddfc2602f27827218e3d17a868f4a005d79db0230c8da"},"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"}}]},{"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"}}]},{"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":"2b182b0531a43a017fea86386c6c4147cb3d9f571418c278e13707f25f624c1b"},"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"}}]},{"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":"334aad9e6b1d51ab74f714fc36e9a3e0750e606935d790ed53f22e20861742bb"},"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"}}]},{"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"}}]},{"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":"60e4a7820532e389cd2bd955a4fa465ca5e1f63007d5db2daaecaf239ac95131"},"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"}}]},{"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":"141feae6c13aac6e487fd19f7f57e0bc831d72be766d0f22f5d904628ce9cb71"},"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"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"}}]},{"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"}}]},{"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":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"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"}}]},{"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"}}]},{"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"}}]},{"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":"a1873f73df2980e05749fb989e4983bd7e44b6790994284629fa7f4a2ef29ad4"},"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"}}]},{"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"}}]},{"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"}}]},{"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":"45e43b2cf0f13df69fd5c5d1f3263d8d91ae8a1d217ff414c529a77aebd1ca8d"},"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"57d823555c0f50a3493fd14230fc2974c80d783a2164e0399518f807a574cc38"},"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"98341b3f35152b26d746a8fe25e684821f1ff3749265395a8e7d389ab0d4840b"},"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"}}]},{"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"}}]},{"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"}}]},{"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":"57d94ecf1e4e1b67a0a20e1126764020d74cc51d3a14b0d8b3faf921de4f9ffd"},"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"}}]},{"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"}}]},{"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"}}]},{"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":"3697f1522e19a638b7ef88b7aaf49350d5b9b08b7c831fcbc85b3c68f84dd986"},"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"}}]},{"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":"1823670305e43a169b48fbd917e572e29e7aa49da335641c631705df063824a1"},"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"}}]},{"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"}}]},{"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":"cb0c607bd165f0cf3b34a2f73b61c1ed49abc3b4ce9af13dabc25e65096c4298"},"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"}}]},{"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":"3643ff687baaf09e4fa86f24721b381bb8ec583e4fb1bc9174a893ca376bdfb1"},"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"}}]},{"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":"f88fb6514ecd9a1d49a33e788bbdd99bea278a0559244edd1cc5a8ea792ded0f"},"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"}}]},{"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"}}]},{"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":"dfd5b7783653e166e17800a934e2ae6026a98d8da97d5d504c10aedbb82a47a6"},"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"}}]},{"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":"24bcc8189b69961073a2a81a26475bc0ac4b4627119c2067a001ba82a978dc0a"},"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"}}]},{"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"}}]},{"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"a07de19a9f18e3a4b58db00c56b9b6dc015c4fa79668310d7187dffee4fa9009"},"taxa":[{"id":"CWE-570","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-571","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"}},{"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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"}},{"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"}},{"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":"3035e85b1a9c0c33df37dc333f490439b3fa52aefda24a401e2e75a177cdf778"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 124 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 and example/demo trees and test files identified by path convention, largest first; 124 of the 157 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. 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":"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"}},{"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"}},{"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"}},{"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"}},{"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"}},{"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":"01617c8618e3c4e3878dbf35ba9ff053ccec9d7cd1ea559a8db623472c13a49c"}},{"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"}},{"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":"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":"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":261}}}],"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":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"538b470be9f6867d784284d83ca6f700cfbcb1d866e158a8176dcd052d071987"}},{"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":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e802560aecf898f4db4b01d09b2aa35d6ff41ec8f0fb743a5ccca0ded01975"}},{"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":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31d958060a337c1cef454dc94eabc8a3f25136cb0f67fe588c6597d4703637f"}},{"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":557}}}],"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":812}}}],"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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"CWE-552","shortDescription":{"text":"CWE-552"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-570","guid":"1c94c05a-8663-e95c-b750-8a0329b22647","name":"CWE-570","shortDescription":{"text":"CWE-570"},"helpUri":"https://cwe.mitre.org/data/definitions/570.html"},{"id":"CWE-571","guid":"c0fe8265-1b68-da53-9217-4ebb9a96d5f7","name":"CWE-571","shortDescription":{"text":"CWE-571"},"helpUri":"https://cwe.mitre.org/data/definitions/571.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":61,"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."]}]}