{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"gix_tix::event_loop (cyclomatic 372): gix_tix::event_loop has cyclomatic complexity 372 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf28c4bdc3a2f1e69b1805b6da80ba06867d7a0fc536b8d84ab7c325e9a644b"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_merge::tree::function::resolve::tree (cyclomatic 192): gix_merge::tree::function::resolve::tree has cyclomatic complexity 192 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee849fe4d37e70085e8e27e847ad85ede478ce0f417b5bdcaa373f236a65a8"}},{"ruleId":"D1","level":"warning","message":{"text":"App::update (cyclomatic 165): App::update has cyclomatic complexity 165 (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":"gix-tix/src/app.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c530a458aafd8cfb1f5ffd07939520758e9d9d7a4d1439f6013b07fabbff2db"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::draw_with_worktree (cyclomatic 135): gix_tix::ui::draw_with_worktree has cyclomatic complexity 135 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec3c8cc3fc7b39342e873cea41f1ddfb9fbc97b1c5d05aa0a04a8bd27271365"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide::plumbing::main::main (cyclomatic 122): gitoxide::plumbing::main::main has cyclomatic complexity 122 (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/plumbing/main.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1b5036b9e8ceedd43933edf3a1188b24a8370bbcea9d9babdf64ca8776157b"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_glob::wildmatch::function::match_recursive (cyclomatic 106): gix_glob::wildmatch::function::match_recursive has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-glob/src/wildmatch.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2244cca55cb84eb5b7a3f9cdd0ae604d1fcdc44c4616674abfa7651274044165"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_plan_with_progress (cyclomatic 78): gix_tix::edit::rebase::perform_plan_with_progress has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb5b8044669ae1fd94ad0708f95b03da0f37fdfa4a284b7d1e5bcf3b907781f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_inner (cyclomatic 68): gix_tix::edit::rebase::perform_inner has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77dce6a5d3db3479414f93d42dbc6b84ab265b93fc809755337824dbf46b0a8"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::command_menu::commands (cyclomatic 63): gix_tix::command_menu::commands has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command_menu.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"54392460eb8cf057eddb17cd666c520f5fb0f3b06a782d9eedebdfaac19fc340"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::parse (cyclomatic 57): gix_tix::edit::todo::parse has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"9518d0dd3895e7ca0361c4132354802583aee728f0dfd8e080eb5cee36562e96"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::clean::function::clean (cyclomatic 55): gitoxide_core::repository::clean::function::clean has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/clean.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"219a084a53f6a0e9e844a80ffa39e1a945a29ee30d7d1ebc8a8640db3646b021"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadSafeRepository::open_from_paths (cyclomatic 46): ThreadSafeRepository::open_from_paths has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/open/repository.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1553c9f00c6993036a354d3771835a1496b289c3d6d84def54c6d714873d0dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::metadata_columns (cyclomatic 46): gix_tix::ui::metadata_columns has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b26bfac6dcd0f68aa7cecbc90a76890869ae2aed62e40e723b0dc82df26cb0c"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::query::engine::update::update (cyclomatic 45): gitoxide_core::query::engine::update::update has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/update.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"611f384f0e886a9410f08e6d8f3cd7f2315e7617f083cc763d63cd3a1df50581"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::draw (cyclomatic 44): gix_tix::draw has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) 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":"gix-tix/src/lib.rs"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ebd29ab1f0e823862e43d2838b67b463b424c5e26402f718cac41d8028b16d"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::decorations_excluding (cyclomatic 42): gix_tix::history::decorations_excluding 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":"gix-tix/src/history.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"31614069d174cdf9cf0decb21d92743b79b2793d27463bca34d39fa833f29a14"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree::handle_key (cyclomatic 41): Tree::handle_key has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"278bc8dcba57ad3ebf0677b7cee5a76872bcfefb06ba8640c89cede7c972f4d9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_blame::file::function::file (cyclomatic 40): gix_blame::file::function::file 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":"gix-blame/src/file/function.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"56db281eef0ceab62ee1ede516e3ad9703a62b0f346a3941c4086125cb27d31c"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline::convert_to_diffable (cyclomatic 38): Pipeline::convert_to_diffable 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":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f313cab4206ccb619b52abe4709473c55cc7d7516626704424562da9406141"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_validate::tag::name_inner (cyclomatic 38): gix_validate::tag::name_inner 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":"gix-validate/src/tag.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"242e8e5f1dfc329e19c8ca42a2d796dfbcd5e395b3a897f597ea061d99e9ca26"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::hours::estimate (cyclomatic 37): gitoxide_core::hours::estimate 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":"gitoxide-core/src/hours/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc8c8f704bd57ff2028bc26797e191dd6088fd8c968c071175fcc439a2fe24f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::load (cyclomatic 37): gix_tix::history::load 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":"gix-tix/src/history.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b975aa8d1417fd588d84e796858840e7bd3d0bee88f67a5071e9b9a05c7f3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_transport::client::blocking_io::http::curl::remote::new (cyclomatic 37): gix_transport::client::blocking_io::http::curl::remote::new 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":"gix-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e108e5e3407c2717fd0a22e8f697b1bf28ae8bd4b802922de29803cbc0ed71d"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::consolidate_with_disk_state (cyclomatic 34): Store::consolidate_with_disk_state 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":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f1e184dd6fbc4c94ce442c0b00fddd0adf7f1bf0898c5b0a66a6d294470c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"gix::remote::connection::fetch::update_refs::update (cyclomatic 31): gix::remote::connection::fetch::update_refs::update 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":"gix/src/remote/connection/fetch/update_refs/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ece027332446bce37fb0b7be446f06046259dc73ffd4fff875a7694dee93a"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::time_travel::move_head_to_reporting (cyclomatic 30): gix_tix::edit::time_travel::move_head_to_reporting has cyclomatic complexity 30 (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":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c729414bd1d9d8c41d5804db5b7470602332dfc14f079e91c364c6a29f4f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"PrepareFetch::fetch_only (cyclomatic 29): PrepareFetch::fetch_only 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":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0895b6e0ca14506528983bc1c596efc4197e002a77212a4f049af51ba36cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_config::format::normalize_events (cyclomatic 29): gix_config::format::normalize_events 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":"gix-config/src/format.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafec6e8c7d8a81bd614d932cada00fb96a0456527bd8a555dfbcf85b9b412e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Mark::try_collapse (cyclomatic 29): Mark::try_collapse 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":"gix-dir/src/walk/readdir.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2f83387fde1415e089f52605fbec646c67e174272a7e4930d89d0cb3c4bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::head::perform_inner (cyclomatic 29): gix_tix::edit::head::perform_inner 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":"gix-tix/src/edit/head.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd04856c42fe4ddad61167e6b5550882773d938123108c0453cb81bd61c3eebe"}},{"ruleId":"D1","level":"warning","message":{"text":"Overview::new (cyclomatic 28): Overview::new has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f4e06b52e7d998cdd67334791a7b959bb7b1a46116082054f641f3285a6390"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::stack_insert_plan (cyclomatic 28): gix_tix::edit::rebase::stack_insert_plan 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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f29db66e33ae4734a45041e87f742c9e5c62743a9d1d045970277df1c765162"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::finish_review_with_progress (cyclomatic 28): gix_tix::edit::rebase::finish_review_with_progress 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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b6532093a3e7c8692ce94284e48b39a5e645811d55ed8a5dcd75799c7615fe"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_blame::file::process_change (cyclomatic 27): gix_blame::file::process_change has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"gix-blame/src/file/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114ec460a8b97346bff280a6ee8b41f68822ce8050374bb4597c4a4bafbd306"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_diff::index::function::diff (cyclomatic 27): gix_diff::index::function::diff has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b37f60477ca39ee8b3623e636477a75812fdaabb48eb788c1c672e6c39239b"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::commit_inner (cyclomatic 27): Transaction::commit_inner 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":"gix-ref/src/store/file/transaction/commit.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"12303464abc9380b6ca0867234b2a5639236cdf7dce04312faba3718bf4c0a2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ParsedUrl::parse_host_port (cyclomatic 27): ParsedUrl::parse_host_port 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":"gix-url/src/simple_url.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afdaa29d247d55cb3d6bec4bb9a82817eb17dbc8ff47d9dffe598b2f6babc21"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_config::parse::format::normalize_events (cyclomatic 26): gix_config::parse::format::normalize_events 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":"gix-config/src/parse/format.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e0c291ae3a014c1e47ce7dee272f0264db50b43e54fc50a9424c5a6bc0cc2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Merge::run (cyclomatic 26): Merge::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":"gix-merge/src/blob/builtin_driver/text/function.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfada58aacd6ff5dadfcafd36abe0acab46b256b90f78cb6434ac794d329d37"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryGraph::refresh (cyclomatic 26): HistoryGraph::refresh 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":"gix-tix/src/history.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe25725c13e76d9e72c26ffb23dd1b255194aa35a64f52258448a04dde4c0dfd"}},{"ruleId":"D1","level":"warning","message":{"text":"Remote::default (cyclomatic 26): Remote::default 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":"gix-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"045c7c267b6503798df6f7618c65b4eb125f8d74a978b65d2a1f087ebe22042f"}},{"ruleId":"D1","level":"warning","message":{"text":"Cascade::invoke (cyclomatic 25): Cascade::invoke 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":"gix-credentials/src/helper/cascade.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2613ac6f8e1c16174302fa236bcc27c9e46572ecf134d870bc7d7cd4863cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::app_action (cyclomatic 25): gix_tix::app_action has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) 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":"gix-tix/src/lib.rs"},"region":{"startLine":7082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51d6730784386a70cf2c159863e322b6368983d790d029d0b6fcc3a310ada69"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::status::show (cyclomatic 24): gitoxide_core::repository::status::show has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/status.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebd65c0dcb53b7eb8329e2392e6ded226d70f9d74302566d4672527eab1b35"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::upsert_or_remove_at_pathbuf (cyclomatic 24): Editor::upsert_or_remove_at_pathbuf 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":"gix-object/src/tree/editor.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a0b4f941070d7171657a66b3a291f0722533e1ddb24a82e8d9532d43baa306"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::parse_state (cyclomatic 24): gix_tix::edit::todo::parse_state 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b40f9d9b8b596b3b3ea1eb960284d21ce3c0ed41f599ac1db57c417546482c"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::time_travel::perform_reporting_rebased (cyclomatic 24): gix_tix::edit::time_travel::perform_reporting_rebased has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2eea73ecc8bdce27f16d6c2c1c26a89cb463392e2831f45f686c426214281a"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline (cyclomatic 23): gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline 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":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb412724a0ce934942eef46bb8555ead3d730d72e8afb24833fb9094bb1235"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration::at_path (cyclomatic 23): Configuration::at_path has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (extract_encoding, extract_crlf, extract_eol, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/pipeline/util.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ce052cc7e19ab3781aa6f83e897c4b2358355c3cc4e74e0ffd7b7fa5477a1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Response::from_line_reader (cyclomatic 23): Response::from_line_reader 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":"gix-protocol/src/fetch/response/io.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a6fda059c476d6fc5e7a84b1b4bf6a4a88c41ce60984243d95b75e4a17575d"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::lock_ref_and_apply_change (cyclomatic 23): Transaction::lock_ref_and_apply_change has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb7c55c60eecf88752291e33b16dfaa27a84aeec5457860eac5b24a70acb53a"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::prepare_inner (cyclomatic 23): Transaction::prepare_inner 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":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e12e3c829d66e31bea7b7f2a8376043dad23f80e19afb6e076a6dddb043fdc3"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_refspec::parse::function::parse (cyclomatic 23): gix_refspec::parse::function::parse has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/parse.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd05b2de07b48f8345247c2f11a055dcac2ab91cf33a8038d277476f1b19a3"}},{"ruleId":"D1","level":"warning","message":{"text":"State::compute_status (cyclomatic 23): State::compute_status has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e5581d792c257cde81b3eabf8fbbf2a1a4149d0962f166e8645393d740e3dd"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::update_refs (cyclomatic 23): gix_tix::edit::rebase::update_refs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"761c40a4bfaf05e254411ccfe388303be9bfea28ce1a0302314f4cd23de534b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::from (cyclomatic 22): Command::from 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":"gix-command/src/prepare.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c864307eafd7544d1d945957979ccd4c23d698f58b5e08c3a0e03fa10aa3c7ee"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_dir::walk::classify::path (cyclomatic 22): gix_dir::walk::classify::path 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":"gix-dir/src/walk/classify.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"40744f043aaf5b367453f265d8004bceeed296b4b070880851da846c41151983"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_filter::eol::convert_to_git::function::convert_to_git (cyclomatic 22): gix_filter::eol::convert_to_git::function::convert_to_git 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":"gix-filter/src/eol/convert_to_git.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fd14e5af39308d5e717b5fbdc13b5f505ef7b7dfc359937f5e0d9aadc605ea"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_merge::tree::apply_index_entries::function::apply_index_entries (cyclomatic 22): gix_merge::tree::apply_index_entries::function::apply_index_entries has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3eefb3d7befd9775800acadd65ae35367f9079e2f4d10e68ddfea17c92d8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::prepare (cyclomatic 22): gix_tix::edit::todo::prepare 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb62b1903ad90662683ac71782f224820e1c4d249b986ed6ee379c2d174c1c53"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_url::parse::url (cyclomatic 22): gix_url::parse::url 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":"gix-url/src/parse.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffd172c6a9986395a648afa02a4d58dd3a487a4e9c7465d09f081860c47dba9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_validate::path::component (cyclomatic 22): gix_validate::path::component 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":"gix-validate/src/path.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd88c3383fa15e8cd68ceffafbfd4aa61260f9991561da4989608726533a5777"}},{"ruleId":"D1","level":"warning","message":{"text":"Repository::try_find_remote_inner (cyclomatic 21): Repository::try_find_remote_inner has cyclomatic complexity 21 (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":"gix/src/repository/remote.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11d9c56358f9fd07e8cc93e9fffd929d84b78ffe9b9dd1f9ace1ad35d2291d0"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_diff::rewrites::tracker::find_match (cyclomatic 21): gix_diff::rewrites::tracker::find_match 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":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cee55228eb4724143a96a7496d77cc5cc6697a496f77fac16b33bfa8e3ca75"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_discover::upwards::function::discover_opts (cyclomatic 21): gix_discover::upwards::function::discover_opts 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":"gix-discover/src/upwards/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b66ac3468ed1e4101cd65f2248ae31a75f73b087a4abe6c002f6541ff0e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames (cyclomatic 21): gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames 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":"gix-status/src/index_as_worktree_with_renames/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c9d83b48bf615019fabb3bc05d3789acafed734fa22490a61c53b86df3233"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryGraph::paint_inner (cyclomatic 21): HistoryGraph::paint_inner 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":"gix-tix/src/history.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba102ae8f402c9a546f8300678d3c4dd8c6508bf131279ff6eecb64b6cac9362"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::command::write_history (cyclomatic 21): gix_tix::command::write_history 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":"gix-tix/src/command.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5871b8d1c99fbef1f5e1bbb5a724afd1e36d785fec12f5262e6fb9541bf160"}},{"ruleId":"D1","level":"warning","message":{"text":"gix::worktree::remove::resolve (cyclomatic 20): gix::worktree::remove::resolve has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/worktree/remove.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb07b1cc16ecfb58d76a14aae6d755511ba0e79091f381f90ee677f10050cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_command::parse::parse_words (cyclomatic 20): gix_command::parse::parse_words has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-command/src/parse.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a46937a9b74b78e28dc15a69fff12d27d620e8a15f73aad87c0714590118554"}},{"ruleId":"D1","level":"warning","message":{"text":"Attribute::fmt (cyclomatic 20): Attribute::fmt has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config-value/src/color.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e7251cc23ba3aa6eeb672e79df19c85780852102018c9912a4da09c3290754"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_discover::is::git_with_metadata (cyclomatic 20): gix_discover::is::git_with_metadata 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":"gix-discover/src/is.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"26965cbce022e344238c80f375dae35eb61a05ac77aecde47297a50354d8e7f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Handle::try_find_cached_inner (cyclomatic 20): Handle::try_find_cached_inner 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":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b764a13e15856aa38122716f3de72762fb82c69a852baa4a6d25f8bb4cbb09fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Handle::try_header_inner (cyclomatic 20): Handle::try_header_inner 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":"gix-odb/src/store_impls/dynamic/header.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9044b4ad7cb142045901afc22d328055a0ebc8351efb7af9e9e7b07fe4248d95"}},{"ruleId":"D1","level":"warning","message":{"text":"Search::pattern_matching_relative_path (cyclomatic 20): Search::pattern_matching_relative_path 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":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f629709607a1986b73c7434e66a04f96c669904bd38f5d4f02284ccc48500e5"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_utils::str::precompose_impl (cyclomatic 20): gix_utils::str::precompose_impl has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-utils/src/str.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4396bda5fa8a33bbc831fe718da00ec30921d55fe0159aa98223349246a4d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Remote::save_to (cyclomatic 19): Remote::save_to 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":"gix/src/remote/save.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baa1b037c46de95d97cab5d42b8f47a97ecd26dbd2a23c676046b0f1cf33518"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_config::parse::from_bytes::value (cyclomatic 19): gix_config::parse::from_bytes::value 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":"gix-config/src/parse/from_bytes/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037227ace3908fdfedd87f98806b3e3b04af0566299db5b062f2d2113cbfe33"}},{"ruleId":"D1","level":"warning","message":{"text":"Stack::make_relative_path_current (cyclomatic 19): Stack::make_relative_path_current 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":"gix-fs/src/stack.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d4b6ef7dfcb73504ffb491091b1e47b80518f52b15a90abd07bcd55f647e4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline::convert_to_mergeable (cyclomatic 19): Pipeline::convert_to_mergeable 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":"gix-merge/src/blob/pipeline.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7934695979c504084c49b7c1cef9baa7ead268acfe6498dd3de3a8f0d22b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"File::resolve_deltas (cyclomatic 19): File::resolve_deltas 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":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c3b0b98be53472b5fbb18e14be3c47e6026586b66a88eef085a11e4a9454a7"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_pack::data::output::count::objects::expand::this (cyclomatic 19): gix_pack::data::output::count::objects::expand::this has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/output/count/objects/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e564dc6589a970df1c00ae7c89e376ea429da9a9ab087c4482bb82f73eca9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Search::can_match_relative_path (cyclomatic 19): Search::can_match_relative_path 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":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6f93c9d24f11d91944617801744088f3113d688cd0607c9773f52dca9f2fc"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::app::transition (cyclomatic 19): gix_tix::app::transition has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f287a4dc5d30a01bb0871c501b2ae0a63246fa3cd95d396744d975c958578f4"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::run_with_rebase_selection (cyclomatic 19): gix_tix::run_with_rebase_selection has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) 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":"gix-tix/src/lib.rs"},"region":{"startLine":5732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4982d9194e788fdc9442a891dd375a7e9a105cd4dadcd10a64204a018d90b72"}},{"ruleId":"D1","level":"warning","message":{"text":"Collection::try_from_file (cyclomatic 18): Collection::try_from_file 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":"gitoxide-core/src/index/information.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c6de8c617787fb71a266dfc38763a5a4e45db5494e4f627d46c159c7d728c9"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::merge::tree::function::tree (cyclomatic 18): gitoxide_core::repository::merge::tree::function::tree 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":"gitoxide-core/src/repository/merge/tree.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e564098a0a9f1275791eef7d42b8d4714e42bd508dd841ffcac80e0fd4afa1b"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::remote::refs_impl::print_refmap (cyclomatic 18): gitoxide_core::repository::remote::refs_impl::print_refmap 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":"gitoxide-core/src/repository/remote.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8058d24ca4ef77df3b7d5f780fe0b1a1d878e41d9bcca31011a4a3c3e970cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::hours::core::spawn_tree_delta_threads (cyclomatic 18): gitoxide_core::hours::core::spawn_tree_delta_threads 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":"gitoxide-core/src/hours/core.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"25318eb1a84dd19ac780d5d05f2176b4a975f9bcb0f521fcae110594fb9e4fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::organize::find_git_repository_workdirs (cyclomatic 18): gitoxide_core::organize::find_git_repository_workdirs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (is_repository, into_workdir, repository_at). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/organize.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a3c2f66f6dd66d24b36bcf025b85e8595bcda0f27df2c0abf3fe3653c05408"}},{"ruleId":"D1","level":"warning","message":{"text":"Repository::add_worktree (cyclomatic 18): Repository::add_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":"gix/src/worktree/add.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"171ddc58b831016575f183a04190f4c2e7e09c4287d83d10c1ace9601f28d3ed"}},{"ruleId":"D1","level":"warning","message":{"text":"LineWriter::poll_write (cyclomatic 18): LineWriter::poll_write 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":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"da96255701f3d1c5fda9a410a87def7e951c857bb8a7ba75d732d03a77bab54a"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_revision::describe::function::describe (cyclomatic 18): gix_revision::describe::function::describe 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":"gix-revision/src/describe.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e986f2689f4f994b2eebc9ec80e8aba5d2a0e114f5472afcab20a27c5eb988"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::decode_metadata (cyclomatic 18): gix_tix::history::decode_metadata 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":"gix-tix/src/history.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5c532e6ccd81b2dd0637c48670af8df4fed9902738d207fbd2b81d4f0e53a6"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ref_tree::place_rail (cyclomatic 18): gix_tix::ref_tree::place_rail has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afc3847dddacf6f3fef26eb6b3bb33a39bd3414f15d08cf02db65c8e3150ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_validate::path::is_win_device (cyclomatic 18): gix_validate::path::is_win_device has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/path.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ce7da4ca3386b9ba149084ddce34d7d1eb473781a3f821a2b3b98ac58545f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_worktree::remove::remove_root_with_after_scan (cyclomatic 18): gix_worktree::remove::remove_root_with_after_scan 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":"gix-worktree/src/remove.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3039373b5ddd69a3f790997376abc910b2f5b5dfb005e1dffa6f74ffa5a4375"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::organize::handle (cyclomatic 17): gitoxide_core::organize::handle has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/organize.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b44a7e190b474e1320de353df6311bab78625333565d861d84b2f5e058b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Mode::change_to_match_fs_with_values (cyclomatic 17): Mode::change_to_match_fs_with_values has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/entry/mode.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fbfe8c4eabefefd509875ea4e1f7aad316320b096749f943e21d1db92f9bda"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_pack::cache::delta::traverse::resolve::resolve_parallel (cyclomatic 17): gix_pack::cache::delta::traverse::resolve::resolve_parallel 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":"gix-pack/src/cache/delta/traverse/resolve.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f1995263a8f15f5303fcd72194e7357804f8b9bfd5cf99a81b003eb98b4666"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_protocol::fetch::function::fetch (cyclomatic 17): gix_protocol::fetch::function::fetch 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":"gix-protocol/src/fetch/function.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893d8b47b9ddc37db35cfa43dd035b3800c0c6e46d1cb7a3f65ba225e66165c"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_protocol::fetch::negotiate::mark_complete_and_common_ref (cyclomatic 17): gix_protocol::fetch::negotiate::mark_complete_and_common_ref 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":"gix-protocol/src/fetch/negotiate.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d043ed9dde6188696828e1d85fc09e2d5ba16deeb919bddf8f5576e5a0901ced"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_revision::merge_base::function::remove_redundant (cyclomatic 17): gix_revision::merge_base::function::remove_redundant 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":"gix-revision/src/merge_base/function.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ee9329dc2277e15ee36e02bc2dfe891bfa3ba36fea826d0d290ac38779b262"}},{"ruleId":"D1","level":"warning","message":{"text":"WorktreeWatchRefresh::observe (cyclomatic 17): WorktreeWatchRefresh::observe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) 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":"gix-tix/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e431e1c03d4bf0b7f8afa1dfe30846578e89de28492e09f440eaec4a65eda4aa"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::worktree_transitions (cyclomatic 17): gix_tix::edit::rebase::worktree_transitions 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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37560c2f92737d00f380f4f93c00869c7cc9f47b04a5a6c80d69722f1362c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_quote::ansi_c::undo (cyclomatic 17): gix_quote::ansi_c::undo 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":"gix-quote/src/ansi_c.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14986d7465cb76e1d5a163121ecc01afb740efda42129392fd6097ceec7174b"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::index::checkout::checkout_exclusive (cyclomatic 16): gitoxide_core::index::checkout::checkout_exclusive has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/index/checkout.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca577da6980191ce3422fc26866a6699e2b2d65854abe066665e511e72ba500"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::odb::statistics (cyclomatic 16): gitoxide_core::repository::odb::statistics 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":"gitoxide-core/src/repository/odb.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68e64cd308643809f8e217f41dc256e139d94c64e2dd4ab16e5b85ff7e3d4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"gix::config::snapshot::credential_helpers::function::credential_helpers (cyclomatic 16): gix::config::snapshot::credential_helpers::function::credential_helpers 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":"gix/src/config/snapshot/credential_helpers.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5082083a2b1720ef83bc034504fdd8d763d885fb3a0001f39fbcc91ea2e619"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_date::parse::function::parse (cyclomatic 16): gix_date::parse::function::parse 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":"gix-date/src/parse/function.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"482cd7991626d68c7d52c3817208dada0fb02910181660e0b4606954b866f5db"}},{"ruleId":"D1","level":"warning","message":{"text":"Myers::split (cyclomatic 16): Myers::split 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":"gix-imara-diff/src/myers.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0998a43e6c9afdfe48e69b218b9bf86ef2e3674b0e9db816ff25106d5feb0186"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_path::realpath::function::realpath_opts (cyclomatic 16): gix_path::realpath::function::realpath_opts 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":"gix-path/src/realpath.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabad5a4041ed98cbf403dc83990388e2d4760b5c3f7b881c8c8b1fbaf105ccd"}},{"ruleId":"D1","level":"warning","message":{"text":"LooseThenPacked::next (cyclomatic 16): LooseThenPacked::next has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"gix-ref/src/store/file/overlay_iter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ade529cab0b78a903130dec16bbff30c8b6911062589c955e773cf4bc6122c7"}},{"ruleId":"D1","level":"warning","message":{"text":"CompressedHistory::new (cyclomatic 16): CompressedHistory::new has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042310f8cef677be048d4f72e4774a256aceca09d5eb0d7fb9d0107f17bc171"}},{"ruleId":"D1","level":"warning","message":{"text":"Prepared::finish (cyclomatic 16): Prepared::finish 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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b67f9d3f9a9ae093e554851152bd54db0901b41dc59b817f29af062926bc816"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree::draw (cyclomatic 16): Tree::draw 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":"gix-tix/src/ref_tree.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c301f12400be77cbdf0c36fe8786010bbbb436302c979138c2f9640c325584"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::render_changes (cyclomatic 16): gix_tix::ui::render_changes 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":"gix-tix/src/ui.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8176881e4693fc6dca646a09227ec4f9d8aa26179c3f41ea72477784489d55"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::validate_state (cyclomatic 16): gix_tix::edit::todo::validate_state 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71c96644c8e85958de27572370af8d2afe1c0eef59f749d92725298146a2081"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::create::prepare_inner (cyclomatic 16): gix_tix::edit::create::prepare_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/create.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51f931c8ed3761e153768a09dc7f605c146c1a03f4bf927ae11b0cb4de1be2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ParsedUrl::parse (cyclomatic 16): ParsedUrl::parse 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":"gix-url/src/simple_url.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9478e53d095a47243f563e1229aa9820ab977db16db25173dd7929fbd90df79c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::event_loop (cognitive 915): gix_tix::event_loop has cognitive complexity 915 (threshold 15). Drivers by points: if/else 199 (576 pts), match/switch 74 (274 pts), boolean chains 49, loops 6 (16 pts) (nesting depth added 587). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f1db7cff973e0aa73440b5b101455b2c036606d6258c4945b8ce8f8d7da9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_merge::tree::function::resolve::tree (cognitive 677): gix_merge::tree::function::resolve::tree has cognitive complexity 677 (threshold 15). Drivers by points: if/else 98 (458 pts), match/switch 39 (175 pts), boolean chains 38, loops 3 (6 pts) (nesting depth added 499). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75b3b4912e2730fd3b2f76e4ea9db2c7c1e5d3bbbe41616e926566c5d7b441a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_glob::wildmatch::function::match_recursive (cognitive 335): gix_glob::wildmatch::function::match_recursive has cognitive complexity 335 (threshold 15). Drivers by points: if/else 58 (233 pts), match/switch 14 (51 pts), loops 7 (29 pts), boolean chains 22 (nesting depth added 234). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-glob/src/wildmatch.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de60e2747df30c2cd88a08c8e437f2b20659afffed4502b1d52f06c1f89267d"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::draw_with_worktree (cognitive 215): gix_tix::ui::draw_with_worktree has cognitive complexity 215 (threshold 15). Drivers by points: if/else 87 (140 pts), boolean chains 39, loops 9 (21 pts), match/switch 10 (15 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"76906835aee4bdee832f073455ed883dabe06438b279f2b71271e24ca0985493"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide::plumbing::main::main (cognitive 171): gitoxide::plumbing::main::main has cognitive complexity 171 (threshold 15). Drivers by points: match/switch 39 (90 pts), if/else 37 (79 pts), boolean chains 2 (nesting depth added 93). 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/plumbing/main.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"37db622447e09fb1282edae725dcbd5f110f898ca0857b871aa458160eb9aed3"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_plan_with_progress (cognitive 139): gix_tix::edit::rebase::perform_plan_with_progress has cognitive complexity 139 (threshold 15). Drivers by points: if/else 36 (75 pts), loops 16 (26 pts), match/switch 13 (24 pts), boolean chains 14 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef242dab812678b58360b0b62009e61c3a60bd319727cc119b401db916ca69ed"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::parse (cognitive 122): gix_tix::edit::todo::parse has cognitive complexity 122 (threshold 15). Drivers by points: if/else 43 (103 pts), boolean chains 9, loops 4 (7 pts), match/switch 2 (3 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9aa00f1207a9bc3488c2aa08666bdef6f9a31387f57d42ed4154e9cdca7d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::query::engine::update::update (cognitive 111): gitoxide_core::query::engine::update::update has cognitive complexity 111 (threshold 15). Drivers by points: if/else 28 (64 pts), match/switch 8 (34 pts), loops 8 (12 pts), boolean chains 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/update.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2a3dcca11305fd1a60f8d61825342031437f47fb039ce78def114df3988844"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::clean::function::clean (cognitive 109): gitoxide_core::repository::clean::function::clean has cognitive complexity 109 (threshold 15). Drivers by points: if/else 42 (92 pts), boolean chains 8, match/switch 4 (8 pts), loops 1 (nesting depth added 54). 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":"gitoxide-core/src/repository/clean.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ebbb322052e37372a336a95e009d4f8275082c4f170a10933f84601485238"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_blame::file::function::file (cognitive 105): gix_blame::file::function::file has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (83 pts), loops 6 (16 pts), boolean chains 3, match/switch 1 (3 pts) (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":"gix-blame/src/file/function.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"51968f73ed04c2140c1b592dd6e98b64015eaef2393c886451a77eb187152989"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::convert_to_diffable (cognitive 102): Pipeline::convert_to_diffable has cognitive complexity 102 (threshold 15). Drivers by points: if/else 20 (54 pts), match/switch 9 (38 pts), boolean chains 10 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bbd11cad3dab783d5ab20f9a834a4b61dd40ab7ebbb4c240f3451f53b507fd"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_inner (cognitive 102): gix_tix::edit::rebase::perform_inner has cognitive complexity 102 (threshold 15). Drivers by points: if/else 42 (66 pts), boolean chains 26, match/switch 6 (9 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7687ef27f20f5f906696490828320033e73d7d60adb5b255ee8cab5f0f3eba"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update (cognitive 99): App::update has cognitive complexity 99 (threshold 15). Drivers by points: if/else 35 (65 pts), match/switch 9 (17 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8810a6902b45164fed597463709d7c562c52eaac71dfc8c8969e134d7184acfd"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::metadata_columns (cognitive 95): gix_tix::ui::metadata_columns has cognitive complexity 95 (threshold 15). Drivers by points: if/else 40 (73 pts), loops 5 (15 pts), boolean chains 4, match/switch 3 (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":"gix-tix/src/ui.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3ca5b14866f24f9171f4cfcf4a68caf2458258d48aa60758b61e8604a199f0"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::remote::connection::fetch::update_refs::update (cognitive 92): gix::remote::connection::fetch::update_refs::update has cognitive complexity 92 (threshold 15). Drivers by points: if/else 18 (51 pts), match/switch 11 (37 pts), boolean chains 2, loops 2 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/connection/fetch/update_refs/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c4aa0767a554044ed4d8488d026747e5a93d7d42c0813c6c0964c7d20ca58"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_validate::tag::name_inner (cognitive 88): gix_validate::tag::name_inner has cognitive complexity 88 (threshold 15). Drivers by points: if/else 32 (66 pts), loops 5 (16 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/tag.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf07367a22517fa86ee69628533bc5fc73589a68f54a4d2cb260f26fcab0725"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::consolidate_with_disk_state (cognitive 80): Store::consolidate_with_disk_state has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (58 pts), match/switch 4 (13 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"31505f240403b4c83b196c6a0afccf1c88252cb0563cdb5b39b5e607074d2966"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::draw (cognitive 75): gix_tix::draw has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (41 pts), boolean chains 14, match/switch 4 (11 pts), loops 3 (9 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97f948d820676a7b804ef9403002ce7ec271145714f5f9bd43a3b741d093905"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_transport::client::blocking_io::http::curl::remote::new (cognitive 73): gix_transport::client::blocking_io::http::curl::remote::new has cognitive complexity 73 (threshold 15). Drivers by points: if/else 27 (57 pts), match/switch 4 (10 pts), boolean chains 3, loops 2 (3 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":"gix-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b0e3ceed13f075c8d2025e65847334032d7a7744445257ba14e3b5f1e2df48"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadSafeRepository::open_from_paths (cognitive 72): ThreadSafeRepository::open_from_paths has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 12, match/switch 7 (11 pts), loops 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/open/repository.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea703a625ef682f50c9ea3adab81d9033bcb472e33fb0e5aec21e1b4a115a85b"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::commit_inner (cognitive 71): Transaction::commit_inner has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (41 pts), match/switch 7 (23 pts), boolean chains 4, loops 3 (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":"gix-ref/src/store/file/transaction/commit.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00e2eb2f3042d1cd0bf28d1d326528a28a830bf815f08e570260599ef7366b7"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::command_menu::commands (cognitive 71): gix_tix::command_menu::commands has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (45 pts), boolean chains 21, match/switch 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command_menu.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc67436f8623ff8e9206195375f74495ebc4dbb2249bd088695425ca1a5ec72"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::load (cognitive 70): gix_tix::history::load has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (51 pts), loops 6 (11 pts), boolean chains 8 (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":"gix-tix/src/history.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76649f2077ed02bab939a2a6b07c7bbcde60a7af494d4dd8e8aa1323a4eb25c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::decorations_excluding (cognitive 68): gix_tix::history::decorations_excluding has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 11, match/switch 4 (11 pts), loops 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f655d0cb8536e9b3c91085d35f0f448ea43630c19efce483bcc09b210052a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::upsert_or_remove_at_pathbuf (cognitive 65): Editor::upsert_or_remove_at_pathbuf has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (45 pts), match/switch 5 (16 pts), boolean chains 3, loops 1 (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":"gix-object/src/tree/editor.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc151cc07cd081bebaeabb85d7ca6ba7691255b3ef87aded9d5470883acf862d"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_diff::index::function::diff (cognitive 63): gix_diff::index::function::diff has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 10 (35 pts), if/else 11 (23 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 38). 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":"gix-diff/src/index/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"048c21a9289373d571224bc6060b3a109364dbf41c47f4e3df2898e1ec06f12b"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::try_find_cached_inner (cognitive 63): Handle::try_find_cached_inner has cognitive complexity 63 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 6 (25 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77c684c22c0acee2579ef96a71985845144de31f3610fca38eea6a420b9c0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::try_header_inner (cognitive 63): Handle::try_header_inner has cognitive complexity 63 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 6 (25 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/header.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec991c138b982183109b3172782dfd78b18c09df3d9dc075f36617e9d1640568"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::hours::estimate (cognitive 62): gitoxide_core::hours::estimate has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (41 pts), loops 6 (10 pts), match/switch 3 (6 pts), boolean chains 5 (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":"gitoxide-core/src/hours/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc844397d23f1ab363c5d93a19651c153046a903a235e71a27e12043ee13a22"}},{"ruleId":"D2","level":"warning","message":{"text":"Merge::run (cognitive 56): Merge::run has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (40 pts), match/switch 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/builtin_driver/text/function.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd173125c9061865b0294d4432fe26b44c470bdd3a5f783114714833a8350ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedUrl::parse_host_port (cognitive 53): ParsedUrl::parse_host_port has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 5, match/switch 1 (3 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":"gix-url/src/simple_url.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"696acf7a18c0a855e94a7222bee2ae303266a97f8d05482548ce680ddef06910"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_pack::data::output::count::objects::expand::this (cognitive 52): gix_pack::data::output::count::objects::expand::this has cognitive complexity 52 (threshold 15). Drivers by points: loops 7 (28 pts), match/switch 4 (16 pts), if/else 3 (8 pts) (nesting depth added 38). 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":"gix-pack/src/data/output/count/objects/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc77ebee2f95578996e5e489b98d4b025bddddc007aa1a7662de52a9c459ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cascade::invoke (cognitive 51): Cascade::invoke has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/helper/cascade.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8b8f3ecbfb013560d80d672d49e9af17f62a3453cf81b448e90a3c2951e8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::from (cognitive 50): Command::from has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (44 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-command/src/prepare.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3735a3154fa8a4bc0925f198a446546c2f333816548e9c9ed0f0720783b969"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::remote::refs_impl::print_refmap (cognitive 50): gitoxide_core::repository::remote::refs_impl::print_refmap has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 7 (20 pts), loops 3 (6 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/remote.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"712ef5bce4d6e75f35de3347865d03fcfa983422b8adc805005ef3461b5b4d67"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_config::format::normalize_events (cognitive 49): gix_config::format::normalize_events has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 6, loops 3 (6 pts), match/switch 2 (3 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":"gix-config/src/format.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bbe060da0369dbc733a05138d312eb5c72817edbf952d3b37c208c3fea57c7"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames (cognitive 49): gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 5 (12 pts), match/switch 6 (11 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-status/src/index_as_worktree_with_renames/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a5655eaecf310eb46125932f91bb5926477c2dff0d71e0094c97b334c7e89"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::finish_review_with_progress (cognitive 48): gix_tix::edit::rebase::finish_review_with_progress has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 5, loops 3, match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1236203c1bae55fcbcc4e218233af6f0b4c34bc59f868e8935bfede6e4992c"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::prepare_inner (cognitive 47): Transaction::prepare_inner has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (14 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82dac13c0c90523624affac6dc2e7d2feacf4417b331206cdcf21ca47787788"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryGraph::refresh (cognitive 47): HistoryGraph::refresh has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 8 (13 pts), boolean chains 5 (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":"gix-tix/src/history.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d718c26be4786e2009a6138390246907095708949a5e4e4e2a589785c6842e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::convert_to_mergeable (cognitive 46): Pipeline::convert_to_mergeable has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 6 (22 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/pipeline.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb11294609404e0c6669b7d12025c8689df55b80491ef0a99f1fdcc8eb9b0b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::handle_key (cognitive 46): Tree::handle_key has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 16, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b20b5d950dd66b5e67eb2a299fa60aa87563757bde6f8be62746dd001fc0f27"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::hours::core::spawn_tree_delta_threads (cognitive 45): gitoxide_core::hours::core::spawn_tree_delta_threads has cognitive complexity 45 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 5 (17 pts), loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/hours/core.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea857345772abbfc05836dc96ce2258beeaef3c32b97b1a86fa76a79986377e"}},{"ruleId":"D2","level":"warning","message":{"text":"LineWriter::poll_write (cognitive 45): LineWriter::poll_write has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (13 pts), 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":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15dda84a373efdde67b093c2b78497d4d322ed95f2697cb0d2e8e97e36a05a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Remote::default (cognitive 45): Remote::default has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e9f59fb2e90a6e14d70215746f881a98e0c038c02a7d2a50561229d496a266"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_revision::merge_base::function::remove_redundant (cognitive 44): gix_revision::merge_base::function::remove_redundant has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 6 (14 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revision/src/merge_base/function.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66e59560cb30769787a54937230d7e5cb5c7907d6781755a2f72632009f07ed"}},{"ruleId":"D2","level":"warning","message":{"text":"PrepareFetch::fetch_only (cognitive 43): PrepareFetch::fetch_only has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (31 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6012ff28082d958f77980e1b3c27c2b9157c4cd05b0838c44608175f5d046b"}},{"ruleId":"D2","level":"warning","message":{"text":"WithSidebands::poll_fill_buf (cognitive 43): WithSidebands::poll_fill_buf has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 6 (22 pts), if/else 4 (19 pts), loops 1 (2 pts) (nesting depth added 32). 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":"gix-packetline/src/async_io/sidebands.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"697dba2fd3afed79d9a65752bf5b5699f2889af1a2aa2681ac7c8f97163aa668"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::perform_run (cognitive 42): Engine::perform_run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (12 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/engine.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd8ed9bb43bbe42cbbb8093987a2072febbc28804cf419a844b0a625d949d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_diff::rewrites::tracker::find_match (cognitive 42): gix_diff::rewrites::tracker::find_match has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 3 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b29d4943aeaadd9e1bab8854c1952a3d5a3095253ea9b76eabfb08d5ae6331"}},{"ruleId":"D2","level":"warning","message":{"text":"Overview::new (cognitive 42): Overview::new has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 12 (15 pts), boolean chains 4 (nesting depth added 15). Of this number, 40 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeeae096857c34c9d08be2d7160a036a4e34be369ca265d1978e18b5efa5e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::config::snapshot::credential_helpers::function::credential_helpers (cognitive 41): gix::config::snapshot::credential_helpers::function::credential_helpers has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/snapshot/credential_helpers.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d331dabcf2e07348ac84ea95302463dbb53344e9e11623fd972c5d8bc04e9f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_discover::upwards::function::discover_opts (cognitive 41): gix_discover::upwards::function::discover_opts has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-discover/src/upwards/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c9552a5c07dcf187d76f97cbbed5f815d8b0722cab5552ae4e3768f9499135"}},{"ruleId":"D2","level":"warning","message":{"text":"Response::from_line_reader (cognitive 41): Response::from_line_reader has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 27). 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":"gix-protocol/src/fetch/response/io.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf4e8d51d74b8c4ab25eb329123dd9b870d122431435127c3900422a61c0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryGraph::paint_inner (cognitive 41): HistoryGraph::paint_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d6a497725f4e2ff8d319747fa53f8d724eac7bed399610e6f9e3270dbea677"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline (cognitive 40): gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 7 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8180aaf8b04271a0cf96d63829e1da91e446df334ab036968c9006cb1e6dc86c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::stack_insert_plan (cognitive 40): gix_tix::edit::rebase::stack_insert_plan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 7 (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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374ac4ec483823968b07546f09beeeda436cfe74738c2b172000e38e0666723"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::update_refs (cognitive 40): gix_tix::edit::rebase::update_refs has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"59696da0ff95b4679b8e8159fbb4ead795df70f59f25f5ddf9c944e4cc3cb3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::head::perform_inner (cognitive 40): gix_tix::edit::head::perform_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 8, match/switch 5 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/head.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdc09727623dffc1e01b3644cd2f7f8a5e82cbbd37d77223a3763c1c674f100"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_worktree::remove::remove_root_with_after_scan (cognitive 40): gix_worktree::remove::remove_root_with_after_scan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 3 (11 pts), loops 3 (5 pts), boolean chains 2 (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":"gix-worktree/src/remove.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c261de973433298c89e98e5aafbcab6690dd6f12e3423811f077dce65cfa011"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_config::parse::format::normalize_events (cognitive 39): gix_config::parse::format::normalize_events has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (6 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/parse/format.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9225f2dd5efaf17ab2671c30b4b23f446983e4f35ad02b80aa0315bd06cc0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::index::entries::function::print_entries (cognitive 38): gitoxide_core::repository::index::entries::function::print_entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/index/entries.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2473dade959964fafb60a496a194b99fb715715b33fd8eda963d5a1909aebbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_blame::file::process_change (cognitive 38): gix_blame::file::process_change has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 8 (18 pts), boolean chains 1 (nesting depth added 18). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2bb47b1223f328cd4822bbce6836ee727ae50d5ea72e9483fdb7873d87af77"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::can_match_relative_path (cognitive 38): Search::can_match_relative_path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 6, loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a23ee1a63f9512a2d7b92049d8902a644931632aea00c4335e1af80378c3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::write_at_pathbuf (cognitive 37): Editor::write_at_pathbuf has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (14 pts), loops 2 (3 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":"gix-object/src/tree/editor.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8118cbd6e2043883fc7b7ac004ec71ec8605b6fce7184d20653c81e69d83d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Mark::try_collapse (cognitive 36): Mark::try_collapse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 9, match/switch 2 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-dir/src/walk/readdir.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3433e625c2ee564ba5296322613dd3c65090defc4b8542ae5dd7c733ddd2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::time_travel::perform_reporting_rebased (cognitive 36): gix_tix::edit::time_travel::perform_reporting_rebased has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 11 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49331e7743bf041cc183c7c8fd4343cd7f4095bed2c136908e8311ea3ca572c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_pack::cache::delta::traverse::resolve::resolve_parallel (cognitive 35): gix_pack::cache::delta::traverse::resolve::resolve_parallel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (8 pts), match/switch 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/delta/traverse/resolve.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"493fbb7b3d1701bcbe928d6b5519f1cd7e99d3269c063ce822adf422756c12b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::pattern_matching_relative_path (cognitive 35): Search::pattern_matching_relative_path has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99ca0106bb348e9b012a9dd613ce299b67b5f490c9efe051983a10ae54f96bd"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_protocol::fetch::function::fetch (cognitive 35): gix_protocol::fetch::function::fetch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/function.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5630d22c529474ebdfc1545f59198ac04d7a7a1ba3a38fa0d7910439e3dd72cf"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_filter::eol::convert_to_git::function::convert_to_git (cognitive 34): gix_filter::eol::convert_to_git::function::convert_to_git has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/eol/convert_to_git.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b5c4816737cba6b54bab0465ebea5547a7eae2a47f6d15ad0fd21400b464d9"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupRefDeltaObjectsIter::next (cognitive 34): LookupRefDeltaObjectsIter::next has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 5 (14 pts) (nesting depth added 23). 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":"gix-pack/src/data/input/lookup_ref_delta_objects.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a8c188cfa16e645d32e54ced0b28f13551f2fff3dad67a46cde625fb26627e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_protocol::handshake::refs::shared::parse_v2 (cognitive 34): gix_protocol::handshake::refs::shared::parse_v2 has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 5 (11 pts), loops 1 (2 pts) (nesting depth added 21). 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":"gix-protocol/src/handshake/refs/shared.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"676b4f2acaa10af98e8857587895d840abb78ffc184f3512f76158488766d64c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_revision::describe::function::describe (cognitive 34): gix_revision::describe::function::describe has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3 (6 pts), match/switch 1 (4 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":"gix-revision/src/describe.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08530059859967dfd87fe363a53b3458654a98028a26ba254b637de8d3a6bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::prepare (cognitive 34): gix_tix::edit::todo::prepare has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 7 (9 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0ec0bd86f61c53f8885c597ae3f0ffae282538a5e902303bd807855a0af12b"}},{"ruleId":"D2","level":"warning","message":{"text":"Myers::split (cognitive 33): Myers::split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 2 (5 pts), boolean chains 3, 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":"gix-imara-diff/src/myers.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0f1576a9584eef12780b286232254ecc961c0d7499c2a057a501d02b597a6"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::prepare_continuation (cognitive 33): gix_tix::edit::todo::prepare_continuation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 4 (10 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3195303d34bfecdd6bc77a3f74ae38ccf3588d332e4d24f6074d460c59d6e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::time_travel::move_head_to_reporting (cognitive 33): gix_tix::edit::time_travel::move_head_to_reporting has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 10 (14 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea55801d4300e8d014a6ea5dbb95bf7ce0f8b1a6b68cf3f3033f5f9e74187e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"LcsSearch::update_lcs (cognitive 32): LcsSearch::update_lcs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/histogram/lcs.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3cdfb4020a03180f4bdae10d66947b9ebbc2e887400ec66136ab11017bd65"}},{"ruleId":"D2","level":"warning","message":{"text":"WithSidebands::fill_buf (cognitive 32): WithSidebands::fill_buf has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 4 (14 pts), loops 1 (2 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":"gix-packetline/src/blocking_io/sidebands.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"912de55719dda99fcfbd55a86f364c106d0aebcf2bf6cd9baa6182e29465ce83"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::fetch::function::print_updates (cognitive 31): gitoxide_core::repository::fetch::function::print_updates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 7 (13 pts), loops 2 (3 pts) (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1dbbc9029aa152afc1bac5410e92f34e003ff7ec7c718c8b27440a5ab7c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Remote::save_to (cognitive 31): Remote::save_to has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 9 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/save.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"142721ed142fe957246891d39e2a523066930bc029cd5c6600079e6264597c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_dir::walk::classify::resolve_file_type_with_index (cognitive 31): gix_dir::walk::classify::resolve_file_type_with_index has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-dir/src/walk/classify.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7710b6c36aa01254cee5cd8d1121417857a3f37a06f475f751ca9ffb47ef962e"}},{"ruleId":"D2","level":"warning","message":{"text":"Algorithm::mark_common (cognitive 31): Algorithm::mark_common has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (6 pts), boolean chains 4 (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":"gix-negotiate/src/consecutive.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fae7df0fd62b08fced7f7cbe3e0bbd7856b830994d6942469a9bcd97e5bbde"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::lock_ref_and_apply_change (cognitive 31): Transaction::lock_ref_and_apply_change has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 14). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0245528e4e55e7bdda06e4633fd4d8ddf912433ebc7dae1581a12758daa7d867"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::parse_state (cognitive 31): gix_tix::edit::todo::parse_state has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"74723c803820091a614b77c1da4170e263d594716da31c507589f65db7c4df6a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_validate::path::is_dot_ntfs (cognitive 31): gix_validate::path::is_dot_ntfs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/path.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"668b1e7a35139234c386f58cd7f97b1c020209b67465e722bc1f3701abad9f13"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_dir::walk::classify::path (cognitive 30): gix_dir::walk::classify::path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 7 (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":"gix-dir/src/walk/classify.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4fa86c9545425c37f17a727b5148b91ff25e6b889edb614a10a025fb9b003a"}},{"ruleId":"D2","level":"warning","message":{"text":"Iter::next (cognitive 30): Iter::next has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 4 (10 pts) (nesting depth added 21). 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":"gix-fs/src/dir/create.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d956cb67a85805c3cd954098b91f5cc28f9e8ad20d03919f256d7c95e80b83"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::load_next_index (cognitive 30): Store::load_next_index has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (8 pts), loops 3 (7 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":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92ead011cce649f13d4e0c60f359d5392ba3c5cddf5ac1532e2b5499836ea39"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_status::fscache::windows::directory_entries (cognitive 30): gix_status::fscache::windows::directory_entries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (7 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-status/src/fscache.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceda01ad22813ec47e0bc44c19f37713e9caaea62b7d5d55af74a5e6c6d34e51"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_url::parse::url (cognitive 30): gix_url::parse::url has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 10 (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":"gix-url/src/parse.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf873fd0f226981cd0c5d715855dd749ec5e0792089314c36e6b188b894af0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_worktree_state::checkout::chunk::process_delayed_filter_results (cognitive 30): gix_worktree_state::checkout::chunk::process_delayed_filter_results has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (8 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree-state/src/checkout/chunk.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35dd297b00d03937a230f5091a4ee52bbbdf4de6ff5080ab4b8d2265a990cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Vec::for_each_set_bit (cognitive 29): Vec::for_each_set_bit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-bitmap/src/ewah.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcbbb1824fb9018262a5381825b247d5a15c176e85d68c831fe7c03b105eafe"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddleSnakeSearch::found_snake (cognitive 29): MiddleSnakeSearch::found_snake has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 1, 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":"gix-imara-diff/src/myers/middle_snake.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"923b2cdf19e03994c35ecf6ae534f734f898494305229f430282a82c77fada82"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::metrics (cognitive 29): Store::metrics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (8 pts), loops 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/metrics.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a66d19c368d095839c3acf733f85d115165d296c7d827c2bd32db1fb3ea62b"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::location_by_oid (cognitive 29): Handle::location_by_oid has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 3 (15 pts), if/else 3 (11 pts), loops 2 (3 pts) (nesting depth added 21). 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":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ff56dc1f2181347286cae1b86716b34ea22a15c873e68aedf1388ad2d39d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::run_with_rebase_selection (cognitive 29): gix_tix::run_with_rebase_selection has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":5732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cff62186f4926b253d73c666c7a0f0e5e5ed462808bb260930273cd388cae53"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_utils::str::precompose_impl (cognitive 29): gix_utils::str::precompose_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-utils/src/str.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c969b171a1c46aeb63032587316ff5c13e17d35ada72261fccbf48d1972b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_pack::index::access::lookup_prefix (cognitive 28): gix_pack::index::access::lookup_prefix has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/access.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd697a9012f99545a74ed506567957dc148c593927e3af555bd9462dfa463dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_path::realpath::function::realpath_opts (cognitive 28): gix_path::realpath::function::realpath_opts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 2, 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":"gix-path/src/realpath.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e184fb63db5f9ced64c0d3a0aad984b1a2bc527e3482b34910d0907b761f1832"}},{"ruleId":"D2","level":"warning","message":{"text":"Reverse::next (cognitive 28): Reverse::next has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (3 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/log/iter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b93edc38e2a8370ca8a9b8d34c45d1cfd7b9aa941b636edda2a946ee72fbe11"}},{"ruleId":"D2","level":"warning","message":{"text":"State::compute_status (cognitive 28): State::compute_status has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, match/switch 4 (5 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":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f8b936c3fe48168f11f28c12ba15d1055758afb927fcfa32233f10054c5864"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_validate::path::component (cognitive 28): gix_validate::path::component has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/path.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7841733d4a2b067ec0effa1fde722c55e9bc9a6d3950e02c7c7386fbd57aff"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::attributes::query::function::query (cognitive 27): gitoxide_core::repository::attributes::query::function::query has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/query.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"16888fc81d106c2d61d4a4a787d87bc24a8c9e3677e204e6dd5d462d7078010a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_command::parse::parse_words (cognitive 27): gix_command::parse::parse_words has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). 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":"gix-command/src/parse.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bc80d17dba5be1eee19bf755f4a6081bffe2bb27d0e1227afcce1552cab400"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_features::parallel::in_parallel::in_parallel_with_slice (cognitive 27): gix_features::parallel::in_parallel::in_parallel_with_slice has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (6 pts), match/switch 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-features/src/parallel/in_parallel.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"923f624c3d5aec91f2738f9c69f0260b45e891aa53348bf1b04118ea8638b1af"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration::at_path (cognitive 27): Configuration::at_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 7 (11 pts) (nesting depth added 8). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 4 function items inside it that branch (extract_encoding, extract_crlf, extract_eol, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/pipeline/util.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7513d60721197868699a04a798f255dcf6e2f81b555c84dc078dcaea1b0a13"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::make_relative_path_current (cognitive 27): Stack::make_relative_path_current has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 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":"gix-fs/src/stack.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf19342af0342d87e67000bc3c28ce940d9ebd75bb19d26d34033f3d4b4d822"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::decode_metadata (cognitive 27): gix_tix::history::decode_metadata has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (7 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c045cf0a1bcbe2d4f3c6ac8712613717218fa91dd52182058aca7106d8734fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::command::write_history (cognitive 27): gix_tix::command::write_history has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 5, match/switch 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fa1b9ee00a81e9ae587540e9bf947e795a96892057983f8c8fc514f5b526a9"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::app_action (cognitive 27): gix_tix::app_action has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":7082}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e42b8acb4673906240528c9344fcb25761f6bef6839a8156bc6fbaf306df1c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler::header (cognitive 27): Handler::header has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9f60ec1d7315a57e673affee9b64fbea92a8d69f1084899857e6e7cc71f02e"}},{"ruleId":"D2","level":"warning","message":{"text":"Simple::next_by_topology (cognitive 27): Simple::next_by_topology has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), match/switch 2 (6 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":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b881cab772f16005fb3bb60fc2c0876fa89eae8a3d16f73f0db50fedee488414"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddleSnakeSearch::run (cognitive 26): MiddleSnakeSearch::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 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":"gix-imara-diff/src/myers/middle_snake.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02da16d370cc67d4a9fe2a987bfe10abbb8c7a6562b34ee4bccee183246bb77"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_macros::momo::convert (cognitive 26): gix_macros::momo::convert has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 14). 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":"gix-macros/src/momo.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"819764fb623a8179cb20a3499f81d685e9c6223623694307bfe6162c0be5fcee"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::load_pack (cognitive 26): Store::load_pack has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 2 (nesting depth added 16). 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":"gix-odb/src/store_impls/dynamic/load_one.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73952f922052b676b8e64da72a87017085095a405b369e44a68bf7356c3093a"}},{"ruleId":"D2","level":"warning","message":{"text":"File::resolve_deltas (cognitive 26): File::resolve_deltas has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (6 pts), loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c652ff612186087cb7a607bd859c564237b3ba14991b1fadf96e06f7ac5232e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_refspec::parse::function::parse (cognitive 26): gix_refspec::parse::function::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 8 (11 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/parse.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e15dea9d6c01d86824a9a3921839bafbb017c61c714a229a4d8fa94c652add9"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedHistory::new (cognitive 26): CompressedHistory::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (8 pts), boolean chains 3, match/switch 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":"gix-tix/src/app.rs"},"region":{"startLine":3447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe38476633566bfd72f3a8e959ae9929426dea7f444541f3d7ce309612d2818"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::status::show (cognitive 25): gitoxide_core::repository::status::show has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 5 (10 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/status.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e62cf05bfb551c550629009646bc0497bd83956e82fe5074d66ee1d2cad59c"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository::add_worktree (cognitive 25): Repository::add_worktree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/worktree/add.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b92b72dbe7ff253a4358aba96b6cdfbbf79afd46c65e94838abfb83c32fe1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Postprocessor::run (cognitive 25): Postprocessor::run has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 5 (10 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/postprocess.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b27431d2712a86d5ba265d03e5cfd72bfb1152c9ac500515c8204d29d507d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Link::dissolve_into (cognitive 25): Link::dissolve_into has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/extension/link.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9734c423ba10779a3309c3c4b99091b25d216d5ae63ea2396c63914cfd755e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_merge::tree::apply_index_entries::function::apply_index_entries (cognitive 25): gix_merge::tree::apply_index_entries::function::apply_index_entries has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 3 (6 pts), loops 2 (3 pts) (nesting depth added 13). 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":"gix-merge/src/tree/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb5284d31bb3d5b79ddb9509968c0415a55cd388459ea3747d7a45ab064c35"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts (cognitive 25): gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (17 pts), loops 3 (4 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 13). 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":"gix-pack/src/data/output/entry/iter_from_counts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f795df89d03e19832205dd19d078ea9388b081a8612b0dd87d7d6f4b936d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::directory_matches_prefix (cognitive 25): Search::directory_matches_prefix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4627673aa942193bc482b73aba34fc0eeeef199260de0cb3b07876c1850a82c"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::find_inner (cognitive 25): Store::find_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/find.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"34214b8357048d4356b7b2c64c457bea23f950f16ce634581dac59a964be9cac"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::prepare (cognitive 25): Transaction::prepare has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/packed/transaction.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4db8462f111ed1088c2e742369d1c07dbbe14461d2fd0bbe64f406a3d5c001"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::worktree_transitions (cognitive 25): gix_tix::edit::rebase::worktree_transitions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc5ae9911bf270ea88ec307d4e7b9149a91e0dcd1ffae4d07dfe0b08cd53635"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ref_tree::place_rail (cognitive 25): gix_tix::ref_tree::place_rail has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 pts), loops 4, boolean chains 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4552c5855682f035cb243e53386b0a3cdedeb0660be1f7a1bb1d6b5882d704"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::app::compute_lanes (cognitive 25): gix_tix::app::compute_lanes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 7 (12 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":"gix-tix/src/app.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b4d3a5e7d280b28144ad7c233c60f3d7fd18aa167a977f6ad6778b0978f910"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run (cognitive 24): Engine::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/command.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa70692336cdbd11ff89f012b53eef98bc1f80cfbe921b68d94050540d7a883"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::worktree::remove::resolve (cognitive 24): gix::worktree::remove::resolve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 5 (8 pts), loops 3, 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":"gix/src/worktree/remove.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9afc60eafc1ce592eaaff307660be52a0e4d5a2e28e2488757e34e3a4afc9"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_config::parse::from_bytes::value (cognitive 24): gix_config::parse::from_bytes::value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/parse/from_bytes/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a46a6a30714281cba453bfcad58141d7fa59ff42e0cb0e7794c74a0be7393e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_dir::walk::readdir::recursive (cognitive 24): gix_dir::walk::readdir::recursive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-dir/src/walk/readdir.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb4d6df3908aad855b72ba5831baa66a355ed587453024113b0daf61a31ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_discover::is::git_with_metadata (cognitive 24): gix_discover::is::git_with_metadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-discover/src/is.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9961f556dadc763f7a8a02cd852df2f98f4f5feb6ab74ab6cdcd09b1b6bd41c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Algorithm::mark_common (cognitive 24): Algorithm::mark_common has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (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":"gix-negotiate/src/skipping.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df56c7d329efc8dca19023072e0c6ae3f854b26ff9f05a04025e676b66df636"}},{"ruleId":"D2","level":"warning","message":{"text":"Prepared::finish (cognitive 24): Prepared::finish has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2e728da219b5c4fe3e064d5a7436b73f9e598899f571b9572452c035c038b"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::draw (cognitive 24): Tree::draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e681b5c6cd64f80f27843b1924e973e72db4d091434d769ccbfe106618efb82"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ref_tree::draw_nodes (cognitive 24): gix_tix::ref_tree::draw_nodes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 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":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8422c4521c4c26aa0bd0ee7aa36d584e1807a0e195d11927863579629ef02d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedUrl::parse (cognitive 24): ParsedUrl::parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/simple_url.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8b493c291a71eb8ddff842beb941b880d98d9a17f48fcdb23bc60f750d2dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::clone::function::clone (cognitive 23): gitoxide_core::repository::clone::function::clone has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (6 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"gitoxide-core/src/repository/clone.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd536053ba3d5827ba563685c4ebb11695df2bf6189a6c0699e8345bfa5e428"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::organize::handle (cognitive 23): gitoxide_core::organize::handle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 5, boolean chains 1, loops 1 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/organize.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00ccc44252957adac4fd93986d2539f2b1dd682655ac22b7ae7acd2162fa1ed"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::open::repository::check_safe_directories (cognitive 23): gix::open::repository::check_safe_directories has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (3 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":"gix/src/open/repository.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06a8e49ef044754b1bbf34cd8f87d6acb3bb04730b8714b85d9c8213c2907ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Parents::next (cognitive 23): Parents::next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (11 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/commit.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea546ce14870fcaeccf2749e30e4265df1695e3f77ae2c294edc65b33b553d"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::lookup_prefix (cognitive 23): Handle::lookup_prefix has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/prefix.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f55871333b483fdac8dae4ebe38d4ccb46a82345c867789fbd8aee0d8018bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_protocol::fetch::negotiate::mark_complete_and_common_ref (cognitive 23): gix_protocol::fetch::negotiate::mark_complete_and_common_ref has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/negotiate.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d12900c22cac19a1bfe0a6cc4c666adf41bbe578f96852df1334a98c5ca2ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository::try_find_remote_inner (cognitive 22): Repository::try_find_remote_inner has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). 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":"gix/src/repository/remote.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7ca53ab778b8fd47e0f9b4261655f8d86a49a8e983a859a15b51a08471339"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::remote::connection::fetch::update_refs::update_needs_adjustment_as_edits_symbolic_target_is_missing (cognitive 22): gix::remote::connection::fetch::update_refs::update_needs_adjustment_as_edits_symbolic_target_is_missing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 3 (6 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/connection/fetch/update_refs/mod.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e707d13f065baab54f829c482687823cab585226eabe8f591e5f1b4888fd6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::config::cache::init::apply_environment_overrides (cognitive 22): gix::config::cache::init::apply_environment_overrides has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/init.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd9b8b8fd0f42e69965435ab01cc96ae75a2445ae6eb0387ef8fe0a99d4486"}},{"ruleId":"D2","level":"warning","message":{"text":"Capabilities::probe_ignore_case (cognitive 22): Capabilities::probe_ignore_case has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), loops 2 (5 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-fs/src/capabilities.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e643c735ba1bf15aa239406637d773ebdc4c5fd844e24efc96936eee44e146a9"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryMode::extract_from_bytes (cognitive 22): EntryMode::extract_from_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tree/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b370a6e2f6c8ebb6f4e015593decdfe883222c9ff47e742fb1dcef60d3837e4"}},{"ruleId":"D2","level":"warning","message":{"text":"WorktreeWatchRefresh::observe (cognitive 22): WorktreeWatchRefresh::observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"909dcc4d02ff38627cc2fb01661e74ee0e87ec295d2619000deb25386f0a4852"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::render_changes (cognitive 22): gix_tix::ui::render_changes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, 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":"gix-tix/src/ui.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b91016ee08cd471788538c88ba0cdab3c78588bb91c0c89f115360a6965d69"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::run_with_todo_progress (cognitive 22): gix_tix::run_with_todo_progress has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":5821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b77d19864b0f1859947a2d981de50d512080d5384320e3487cdea7f2f002316"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::odb::statistics (cognitive 21): gitoxide_core::repository::odb::statistics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/odb.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f1b583f5495d30e0e95612acd536f7cc6ae678595bf9618b2f9b9b02f24aec"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::emit (cognitive 21): Tracker::emit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69e14a8bdfb8c83819aa925d150fd1b45c037dad4762c3ac3456ab7f139e9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_error::exn::impls::write_error_node_recursive (cognitive 21): gix_error::exn::impls::write_error_node_recursive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/exn/impls.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f445323f02bae1b3c87513d3b7e939d83cad9fd05c3aa2473a34dcf92e08c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadFilterOutput::read (cognitive 21): ReadFilterOutput::read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 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":"gix-filter/src/driver/apply.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"db206246772acc528aac6c931c71f38f11953db019cb5d86889d39c620bbea5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Indents::score (cognitive 21): Indents::score has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/slider_heuristic.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee983ef10239b7e39107a3a85255f4711b3da6f465d3cc9a8cb2330d39613f53"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeNodes::track_change (cognitive 21): TreeNodes::track_change has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/utils.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c363d06d806c658aa24ceb71462ed87b5b285948b57199af423c6a2da4111"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern::normalize (cognitive 21): Pattern::normalize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/pattern.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80a4ddc7e20fc00c4c27716aa1ecc2d48fa7c2fee442723d2af9167a202eb67"}},{"ruleId":"D2","level":"warning","message":{"text":"SortedLoosePaths::next (cognitive 21): SortedLoosePaths::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, 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":"gix-ref/src/store/file/loose/iter.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf914d2bc252ddf441a959e92263156b8f8cd1a5283fac33850cd2a809ed9f50"}},{"ruleId":"D2","level":"warning","message":{"text":"LaneState::advance_ids (cognitive 21): LaneState::advance_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 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":"gix-tix/src/app.rs"},"region":{"startLine":3767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f4c4241b15f2dee9553fd9cd2bdcc7f3a2143b8a3115be15e5b015baebb3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::refs_with_commit_targets (cognitive 21): gix_tix::history::refs_with_commit_targets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 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":"gix-tix/src/history.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a036b5e026bf13cd2957f527cd503203b18e2af4e9449033dd655fab496e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_traverse::tree::depthfirst::function::depthfirst (cognitive 21): gix_traverse::tree::depthfirst::function::depthfirst has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (7 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/tree/depthfirst.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3071f9f64553bee4c8bb0ad30f6d8e46c97a3a7e0b3732b6ac6cd07b2dd71984"}},{"ruleId":"D2","level":"warning","message":{"text":"Url::path_query_fragment (cognitive 21): Url::path_query_fragment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts) (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/lib.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1a6d3de56abf884685d5de9f59cb4f84ad151948d427e2e680df5e32874e03"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::merge::tree::function::tree (cognitive 20): gitoxide_core::repository::merge::tree::function::tree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"gitoxide-core/src/repository/merge/tree.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6dd6ee1549200c220c6d9d7df387717c97076c299a07c63a72eeb1de31078e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::index::checkout::checkout_exclusive (cognitive 20): gitoxide_core::index::checkout::checkout_exclusive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, loops 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/index/checkout.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c8f49050f2699411053963eac4bcc75c14963ef1d54a98cc5a0a5d1de7f15e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::revision::list::function::list (cognitive 20): gitoxide_core::repository::revision::list::function::list has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (6 pts), loops 2 (4 pts) (nesting depth added 10). 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":"gitoxide-core/src/repository/revision/list.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afdadea2aa1b932eb17adbbdeee3311cbdfd6d0cf6874333cbb5d90e300f76e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::organize::find_git_repository_workdirs (cognitive 20): gitoxide_core::organize::find_git_repository_workdirs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (is_repository, into_workdir, repository_at). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/organize.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe14512a6b29a3e9e32c5c2ed38b8b5c97ca4441d78787739ce6b1272ea825f"}},{"ruleId":"D2","level":"warning","message":{"text":"Iter::next (cognitive 20): Iter::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (9 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":"gix/src/status/iter/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24492690c3b9d1b5dea1018089894706e9a488a38ea91937e3a9ed016157d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::verify_integrity (cognitive 20): Graph::verify_integrity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/verify.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b093e659ee2e047e4d2940bc26a4dbb8c7502a7d93d8f3d750b7369e384685"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::match_pairs (cognitive 20): Tracker::match_pairs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21255438554873b9e22f378b85acbfc4618964e456391c4b0e4e5f22819faec"}},{"ruleId":"D2","level":"warning","message":{"text":"State::apply_delayed (cognitive 20): State::apply_delayed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/driver/apply.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"58876d75ad3dbb1d923f690d66982e2482b08a855094dc31d100b5377e2d44eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Lines::next (cognitive 20): Lines::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 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":"gix-ignore/src/parse.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6ce80efceec15ca7d263c4b57fa678ef823b8481f585442a6dc24745dd704b"}},{"ruleId":"D2","level":"warning","message":{"text":"State::from_bytes (cognitive 20): State::from_bytes has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (10 pts), match/switch 3 (7 pts), if/else 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/decode/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71cadae5e2e9e14fa7306eb82c5bacef1d74dca09a0e3b89845bdde400cd93b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update_hidden_branch_targets (cognitive 20): App::update_hidden_branch_targets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"33afde80ae1b50e64ea84ed9f62546d5bb3a4b0ffcdd704d83f48c52caaef001"}},{"ruleId":"D2","level":"warning","message":{"text":"App::finish_lane_computation (cognitive 20): App::finish_lane_computation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"gix-tix/src/app.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6967a1451f625cb66d831c98bb0f105a27ed291104189072e60c70983f31ac92"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryGraph::descendants_in_parent_order (cognitive 20): HistoryGraph::descendants_in_parent_order has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca60ccb9c1783913cf9bacc45a02de422416ed22a4d6ff354c56a1b6ff70f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Simple::next_by_commit_date (cognitive 20): Simple::next_by_commit_date has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (7 pts), if/else 2 (5 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":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2aeb99df5bfb52c10d3fe758d3a6841323ab154bc61443416d07c38912798c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_traverse::commit::topo::iter::collect_parents (cognitive 20): gix_traverse::commit::topo::iter::collect_parents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/topo/iter.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d64ea5198e9669e8316c286e1fe30fcda78973b9c8b9af42ed462fdfcb6291"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository::branch_remote_ref_name (cognitive 19): Repository::branch_remote_ref_name has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (6 pts) (nesting depth added 10). 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":"gix/src/repository/config/branch.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4236a5027176ddece637392f47bde8102a82c01031fe474421eed59d1ecab883"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_diff::tree::function::handle_lhs_and_rhs_with_equal_filenames (cognitive 19): gix_diff::tree::function::handle_lhs_and_rhs_with_equal_filenames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/function.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab57729d015f9e9cc8094f5a3cb9250e2f035c192b28dc950800e8a2fe627ea"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddleSnakeSearch::best_position (cognitive 19): MiddleSnakeSearch::best_position has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/myers/middle_snake.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cda9031dd4be1622ad695eacdbfb8d0bb5bfff61bb34197426da083116a5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_merge::blob::builtin_driver::text::utils::zealously_contract_hunks (cognitive 19): gix_merge::blob::builtin_driver::text::utils::zealously_contract_hunks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2, 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":"gix-merge/src/blob/builtin_driver/text/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b00a71c51d8903c6f50884fae3bfb8b6c6e65b769f41361638d72eeb8da9aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"Algorithm::next_have (cognitive 19): Algorithm::next_have has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-negotiate/src/consecutive.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c64b1d3ca5b8c5319103cf62320cca6875a6dd3639a7b5ba522babcc1912007"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_path::convert::normalize_inner (cognitive 19): gix_path::convert::normalize_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-path/src/convert.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"221b55d674e0dd781d162823a8595f421666aa40f4d0c637be6491b1ee079b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern::to_bstring (cognitive 19): Pattern::to_bstring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/pattern.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"249adebe45d83b65eefb9ebe110a16fc8cb97b85b26218611f16dd7e2f496333"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::find_one_with_verified_input (cognitive 19): Store::find_one_with_verified_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/find.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d931c81e21e5c9afebe214bddc822a2a8f19c33ba8969263a8c32700e698a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchGroup::match_lhs (cognitive 19): MatchGroup::match_lhs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/match_group/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ee67852bb4ce138b03c08bddc1c1e74e53cbb2ce1e9b60d0f66cab03f84799"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::render_changes_divider (cognitive 19): gix_tix::ui::render_changes_divider has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 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":"gix-tix/src/ui.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4926664801bcdf202102615ed792450c965882e8fc7469054897d3a303669861"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::active_prefix_popup (cognitive 19): gix_tix::ui::active_prefix_popup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5 (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":"gix-tix/src/ui.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7065a75c3ec406e8d784f737c29d576e40711e70c20503c49d4d90da6697006"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::pack::verify::pack_or_pack_index (cognitive 18): gitoxide_core::pack::verify::pack_or_pack_index has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 5 (6 pts), loops 1 (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":"gitoxide-core/src/pack/verify.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4182d6ced46a994e95a7592d8c15a3fa4af98480a09a37b27f4df72cbacd90"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::repository::worktree::insert_head (cognitive 18): gix::repository::worktree::insert_head has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/worktree.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7996dce5c2095fefb7ed6b689f4b2c07cb926cc20ccc185e2595615de72294f5"}},{"ruleId":"D2","level":"warning","message":{"text":"File::from_paths_metadata_buf (cognitive 18): File::from_paths_metadata_buf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/init/from_paths.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d1d43f0e234d084773617bd0c1f59731509cfd0d69afeb9472a9297fe7fb03"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_date::parse::function::parse (cognitive 18): gix_date::parse::function::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/function.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b437931f334ef8f28b957238f6af241f9043b1262984927ba4985f770f67e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeNodes::check_conflict (cognitive 18): TreeNodes::check_conflict has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/utils.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd637d30b8ea06c595e4fe919fadd5962fe0243cb0d10e257678fa0f0d7390"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::lookup_prefix (cognitive 18): Store::lookup_prefix has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (6 pts), loops 1 (nesting depth added 10). 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":"gix-odb/src/store_impls/loose/find.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ba5dcffb835448c2b5ee6e71f0742349e8560c1f97a08719d018cb2fdc5101"}},{"ruleId":"D2","level":"warning","message":{"text":"File::verify_integrity_inner (cognitive 18): File::verify_integrity_inner 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":"gix-pack/src/multi_index/verify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"744341fb5cf246161e89979db7972d87612b17dff5f3df4da7f50054c564514e"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::reflog_create_or_append (cognitive 18): Store::reflog_create_or_append has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/loose/reflog.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a360f8b7a05d4d52a5673af2d7813b67d9666a9260e64ee757a3b5eaf479c72a"}},{"ruleId":"D2","level":"warning","message":{"text":"LooseThenPacked::next (cognitive 18): LooseThenPacked::next has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 2 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (peek_loose, advance_to_non_private). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/overlay_iter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c584d1c3acef9647d3e6a6c16dc6dcf71f48d9e246a08dd76111f77af325f13"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::review::finish_with_progress (cognitive 18): gix_tix::edit::review::finish_with_progress has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/review.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b72729480a56076683117fa408ae682e6b8e4a872b8bc4b7b4def0b3a3e5213"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ref_tree::render_overview (cognitive 18): gix_tix::ref_tree::render_overview has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4de505fc5a40f3d20e87e6c6ce2b17e251aed718caf07ae10ad0a40fc23570"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::render_commit_message (cognitive 18): gix_tix::ui::render_commit_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45f13895aab2d175094c9e109e1cb30b98f4ffc8caac86f06293dfe94a71c56"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::validate_state (cognitive 18): gix_tix::edit::todo::validate_state has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 3 (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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c55d12fe7435ab8df246f7067126b45c8c15f38f1cdd15eb1b46fa3e49ac3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::time_travel::attach_reporting (cognitive 18): gix_tix::edit::time_travel::attach_reporting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e773852435bb86919e8acb67e6157515b1f3873ad03adee0e863a5513243e77"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::run (cognitive 18): gix_tix::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcbd135386d371fcc1dc2cae41038cd230812795ad8a74ac119e1c102e41d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::peel_to_entry (cognitive 17): Tree::peel_to_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/object/tree/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a9a264aabe3aa6e82df6edf8b19af7b704d567ad07848e680c2e26bae53376"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::worktree_file_to_object (cognitive 17): Pipeline::worktree_file_to_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/filter.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aaa8f11ee8d5019bed4a716c6eb84620fa2aee1766f37ca37c9744d097a97f"}},{"ruleId":"D2","level":"warning","message":{"text":"Vec::extend_with_splits_of_symbolic_refs (cognitive 17): Vec::extend_with_splits_of_symbolic_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/transaction/ext.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca7598a69349c480bcdda8c2b990a2c4daadf29cd28ead1ac3a3e0721eff263"}},{"ruleId":"D2","level":"warning","message":{"text":"File::eq (cognitive 17): File::eq has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/impls.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b5cf9d36e76229f56abdf3b3847dbbd638bca7120dfb076f0092298c22cb07"}},{"ruleId":"D2","level":"warning","message":{"text":"File::write_to_filter (cognitive 17): File::write_to_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/write.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a98eb6e293c50b8506df78c4957a4ebd32e99aa24416441f896c5ee4ab2a73"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::convert_to_git (cognitive 17): Pipeline::convert_to_git has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"gix-filter/src/pipeline/convert.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b0c697da00fd5e6345a4c822b49f5ff580d93959337343ad67686a2d5d23cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::verify::verify_recursive (cognitive 17): Tree::verify::verify_recursive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/extension/tree/verify.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56a5fab451d7e56a7897650bf0c8ee4ceb06a03db71f90b9eb28d2e7bcd3a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_object::commit::message::summary (cognitive 17): gix_object::commit::message::summary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc58dc6f19aa7b9f78a245d232dac634a7b6126fb54212fa863975246538ebe9"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::contains (cognitive 17): Handle::contains has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3a7206b505e1fe0f033c8f16944a0f208ecee5d857118aed3ab119c6030328"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_protocol::fetch::negotiate::one_round (cognitive 17): gix_protocol::fetch::negotiate::one_round has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (5 pts), match/switch 1 (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":"gix-protocol/src/fetch/negotiate.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ccb9858451ec147f0a0232e41b107f0086d6359cc7547c259ae6b1cb5ab930"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::infer_plan_checkout (cognitive 17): gix_tix::edit::rebase::infer_plan_checkout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"23262581d84708d8a8ecf2045ee62218773abd8e24b4b4a4a9d552b921508244"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::app::transition (cognitive 17): gix_tix::app::transition has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"66afe0f59229fb72a909010dc1e4a21abab09dce41c30f4844ff074b13d00d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::unstaged_change (cognitive 17): gix_tix::unstaged_change has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b02e2c4e32bc0b19eff9308a9fcbf4cc26e58b212be5557630dacf7541efe24"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_traverse::tree::breadthfirst::function::breadthfirst (cognitive 17): gix_traverse::tree::breadthfirst::function::breadthfirst has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/tree/breadthfirst.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dd4661351120b22097e165e1e025c55a1cfa7706c7a5fee56efdd5392e167a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_validate::path::is_win_device (cognitive 17): gix_validate::path::is_win_device has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/path.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06bcdd59e00a5630a3598ac524f1b6af17a078c87d9f8c3ef1a878038290275"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::pack::create::create (cognitive 16): gitoxide_core::pack::create::create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, match/switch 2, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/create.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a80615c181206a61dd74ed8965ce11c90e8cff0d2cf47be21a32b7beb42f31e"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository::state (cognitive 16): Repository::state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/state.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1bbb0cfacc62926646ab95bbd95c10b29d96b64649e83c97055254790176e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::create::into_with_capabilities (cognitive 16): gix::create::into_with_capabilities has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2, boolean chains 1, 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":"gix/src/create.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f969e2cba0e253e44b0b573f2f15beed804ade0f0f700d6696b46dec130615"}},{"ruleId":"D2","level":"warning","message":{"text":"Source::storage_location (cognitive 16): Source::storage_location has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/source.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb32c5af709397a753d65080383dc5668762828723c84810ee206d7d0cf82df9"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_config::file::includes::include_condition_match (cognitive 16): gix_config::file::includes::include_condition_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), match/switch 3 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/includes/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3a264b109115c7b16cd47bfc8775fc0cb61b298174e4bf519c0c5683e3f924"}},{"ruleId":"D2","level":"warning","message":{"text":"Name::from_str (cognitive 16): Name::from_str has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, 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":"gix-config-value/src/color.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"667f21d5da543a11ea13b712f5682c238c80cf891bd7a42172c23ea573fb2e43"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_date::parse::git::split_time_and_offset (cognitive 16): gix_date::parse::git::split_time_and_offset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/git.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d00bad18508a4557ea986fc502462f005aad887662788c50168dc61da4e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Stats::from_bytes (cognitive 16): Stats::from_bytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (6 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":"gix-filter/src/eol/utils.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a4e68ba889c907e9a75285547d818451f1862e03ad3d29acf94a444e4103d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Stat::matches (cognitive 16): Stat::matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/entry/stat.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a365f07e13ee71155876464f4aa22ac9e61c3b4d10993b5f36163482e115c132"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_merge::tree::utils::unique_path_in_tree (cognitive 16): gix_merge::tree::utils::unique_path_in_tree 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":"gix-merge/src/tree/utils.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5794c5c14a958ed0f227818fd47739128e5c64b94fffbd0e5264559529b1ab5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Algorithm::next_have (cognitive 16): Algorithm::next_have has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (3 pts), match/switch 1 (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":"gix-negotiate/src/skipping.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eb8abc168dcf2cd94b5e038373f193e2dbbe0150e3e1e798d5fef178d0fc56"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::verify_integrity (cognitive 16): Store::verify_integrity has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (3 pts), loops 2 (nesting depth added 8). 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":"gix-odb/src/store_impls/dynamic/verify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2746cdb9a59d11f3df3c8f6ba4e1024022302cc1d2472af8871bc12cd48d8a64"}},{"ruleId":"D2","level":"warning","message":{"text":"FullNameRef::category_and_short_name (cognitive 16): FullNameRef::category_and_short_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/fullname.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1964d7a5f8fdc3a5956b6565e071c88b952220fd676c2f68bdc5db2239f065"}},{"ruleId":"D2","level":"warning","message":{"text":"App::peel_compressed_segment (cognitive 16): App::peel_compressed_segment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f02eac43ffe6502dd87376cd4e8b8b6ec6d689358d4e24d244a81452becb99"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::stash::rewrite_edits (cognitive 16): gix_tix::edit::stash::rewrite_edits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 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":"gix-tix/src/edit/stash.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae5dc697ea80ea7dea935007215234b2bca2b63eacdb73c5483a7f83b33f26"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::color_graph (cognitive 16): gix_tix::ui::color_graph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"af193ed2e455e18b9911ba7ea8d9879a897b6788cb45092dd46afa20eed7b9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::commit_states (cognitive 16): gix_tix::edit::todo::commit_states has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"246026f62f8af601b4e9a9980cd2b652284ca0d8adddbcbc7dc3005285cb47bd"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::reword::parse (cognitive 16): gix_tix::edit::reword::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/reword.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b49e27cf541537530cb6062b303257cb2e1bbef9b521fa58a7e4a5763abfccc"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::create::prepare_inner (cognitive 16): gix_tix::edit::create::prepare_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, loops 3 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/create.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0527f139474bc2fb6806d7d8c9f1a59c1cebb0e08cdaca1cd33d856debfa09"}},{"ruleId":"D2","level":"warning","message":{"text":"Url::write_to (cognitive 16): Url::write_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/lib.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d31eb568df3933d768a8f98b11fa4997776104f9efd16a07a6c5f47b1dc8c24"}},{"ruleId":"D2","level":"warning","message":{"text":"Url::write_canonical_form_to (cognitive 16): Url::write_canonical_form_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/lib.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2134222e97fb0c435c8aea1cf46ffa8f26ab32350246b498b3997692db761dd"}},{"ruleId":"D2","level":"warning","message":{"text":"State::id_mappings_from_index (cognitive 16): State::id_mappings_from_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/stack/state/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3676a91961b745e4242859b188e0e455a67487c3d95ecfdd5ff1efa73686cc77"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_worktree::stack::delegate::create_leading_directory (cognitive 16): gix_worktree::stack::delegate::create_leading_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 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":"gix-worktree/src/stack/delegate.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2feb46fe2a8106e93e33a4f3578dd38bfc353d2a5b553e92dcef0500d4aebb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::event_loop: FunctionTooLong \u2014 gix_tix::event_loop runs 2296 significant 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 2196 over it, 22.96\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":"gix-tix/src/lib.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62b89bdc7acd5589b06c87201e2c4e6fdb9006fab6b1b0bc94c839e2286fd8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitoxide::plumbing::main::main: FunctionTooLong \u2014 gitoxide::plumbing::main::main runs 1475 significant 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 1375 over it, 14.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf308f7efcdb897344bd8385dedab106895b7ece692a36d7a1193cb8b9dc63eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_merge::tree::function::resolve::tree: FunctionTooLong \u2014 gix_merge::tree::function::resolve::tree runs 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) in one body. The bar is 100 significant lines; this is 1222 over it, 13.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0aa602bfa72995830a26ee4893466800b39933e2685dc2ef3fbe1e7114af32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 5798 significant 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 139 free functions. The bar is 500 significant lines; this is 5298 over it, 11.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a9350f813a6060972107333c5482a13b77d965b07b88f4d806eebcd23ca4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::ui::draw_with_worktree: FunctionTooLong \u2014 gix_tix::ui::draw_with_worktree runs 699 significant 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 599 over it, 6.99\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":"gix-tix/src/ui.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"33681dd96caf922c3e5d116c0b355e7535182c0f081364d72914cd105e3ba2a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Repository: TooManyMethods \u2014 188 methods, declared across 36 files: repository/object.rs (23), config/mod.rs (21), repository/reference.rs (20), repository/location.rs (16), \u002B32 more file(s). The bar is 30 methods; this is 158 over it, 6.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/types.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b8c72a218ceb6d5b348fff09a057b49845a7bc9628cb4b0a25fa3dc730bf44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 176 methods. The bar is 30 methods; this is 146 over it, 5.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f1ccfeb06c47e32b8ffd19d3f6c59f618cfbd7af989f91b65e6341b47dbf23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 2712 significant 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 72% of them inside a single declaration: App (513-3444). The bar is 500 significant lines; this is 2212 over it, 5.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92777b7566e6eaa5d2a8c9524de22c6aa04da1d2d7ea25ffefa2fea4ff79032"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/rebase.rs: FileTooLong \u2014 2506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 2006 over it, 5.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f9aa1fa364d3183a36d07844c18ec070415bcfbf136adc54ef1428bfeba4c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 1952 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 176 methods. The bar is 400 significant lines; this is 1552 over it, 4.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3dffb5752c9593f416c231cc9d22fbf546ac01aa4bb712ae972eb13fa3760b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: File: TooManyMethods \u2014 137 methods, declared across 11 files: access/raw.rs (39), access/read_only.rs (29), access/comfort.rs (24), access/mutate.rs (24), \u002B7 more file(s). The bar is 30 methods; this is 107 over it, 4.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/types.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7c548cc1952239044e1be577aff33b4e8bc529a428d2521bf1dd961b85c22c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.update: MethodTooLong \u2014 update runs 453 significant 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 353 over it, 4.53\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":"gix-tix/src/app.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9aaf7c49218f1a072d23da504437309f2b48cfb8113927db415b00f4e827d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ui.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), declaring 51 free functions. 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":"gix-tix/src/ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e2a11c27a50119e82973c91d62d70061a7019432cb6bc7f9dfbcf10a45b01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::rebase::perform_plan_with_progress: FunctionTooLong \u2014 gix_tix::edit::rebase::perform_plan_with_progress runs 390 significant 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 290 over it, 3.90\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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"16387fc8bdf68d84b903f8931c3ccaf14efd40f5c695768e46491d399335b8db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::command_menu::commands: FunctionTooLong \u2014 gix_tix::command_menu::commands runs 374 significant 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 274 over it, 3.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command_menu.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6b28f5a44d7ceb60c1627fcc27c7fda804c0cfe275c9baeb650770c250e2f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 102 stored fields beside 176 methods. The bar is 30 stored fields; this is 72 over it, 3.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca97ee87e1163481605f5b6b65ac6de83ab11cdf3cc78ac7935ad097946ad9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/history.rs: FileTooLong \u2014 1629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 1129 over it, 3.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":"gix-tix/src/history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa4afb147ebcf345a7337f3b2ece644bbc7307e425a8beced9ece835a081979"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repository.transport_options: MethodTooLong \u2014 transport_options runs 312 significant 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 212 over it, 3.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":"gix/src/repository/config/transport.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548eab0ae0fcd6bfc819c42b7e493ce26a3b72edde430eee6f6f31836ba2344"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plumbing/main.rs: FileTooLong \u2014 1525 significant 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 1025 over it, 3.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d36bfe16f190ca5478f7529bf53bf282e3898a84983bc8d501a2a95a57c29e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::rebase::perform_inner: FunctionTooLong \u2014 gix_tix::edit::rebase::perform_inner runs 304 significant 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 204 over it, 3.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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde845e044a89b11c27a68a507233c5f3df17079401add0bb4f9062e5bfbe9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function/resolve.rs: FileTooLong \u2014 1414 significant 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 914 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fdf2f4f18cb991d2f7c53429f63002922512c8397392c8d278023fa0b86bd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ThreadSafeRepository.open_from_paths: MethodTooLong \u2014 open_from_paths runs 274 significant 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 174 over it, 2.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/open/repository.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfaee95af2d1e9860f4d74e1cabbca73836fcfcad5c51e020d63b892722ba54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::draw: FunctionTooLong \u2014 gix_tix::draw runs 265 significant 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 165 over it, 2.65\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":"gix-tix/src/lib.rs"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f98ef883d15da04306ef6dc22b9a12705d639459213e4868d9442f194a744e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_blame::file::function::file: FunctionTooLong \u2014 gix_blame::file::function::file runs 260 significant 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 160 over it, 2.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39bd2f9b0fa73d34fb8c54bae42fcc25dcedeb41327a54f47b8df805d8733ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ref_tree.rs: FileTooLong \u2014 1270 significant 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 770 over it, 2.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":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38523dd94f5d16d7ccf8985b591c94a5c97d76da1600e142c0ea2ad698b35aa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix::config::cache::init::apply_environment_overrides: FunctionTooLong \u2014 gix::config::cache::init::apply_environment_overrides runs 240 significant 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 140 over it, 2.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/init.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb4cf8d52268c0d62f563543f89879606907a138331c2debfee49b99b06623d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrepareFetch.fetch_only: MethodTooLong \u2014 fetch_only runs 235 significant 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 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173844795c2e01e5acbfee32a71aeca85af00a20084fb9e23bf959728da8f42"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix::remote::connection::fetch::update_refs::update: FunctionTooLong \u2014 gix::remote::connection::fetch::update_refs::update runs 227 significant 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 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/connection/fetch/update_refs/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cc0b6408a56c89d1dbf805d1fcc3aea3545e6312e84b1da5d09bb2098db950"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pipeline.convert_to_diffable: MethodTooLong \u2014 convert_to_diffable runs 222 significant 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 122 over it, 2.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96fc112f1e9f269a03e437e33236c290e1404d55d84d437b7a9bf93bb2df736"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_glob::wildmatch::function::match_recursive: FunctionTooLong \u2014 gix_glob::wildmatch::function::match_recursive runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-glob/src/wildmatch.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c775c99f4e4e58a5a596e4aa0c40ebf5e970b76a00bdf4c5351b3e3f73544733"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::history::load: FunctionTooLong \u2014 gix_tix::history::load runs 209 significant 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 109 over it, 2.09\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":"gix-tix/src/history.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0ad395bc6c7542f94bfa19f992a14f0bd687204f4bd02eb2c300e29b0b138a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::rebase::finish_review_with_progress: FunctionTooLong \u2014 gix_tix::edit::rebase::finish_review_with_progress runs 205 significant 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 105 over it, 2.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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78bdd540c3aedb11facef28356fdec55df30ecf614f197f616486c3aa81988e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/time_travel.rs: FileTooLong \u2014 999 significant 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 499 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c07390009da13ca957fcf3c9bb0d049e33204ee1f9d96881840f78487655805"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::ui::metadata_columns: FunctionTooLong \u2014 gix_tix::ui::metadata_columns runs 193 significant 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 93 over it, 1.93\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":"gix-tix/src/ui.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01dcdca6f5b0ff21802196d8b63f3786fe1d8dc5adc81ee174574421b92ed02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 56 methods, declared across 5 files: access/mod.rs (48), src/write.rs (3), src/init.rs (2), src/verify.rs (2), \u002B1 more file(s). The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/lib.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d1901955eeb0a97f82a5019f8f8419f818c6c1b1a0008d30d4132f6df0e429"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryGraph.refresh: MethodTooLong \u2014 refresh runs 186 significant 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 86 over it, 1.86\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":"gix-tix/src/history.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1ce75f333bec7eb118f7be3290219636be35960251fa67921599b79704a66f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/todo.rs: FileTooLong \u2014 925 significant 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 425 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b529e75888f9a6f9bf55f4def14122f18e401f52eb5235fabe038ccc461659"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.consolidate_with_disk_state: MethodTooLong \u2014 consolidate_with_disk_state runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dcb58b5111beee8488cff3a280c3cc0d621ed6a5936031a71745b0cc8954de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_transport::client::blocking_io::http::curl::remote::new: FunctionTooLong \u2014 gix_transport::client::blocking_io::http::curl::remote::new runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"af10e0579371f6a78c318d9cd51f97320c19ae3d69cb4c66f3cfe02f9abd698c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::todo::parse: FunctionTooLong \u2014 gix_tix::edit::todo::parse runs 176 significant 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c04de7589847ee8424fb84f56595673c43a2c459d48e72fa6e5ae1fe1193e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repository.add_worktree: MethodTooLong \u2014 add_worktree runs 173 significant 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 73 over it, 1.73\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":"gix/src/worktree/add.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"84292de81178eacda1cdabc427677a12f1a8fdb936bb4adb6918799f0fa13609"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: File.resolve_deltas: MethodTooLong \u2014 resolve_deltas runs 170 significant 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 70 over it, 1.70\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":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65983a31a8f71f4ee05521494f966ec45ab28e4338b33eca4fa57747c24c49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 50 methods, declared across 9 files: file/find.rs (14), loose/reflog.rs (9), file/packed.rs (7), file/mod.rs (5), \u002B5 more file(s). The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/lib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38cf477c0d02a5c6d34bbf8d482ba28cb8e1e694c45f508792a38fe6473d6e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_pack::index::write::function::write_data_iter_to_stream: FunctionTooLong \u2014 gix_pack::index::write::function::write_data_iter_to_stream runs 153 significant 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 53 over it, 1.53\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":"gix-pack/src/index/write/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62cd7e6f985142fa1e140cf5b9451dff6c3649e781716c8f7cb03b5e152f01c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Handle.try_find_cached_inner: MethodTooLong \u2014 try_find_cached_inner runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e6dfcddeed89532295c487e3643eb4e972c883b70883e883a19a9fcf73a3da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::todo::prepare: FunctionTooLong \u2014 gix_tix::edit::todo::prepare 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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0205de4562556ab31c100a52da517852adeec31310ebfbc458be2c66154f524a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/mod.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/options/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7a7e14a33ca817d5fad1b4bcd952c61b56fc671e1bc620d4277f31086e186"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Remote.default: MethodTooLong \u2014 default runs 149 significant 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 49 over it, 1.49\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":"gix-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a556612a0eab3deb192f926e5e222b859a8f115a4be9789ea15dbf05ab77e25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Platform.into_iter: MethodTooLong \u2014 into_iter runs 149 significant 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 49 over it, 1.49\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":"gix/src/status/iter/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"382dd4018b40c57d382ce7357351443525cef97897aab6fe84b6e6bed45d9ff2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_pack::data::output::count::objects::expand::this: FunctionTooLong \u2014 gix_pack::data::output::count::objects::expand::this runs 147 significant 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 47 over it, 1.47\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":"gix-pack/src/data/output/count/objects/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57efdfda31269a336cc9b07f6896d324002b81457ba56449edee21c50f9d067"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitoxide::porcelain::main::main: FunctionTooLong \u2014 gitoxide::porcelain::main::main runs 146 significant 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 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/porcelain/main.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ae280c47fb212b6fc50e195f15abe515231a4afea836bf3efb0cc085d7f97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_diff::index::function::diff: FunctionTooLong \u2014 gix_diff::index::function::diff 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":"gix-diff/src/index/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2865fa72326ff2276f65c0cea9e220f7406a6e0ffc4ea984d92bc151fc5cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 43 methods, declared across 12 files: dynamic/load_index.rs (10), dynamic/handle.rs (8), loose/find.rs (7), loose/write.rs (5), \u002B8 more file(s). The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/lib.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bbaf25bdaf879dcf57411a1fe3a0474788f26864b18a60f6512d9a738b7a56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file/function.rs: FileTooLong \u2014 711 significant 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 211 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e5c7730bed515a7a188c951c6745aeb829208e0f18e785d0779d30bf6be795"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Overview.new: MethodTooLong \u2014 new runs 142 significant 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 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9722b9f91921db0177e7c4735c64f3a4f517db406eec77c948492d8102cd5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrepareDetached.receive: MethodTooLong \u2014 receive runs 142 significant 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 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/connection/fetch/receive_pack.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58bd464ce4467dfb076ae3baf3328ad771dce42d8eb48dcea0579c007dd2212"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.verify_integrity: MethodTooLong \u2014 verify_integrity runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/verify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"92551b7e22d4f9336410af5bb4f6b87ac2b284e353765ae34eec27b1c79d492f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::command::write_history: FunctionTooLong \u2014 gix_tix::command::write_history runs 140 significant 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 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0be98c0916b32532d8b35f010de2c5a776d5205c2bce0ba213e3e5cbaaa75b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::time_travel::perform_reporting_rebased: FunctionTooLong \u2014 gix_tix::edit::time_travel::perform_reporting_rebased runs 138 significant 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b08552fcebb6a9ee53601e56971cfc05e9208ce438b44ba8f1b447e427238"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::time_travel::move_head_to_reporting: FunctionTooLong \u2014 gix_tix::edit::time_travel::move_head_to_reporting runs 136 significant 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 36 over it, 1.36\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":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849a087aa194baee8dd01d15f95fc1b158b51469c89eea9dbd2dced107f944e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HistoryGraph: ClassTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 125-843. The bar is 400 significant lines; this is 126 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50f7b9b5e3a85af5f3a0865d5143df575dac64b306626808d697d57cf1a2578"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitoxide_core::repository::index::entries::function::print_entries: FunctionTooLong \u2014 gitoxide_core::repository::index::entries::function::print_entries 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":"gitoxide-core/src/repository/index/entries.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffb61f3889a48d8c434fa9d2ddc73ba47ba745a5b92f373373a7a949a55e939"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::history::decorations_excluding: FunctionTooLong \u2014 gix_tix::history::decorations_excluding 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":"gix-tix/src/history.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5287cc45f6f752f6e434e3141e18a1e65cf5ed3ffe5eeb417ce610466484e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repository.try_find_remote_inner: MethodTooLong \u2014 try_find_remote_inner runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/remote.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1911b40e775b4683a1980f7dae041200600fbbfd4162a2f57017b55ed029cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/undo.rs: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 136 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/undo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86df6855b6409823db89663283e3326e6aa77219d9531b063e90ec2fe52a67f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pipeline.convert_to_mergeable: MethodTooLong \u2014 convert_to_mergeable runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/pipeline.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4825645f6081c3963206296267a1ba8c4955344d088a62929f05462ac5f199"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.perform_run: MethodTooLong \u2014 perform_run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/engine.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e8c184faf9d44c35ccc42cce149d42ec99c59e8e990b5c1a88abee2a175be1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tree: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 145-791. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5044943c85e3be1af65f0894e287a263379359bb64a3614b0cca291cb49b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.prepare_inner: MethodTooLong \u2014 prepare_inner runs 123 significant 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 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f0d6d4be7a337ad84fcc0f31a74eff73de98028a57db9a55dbe843434db2d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_blame::file::process_change: FunctionTooLong \u2014 gix_blame::file::process_change 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":"gix-blame/src/file/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2709cc6f6240c523b28ee2389b4e591236715904725db43a8482c1fcd664499d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::rebase::stack_insert_plan: FunctionTooLong \u2014 gix_tix::edit::rebase::stack_insert_plan runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0c973da638658d416a50fd3705f143dd311cb07b57b611722c89f42515aac9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::unstaged_change: FunctionTooLong \u2014 gix_tix::unstaged_change runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc85ec12f84306ba8c9d410e893fb71d64c385a5290322629fddcec1acdf961"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::head::perform_inner: FunctionTooLong \u2014 gix_tix::edit::head::perform_inner runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/head.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2da5ee70b2276cdedd88d0f23dd0129c783cb417b15fc31465c29507d927f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SectionMut: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/mutable/section.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe2ddb069c7b1c1f67f64d4adfe3ad10f77c8690d9ef2cf6d763cbf90696f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Handle.try_header_inner: MethodTooLong \u2014 try_header_inner runs 113 significant 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 13 over it, 1.13\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":"gix-odb/src/store_impls/dynamic/header.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c40c5ac65dbef86e7d89fa6d2a7e7c2f04497bb42699587b4537117de5a06a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: File.verify_integrity_inner: MethodTooLong \u2014 verify_integrity_inner runs 113 significant 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 13 over it, 1.13\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":"gix-pack/src/multi_index/verify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"356d9884e2343d8648d7e4a78e667b608f3f9072fece583e94bb00c475680cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.lock_ref_and_apply_change: MethodTooLong \u2014 lock_ref_and_apply_change runs 113 significant 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 13 over it, 1.13\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":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a171d7598d769a8ec753822b1d244b87f8d152a185a7e396176911a58dd0381"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/init.rs: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1365fcef160bba423cf2c1828e88200c7476b521710c344bdbba8871b77cdfb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.compute_status: MethodTooLong \u2014 compute_status 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":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b48e84eafd75eece62b8816cf9891466d1a53a5753af1e364535aeb3e2db73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::create::prepare_inner: FunctionTooLong \u2014 gix_tix::edit::create::prepare_inner 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":"gix-tix/src/edit/create.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba33267a0288b8914e5f97a287034846a92f52cc2db118358b66ed15dc0fc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command.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). 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":"gix-tix/src/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb070e7fc4a56eb911fd371a5cda6fd4e58573756bb17ac2fb52c683cbb6d87"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::rebase::update_refs: FunctionTooLong \u2014 gix_tix::edit::rebase::update_refs runs 111 significant 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 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fc2b9d296a6330713b19506fcd251a739b31c332bd6a695597364af4d0e315"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_worktree_state::checkout::function::checkout_inner: FunctionTooLong \u2014 gix_worktree_state::checkout::function::checkout_inner runs 111 significant 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 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree-state/src/checkout/function.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed49427db37551622c086f19454d7b30baacf350e05d69f9ac5bee43d93ac487"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cache: TooManyMethods \u2014 33 methods, declared across 2 files: cache/access.rs (29), cache/init.rs (4). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d6dcc47dd050d88261b4d4543a5329c9415dc846408ed2b280d97eec73198c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix::config::snapshot::credential_helpers::function::credential_helpers: FunctionTooLong \u2014 gix::config::snapshot::credential_helpers::function::credential_helpers runs 109 significant 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 9 over it, 1.09\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":"gix/src/config/snapshot/credential_helpers.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0a83ae2e56879b53513441c16bce1410a1677fae02ade8519167623406642c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: File.new: MethodTooLong \u2014 new 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":"gix-commitgraph/src/file/init.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"879c32a01248ee84e25364b36e94c2b0249443d816850e943fb400dd100eaeea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rewrites/tracker.rs: FileTooLong \u2014 513 significant 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 62% of them inside a single declaration: Tracker (3 blocks, 138-630). The bar is 500 significant lines; this is 13 over it, 1.03\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":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c464ff70556d20d6a9815af354aa9395398e9dfea599016745144aa100abf8c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_pack::cache::delta::traverse::resolve::resolve_parallel: FunctionTooLong \u2014 gix_pack::cache::delta::traverse::resolve::resolve_parallel runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/delta/traverse/resolve.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e00b234d1914618923c33f68b1096715eaa7b3a8eb26e6c2da1b01314a73fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:849-870 | gix-merge/src/tree/function/resolve.rs:1306-1332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f2fab0090584f9400e9244214b6a6bbd10fb79e25e58b0b0c4f040e2aeb062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:866-892 | gix-merge/src/tree/function/resolve.rs:1923-1949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda8d718c01ede3fdc5960e6b98cec4e91d7a1e6b7b80c4f8845096f4f51062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): gix-tix/src/history.rs:687-713 | gix-tix/src/history.rs:736-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ffcc3b41672246fbe14e403e6e42bd467dcbe0d631df2295dc524bbceff61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): gitoxide-core/src/repository/fetch.rs:293-317 | gitoxide-core/src/repository/remote.rs:217-241 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed746d67bf608ec5d91dffd8facb387e574cd5f8d818edcb3b4538018255c0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:704-725 | gix-merge/src/tree/function/resolve.rs:1524-1546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bdfc9938b93c9f7415c94b1d287312fecce5edd52bfc4a064d3f65de15e2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:1406-1427 | gix-merge/src/tree/function/resolve.rs:1794-1815 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db8701968da80f2268d55ff3e490802a7ec788ceb76033189f9ab61ec70c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): gix-merge/src/tree/function/resolve.rs:681-700 | gix-merge/src/tree/function/resolve.rs:742-761 | gix-merge/src/tree/function/resolve.rs:1154-1173 | gix-merge/src/tree/function/resolve.rs:1501-1520 \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":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c647622c53b6227107fcadb47faa47ad0c467e4a0986b20dc2bf779677470c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): gix-blame/src/file/mod.rs:133-152 | gix-blame/src/file/mod.rs:181-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de8020eb428436821172b45ff2eb54c9d63c0bbfcb2a0a244a25375dab7333e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): gix-packetline/src/async_io/read.rs:135-154 | gix-packetline/src/blocking_io/read.rs:134-152 \u2014 \u0060gix-packetline/src/async_io/read.rs\u0060 and \u0060gix-packetline/src/blocking_io/read.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edfaf28e4fbc52583a0292039b6da9dcb94942f0a4bf312e01bedb18756a048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): gix-tix/src/history.rs:770-789 | gix-tix/src/history.rs:1158-1177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4503fa6d29b38b1b3f50221c43551b7ced28772754081845eee693138a9943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): gix-merge/src/blob/builtin_driver/text/utils.rs:194-211 | gix-merge/src/blob/builtin_driver/text/utils.rs:234-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/builtin_driver/text/utils.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f188116c9ff9e20d6f79254d56cbd4740b445560e74f07955f989a8668c029e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): gix-utils/src/btoi.rs:117-135 | gix-utils/src/btoi.rs:235-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-utils/src/btoi.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d541176f273390efa4e2e85b29bc2999453d090e03807577263a68f33f9c238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:800-817 | gix-merge/src/tree/function/resolve.rs:1832-1848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"209da441ed3e1c2f433e74dfc1224c47a2f1e2c50b9504411b271b13e826a54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): gix-date/src/parse/git.rs:69-85 | gix-date/src/parse/git.rs:123-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/git.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"913d3d75f52305de888c7ac7c52518d28515d5556f571b7b8fe1de881452584f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gix-diff/src/index/function.rs:231-246 | gix-diff/src/index/function.rs:258-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"587fb0dd097b06bf326ea774151f63b973d95fb572602d68b5b2352a50591270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gitoxide-core/src/commitgraph/verify.rs:63-77 | gitoxide-core/src/repository/commitgraph/verify.rs:52-66 \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":"gitoxide-core/src/commitgraph/verify.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"655eadd4d49b2a97c7828858e6fbcac7608b7ebbb402cb20f8858d53a921b52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-imara-diff/src/myers.rs:129-143 | gix-imara-diff/src/myers.rs:152-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/myers.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ee566a9b9252689deea6bf4b6437aa6eb4f29cebf864d5610068bdd2add0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-imara-diff/src/slider_heuristic.rs:127-141 | gix-imara-diff/src/slider_heuristic.rs:154-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/slider_heuristic.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfc28910a0f658f15210b01094dda9ec2b225c07ae6c0bf0e208547c1d2824a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-imara-diff/src/unified_diff.rs:230-244 | gix-imara-diff/src/unified_diff.rs:264-278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/unified_diff.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c96db3caba2280072ff2df31435d271b2587c3fb4cc385aab4745bdeca13e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): gix-merge/src/blob/pipeline.rs:204-218 | gix-merge/src/blob/pipeline.rs:289-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/pipeline.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1146a890d5523391c86ed515255f43c062ac29f520e1ca20b9ec10232fa1a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-protocol/src/handshake/refs/async_io.rs:45-59 | gix-protocol/src/handshake/refs/blocking_io.rs:43-57 \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":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc765305879726f535b92c2cc049fc329b8a73ed3dcf3388b527b1a7ca738e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-tix/src/edit/rebase.rs:1242-1256 | gix-tix/src/edit/rebase.rs:1538-1552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"291f8632969dec40e43b4fdd59fc89545ac2cb32ea278886cc932bcb85a96681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/plumbing/main.rs:1834-1848 | src/porcelain/main.rs:178-192 \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/plumbing/main.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca88521f222636be0708036e98a57cbe480df9cbe08ce2c151759633cd205946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gitoxide-core/src/commitgraph/verify.rs:45-58 | gitoxide-core/src/repository/commitgraph/verify.rs:34-47 \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":"gitoxide-core/src/commitgraph/verify.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2436c8cc0066707a26bc89838df530474409fb8983667f6b59ae0df447da360a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gix-object/src/commit/ref_iter.rs:253-266 | gix-object/src/tag/ref_iter.rs:127-140 \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":"gix-object/src/commit/ref_iter.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef3ca4e25975d50e0198a0f8153021ff80a0d92a36b705a3822374530415b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): gix-packetline/src/async_io/read.rs:167-180 | gix-packetline/src/blocking_io/read.rs:165-177 \u2014 \u0060gix-packetline/src/async_io/read.rs\u0060 and \u0060gix-packetline/src/blocking_io/read.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6568c15fac63b66f5d5e02eb452848eb78fef6b27653f4a15d1af02327f985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gitoxide-core/src/repository/index/entries.rs:401-413 | gix-index/src/lib.rs:223-235 \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":"gitoxide-core/src/repository/index/entries.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa19b810f4df19dd5909f9398a8e223f3d79bcc408a33547471b8865d3daa6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): gix-blame/src/file/function.rs:969-981 | gix-blame/src/file/function.rs:1000-1011 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"c543e19926c5ee95aeeb73fae7ae11d7e3cf56e68c325961ce75bf6a7a8ac4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-packetline/src/async_io/sidebands.rs:285-297 | gix-packetline/src/blocking_io/sidebands.rs:145-157 \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":"gix-packetline/src/async_io/sidebands.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"364ff686e01b749dea8ad33cbddf2d314af1db9fe74fdd91c8c226f8d1d2dd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-transport/src/client/capabilities.rs:224-236 | gix-transport/src/client/capabilities.rs:311-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/capabilities.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44eb9b1ed4a7de4ba9b40e29a97037bb3946054021c0ce98ecbc928e070c43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-traverse/src/commit/simple.rs:524-536 | gix-traverse/src/commit/simple.rs:606-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd42438442d7ce1cf9dab2301d827f8bb53b819621c00c7dc61eeab4223f80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-pathspec/src/search/matching.rs:134-145 | gix-pathspec/src/search/matching.rs:196-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"732efd14d715d67c3c10a46114c5e14c71507be01c36902fef6f5653de0fa91a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:148-159 | gix-transport/src/client/git/blocking_io.rs:143-154 \u2014 before extracting anything, compare \u0060gix-transport/src/client/git/async_io.rs\u0060 and \u0060gix-transport/src/client/git/blocking_io.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef95ab469b853d56aef87a682b741f87bfe7230e2bd0c3d35ac38e27a278ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-worktree/src/stack/state/attributes.rs:109-120 | gix-worktree/src/stack/state/attributes.rs:148-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/stack/state/attributes.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e10db3af22088bf03097c272bfcfe15eda181accc49b17b1865604aab1305de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gitoxide-core/src/repository/merge/commit.rs:60-70 | gitoxide-core/src/repository/merge/tree.rs:94-104 \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":"gitoxide-core/src/repository/merge/commit.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8f2c31ff94a83e6175dfbdd57562e51530e0e9733d9170f410121e46ebfeb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix/src/worktree/remove.rs:384-394 | gix/src/worktree/remove.rs:400-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/worktree/remove.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dde582a3d0792b1feac1a39690acea8867026631018d2920562742ab963a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix/src/config/cache/access.rs:55-65 | gix/src/config/cache/access.rs:119-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/access.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a1dfee37f3fc411511ffc228c8d86f2af49ba361649634c5b3457622c99285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix/src/clone/fetch/mod.rs:82-92 | gix/src/clone/fetch/mod.rs:108-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4f990b005f1e12b7431cd63b65cc2d17b0a4523eabe5c0a80919b7a229b448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-diff/src/tree/function.rs:225-235 | gix-diff/src/tree/function.rs:279-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/function.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"118583640b4d97918024b0e89e79d513edf0c93fda6373029764c109ae1c7251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-index/src/access/mod.rs:354-364 | gix-index/src/access/mod.rs:445-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/access/mod.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a92e5808cd9b1ce1e875b07dd03986914ee529fb597aa8d8158035fbb139d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): gix-object/src/parse.rs:23-33 | gix-object/src/parse.rs:93-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/parse.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca09d05a77db55ba5eac7995da0130f6d704d4746d3d6d3465a4e12a8937b671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-pack/src/bundle/write/mod.rs:96-106 | gix-pack/src/bundle/write/mod.rs:209-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/bundle/write/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f018b6c37231b90233303e625a3bbde2e4948bbee5c7f8753e7b7eb1d3a05fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-packetline/src/async_io/read.rs:115-125 | gix-packetline/src/blocking_io/read.rs:114-124 \u2014 \u0060gix-packetline/src/async_io/read.rs\u0060 and \u0060gix-packetline/src/blocking_io/read.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"92820c406b372ff006a7100dc0d29ebfda6f8d48729a2745db34cef970fee5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-tix/src/history.rs:1274-1284 | gix-tix/src/history.rs:1940-1950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b677227465fd3d0951734447a918edd42c5fcfd3d11aee73e7eca0fb10373ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:86-96 | gix-transport/src/client/git/blocking_io.rs:83-91 \u2014 before extracting anything, compare \u0060gix-transport/src/client/git/async_io.rs\u0060 and \u0060gix-transport/src/client/git/blocking_io.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8e190e242d680eb6019b342d393853495af7829e4353697e600f4562fd70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): gix-merge/src/tree/function/resolve.rs:702-711 | gix-merge/src/tree/function/resolve.rs:762-771 | gix-merge/src/tree/function/resolve.rs:1522-1531 \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":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e8d5ae3e6538dd3b1691981790c14e0aee2f4d32f3537bf9136a3d80dd74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): gitoxide-core/src/repository/merge/commit.rs:45-54 | gitoxide-core/src/repository/merge/tree.rs:73-81 \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":"gitoxide-core/src/repository/merge/commit.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a22535b4e09e597a92923afc8d0167d1ab905c35377699d3bf8c0fc1682a1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): gix-config/src/file/util.rs:18-27 | gix-config/src/file/util.rs:40-48 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/util.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fdf304f57f0be0146285123c85d6f858c6ef964a2bb770918a0367268e0e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): gix-date/src/parse/git.rs:60-68 | gix-date/src/parse/git.rs:101-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/git.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d3c10fc210feecd943ee91f6b97cd721b0b8c511383639f66293815d165b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-hash/src/object_id.rs:70-79 | gix-hash/src/object_id.rs:85-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-hash/src/object_id.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"781cc004dcd9041c5334995c3c5141ee96dbb83d961ee5f00096d4aa0a57b1a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-merge/src/blob/builtin_driver/text/function.rs:174-183 | gix-merge/src/blob/builtin_driver/text/function.rs:201-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/builtin_driver/text/function.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66e6d9090942047af117161fa753cff3db3bcdfefbbec82c6fafc9df37fbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:1567-1576 | gix-merge/src/tree/function/resolve.rs:1873-1882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5951ed1a725653338e58f38a8a56b3a0be75f5bc16eaa4d39526c017499d01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-packetline/src/async_io/read.rs:47-56 | gix-packetline/src/blocking_io/read.rs:45-54 \u2014 \u0060gix-packetline/src/async_io/read.rs\u0060 and \u0060gix-packetline/src/blocking_io/read.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc51b4c385b5cf7fe8ccb91013943d5a0521f4ef6ab11265a1ec48631bbb6a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-protocol/src/handshake/refs/async_io.rs:14-23 | gix-protocol/src/handshake/refs/blocking_io.rs:14-23 \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":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c65f956e7c2aaa2178634754c85eaaaa809b5f94390d95f021617beeebf87b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-tix/src/app.rs:1991-2000 | gix-tix/src/app.rs:2052-2061 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d752961f9b2d1de1817e2aa6941b6206aea7aaef731a1f0310cacabd8214c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-tix/src/edit/rebase.rs:3027-3036 | gix-tix/src/edit/rebase.rs:3042-3051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06728ea4818af176c6b89e721827f60f30131e80f31c8c0dc2328d4fa79d912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-validate/src/tag.rs:147-156 | gix-validate/src/tag.rs:164-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/tag.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"25686a8e4490fdd8a3b82af3a0e569480241152f23917c53d4caf180fb88a577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): gix-tix/src/app.rs:1865-1873 | gix-tix/src/app.rs:1891-1899 | gix-tix/src/app.rs:1905-1913 \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":"gix-tix/src/app.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"4086c0e99888703faa2a424137ddb6274592312e490f8c45a89df076f5bd464e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gitoxide-core/src/repository/fetch.rs:234-242 | gitoxide-core/src/repository/remote.rs:170-178 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebd910c3133732913f7daf19635da38daf7b146ea9fc65d65b750907a97b96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-config/src/file/mutable/section.rs:319-327 | gix-config/src/file/section/mod.rs:292-300 \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":"gix-config/src/file/mutable/section.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0162a093702424beace286ef0b8270e48527bf09229d959135e9f93896ee13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-odb/src/store_impls/dynamic/handle.rs:257-265 | gix-odb/src/store_impls/dynamic/handle.rs:275-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/handle.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feab39143dbbc57bd615c6d6510beeb45f2249984e84b30e9c7aa65d66e3c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): gix-pack/src/index/access.rs:229-237 | gix-pack/src/index/access.rs:290-297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/access.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b92340916c577b30c4c6300e3d814a460c73051e9aa00d42399baf3bf2963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-pack/src/data/delta.rs:42-50 | gix-pack/src/data/delta.rs:54-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/delta.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"651776ad434912c49b8f24c707129751252fbcb39e58bdd032da030cb810d281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-protocol/src/handshake/refs/async_io.rs:11-19 | gix-protocol/src/handshake/refs/async_io.rs:42-50 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9f4e979fe0e8c3dae1db58cdd8360562fd01182023de8f1aa6d7debe1e6730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): gix-refspec/src/match_group/mod.rs:68-76 | gix-refspec/src/match_group/mod.rs:142-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/match_group/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ee4c5c4d8d522349d3fee7f646a357312b6e495670fb817870977dcf70faf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/command/enrich.rs:172-180 | gix-tix/src/lib.rs:5398-5406 \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":"gix-tix/src/command/enrich.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89617ee7eeba0920c21cfdcbb3f1dcb6796eb6c3b41a72ae4abc3a76f47eecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/edit/rebase.rs:613-621 | gix-tix/src/edit/rebase.rs:767-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0604b07578678d8b44b370392bfc835117ec1d10c371f38e05e74245b543423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/edit/rebase.rs:2452-2460 | gix-tix/src/edit/rebase.rs:2907-2915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7e1f7cf338e0811483bc50feffe8aa1569c26b876540f895c078b97f1c3bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/lib.rs:6196-6204 | gix-tix/src/lib.rs:6746-6754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6196}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b0b5d06d242817b6b919d0ec6818ee29849a5a18c141312e6c2fdf1e4c3d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:56-64 | gix-transport/src/client/git/blocking_io.rs:54-62 \u2014 before extracting anything, compare \u0060gix-transport/src/client/git/async_io.rs\u0060 and \u0060gix-transport/src/client/git/blocking_io.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec0e933f9abfae70b9204ca502399515bcc7d5ce9136d64f5ac6c96e54293b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/plumbing/options/mod.rs:770-778 | src/plumbing/options/mod.rs:850-858 \u2014 both copies are in the same file, so extract the block into one function there 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/plumbing/options/mod.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef23c5b1cf933f5e0da1e80515bda35427567a08a930776988be9110e1bcc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/plumbing/main.rs:149-157 | src/porcelain/main.rs:17-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f4cfdc4ad4bf771fd697ec9b2ebf7ca529864715f4501d728f525cd0ae56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): gix-tix/src/history.rs:193-200 | gix-tix/src/history.rs:644-651 | gix-tix/src/history.rs:1039-1046 \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":"gix-tix/src/history.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daba4901b6f2520c501c0138f36996528c0eaefd2e51f30e1b5987c25a7193b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-blame/src/file/function.rs:584-591 | gix-blame/src/file/function.rs:594-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9b753596be01d4f827f959058d459ac138a35674bdba7afb3e2859e0f492d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-diff/src/rewrites/tracker.rs:556-563 | gix-diff/src/rewrites/tracker.rs:612-619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd28d7b26bc0c59c40aaf3c3ec9db12f91e29ad195fcd5a9b0ac4a058572d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-pack/src/cache/delta/traverse/resolve.rs:649-656 | gix-pack/src/data/file/decode/entry.rs:495-502 \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":"gix-pack/src/cache/delta/traverse/resolve.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbaf209596666628789df7c42fe3c768d047f1faccdcfcf567c3f682a42d0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-packetline/src/async_io/encode.rs:89-96 | gix-packetline/src/async_io/encode.rs:116-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd97978115f013a0d35385183242990cd58363088860e9d07cd029ba1a56cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-tix/src/edit/time_travel.rs:476-483 | gix-tix/src/edit/time_travel.rs:634-641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"56142e1bf98eb653cd3098ff8f4e3fc23e5d88d9d4d94e52e7e9128397af5a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): gix-blame/src/file/function.rs:585-592 | gix-blame/src/file/function.rs:595-602 | gix-blame/src/file/function.rs:874-880 \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":"gix-blame/src/file/function.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0599fa7c9bb122f8fec64a0c18455055f4539a1be157cb37df520ba8a4098da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gitoxide-core/src/corpus/db.rs:61-67 | gitoxide-core/src/query/db.rs:15-21 \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":"gitoxide-core/src/corpus/db.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51f08e84add74092e2f612f983922c76d1ef657c762d800bc74ee7d6ac855f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-object/src/traits/find.rs:220-226 | gix-object/src/traits/find.rs:238-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/traits/find.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"471490b66a333852f9b66455128aac364274072cfe9850853e2cbd64e8b04082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-pack/src/index/traverse/with_index.rs:84-90 | gix-pack/src/index/traverse/with_lookup.rs:91-97 \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":"gix-pack/src/index/traverse/with_index.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de5e3bf62b65db3f9b06ea0a85d7335f1bd5dd53d56e542397fd9e52c8b031d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-ref/src/store/file/overlay_iter.rs:391-397 | gix-ref/src/store/file/overlay_iter.rs:404-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/overlay_iter.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fc61c52654276491fc5e6f1e25feb4cb276e2ed95e74dd71a41a013087aba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/edit/rebase.rs:1284-1290 | gix-tix/src/edit/rebase.rs:1574-1580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae49765e33f57181a5c5cbc0334d0bf6bcf5de49bf5adcef9d0ba1b52225bf7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/ref_tree.rs:257-263 | gix-tix/src/ref_tree.rs:709-715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa57e7525fc6bce6f302d151f4fa85e23297eadb63c416d1e42f71f114d3f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-transport/src/client/async_io/bufread_ext.rs:133-139 | gix-transport/src/client/blocking_io/bufread_ext.rs:123-129 \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":"gix-transport/src/client/async_io/bufread_ext.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84e6734f451f3902cd0bff615c52105a3d139c4268d6e2b49659a7ad6e008e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-features/src/parallel/in_parallel.rs:61-66 | gix-features/src/parallel/in_parallel.rs:129-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-features/src/parallel/in_parallel.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"072585987e02778c8bf3a59c81b8a8c55df24c1f5227cb10b897cbc6728f392b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-packetline/src/async_io/encode.rs:76-81 | gix-packetline/src/async_io/encode.rs:101-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c06ed6e3f67b8f0177cd0cfe2bc365b961c7093de9e3f71918419f889a52ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-revwalk/src/graph/mod.rs:207-212 | gix-revwalk/src/graph/mod.rs:258-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revwalk/src/graph/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4399f147cd194e1737c9b5a7ce7ef386bd9706adddd5fd3501e5cc4032ec2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/lib.rs:537-542 | gix-tix/src/lib.rs:548-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":"gix-tix/src/lib.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d55011c433e48d775336c2318ac252bef4a876d55b9fae9c9072ad61d9f409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-worktree/src/stack/state/ignore.rs:179-184 | gix-worktree/src/stack/state/ignore.rs:208-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":"gix-worktree/src/stack/state/ignore.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d62de1567af76f59d1c848f3d036c695c2e4d6bd4889f65a937ebe7955a863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): gix-worktree/src/stack/state/attributes.rs:107-111 | gix-worktree/src/stack/state/attributes.rs:146-150 | gix-worktree/src/stack/state/ignore.rs:181-185 | gix-worktree/src/stack/state/ignore.rs:210-214 \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":"gix-worktree/src/stack/state/attributes.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"731b2c573e66e3a7e55fc27696d3188c9e28aa3c4432c1fd4e46b1f8bf2186ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-diff/src/index/function.rs:145-149 | gix-diff/src/index/function.rs:151-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccf5ef59a5d047a8b38873cbb02dc81e3d649ba9a5aa50f83d9f695eedd976f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-imara-diff/src/sources.rs:175-179 | gix-imara-diff/src/sources.rs:208-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/sources.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ff5884e6cc904228d7ac8e6b6ff145e5db3e7da7bb521deab06c8b32960920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-odb/src/store_impls/loose/find.rs:97-101 | gix-odb/src/store_impls/loose/find.rs:122-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/loose/find.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ff0e8abb419bfc91d101e8d5fb6c4ccf51ca41a95278ab181afef9c50c6fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-prompt/src/unix.rs:42-46 | gix-prompt/src/unix.rs:61-65 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-prompt/src/unix.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c0f251e1c25871ec78b53b28b27154f2b315e0f38cb900aa39f3a054007e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/app.rs:1776-1780 | gix-tix/src/app.rs:1787-1791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"47872cd8953fc80010a85287282adda2a21f993006bf23b6595f6882c8a028ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/app.rs:3555-3559 | gix-tix/src/app.rs:3571-3575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e90b090342879dc6de3ef3499e797f276d67973b8fac8150cc95def61319e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-transport/src/client/async_io/bufread_ext.rs:118-122 | gix-transport/src/client/blocking_io/bufread_ext.rs:108-112 \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":"gix-transport/src/client/async_io/bufread_ext.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c85a0130cd5814e569cecb4d59dc1b61ca1ef06a1faa909409eefdb7d9342c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (184 lines \u00D7 2): gix/src/open/permissions.rs:37-229 | gix/src/repository/permissions.rs:36-219 \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":"gix/src/open/permissions.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0675f9302e06c34dbed299ce6cbb31825bcd9a2c2eaf392d4e94442a79a686b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): gitoxide-core/src/repository/tree.rs:53-59 | gix-diff/src/tree/recorder.rs:82-88 | gix-index/src/init.rs:198-204 | gix-traverse/src/tree/recorder.rs:56-62 | gix-worktree-stream/src/from_tree/traverse.rs:39-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/tree.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f832e11df22080969261b21f384b4360b5657231ab12b90f4e0a5fe67c4780d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): gitoxide-core/src/repository/tree.rs:61-69 | gix-diff/src/tree/recorder.rs:90-98 | gix-traverse/src/tree/recorder.rs:64-72 | gix-worktree-stream/src/from_tree/traverse.rs:47-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/tree.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbce0b3b08fc2b5d68b33abebeb858ac6d682e379d45caa213b8902969a1846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-config/src/file/section/mod.rs:196-200 | gix-config/src/file/write.rs:10-14 \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":"gix-config/src/file/section/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67059ab1b8bf4fa66d53ac919cc52f81b77c8601e4cc58a4a811a818a51eed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-config/src/format.rs:96-100 | gix-config/src/parse/format.rs:81-85 \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":"gix-config/src/format.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bc8308b808d0d40d017d4376e010882e71da7fb206ab92dee46283e889cf50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-diff/src/blob/pipeline.rs:495-501 | gix-merge/src/blob/pipeline.rs:313-319 \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":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"185efac8674132595ab2ca59232fc8a8fc2d7f5d6042970b294bb9c3d17c01e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-diff/src/tree/recorder.rs:122-133 | gix-traverse/src/tree/recorder.rs:120-131 \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":"gix-diff/src/tree/recorder.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd12a19ea5d997ec3272608fa95284cb0888d6769173a27a52773b56de9c6d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-error/src/error.rs:143-148 | gix-error/src/exn/impls.rs:251-256 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/error.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d662f8128310570a149c74440bf447999093f5a35aa345c73fa6675d45b57cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-hash/src/io.rs:108-112 | gix-pack/src/data/input/bytes_to_entries.rs:336-340 \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":"gix-hash/src/io.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacfe81a7f85ca426c049ece9db4ff91dd061f471f6f5155ac9c2eae0ad9fc05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-object/src/commit/ref_iter.rs:162-168 | gix-object/src/tag/ref_iter.rs:78-84 \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":"gix-object/src/commit/ref_iter.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"638cf21c1430930f54ff7f11bc09419449fc45f7ab5eba4176ebb8bcf139faf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-transport/src/client/async_io/bufread_ext.rs:123-131 | gix-transport/src/client/blocking_io/bufread_ext.rs:113-121 \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":"gix-transport/src/client/async_io/bufread_ext.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8532027139160dd6ea26accdb8327559623d962864e1e796ea462199f5a82e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-transport/src/client/blocking_io/http/curl/mod.rs:153-158 | gix-transport/src/client/blocking_io/http/reqwest/remote.rs:361-366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec03907feba926924c948cff42bc9fd0b42039d4ce1d2c3c4fd9b35102c2d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:118-126 | gix-transport/src/client/git/blocking_io.rs:113-121 \u2014 before extracting anything, compare \u0060gix-transport/src/client/git/async_io.rs\u0060 and \u0060gix-transport/src/client/git/blocking_io.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8273105b6f5eb0793e5c08a1f87fe1790e00e1a26da77ea085e2b2571692bd93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-odb/src/store_impls/loose/find.rs:213-220 | gix-pack/src/lib.rs:67-74 \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":"gix-odb/src/store_impls/loose/find.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0a2579b23b0758d89f9486b36e2e58b8547789d149ae7ff135bef4b0dcaf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-pack/src/index/verify.rs:115-124 | gix-pack/src/multi_index/verify.rs:50-59 \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":"gix-pack/src/index/verify.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaa761a51aef22062e9a35cf1a2cbc176f4df2ae6983150afd9e3621a2f90f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix/src/config/tree/sections/core.rs:548-559 | gix/src/config/tree/sections/pack.rs:73-84 \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":"gix/src/config/tree/sections/core.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96159e6916aedd6892a9fe305095c3352c36dc34a88d366203d686b65ca379e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/plumbing/main.rs:1649-1658 | src/plumbing/main.rs:1704-1714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"414a0cefd416abd150203d97e46ebe157a99d73f197bbbf84be8b1f4f6c3112e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-filter/src/driver/process/client.rs:91-100 | gix-filter/src/driver/process/server.rs:93-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":"gix-filter/src/driver/process/client.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e986a8145d6f4fead61f7c50b50a8fabde0d583645bba057c4d81261bf801d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/lib.rs:5352-5360 | gix-tix/src/lib.rs:5409-5417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":5352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3994f0912aa468963bb2068e7c7fa04757e5e896b7b9aa41d27048b3481811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-filter/src/driver/process/client.rs:39-47 | gix-filter/src/driver/process/server.rs:41-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/driver/process/client.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75c84bf4a38a3d39ceceacd7877f1f25c21fd9f3a10acc6521ea055b9d1ce46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/command/enrich.rs:139-147 | gix-tix/src/command/enrich.rs:183-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":"gix-tix/src/command/enrich.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa505c6648b20d4458c0446ff79687f0ccd2d0241b858854cbbf29b6cdef85d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-imara-diff/src/unified_diff.rs:180-187 | gix-imara-diff/src/unified_diff.rs:189-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/unified_diff.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"451401f35f386e25fc1190f439b32bde0f9e82e523567f3989c5c997854d5787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/edit/rebase.rs:2362-2368 | gix-tix/src/edit/rebase.rs:2415-2421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1612b9c7b29d0a39c435ef4e0721869470dccd5cbc11cdff4430ac6245ca58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/edit/create.rs:386-392 | gix-tix/src/edit/split.rs:108-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/create.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1e4011a4bde14b3235a7262e5ebf9f66f1217413497c0b5c9c14cec93f6be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/edit/rebase.rs:409-415 | gix-tix/src/edit/rebase.rs:3006-3012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf682de3ece8862c971ee00ec5ec8d3ef1ccc02f1728b162d13a6ba5fbfef1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/edit/create.rs:396-402 | gix-tix/src/edit/split.rs:116-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/create.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"001df7312d8182e8ce48eb9873a925542c1b2d60ee6550a7cbbd7487c0500d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/history.rs:764-769 | gix-tix/src/history.rs:1151-1156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc478cd4f976e3a7a096431a4481ac44bbbd6303082c9d0d8236375e27a6180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-filter/src/driver/process/client.rs:29-34 | gix-filter/src/driver/process/client.rs:81-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/driver/process/client.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc79aa5f24606aed93cfe8568793d11c1ee8586468dd29aea621a53653a97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/history.rs:1280-1284 | gix-tix/src/history.rs:1491-1495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"384bf001c36718abdf6237be615932fa0dabf56c3b5e04c21a21e3a9f77d4f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/edit/time_travel.rs:1201-1205 | gix-tix/src/edit/time_travel.rs:1227-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"300093a57073a2f7e17b9f05f6b029eceeb920d45fce7bebe15ba300947c4a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gitoxide-core/src/repository/fetch.rs:168-172 | gitoxide-core/src/repository/revision/list.rs:122-126 \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":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a6b51d792ec952082117e483e4bdf72e76ae6adeb2e6f827c3f647cb377900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-config/src/file/includes/mod.rs:159-163 | gix-config/src/file/includes/mod.rs:180-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/includes/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"408dfa51ffc27338d76a7534c1bb3b669767453060d571dc9003d248531e3cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-odb/src/store_impls/loose/write.rs:36-40 | gix-odb/src/store_impls/loose/write.rs:53-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/loose/write.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9d174ac83545588d6b49082812bcb4a45d78d28f9dc8a3efb654e1a2995ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-odb/src/store_impls/loose/write.rs:73-77 | gix-odb/src/store_impls/loose/write.rs:91-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/loose/write.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeb7581ff698c58536e2009c1d7de5880738080e31ac5d3c9382c8bab318ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-refspec/src/match_group/mod.rs:90-94 | gix-refspec/src/match_group/mod.rs:161-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/match_group/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3249881b5fb8ad1389a00468060ebb36cf2611ee75a6c39eb5ebc55c64700f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-pack/fuzz/fuzz_targets/index_file.rs:34-44 | gix-pack/fuzz/fuzz_targets/multi_index_file.rs:35-45 \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":"gix-pack/fuzz/fuzz_targets/index_file.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9012a49e720d4b699a60f10d2c80eaeb98968bef9028a49e5f7cf25779428d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-pack/fuzz/fuzz_targets/index_file.rs:13-21 | gix-pack/fuzz/fuzz_targets/multi_index_file.rs:15-23 \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":"gix-pack/fuzz/fuzz_targets/index_file.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb321746c437cd4b9b0d72be26529592afb9ad9df7c99fcc313973b2ae7143f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gitoxide-core: gitoxide-core has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f2c718d945dc71b82c2aef20a18e175aa989d8c3a17949a6d669079f951683a6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix: gix has instability 0.95 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e63a072d82719aa1251f91ba58bbd01fbddcee8be959e220801d9ea1ad347681"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-blame: gix-blame has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8be5ebbca4786c1921b9155742af8534a27e3d9303bddc922fae41ff2b9bd603"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-dir: gix-dir has instability 0.85 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aee12b6034bc05876ac23cb688e52fe527389c246c0c62e21ae4af0119afa29a"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-merge: gix-merge has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dc8edb756242f709ac898ef1e44a665afce9dc624fe0b24c851fc15908abf7a0"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-odb: gix-odb has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1889a3e9d6690d5b5fbe1a555eda686ad38545d3540105ed4b345895d496cde8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-protocol: gix-protocol has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"71ccf715051211af548806b6e515eda9fd0541df25c6a74db2f2548f28206945"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-status: gix-status has instability 0.86 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"66a5280f4c23e3471bba6bdd1c8549de637ff1e0f2a386101c853c15d162e042"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-submodule: gix-submodule has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d356aeb855a7ef8dd6f9ef7a55f78fdf16edc649ba7c3be0890337cb1786f84c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-worktree-state: gix-worktree-state has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"00de0bfad4cf7cf440c5e0074f3883afd5e7913189a7e0f2f67a1e39fc77f790"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-worktree-stream: gix-worktree-stream has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ef809b8dd09b53d34b57d2528ccf7f3affae1f2928ea4f2fde831ab7c3cea22"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-trace: gix-trace: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86d587427ba31c0d4fbc8d6e73c0649b331b3a29c0ac43712454406eeb79e677"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-hash: gix-hash: abstractness 0.00, instability 0.07, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 25 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5052e1d069e8c92f997d725917e93869bcb60ecfc6e47226e653bc4f72bdfa3e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-date: gix-date: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6603f10712bf6c278e465799b97eb45756cd8888d439c9d83f6080f95dd7645b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-path: gix-path: abstractness 0.00, instability 0.09, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 30 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a8afc1db9c425a76c685d2a877fd5cbf759871a70cf9128e52379ec32deefc65"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-hashtable: gix-hashtable: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6b97bbc58c11e14ea718a7b84f83980c36eb1036a6c9fd5cf69e81c3c1103f1c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-tempfile: gix-tempfile: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"09509002be46494bcdcfcee339469efb810797d4065d28fc7b7302b950e39035"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-imara-diff: gix-imara-diff: abstractness 0.12, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"648d7784fc197353d5fe8fab23bc87051cddadb0b8c633b99c1a61b05c2fbbf4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-validate: gix-validate: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5094c5469556157eea75a26b6d97c3c41af05dd68f27b44ff89a235117edcf34"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-error: gix-error: abstractness 0.21, instability 0.00, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 52 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"077a598fb47b10dc453ae2e5176125c0105278c75f0bbd5bf44db6e57035f5ac"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-zlib: gix-zlib: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b48c9b9611d5c6bb56f386297d93f99a0feb1a8bb50ae9b85099d910db9d9a4b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-features: gix-features: abstractness 0.12, instability 0.14, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 18 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15bfdb43a04a36aa370824a43f7e1e711ce9242f21e5b75d719b8d67d8484bb5"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D9","level":"note","message":{"text":"Inverted test pyramid: Only 22 % of tests are unit tests (930 unit vs 3338 integration, 0 BDD); a broader unit base gives faster, more localised feedback."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3fc0c6fc621cd18b83a2d2c03ea6976b61fb4769f62dc21043f0af4cad912d10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/lib.rs: gix-tix/src/lib.rs changed 194 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 372 in gix_tix::event_loop at line 1014. 52 of those changes were fix/bug commits, and the other 142 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64d5146577aed16c9731b571c92be8a5c96edd3bd717a623758afad95f3f18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/app.rs: gix-tix/src/app.rs changed 147 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in App::update at line 1575. 35 of those changes were fix/bug commits, and the other 112 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"836c86aa05c2d2a5c6b80fbaf5ae1de89a8a70b7690237889ff0d7fc2101a011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/ui.rs: gix-tix/src/ui.rs changed 167 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 135 in gix_tix::ui::draw_with_worktree at line 391. 33 of those changes were fix/bug commits, and the other 134 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4c6e57badd05aaed3b0c0ac25be1b847e6ba6a0d056fc14eecf792b85ea5eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/rebase.rs: gix-tix/src/edit/rebase.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in gix_tix::edit::rebase::perform_plan_with_progress at line 1621. 20 of those changes were fix/bug commits, and the other 40 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/edit/rebase.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e96faf7bedbefc60b24bb5a46d4f9022db7e66bed1636eae71db3f496ee6c83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/history.rs: gix-tix/src/history.rs changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in gix_tix::history::decorations_excluding at line 1926. 17 of those changes were fix/bug commits, and the other 58 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/history.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867ffbd1f10209727d9d0e09c36d65db7aba7b5c218f53cfdd92aed7ec05d83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-merge/src/tree/function/resolve.rs: gix-merge/src/tree/function/resolve.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 192 in gix_merge::tree::function::resolve::tree at line 97. 1 of those changes was a fix/bug commit, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-merge/src/tree/function/resolve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"17083926f8c14c5de901a3b1bb703cbac390de7ee2a5dcb8af5aa92383479e9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/plumbing/main.rs: src/plumbing/main.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 122 in gitoxide::plumbing::main::main at line 57. 2 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- src/plumbing/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/plumbing/main.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3106c5d6c2eb3c222a86c6f989915c298a70758f45b3f765ca29237423369df5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/todo.rs: gix-tix/src/edit/todo.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in gix_tix::edit::todo::parse at line 832. 13 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/edit/todo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"502aa6d2f8e448f173ae5b66cc595b0b73f65146dbee9233e378154822a28d3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/time_travel.rs: gix-tix/src/edit/time_travel.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in gix_tix::edit::time_travel::move_head_to_reporting at line 314. 16 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/edit/time_travel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"de77b2d1e26a575fac3b69153ef641c963925de1460a3c1f7adcb91d2cd73d69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/open/repository.rs: gix/src/open/repository.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in ThreadSafeRepository::open_from_paths at line 166. 6 of those changes were fix/bug commits, and the other 21 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix/src/open/repository.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/open/repository.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79dc488203a17c22c445628c22cba03d8e9309d5f6a1f6a340476f377d9894a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/command.rs: gix-tix/src/command.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gix_tix::command::write_history at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/command.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7ab07aea6aee035634ba9e8ccf20e1f800d87eb6d3c08a16ff46fc9b53280d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/ref_tree.rs: gix-tix/src/ref_tree.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Tree::handle_key at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/ref_tree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c062a3a652d16c4ecf722f0f79be3020fcdc4dba58070c70de2adcb1090f927"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/create.rs: gix-tix/src/edit/create.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gix_tix::edit::create::prepare_inner at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/edit/create.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/create.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f02aef4b3d13235e34030030e8831ef425bae551f5be546310661c30da7f2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/head.rs: gix-tix/src/edit/head.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in gix_tix::edit::head::perform_inner at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-tix/src/edit/head.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/head.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d4486047d4e668c2bc6469673a010af5d7ae07ce613137d96a0893c0a366ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/clone/fetch/mod.rs: gix/src/clone/fetch/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PrepareFetch::fetch_only at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix/src/clone/fetch/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":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e86f5e8008a08ea7f96a59fb0eb9510cb7117d78466af6e72dddff8ef7523c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-transport/src/client/blocking_io/http/curl/remote.rs: gix-transport/src/client/blocking_io/http/curl/remote.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in gix_transport::client::blocking_io::http::curl::remote::new at line 408. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-transport/src/client/blocking_io/http/curl/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"542e982cd0caf20b9a5e569578b312579e18ed3634a82a9f1eaa032f430d5a25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-blame/src/file/function.rs: gix-blame/src/file/function.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in gix_blame::file::function::file at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-blame/src/file/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d05bcf2e8adfedbcf25e1e6e4bae7fdf1d7a387ee4d2725da3b7151510fd46b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-url/src/parse.rs: gix-url/src/parse.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in gix_url::parse::url at line 117. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-url/src/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/parse.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f334a8a27adfb7d0417f5a4188dd640b46fdcfdf95b0e03c5ebc90751e66f11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-url/src/simple_url.rs: gix-url/src/simple_url.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ParsedUrl::parse_host_port at line 202. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-url/src/simple_url.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/simple_url.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4523e1aad3361ae98f34e4ac78b4059728e5f8cd028938eea19df561bfa72309"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/remote/connection/fetch/update_refs/mod.rs: gix/src/remote/connection/fetch/update_refs/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in gix::remote::connection::fetch::update_refs::update at line 63. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix/src/remote/connection/fetch/update_refs/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":"gix/src/remote/connection/fetch/update_refs/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"03644836c548a7eabe469c972855f05910a13fffca0184610e0c9f73657d5cf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-status/src/index_as_worktree/function.rs: gix-status/src/index_as_worktree/function.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in State::compute_status at line 371. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-status/src/index_as_worktree/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fe1d555bbbe5aaca90d5edd7993369e04de42c5a196f93b19045a616cf64cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-diff/src/blob/pipeline.rs: gix-diff/src/blob/pipeline.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Pipeline::convert_to_diffable at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-diff/src/blob/pipeline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17ae3378c0e59152745f7dff81efa19d22b4a1c53f67596082c4afb362a1201"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/find.rs: gix-odb/src/store_impls/dynamic/find.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Handle::try_find_cached_inner at line 51. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-odb/src/store_impls/dynamic/find.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7c9b99f5828c032aeab013f71caee9f40b4e649cdc7b63b88ec168d1854fa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/load_index.rs: gix-odb/src/store_impls/dynamic/load_index.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Store::consolidate_with_disk_state at line 168. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-odb/src/store_impls/dynamic/load_index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"899871e0d7cd599ff30908b8497e994c7f5aca98f5157b14f16d5b18dfa62e88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-pack/src/cache/delta/traverse/resolve.rs: gix-pack/src/cache/delta/traverse/resolve.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gix_pack::cache::delta::traverse::resolve::resolve_parallel at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-pack/src/cache/delta/traverse/resolve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/delta/traverse/resolve.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3b646a88ea2f3a662faadca01876bb5f78bdebe8986a6f16556373c0b3e5e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-ref/src/store/file/transaction/prepare.rs: gix-ref/src/store/file/transaction/prepare.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Transaction::lock_ref_and_apply_change at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-ref/src/store/file/transaction/prepare.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0227dcc723aea733da9b37810e776de5ca3201706fa6c30f0dc7bd4c0d49f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-url/src/lib.rs: gix-url/src/lib.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Url::write_canonical_form_to at line 734. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-url/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/lib.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cdf6dda7f39f70fbce3965ce8534d0572bf3fb362b373400c470872b5993de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-credentials/src/helper/cascade.rs: gix-credentials/src/helper/cascade.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Cascade::invoke at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-credentials/src/helper/cascade.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/helper/cascade.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e1e456f8f46c615b1d6a5c686f8f7f55d2ed4a0176883491c42ded05dfed11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-glob/src/wildmatch.rs: gix-glob/src/wildmatch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in gix_glob::wildmatch::function::match_recursive at line 55. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-glob/src/wildmatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-glob/src/wildmatch.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e13a8e192a416b7e2c9900a35cd9ff6c5cfbe6a5eb3f7bf87a7cb71beee25a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-refspec/src/parse.rs: gix-refspec/src/parse.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in gix_refspec::parse::function::parse at line 19. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-refspec/src/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/parse.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fab3a54a697685aec6799aed5f3e738e0d7b3507830bad609f06e7cabd6466"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-diff/src/rewrites/tracker.rs: gix-diff/src/rewrites/tracker.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gix_diff::rewrites::tracker::find_match at line 684. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-diff/src/rewrites/tracker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e2f0b04b6083b752311d460dc96a0e2ddadd48812a4932087636cb3628a4c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-status/src/index_as_worktree_with_renames/mod.rs: gix-status/src/index_as_worktree_with_renames/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-status/src/index_as_worktree_with_renames/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":"gix-status/src/index_as_worktree_with_renames/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a3bbf01bf8cf1b450924c4aba05001b92ef627bdfae5e733bb7c4d687bfdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-protocol/src/fetch/function.rs: gix-protocol/src/fetch/function.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gix_protocol::fetch::function::fetch at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-protocol/src/fetch/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/function.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"08126bfce1800394a3787b0e6b0a4668e360ae4fcb938a4e7bca330de922f03f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-transport/src/client/blocking_io/http/reqwest/remote.rs: gix-transport/src/client/blocking_io/http/reqwest/remote.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Remote::default at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-transport/src/client/blocking_io/http/reqwest/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1b58e17019ed8369a9241c8ef1a4393959973cae18adcff642baf29606de21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/query/engine/update.rs: gitoxide-core/src/query/engine/update.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in gitoxide_core::query::engine::update::update at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gitoxide-core/src/query/engine/update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/update.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68752a9597112214d0a468f526c399c0abaaa89dc31fb8ba81bcf938830e68b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-merge/src/blob/pipeline.rs: gix-merge/src/blob/pipeline.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Pipeline::convert_to_mergeable at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-merge/src/blob/pipeline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/pipeline.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"67524eff40cbe40eea60907d26c2ace45c465bf2e3758e3fcf8319ee54fb432f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-config/src/parse/from_bytes/mod.rs: gix-config/src/parse/from_bytes/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in gix_config::parse::from_bytes::value at line 318. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-config/src/parse/from_bytes/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":"gix-config/src/parse/from_bytes/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb7309c44487dd471e6f99145745768d45c0387400189ba9de83506b706f92b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-object/src/tree/editor.rs: gix-object/src/tree/editor.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Editor::upsert_or_remove_at_pathbuf at line 272. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-object/src/tree/editor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tree/editor.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29b31a9943b779e369992b13f20fd3c696accac1f4d3778e1d426b2360fd160"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-date/src/parse/function.rs: gix-date/src/parse/function.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gix_date::parse::function::parse 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-date/src/parse/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/function.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1297815537afc25ffd81efde361be6463bb3d88aec39771fbaf610a0fafc9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/header.rs: gix-odb/src/store_impls/dynamic/header.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Handle::try_header_inner at line 20. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-odb/src/store_impls/dynamic/header.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/header.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cea30b565dcbe78429cd296ee5c4e3c50697f30b3d6babbe33888ff75110b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/config/snapshot/credential_helpers.rs: gix/src/config/snapshot/credential_helpers.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gix::config::snapshot::credential_helpers::function::credential_helpers at line 69. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix/src/config/snapshot/credential_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/snapshot/credential_helpers.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bdab2e28829c2e6a15312615152c60e7d81b29cf05dca458140f69b9bd1938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-pack/src/data/file/decode/entry.rs: gix-pack/src/data/file/decode/entry.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in File::resolve_deltas at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-pack/src/data/file/decode/entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdecbff8f95bfdca628c0a7d1fb4d367df44dec84ce9e667d3fe15026220e174"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/remote/save.rs: gix/src/remote/save.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Remote::save_to at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix/src/remote/save.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/save.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06678c14a4b39df32d5c3bcc74491ecf934886ed5275a01dfe23d6de64c6ae2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/repository/remote.rs: gix/src/repository/remote.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Repository::try_find_remote_inner at line 182. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix/src/repository/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/remote.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"78202484911c15de51ed3bb7573926c6db5b0f4bbce3efb572525796da832f72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-config-value/src/color.rs: gix-config-value/src/color.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Attribute::from_str at line 387. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-config-value/src/color.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config-value/src/color.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ca347ad635f87adca38ce10105ccea95b024a22244923862289fc129ead7c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-credentials/src/protocol/context/serde.rs: gix-credentials/src/protocol/context/serde.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Context::from_bytes at line 92. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-credentials/src/protocol/context/serde.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/protocol/context/serde.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce1a15e1362bd72e2ec404e76ac5ec0bc37d5efd6af43135d2a414945073cac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-index/src/extension/tree/verify.rs: gix-index/src/extension/tree/verify.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Tree::verify at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-index/src/extension/tree/verify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/extension/tree/verify.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9778c7f9749b3547c2f854129a8221e9f4203b6ca0ed07eca9d33896c2dcbe31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-ref/src/store/file/transaction/commit.rs: gix-ref/src/store/file/transaction/commit.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Transaction::commit_inner at line 37. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-ref/src/store/file/transaction/commit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/commit.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"718dd102db4a2c2648aaaf61435ba67880837c8ef00af73da113f6e93bb778fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-fs/src/stack.rs: gix-fs/src/stack.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Stack::make_relative_path_current at line 138. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-fs/src/stack.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-fs/src/stack.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b4c792cacebdd46a690b34cadac0d5c7502c591a2a36491cf7c937d8f00134"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-pack/src/data/output/entry/iter_from_counts.rs: gix-pack/src/data/output/entry/iter_from_counts.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-pack/src/data/output/entry/iter_from_counts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/output/entry/iter_from_counts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"42680db1ceb2989885e1b61e476862e085730d86c779409cdd43fd21de4c0eac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-protocol/src/fetch/negotiate.rs: gix-protocol/src/fetch/negotiate.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gix_protocol::fetch::negotiate::mark_complete_and_common_ref 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-protocol/src/fetch/negotiate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/negotiate.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4ab598b4c4d5a29e679134029d9b4926608bf3ee85ddd9d6bad27542eab391"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-protocol/src/fetch/response/io.rs: gix-protocol/src/fetch/response/io.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Response::from_line_reader at line 51. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-protocol/src/fetch/response/io.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/response/io.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5b8188e5e0af98391043681337d7ff04041c38495881939afabbf4eb0d3144"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-pack/src/data/output/count/objects/mod.rs: gix-pack/src/data/output/count/objects/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in gix_pack::data::output::count::objects::expand::this at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-pack/src/data/output/count/objects/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":"gix-pack/src/data/output/count/objects/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1732e79b8fd27f6be636c27ad8ed129f462979bb51dc80b4ec9839aed368331a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-dir/src/walk/classify.rs: gix-dir/src/walk/classify.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in gix_dir::walk::classify::path at line 133. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-dir/src/walk/classify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-dir/src/walk/classify.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c1411671f9622c325e2c810fd048111c460f950f4c9598966b5c6158a5967"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-discover/src/upwards/mod.rs: gix-discover/src/upwards/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gix_discover::upwards::function::discover_opts at line 205. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-discover/src/upwards/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":"gix-discover/src/upwards/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00307e13979d90184dce3ad496849d538cf9e6b53bdd554bab65bacc096a74c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-discover/src/is.rs: gix-discover/src/is.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gix_discover::is::git_with_metadata 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-discover/src/is.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-discover/src/is.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca0e3db3c6f0dad39e91560dc9384ce61424949780f467c11f5d29ca4556045"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-filter/src/pipeline/util.rs: gix-filter/src/pipeline/util.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Configuration::at_path at line 26. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-filter/src/pipeline/util.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/pipeline/util.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfec3ecdca6fb2dde119466644b8fad28a112d83c68a9c57b1e45c3d6a8524ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/prefix.rs: gix-odb/src/store_impls/dynamic/prefix.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Handle::lookup_prefix 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-odb/src/store_impls/dynamic/prefix.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/prefix.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ddf8f46b4e98954ca2c2445e23098ca62ccf4ef4165d8e6645bdf58d0a2950"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-filter/src/eol/convert_to_git.rs: gix-filter/src/eol/convert_to_git.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in gix_filter::eol::convert_to_git::function::convert_to_git at line 55. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-filter/src/eol/convert_to_git.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/eol/convert_to_git.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb56a73a946cbaa1c7c8e3f95ea596678f5fbd483b9c0475de25a90b0260a98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-diff/src/index/function.rs: gix-diff/src/index/function.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gix_diff::index::function::diff at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-diff/src/index/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f63442234ef79cc8e7f8a71122b537db926d253275ebec18b5c3e292a729cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-utils/src/str.rs: gix-utils/src/str.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gix_utils::str::precompose_impl at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-utils/src/str.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-utils/src/str.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c28b1ef9c4dd247da1e4d20319e637fc56b36ee1a095a66bea73ab1503dc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-path/src/realpath.rs: gix-path/src/realpath.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gix_path::realpath::function::realpath_opts at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-path/src/realpath.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-path/src/realpath.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"190765bea13a1e1c9be8c7f16daf9fc937fd820bec0afd6e94a615666803da32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/organize.rs: gitoxide-core/src/organize.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in gitoxide_core::organize::find_git_repository_workdirs at line 29. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gitoxide-core/src/organize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/organize.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cf26ad9a0631e5c4b332ddee12e383671c8378b864fe479ce39bfa0e6c55b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/index/checkout.rs: gitoxide-core/src/index/checkout.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gitoxide_core::index::checkout::checkout_exclusive at line 14. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gitoxide-core/src/index/checkout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/index/checkout.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4e91b8dab715f7385875192c3070d9ae3b7fc72715704dd2b922268c10bda8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-index/src/extension/link.rs: gix-index/src/extension/link.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Link::dissolve_into at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-index/src/extension/link.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/extension/link.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9475bcad6997691b6b1050528eb6a5c08928fef8e51e752fdcf42c1c1210357d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-packetline/src/async_io/encode.rs: gix-packetline/src/async_io/encode.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LineWriter::poll_write 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-packetline/src/async_io/encode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"04eae2244434ffd7cdae549aeef1f9ff49d3bd72316200ee501487722ec6d625"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/repository/merge/tree.rs: gitoxide-core/src/repository/merge/tree.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in gitoxide_core::repository::merge::tree::function::tree at line 27. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gitoxide-core/src/repository/merge/tree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/tree.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afd1a55979d363645e58364979baa370c94bb0ebda7e49f6fb4461b7b3dd869"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-revision/src/merge_base/function.rs: gix-revision/src/merge_base/function.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gix_revision::merge_base::function::remove_redundant at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-revision/src/merge_base/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revision/src/merge_base/function.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eecc54db72a9536fbd34364f5415cd1ae891d6c47e22bae7e4601a3cbe0e86e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/repository/status.rs: gitoxide-core/src/repository/status.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in gitoxide_core::repository::status::show at line 47. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gitoxide-core/src/repository/status.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/status.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b67ac02b112b4845ea8fc5aed240933a8a378ecdd9f68fbde4536e40b0a64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/repository/attributes/validate_baseline.rs: gitoxide-core/src/repository/attributes/validate_baseline.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline at line 32. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gitoxide-core/src/repository/attributes/validate_baseline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5555ca80ae815efa4ce49607f5a1a929e828f307ef8ead7d3e3772457f58294"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-protocol/src/handshake/refs/shared.rs: gix-protocol/src/handshake/refs/shared.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in gix_protocol::handshake::refs::shared::parse_v2 at line 208. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-protocol/src/handshake/refs/shared.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/shared.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ea8b8bdef9468394b17296a9d3e87a561b66826cab06380506a494f6daec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/load_one.rs: gix-odb/src/store_impls/dynamic/load_one.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Store::load_pack at line 14. Frequent change and high complexity in one file compound: schedule 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-odb/src/store_impls/dynamic/load_one.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/load_one.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"810c666e2d142a5fcd61558571797b0da23a3273c5052e60a5826a480bb8d445"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-fs/src/lib.rs: gix-fs/src/lib.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is gix_fs::adjust_shared_repository_permissions at line 143), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-fs)!: apply Git\u0027s shared permissions for files and directories\u201D; \u201Cfix(gix)!: preserve causes across fallible conversions\u201D; \u201Cfix(gix-fs): revalidate cached terminal entries before reusing 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-fs/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-fs/src/lib.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afc53ae6411ed305b770fdb3e8ea5c851f09623916096c308c7a81544b18afe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-command/src/lib.rs: gix-command/src/lib.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is gix_command::win_path_lookup at line 159), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-command): safely split commands and ignore shebang options\u201D; \u201Cfix(gix-command): invoke existing absolute paths directly\u201D; \u201Cfix: use onfigured shell arguments in gix-command\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 18:44:01 \u002B02:00\u0027 --until=\u00272026-09-28 18:44:01 \u002B02:00\u0027 --full-history --no-merges -- gix-command/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-command/src/lib.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"251867d761dcfe8cb0763daf6d7843b573372d973ebc87e9500b14784cd5f6eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should make use of the \u0060git2::DiffOptions\u0060 \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":"examples/log.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"10701b61a4ec7312678ebae1b6854938c1b309802b39beb57b71a92e806f6c0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: wait for new release of \u0060tracing-forest\u0060 and load the ID from span fields. \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":"gitoxide-core/src/corpus/trace.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad414cc612dfa68df7fba2439c64cf887a74de6fc6458a5fe2c491a8cbf94eee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: wait for new release of \u0060tracing-forest\u0060 to be able to provide run_id via span attributes \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":"gitoxide-core/src/corpus/engine.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922d24ebd63985334adbb96935a28e7e246abe67b18ee231f7d0b1b91c5b80d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a way to get the pack cache from a handle \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":"gitoxide-core/src/repository/verify.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"030dbad3690ab83f26d79d167946cf4f87184dcf9c7535b9bc09e56ec40b8b89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(name-revision): this is the simple version, \u0060git\u0060 gives it \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":"gitoxide-core/src/repository/submodule.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"709d2ca7dbf7e310f761fe0373b53345903816551b30c2c3d5e62237fa468308"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle multi-status characters, there can also be modifications at the same time as determined by their ID and potentially diffstats. \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":"gitoxide-core/src/repository/status.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c361bea8b278fa7fae046a02720d9a0942b4d63f937b302fe0b4b81fb0b24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(blame): Git uses something akin to \u0060ToGitUnlessBinaryToTextIsPresent\u0060 here, but with a specialty: textconv output is converted \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":"gitoxide-core/src/repository/blame.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9725a45974e6a23b20be3db474e48b1c7c52f2080b723eab54a3fbff8729a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to not have to do more work, but make the warning go away. \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":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"763922863a638e69334b46596f2d8a2221d2ee2cd84d8acd18eb67e5c3a52e67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(borrowchk): this shouldn\u0027t be necessary at all, but \u0060pathspec\u0060 stays borrowed mutably for some reason. \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":"gitoxide-core/src/repository/attributes/query.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f14dd1737edc709d4ce2d7cca336daa7dcc87c36e9b06e849f502cbac6a86fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be some sort of \u0027smallbstring\u0027 - but can\u0027t use \u0060kstring\u0060 here due to UTF8 requirement. 5% performance boost possible. \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":"gix-attributes/src/state.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f858552c0c8ed250805a8bde7fd4bf0e5a700f1e8e37ac4b59038a44ec7876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(borrowchk): one fine day we should be able to re-borrow \u0060slot\u0060 without having to redo the array access. \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":"gix-attributes/src/search/outcome.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"311a415bbf30334516976b8d32dab18abb6611b57334f5633b2ebab1287b3424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should \u0060Pattern\u0060 trait use an instance as first argument to carry this information \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":"gix-attributes/src/search/attributes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"286592c81277608657ca0fd64f8620d2c554ab3da25320727cef7dcbbd421ad9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(blame): add a type so rename tracking can avoid comparing blobs with symlinks. \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":"gix-blame/src/types.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ca9a6710a3f225679ffae75a511354c73612786635188acc02581082edce1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): renames are usually rare enough to not care about the work duplication done here. \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":"gix-blame/src/file/function.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2fc7404be7e0e298b4d8f95c8033ef12ba50d9171272883b57660cd3bedaed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(blame): add a test to show of symlink blaming works. \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":"gix-blame/src/file/function.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"01567338d228e2ff64eebafc4ca35ece23fe0b2847a6010e921d4afab5cde8f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Detect duplicate commit IDs across different files. Not sure how to do this without \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":"gix-commitgraph/src/verify.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88c73ef34716cb8f513568c0f33d4ae89a4bd155c7e1289b8c187cee378996"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify self.fan values as we go. \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":"gix-commitgraph/src/file/verify.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"891dbab657d0fc6afe855cb38863b061c35c5579d12025e3004ea11ae1f5c587"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for corrected commit date offset overflow. \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":"gix-commitgraph/src/file/commit.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5341804f256dbda5e185cfd12cea9a72e0aa134627a6d894b53ccc27b1cb0098"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //         TODO: use the \u0060*_r\u0060 version, but it\u0027s much harder to use. \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":"gix-config-value/src/path.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63faf9f4bcf3ce8ad007fd0c4af633f608fbb4382561c5dcd98144b7c009ba3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(error): make it fallible \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":"gix-config/src/file/mutable/section.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa484a2c88f85d6107de450469f29e29c10fbd00688663ad735837975da51684"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this can probably be done more smartly, right now it\u0027s more of a brute force. Learn from Git here. \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":"gix-date/src/parse/git.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d87638b94dbcd8f8c1ae2a8567d7bcd692f1260e08085a63ab21a8265ca934"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060bstr::Lines\u0060 here, but it\u0027s not \u0060Copy\u0060 \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":"gix-diff/src/blob/platform.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc7d86ab79906345344d16f1e102cb90cc7990bc4354b6a43a8e69fc64c72d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this \u0060dyn\u0060 once https://github.com/rust-lang/rust/issues/65991 is stable, then also make tracker.rs \u0060objects\u0060 dyn"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/platform.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9aa42e557fa0d8e3b666f65884d674e98fb0f7472bd247503eb90677d70335"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this - the diff shouldn\u0027t fail if binary (or large) files are used, just copy them into tempfiles. \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":"gix-diff/src/blob/platform.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80dd99afc5e160f69d1caf0a79b688c5ac949ee4508d4e2355a1f14947f1893"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for an actual Context, validate it *can* match Git \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":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ebdea4552922bc4b26ead75a708a4e7915f017442c0abb29bab0ce8e58aff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: update this with information about possible directions. \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":"gix-diff/src/blob/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997db8e9cbbb6002abb95119f488ed94141062c192d6879b42f4274e5b4fb47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can this be made so the code above does the job? \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":"gix-diff/src/blob/unified_diff/impls.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4939d580436c0d1af0cd0e5017395cf444452590de8033ab6ad64ae64522a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rewrite this based on what Git actually this, as long as there are test-cases for any \u0027complication\u0027. \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":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8361468a27d2bb5e16d228eb4f52c6ddba78386f88bb0f5f08052c041e30d243"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out if git does more here \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":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"27669cfce534f74aa2237fd6729f8e725001b3af9ce5f2ffade039b0e449f8f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this \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":"gix-diff/tests/diff/blob/unified_diff.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45507e31de12023cee9c9d80505b1bd70da0b06a722e57fd3dfe21d696c49c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this \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":"gix-transport/src/client/blocking_io/file.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72d687485cfe41fbe444941ea638617acbd6831ece25d84b1afccc001556c43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: either get this to work for icase as well, or remove the need for it. Logic is different in both branches. \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":"gix-dir/src/walk/classify.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e6e6247d32ba661aff93e75ce26cd189663cb73f20d2e42f059179e3b60a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): multi-threaded hash-table so it\u0027s always used, even for case-sensitive lookups, just like Git does it. \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":"gix-dir/src/walk/classify.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc29037ac04804324aa3c1707aaa9946ccfa94f747bac588a035e15a8833a05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try for deletion, and prefix combinations \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":"gix-dir/tests/dir/walk.rs"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6b2ab52512a0bdcf69882eefc226cfd6ee6b1a8bfc32b4c32da252147c8636"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test on Linux \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":"gix-discover/src/upwards/types.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e69cb1297aed61228cb2157853b795b1e7b7ff2889862a8472193f15357439a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle WASI once https://github.com/rust-lang/rust/issues/71213 is resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-discover/src/upwards/types.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"675369fd390063c9544fe507926aec810e5ce7fc07a51d9d5b4c96f95c48510c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \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":"gix-discover/src/upwards/types.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed1d0a0b3bba54084bce6d32503028073f421c6d503452a773456cb115be87f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \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":"gix-merge/src/commit/mod.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b2c7b9a558a3bc77b4c4c7268fcfe2cb345ce868e115412ab1a2fccf8807db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \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":"gix/src/state.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3a9894ee7e15017b5fcdbee334bdb87ad93e44b00cfee699a8b1366a449042"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \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":"gix/src/repository/merge.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c9390b6b6213d42d8d00962c917aa9e979be8f33e14d0c3850abac6c01d8b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests for trust-based discovery \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":"gix-discover/src/upwards/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4611fdde8b75e6f1799d4405e4bbd557c6ded692470ff9fbe84754453fc0d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out tricks to make this unnecessary. \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":"gix-error/src/exn/impls.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b093c79c89b991c043fbe19b97e6c06e46bcf636b9cc7c86fc65e30825bfe377"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move all this to \u0060gix-fs\u0060 in a breaking change. \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":"gix-features/src/fs.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e125723049275205a6852375dbdbd7609cd42f518742ed248ed9318886c27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to not have to do this \u0027borrow-dance\u0027. \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":"gix-filter/src/driver/init.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba2e98d88b2b8b6ff9064ea4cc8baac9d05e7461e67a0b7d049d535467d9064"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to not have to do the \u0027borrow-dance\u0027. \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":"gix-filter/src/driver/delayed.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1454d96f78d680c8a75c40a71664a15c66f20f6d007bfa6d3cd7bc156c708ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to not have to do the \u0027borrow-dance\u0027. \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":"gix-filter/src/driver/apply.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a5cc2275adb8b4293b184a4a6084eb174ebb79cc0a6f34fce400a69d75935b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): This keeps the entire input in memory until the writer is done. For \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":"gix-filter/src/driver/apply.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f769be6db07660e56ba9108ad1a0823e327a6396f5e06249037254a71e9cf28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use the \u0060symlink\u0060 crate once it can delete directory symlinks \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":"gix-fs/src/symlink.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b16bf5ad0b4b697cb52f4bd0582513690c911d16988c1c39623112cfe7c3dd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out if links to links count as files or whatever they point at \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":"gix-fs/src/symlink.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c32d390a6433ba5d9575d6b6ca50371f16a4bfb06df8380375428935d3467c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060ErrorKind::FilesystemLoop\u0060 once stabilized. \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":"gix-fs/src/symlink.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c2d8d270648c174a1ed536eea6c73a801a2e1ca0266fc0a435cc53f1a6606c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix-fs/src/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0d6bc65d3bf149b273c0c3c78934e5e14d9304a3b90976e39570f1b376ffbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix-fs/src/capabilities.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46046ccab8d9e5b5879fcd0e653060665d475a04d10417d8743efe6408a50cab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/pathspec.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dd866f2a5b1abd1bc04ce86ae323b0864bef9d3418f9e76f47bc42e9d54683"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/clone/mod.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"605e0ccdbdc006c4786cb474c3b0319a0a32c5137b55a38c3a74d16667bb5fb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/object/peel.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e069a3629885ea1392c50980a60dad2688a0530770d08357781d3aabc5b73ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/object/peel.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e40b0b49c017128436d898f185c0709d15ccf1cc935b3a23203fde3fedd3da4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/open/repository.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0760d25a8201fabe8c3742326946ed1b575a3e820bb40a6b8a4bd0b57894d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/open/options.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55b4888b1b8194a468e30cce7e27f31b0cd60e6b072d4f517fe5458b3a34aef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/reference/iter.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487cfd0fc16b0b088228d94af40f93e471188c587b83af819614cc735786de7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/reference/iter.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc452e4e34a3a7b589f7a5bae682f3b66ec2e897915f940360cdb91633c20ef3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests \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":"gix/src/reference/iter.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6366628050f8eb8a1fc3c4a0e05b21835d71ab99eeff4ac4f54619fb5aa40a6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for IsNotADirectory when it becomes stable \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":"gix-fs/tests/fs/dir/remove.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aa5564143565d107f5eeb712447d78486db34a064ad8f08f79864a75450fe8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for IsADirectory when it becomes stable \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":"gix-fs/tests/fs/dir/remove.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"799ec6005fefddcdda8d665f71c28c4b8b835c335751009e527845ec80484269"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     - TODO: consider how to handle a missing commit (invoke \u0060missing_cb\u0060, or possibly return a Result?) \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":"gix-fsck/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2393d42c176695ed3a531c41b079b7d6b8d78039831a9d90fa85d9ed7cf74b96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make \u0027const\u0027 once Rust 1.57 is more readily available in projects using \u0027gitoxide\u0027. \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":"gix-hash/src/kind.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beeacc66e03ab769c162103cabaed4366a484b632f9e86d1e6013eb97984deb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gix-error): review and attempt to remove the need for this if possible. But don\u0027t stress it. \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":"gix-hash/src/io.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f4b6dce8aaa13d904462e38cf09eb35ab955a4eac52968ca92b1aa323e7a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gix-error): review and attempt to remove the need for this if possible. But don\u0027t stress it. \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":"gix-hash/src/io.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf002653390ef387da85c93222135686080ffbd8ed6a9b2aeb9f2fdaf25e8848"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Since SHA-256 has an infallible \u0060finalize\u0060, it might be worth investigating"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-hash/src/hasher.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7067ade48e91ea3a9a181df30091fe24d194d2ed40ec893e9ae6eceec090dbd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: why is this needed \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":"gix-imara-diff/src/slider_heuristic.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b847b6fb158bf21be1d1a71331a8425d2f9a9e7baa4ad6574c836fce51945602"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO do not unnecessarily rescan lines \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":"gix-imara-diff/src/myers/preprocess.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d8b4b9f63acf713cf18ab1e3ae909e2c2d39dd8071adffce777048c9be7b1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: verify links by running the whole set of tests on the index \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":"gix-index/src/verify.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fed3fd767e072bbb6dd74260315a4cc793bf3c15062481365a403aa88bdd31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: integrate this somehow, somewhere, depending on later usage. \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":"gix-index/src/access/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ba70d6112aa86a088540f350a56174f4334c98f908074c839df5b4ea3de2fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: needs multi-threaded insertion, raw-table to have multiple locks depending on bucket. \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":"gix-index/src/access/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33e1b5d10ac0e1321052553cf189c001b1b23096e3a87178d4705773319781a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: entries are actually in an intrusive collection, with path as key. Could be set for us. This affects \u0027ignore_case\u0027 which we \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":"gix-index/src/decode/entries.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3b7639f5caf72450d34a0721ba1b7937cbf9612554ea0dce6cb7f1a1a8e049"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): for some reason, this causes tremendous \u0060memmove\u0060 time even though the backing \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":"gix-index/src/decode/entries.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7e7ff3e1bdffcbcdfcdfb9dc1fb46220b6bff772b0e9a3db888f7053ca3ab4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could we use the pathlen ourselves to save 8 bytes? And how to handle longer paths than that? 0 as sentinel maybe? \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":"gix-index/src/entry/flags.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4709d3ef738c713407c0d5c3c226340a5fd394650947dad9d29b66dd1975961f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// The directories stat data, if available or valid // TODO: or is it the exclude file? \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":"gix-index/src/extension/untracked_cache.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f3692cc1c8a5ec1b83bb43529ffe3b4a3e4c1247a1ef7290526bc183e1b6cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: figure out what this really does \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":"gix-index/src/extension/untracked_cache.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b453938e9e3a559606073cd1ece0a20c3073c4ce77cb225312fbdb23bef6f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this work and re-enable it, once this is done the fixtures can be merged into the main \u0022roundtrip\u0022 test \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":"gix-index/tests/index/file/write.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3993eda370038c9353af48e0d19eebfb770ad4d6b54e71da6f78f430937b2838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this fails because git allows to configure the index version while gitoxide doesn\u0027t \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":"gix-index/tests/index/file/write.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f84688d0178fa045e4e2d3c1c152cded98de2c37d4fc18b8a4c5589684afff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this fails because git writes the sdir extension in this case while gitoxide doesn\u0027t \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":"gix-index/tests/index/file/write.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69e02b60920bf9438124519a78972842afd14b1766756c1009ba3e88ab24947"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this - only needed while \u0026mut Vec\u003Cu8\u003E isn\u0027t used. \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":"gix-merge/src/blob/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3383747404b3972f728f126f4e0b7e72245311c63cc92f7f5af6d688c619f3f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove dead-code annotation \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":"gix-merge/src/blob/platform/merge.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c95be322a94b59dc43c8a6b46434152e492984cf1164e111d42c3728687f4e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this nicer once we have nicer errors. OOM should be a standard error anyway. \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":"gix-merge/src/blob/platform/merge.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbcad4eeaf900d530537bd5f7923bfa7ab195ef6b05db964b18317c9ea2ae65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(borrowchk): this re-assignment shouldn\u0027t be needed. \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":"gix-merge/src/commit/function.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"561d2a256c9aad9f37308063fad3a2f5a5bd63dcc8805a1a8180d7f635aa7345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can we have a better data-structure? This would be for a rewrite though. \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":"gix-merge/src/tree/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb0adde5a79fec9be998983e1d0e3e230f549fa18cda96bdcb7b121b2854903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix all of these eventually \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":"gix-merge/tests/merge/blob/builtin_driver.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6692d75ef5063f058573c1485da9a8c0eadb2491e1be90a54f1b90e68bdef906"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: why did this ever work? \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":"gix-merge/tests/merge/tree/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"929a752435350d41b4aa1b72509ec18e7cd448eacff676c62465de7f4e17263e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Allow callers to provide a callback with enough submodule-repository context to perform reachability checks. \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":"gix-merge/tests/merge/tree/cartesian.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"d624bc51e8d14fce4eb653c248a514176d40cecbb2d18671e56a66ac33f1c31f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: \u00600o140000\u0060 represents \u0060\u0022040000\u0022\u0060, \u00600o40000\u0060 represents \u0060\u002240000\u0022\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tree/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"45de1bfd43ad300c07bf5ffa9a96c087c3adc310084c3585f5c3a8d7307dbcce"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: \u00600o140000\u0060 represents \u0060\u0022040000\u0022\u0060, \u00600o40000\u0060 represents \u0060\u002240000\u0022\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tree/mod.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c7a75e86317d1ab46de5d7e5fb319fd70170e2332ff48404b12ff3ababbd2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how these should be called. id or oid? It\u0027s inconsistent around the codebase. \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":"gix-object/src/tree/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"645fd128bc411cfd131ea51ad3885a6a26a3911983e9d782f1e4e227670873a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: have single-threaded code-paths also for pack-creation (entries from counts) so that we can use OwnShared here \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":"gix-odb/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6ed042238d6b7f00b4a5ad163d5cb9d9082cf38c4588601bf4a47c9455b19e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should be provide more information? We don\u0027t even know what exactly failed right now, degenerating information. \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":"gix-odb/src/store_impls/dynamic/types.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3813bee467d63e65706502ebb238d9e8d1bf8cfec26817dfba8ef38a25af8702"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: potentially hot loop - could this be a condition variable? \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":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e3af8fcc2170acea397b116cacb2d1463eefc58d0336046f489694b63035fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this double-lookup once the borrow checker allows it. \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":"gix-odb/src/store_impls/dynamic/header.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adc05c59e851e8976aefb38ac3e5f0e644507333018c588a2be539d31a8ce09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this double-lookup once the borrow checker allows it. \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":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b818023b87966d47a52b47da897f58854794eac42f6e863520aab8fc800507"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this method fallible to propagate index loading failures. \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":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099d74795398242e952ca5865f256f06142b98df05d6a86e3a1b5fdb62b2561"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // something went wrong, nothing we can communicate here with this trait. TODO: Maybe that should change? \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":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c7067b1c39fa38cba0effe4aa51975e66753e30cbcb082208239182dda5f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: mapping to non-existing object (can happen if replace-refs are pushed but related history isn\u0027t fetched) \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":"gix-odb/tests/odb/store/dynamic.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"be695b5682bc3ca556497a62716fe83cef4603fc8f99314ad0af9421f7a7cfec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this assumption actually true? \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":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ce02211af4c33d57388153d54bf9b56df7561f2232439a9d686db64a70e4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: once we have more tests, we could optimize this memory-intensive work to \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":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c1f35d4f52680890c5af921f4b32863577bb1d81ee88144699fff7da5f8530"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Performance) If delta-chains are uneven, we know we will have to copy bytes over here \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":"gix-pack/src/data/file/decode/entry.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc334d3f8592891d8e965179c8a9290e4f11ab084ae7e72f6d0b19d4253e8629"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: could this become the window size? \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":"gix-pack/src/data/output/entry/iter_from_counts.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d65edfe3becda9e3e7aaaff1377601b789eb4dc2bd29c3047eef51548e340e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix this - we overwrite the header of \u0027data\u0027 which also changes the computed entry size, \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":"gix-pack/src/index/traverse/with_index.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ba073b038c4d1a72fae39b28f8499ca564a42cd57c8be50657d28d92c512da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle base files once it\u0027s clear what this does \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":"gix-pack/src/multi_index/init.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa149d6e77e25c157b55212a4fec08bfe183747210668ff5418888a77beb8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: why more? \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":"gix-pack/tests/pack/data/output/count_and_entries.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b5a9084b9f3389bac49b73039713d287a59aaf3ac41dccfe6a5b2115d10a13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: why more? \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":"gix-pack/tests/pack/data/output/count_and_entries.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"467d4d136cd2b5d927bb093dd289e03567c7c60e35f874aa61ba12af8cd64f00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: figure out why its more than expected \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":"gix-pack/tests/pack/data/output/count_and_entries.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cb83d372ff5525a24456212e4f2537387fb03672ee740dbd97b92885441e3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: figure out why its more than expected \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":"gix-pack/tests/pack/data/output/count_and_entries.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9692357f145c3ec21f6e51fc958442a6c1170dec865ba6dabc09061ac238a529"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out why these hashes change, also depending on the machine, even though they are indeed stable. \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":"gix-pack/tests/pack/data/output/count_and_entries.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce70337922db9e4ba3c4e7216a776dcbb1a32069970d195f4adc8eb212e38e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out why these hashes change, also depending on the machine, even though they are indeed stable. \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":"gix-pack/tests/pack/data/output/count_and_entries.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b419fc6a7a582ff6606dd496db14e1e8b7cadd024dc1df8aae44e47d7f42ef5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is it possible to declare it as it should be? \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":"gix-packetline/src/async_io/sidebands.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82282d44154f15e6543d850e38f0a1ff4ce4633a0dcf3a46e1d15430214ee3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(borrowchk): remove additional decoding of internal buffer which is needed only to make it past borrowchk \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":"gix-packetline/src/blocking_io/read.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ef1ea341f1d861560116aaaf7b3e9ba5d326abc07664597e346e047b1cdff8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fuzz normalize \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":"gix-pathspec/fuzz/fuzz_targets/parse.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2e789917367f1fd623f0e9853c3e82fee72d96e3cbfa6c123743499fe823f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be an async drop once the feature is available. \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":"gix-protocol/src/util.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e316d1e2d0489ef908451aeaaa5e94befe974acac502dab5fd96021e5878ccd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how annotated tags work here. \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":"gix-protocol/src/handshake/refs/shared.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"811de68cf4184f8f6aff40a2cec93a853a7e945f86a8f97fe4274af6c827941d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this without losing test coverage - we have the same but better in \u0060gix\u0060 and it\u0027s \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":"gix-protocol/tests/protocol/fetch/_impl.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d64a47c31a41361207c83502b4d4efcf6b1bf9da994decc5241b9ace7090241"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Figure out if handles are needed at all, which depends on the ref-table implementation. \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":"gix-ref/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5996c9f841248aa2f6f703f372b71e288cbcd39c6e80fc68e9320092c16e057"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when Kind::IsADirectory becomes stable, use that. \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":"gix-ref/src/store/file/loose/reflog.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2b77695e61e723c2f0ebfa6dc603c602c8f51bbca8ef9a727fc44be9619a6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when Kind::IsADirectory becomes stable, use that. \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":"gix-ref/src/store/file/transaction/commit.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3777b6293a32db0350532e22f2c3636f562aba90a3dee618eb93c169d6fafd10"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Special HACK: no reflog for symref changes as there is no OID involved which the reflog needs. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/commit.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d5356e2fce306909c1c36ab8831a817828966f1b50effbcf78147dd8d1b979"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: actually implement this with handling of the packed buffer. \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":"gix-ref/src/store/general/handle/find.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"590ccc7d2cfe1b950893c20a6cf3413d90cd520f6f7b5228963f8bb0d7d90466"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when ready, add a new test entry point with a feature toggle to switch this to \u0060gix_ref::Store\u0060. \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":"gix-ref/tests/refs/file/mod.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5303971bfbc678a1d1135f938a87dc32643126a6389354c1fc2b69c924eb7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure this out \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":"gix-ref/tests/refs/file/store/find.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"42282543e80104310946d1ee84ac2bff41ed02475e00a39142e13882361d0af0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this effectively needs a \u0060Cow\u003C\u0027_, PartialNameRef\u003E\u0060, but we are not allowed to implement conversions for it. \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":"gix-ref/tests/refs/file/store/find.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d396879a522f3a09b66b15509be182b881c39e760197d090249bb74a62471a58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to deal with push-specs, probably when push is being implemented. \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":"gix-refspec/src/match_group/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"20faef613bb2b4f3d6a7395e8821ff5420f26963f8c4a47335e16b213a9568cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ST): Should this type be used for \u0060describe\u0060 as well? \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":"gix-revision/src/merge_base/function.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6618cbe0dc1f435b7193e5c200d54381ed662ff13dd7f81636f460bcfe342860"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: smallvec to save the unnecessary allocation? Can\u0027t keep ref due to lifetime constraints in traits \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":"gix-revision/src/spec/parse/function.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"874031918ac3fee491ebedc53eab8476e4e2e49a2e67c537d7c11421eea93594"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(correctness): it seems we\u0027d have to try to support this at some point, \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":"gix-status/src/fscache.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4843f75f502c45f2d0691cace42352c5a08458e86ee3d59224f93f0e76f43e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make all streaming IOPs interruptible. \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":"gix-status/src/index_as_worktree/traits.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"864bb4c77e5f6988fc3e4814115c3b2c646a3ee8422d7ca985b17a5f29b90021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: heuristic: when is parallelization not worth it? Git says 500 items per thread, but to 20 threads, we can be more fine-grained though. \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":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"28395130e29b06f07c07c00f5839cc0ccc984893acff8723b230591d2eb7b4fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a test for the following line or remove it. Is this more often hit with smudge/clean filters? \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":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e4053b75ec3db28a633ab573b02965e629ca3a6d927ee8b8fb889db6745a53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: what to do about precompose unicode and ignore_case for symlinks \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":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b05bea223bbf6dfd1fba98b1676d1ec71fbeffb4e003229cab9e3dae79793b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out if index or worktree can provide containerization - worktree should be possible. \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":"gix-status/src/index_as_worktree_with_renames/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8469f3b2a0357f7025e8683f37a00fc73692c3ff1077c075215594431ceb95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(performance): use the \u0060gix-hashtable\u0060 slot-map once available. It seems quite fast already though, so experiment. \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":"gix-tempfile/src/lib.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2955af2eba1a11e6a3115068e79c997eedaf6d7bae672fbd38d06c5dedb62f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Todo file to apply; omit or use \u0027-\u0027 to read standard input. \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":"gix-tix/src/command/rebase.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fe02b67b1c5865eae81f9792b85f8ae501d13be2faa56a7f0073c1e0229d51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: testing most of these fields requires a lot of effort, unless special flags to introspect ongoing requests are added. \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":"gix-transport/src/client/blocking_io/http/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05d60d5fb998432e3af20accd9e4e884d1ff543f60d4d3493d519bc3da2a18d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: turn this into HostUnreachable when stable, or NetworkUnreachable in \u0027no route\u0027 example. \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":"gix-transport/src/client/blocking_io/ssh/program_kind.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a1ee19a1cd5d113a8972f83757201d8bcc1678f00fe0612ac598df3a18de64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: url\u0027s may only contain \u0060:/\u0060, we should additionally check if the characters used for \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":"gix-url/src/parse.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd5aa23a17e56bd0173238729a411e458abd5619d7996fd50249ceabe622fcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this incorrectly splits at IPv6 addresses, check for \u0060[]\u0060 before splitting \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":"gix-url/src/parse.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"425a1a48091e34ea9dd1075a9370e943e4a931f55fbad94b4cc6fab4946b25a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement UNC path special case \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":"gix-url/src/parse.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"34719192057a63841055c4820dede499ea3b20d5a4da6230a787fdf2b576b3d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: write test for that \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":"gix-worktree-state/src/checkout/chunk.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8555e1fca2a96dfa5c1cadf65e44e1d1cfed4d726cfd53725604f171a683310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: adjust baseline to also include precious files. \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":"gix-worktree/tests/worktree/stack/ignore.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d7fb51945b2b712b65da32ee79fb3caf5ad718e92f2bdea4a45d90fe4bc2ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: adjust baseline to also include precious files. \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":"gix-worktree/tests/worktree/stack/ignore.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bedc368d8b9d0bfddc3ead193d1cd3aa08c6a5d0184b8ea3cff79f720d4efcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gix-error): write object-chained style (.object().try_into_commit()?) once \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":"gix/src/note.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"374593a2bd88457ab4c44ef814a40d666596320ac67f935f84d345e111db0570"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this much easier - we go from parsed-to-buffer-to-parsed. \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":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ccba9d18be0d6232045e4856e358d1c16a1ad6241a36baa8dec3b5fe776aa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we assume direct refs for tags, which is the common case, but it doesn\u0027t have to be \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":"gix/src/commit/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a87599377eb0cf5a23187ae51fb72e047964cb62afb0836a776084c5156ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make core.precomposeUnicode available as well. \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":"gix/src/config/mod.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3045ae7ba34a588abdb33f145e7b2958fad2569108dce86bce75e30797a046d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to configure this \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":"gix/src/config/cache/util.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef99783a9a6d2a18766be1660eb168d509032863416eb7a89368fac3ac4f5c7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use a specialization here once trait specialization is stabilized. Would be perfect here for \u0060T: Default\u0060. \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":"gix/src/config/cache/util.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17132b033a2b382c8d6b3838499cdd2e591f10f91c9f4b6588199281f51ebc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when dealing with \u0060http.*.*\u0060 configuration, generalize this algorithm as needed and support precedence. \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":"gix/src/config/snapshot/credential_helpers.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"74627f8979a782c2269f8243fef732d6bd60fad07fd9fdfcfb0bc6c8ae17f905"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: review its usage for cases where this key is not set - sometimes it\u0027s \u0027master\u0027, sometimes it\u0027s \u0027main\u0027. \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":"gix/src/config/tree/sections/init.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9140a007ed3c874813267ff1d8a84b1c2855c25b1ebaeed11c93b5caefca89ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a statically checked version of this when available. \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":"gix/src/head/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"04247a9e4ea8ad8adb576eef51d0165fe2c84f07f330861dcc7115a306fd753b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make it possible to verify the signature, probably by wrapping \u0060SignedData\u0060. It\u0027s quite some work to do it properly. \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":"gix/src/object/commit.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c236d70f79eda85dbd093a9582cd0a414fdd950bc6086e56155e9a062e16d8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more tests (only tested insertion right now) \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":"gix/src/object/blob.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7c23325b2a03c21e7ffb8695467e26f42fa978359f662abd2015d3c4003c67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this - it\u0027s a bit too much of a fixed function, or go all in once it\u0027s clear it\u0027s needed, \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":"gix/src/object/tree/traverse.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"767f73ee3c24a2dc0542e1f37607e9c21461bae125ef50ef2b7fd632e3336b07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests, with hooks, GIT_QUARANTINE for ref-log and transaction control (needs gix-sec support to remove write access in gix-ref) \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":"gix/src/open/repository.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bae8132b850073bfd2f2ed6867783de93e56c09c898655184255960eefcf5df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The following vars should end up as overrides of the respective configuration values (see git-config). \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":"gix/src/open/repository.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"480b65c46a1ae232b15074e2f6b0aba8e11739619bf4046b7dcfbaf445f5282d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Testing - it\u0027s hard to get non-ownership reliably and without root. \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":"gix/src/open/repository.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b182881cc4f30c6519f7c99bc0a34f113e3da9c07b46dbfc17a53a39ae075e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): potential performance improvements could be to use the index at \u0060HEAD\u0060 if possible (\u0060index_from_head_tree\u2026()\u0060) \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":"gix/src/repository/worktree.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"488dcf9258f2df4ef65db3316b28956567cb71570c845bca9201a74edadbaa5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): when loading a non-HEAD tree, we effectively traverse the tree twice. This is usually fast though, and sharing \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":"gix/src/repository/worktree.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc48b424a79dbb12b13e927ae106ee136ea53e92a9f765a74a0a98098be49838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(submodule): make it use an updated snapshot instead once we have \u0060config()\u0060. \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":"gix/src/repository/submodule.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f858ec1b0c5953a6b59a4530bc83419f628bce91ae10b2b9d6a90c7f650d66b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(submodule): make it use an updated snapshot instead once we have \u0060config()\u0060. \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":"gix/src/repository/submodule.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8571c213d470001ca830fb5efd7471384f5eabe8ec5a590f610dc3fe37d54357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ErrorKind): we want to use \u0060ErrorKind::FilesystemLoop\u0060, which otherwise happens \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":"gix/src/repository/submodule.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b144d08bb2eaadac9daa8b13ede7100e19aead255bf549accbf949f193649e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more tests or usage \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":"gix/src/repository/reference.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c1d7cf1af5bd9604658118a64ee65a32e4abaee8caed466cdbdc0fda74ca8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: possibly use CommitRef to save a few allocations (but will have to allocate for object ids anyway. \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":"gix/src/repository/object.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b7ce1d57fa5f434612714640d0bc5b4b087fbad6da2100c98a7c4b27836e81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests, respect precomposeUnicode \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":"gix/src/repository/location.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fc75a6b2d4c6ab56c6eaf87f745a4fa6c50051108cd0f2c709665ce119bf70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tests, details - there is a lot about environment variables to change things around. \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":"gix/src/repository/location.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3de807e6599d881462421dd069b0ba6647089d3e2504503d6459c2833330ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(performance): this could be its very own implementation with parallelism and the special: \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":"gix/src/status/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"830c257479f7defbf57434d53ce63606cd6e5903e01441bb31080fa01eff4054"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(symlink): This should work though \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":"gix/tests/submodule_open.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a6e119fa6c8911e27afe7c48dc4beed473298df1e2d4a27131dc6077e479cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it *should* be possible to set the reflog here based on the referent if deref = true \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":"gix/tests/gix/clone.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf58755b0613e980a858650b8bfb82a946a76263f97909b2227223a8e27278d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: needs repos with specific known objects for proper testing \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":"gix/tests/gix/object/blob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300251392ce00809e770edcce35d596a61a38dd50b5a2cfd71d514e73b7a62ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: somehow there is a lot of duplication when receiving objects. \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":"gix/tests/gix/remote/fetch.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"93402ec427a27bc6ef1adc0d10fc6226348c11a78ee38208b6ee8a59bd4c6e64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We cannot yet handle shallow mode for V1 as it will send shallow-info as part of the handshake :/. \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":"gix/tests/gix/remote/fetch.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b11a6a76532c08aaba8414bfa7b6e186d150c3678b90c530a8038467b2699c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check id of expected worktree, but need access to .gitdir from worktree base \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":"gix/tests/gix/repository/worktree.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"da630488b61ba9691e48b3570439f9728ef1d39cf77de7e978f27fab89bc5b76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this a configurable when in \u0060gix\u0060, this seems to be optimal on MacOS, linux scales though! MacOS also scales if reading a lot of files for refresh index \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/plumbing/main.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cfed4567ccacc4a548c47940792c3a643b09d8d34e42fc55f745f2b8fac707"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: needs a \u0027lenient\u0027 mutually exclusive counterpart. Opens the gate to auto-verbose some commands, and add --no-verbose \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/plumbing/options/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfdcc16335b520fdaaca4a3f872b643b8fc780737d0f4d2cdfacafec315fb9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to implement traditional, which right now can\u0027t be done as it requires ignored folders \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/plumbing/options/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c692b9e2187e88623f61d07c0a081b33f0ea1abe88cca5b6ce9d9f8aa81032"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally this could accept patterns already. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/it/src/commands/git_to_sh.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc15f524f0c6b375113591db0b2fc0270c5cbee3f0cf27b0a0025cff32099efa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally this could accept patterns already. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/it/src/commands/copy_royal.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9349256a5d9ba4083cea907842b7f114ff31d456410431fbaf2fd0e47f1b5b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe check status? On Unix, it should be 0 or SIGPIPE. Not sure about Windows. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/it/src/commands/check_mode.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc3fb88f44451c6ea2876fdb9c09e1d7a520a98810fa363d21a286bc3ce3492"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there should be a way to normalize paths without going through patterns, at least in this case maybe? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/it/src/commands/blame_copy_royal.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79c126e14848245e776b3dc8ea9f8a2c57501fad4a9880c57e06f53afd4598"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deps): Unify with \u0060gix_path::env::shell()\u0060 by having both call a more general function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tools/src/lib.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6037e0972fa08a714aff3d43e0ff3df6dbad5b995eae467feb54c4ed83b0ac7"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate output configuration properties with different types. \u0060output_format\u0060 uses the generic \u0060OutputFormat\u0060 enum, while \u0060format\u0060 uses a domain-specific \u0060Format\u0060 enum. This forces users to choose between a generic and a specific formatter for the same operation, creating confusion about which one takes precedence or if they are redundant.: Remove \u0060output_format\u0060 and rely solely on the domain-specific \u0060Format\u0060 enum, or vice versa, to ensure a single source of truth for output styling in the status module. (signatures: gitoxide_core.repository.status.Options.output_format: OutputFormat | gitoxide_core.repository.status.Options.format: Format)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"533f5f7508f7515033940b10953bcf43a0f790b243a3d55e6e753d6d8684823e"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate output configuration properties with different types. Similar to the status module, \u0060revision.list\u0060 exposes both \u0060format\u0060 (generic \u0060OutputFormat\u0060) and \u0060text\u0060 (specific \u0060Format\u0060). This inconsistency across modules suggests a lack of unified design for how output formatting is handled in context objects versus options structs.: Standardize on a single property name and type for output formatting across all context/options structs. Given \u0060Format\u0060 is more specific, consider unifying all to use \u0060Format\u0060 or a unified \u0060OutputStyle\u0060 trait. (signatures: gitoxide_core.repository.revision.list.Context.format: OutputFormat | gitoxide_core.repository.revision.list.Context.text: Format)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e814f47cd4c0c4a39bfc10858c6c97460f934b5a5690b7d2588e2868d22a8860"}},{"ruleId":"D22","level":"warning","message":{"text":"Misleading property naming. \u0060index_worktree_renames\u0060 is typed as \u0060ProgressItem\u0060, which typically denotes a progress bar or counter, not a boolean flag or configuration option. This suggests a copy-paste error or misuse of the \u0060ProgressItem\u0060 type for a control flag, confusing the API consumer about the property\u0027s intent.: Change the type of \u0060index_worktree_renames\u0060 to \u0060bool\u0060 if it is a toggle, or rename it to \u0060index_worktree_renames_progress\u0060 if it genuinely tracks progress (though unlikely for a configuration option). (signatures: gitoxide_core.repository.status.Options.thread_limit: ProgressItem | gitoxide_core.repository.status.Options.index_worktree_renames: ProgressItem)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f4d0e11b185fcbd30a38049dafc0a1554830d0aef57180433228bd97c7f7309"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent use of \u0060ProgressItem\u0060 for configuration vs. state. In \u0060clone.Options\u0060, \u0060revision\u0060 is a \u0060ProgressItem\u0060, which is semantically incorrect as a revision is a string/identifier, not a progress metric. In \u0060fetch.Options\u0060, \u0060open_negotiation_graph\u0060 is also a \u0060ProgressItem\u0060, which is similarly confusing. These should likely be \u0060String\u0060 or a specific \u0060Revision\u0060 type, not progress tracking types.: Change the type of \u0060revision\u0060 in \u0060clone.Options\u0060 to \u0060String\u0060 or \u0060PartialName\u0060. Investigate \u0060open_negotiation_graph\u0060 to ensure it is not misusing \u0060ProgressItem\u0060 for a boolean or path. (signatures: gitoxide_core.repository.clone.Options.revision: ProgressItem | gitoxide_core.repository.fetch.Options.open_negotiation_graph: ProgressItem)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"be112e61d4c44d63c776713c313e5b99b57daac203c46db704d8937d5e576e55"}},{"ruleId":"D26","level":"note","message":{"text":"Split gix: The gix project is huge (28k LoC) and sprawls across 29 namespaces under the config/tree, repository, status, worktree, and ext layers. Suggested: split into gix/config-tree/sections, gix/repository, gix/status, gix/worktree, gix/ext"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4fa1b8b2378c667f08fdbb9b809b7906062027bcbc7bb5f75333e834026f3ed0"}},{"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":"ff6bba770530290c947aa0d0f7a965db6832e0921f5937f99d7bc292a777825e"},"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":"7ee6bf0446e0fecfe61dbb8960987046925dd1bfceeb2103b2b86ffeb772ca2f"},"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":"c14919ef3ec61e6e7d808810e0a27f33a5a61fa6d9dc913eb4a6489a4a641ccc"},"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":"8794837e5811739a5009c542314c2075e6935819e41705bf7d89436e1d8e7b5e"},"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":"f7189984b80dce48f67fde041cb1bd44ace825170fdbf75bbfefd26321555c17"},"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":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"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":"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":"3f72d6265b902bbee1807b58a831709036a9f346b43766814e55ed91af7d52ef"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"97de2d9afba19ac7d5526d587e8aa29754fd1ff1c9caccbe9740917d4dd5ff14"},"properties":{"dependency":{"package":"async-std","version":"1.13.2","advisory":"RUSTSEC-2025-0052","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.18.0","advisory":"RUSTSEC-2026-0253","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f44531e7bfe124cec0849af5c542ed7b81b175b0e0b8264a958eace67554de8"}},{"ruleId":"D31","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":"88792160d66937bfe1670cf4464a44d18b62e6d31d108a74602394a70d831d1a"},"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":"D31","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":"0b41359ead3e1778e7793fdbd59083ff3e89e93c6def82fca847bd4c5a0744a7"},"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":"D31","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":"fe97252e768deb1934f69bd760c8aa5462165f07547110ae88f729a3b355432c"}},{"ruleId":"D31","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":"3adeb5ca433f8377e0513466abe226661632e2c7a65ab03d48b79033987746ab"}},{"ruleId":"D31","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":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 722 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; 722 of the 995 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: gix-utils/src/btoi.rs, gix-index/src/entry/stat.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":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ref_iter.rs \u2194 parse.rs: \u0060gix-object/src/tree/ref_iter.rs\u0060 (context gix-object) and \u0060gix-ref/src/parse.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006012f03db6\u0060 Simplify parsers; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tree/ref_iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45acc87e3f635f52d4e6c0ac1f6f457ee1d9537e8a96be1847317667a57670f9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 parse.rs: \u0060gix-actor/src/signature/decode.rs\u0060 (context gix-actor) and \u0060gix-ref/src/parse.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006012f03db6\u0060 Simplify parsers; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-actor/src/signature/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5db3d19349e2500534be3adb3e3b298d3374ffaf093b47ceacc5977a5ce63b4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 decode.rs: \u0060gix-actor/src/signature/decode.rs\u0060 (context gix-actor) and \u0060gix-object/src/commit/message/decode.rs\u0060 (context gix-object) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u0060e175b20d\u0060 Update winnow to 0.6; \u006012f03db6\u0060 Simplify parsers \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-actor/src/signature/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"007bf1216a2aa69212cfa7fbd17977875a1ab37e78669609f7d3d94af29ef3b8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 mod.rs: \u0060gix-actor/src/signature/decode.rs\u0060 (context gix-actor) and \u0060gix-ref/src/store/packed/decode/mod.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060); \u006012f03db6\u0060 Simplify parsers (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060); \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-actor/src/signature/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bf662a6132cbce6a24e234108ea9448281c277fed1ec64423cb63dee9849bd"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: body.rs \u2194 parse.rs: \u0060gix-object/src/commit/message/body.rs\u0060 (context gix-object) and \u0060gix-ref/src/parse.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006012f03db6\u0060 Simplify parsers; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a47629d3b597b67c48c2ff3f14fcc55e6b483ec0b5e66f317115bb0061242d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 mod.rs: \u0060gix-object/src/commit/message/decode.rs\u0060 (context gix-object) and \u0060gix-ref/src/store/packed/decode/mod.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060); \u006012f03db6\u0060 Simplify parsers (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060); \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec208a151a694b5807709c5a29aa3b73aaefd35346dcf7bb9626eaa97097f2b7"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 decode.rs: \u0060gix-object/src/commit/message/decode.rs\u0060 (context gix-object) and \u0060gix-ref/src/store/file/loose/reference/decode.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006012f03db6\u0060 Simplify parsers; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58365eefe9f389bbc2f477e7df72f19e6de44480471a4e45260f5a7dee166ae1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 parse.rs: \u0060gix-object/src/commit/message/decode.rs\u0060 (context gix-object) and \u0060gix-ref/src/parse.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006012f03db6\u0060 Simplify parsers; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f696c1c756471cd04dde44356ab10dce67592279975dd59c35734c8b7c3a999"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 body.rs: \u0060gix-actor/src/signature/decode.rs\u0060 (context gix-actor) and \u0060gix-object/src/commit/message/body.rs\u0060 (context gix-object) sit in DIFFERENT parts of the tree yet change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006052ede063\u0060 Move off deprecated take_until[01]; \u006012f03db6\u0060 Simplify parsers \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-actor/src/signature/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f435cb495be7d252fa3c21ab4856766c2c157e07eb104e1bd8b0e0d432bf67d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: decode.rs \u2194 decode.rs: \u0060gix-actor/src/signature/decode.rs\u0060 (context gix-actor) and \u0060gix-ref/src/store/file/loose/reference/decode.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006012f03db6\u0060 Simplify parsers; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-actor/src/signature/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d527bdd9326f98c219f9375cd1b0f1002928f96707f01f2cb739b77bb57319"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ref_iter.rs \u2194 parse.rs: \u0060gix-object/src/tag/ref_iter.rs\u0060 (context gix-object) and \u0060gix-ref/src/parse.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations; \u00609ed7df0a\u0060 Resolve 0.4 deprecations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tag/ref_iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3500af2e9d539182f9721fae69bcfe5fb7187c39e8625acce19f57a60241b65"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: body.rs \u2194 mod.rs: \u0060gix-object/src/commit/message/body.rs\u0060 (context gix-object) and \u0060gix-ref/src/store/packed/decode/mod.rs\u0060 (context gix-ref) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060); \u006012f03db6\u0060 Simplify parsers (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060); \u0060f0cbf81a\u0060 Resolve 0.4 not-quite deprecations (at that commit the file was still \u0060gix-ref/src/store/packed/decode.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3ed3e7e265afe199fe6dc8daa00d10e78ac5e1d4faec6da930505521898ab6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: body.rs \u2192 decode.rs, parse.rs, ref_iter.rs: \u0060gix-object/src/commit/message/body.rs\u0060 changes together with 3 other files \u2014 \u0060gix-object/src/commit/message/decode.rs\u0060, \u0060gix-object/src/parse.rs\u0060, \u0060gix-object/src/tree/ref_iter.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/message/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa5163b903a194f36119b0a03c0912f88064c1fc701420ddbba22c34e9c8221"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ref_iter.rs \u2194 ref_iter.rs: \u0060gix-object/src/tag/ref_iter.rs\u0060 and \u0060gix-object/src/tree/ref_iter.rs\u0060 change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00603cd3e2a7\u0060 Resolve Winnow deprecations; \u006058252501\u0060 Refactor Errors to track remaining Input; \u0060be1f4b5d\u0060 Remove From\u003Cwinnow\u003E for (small) step towards stable API \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tag/ref_iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ed089c21fcdcd1a2d2bc5875bb997227aa9c3f94e62f0fc04bcb63b8de03ea"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cascade.rs \u2194 serde.rs: \u0060gix-credentials/src/helper/cascade.rs\u0060 and \u0060gix-credentials/src/protocol/context/serde.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060d0360639\u0060 change(gix-credentials)!: migrate errors to gix-error; \u00607496ef16\u0060 feat(gix-credentials)!: support HTTP challenges in credential context\u2026; \u00607d66c9fc\u0060 fix!: make \u0060protect_protocol\u0060 part of \u0060Context\u0060 so it\u0027s self-contained. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/helper/cascade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269999069ae97addb6b75a9eae97cf2c095c0d0d03cdfb046b3544b2b491209"}},{"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":"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":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4e626b2476f828ec4804636d2cf0cdac589948488b9e36ce4ddf5a8cae5c26"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe7ae7ac8a5b5fd5346b2c57353119792e2b7b356941f836262e835cfce1839"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a858b585bd46290ef73d367d00b7a80ffbb4854cf1e81b2188a230e2d838ab"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a8db457a755c0e0a562a46deb72d644301728190b939be6b4f56e3adcb451"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"adff86ee3b4b3d3fcb0386178c24a99837249992e8c6d291765de4a177b09012"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0912a374f53cd123e9cc45027dd234ffcd3b61537038d5338f94bf1d8fb15705"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f37c970b450ef241028fe81a58e3d9e31c84dc78246a33325c83a5f5b96ad1a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9ae9acacf2e1c8a76f3a374e035e86ed891c1d70bc771e02d260509d456c9d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.3:1): \u0060div#\\:\\$p\u003Esvg\u003EforeignObject\u003Esection\u0060 sets color: #333 on background-color: #0288d1 \u2014 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet \u2014 editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e3e54767abeaf9a570c6781874ace35057abea9a40713d76d362e834812d73"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 1 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 26/27 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060gix-tui\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"CWE-248","shortDescription":{"text":"CWE-248"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"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":23,"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."]}]}