{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::event_loop (cyclomatic 570): gix_tix::event_loop has cyclomatic complexity 570 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf28c4bdc3a2f1e69b1805b6da80ba06867d7a0fc536b8d84ab7c325e9a644b"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_merge::tree::function::resolve::tree (cyclomatic 254): gix_merge::tree::function::resolve::tree has cyclomatic complexity 254 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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 180): App::update has cyclomatic complexity 180 (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":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c530a458aafd8cfb1f5ffd07939520758e9d9d7a4d1439f6013b07fabbff2db"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::draw_with_worktree (cyclomatic 170): gix_tix::ui::draw_with_worktree has cyclomatic complexity 170 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec3c8cc3fc7b39342e873cea41f1ddfb9fbc97b1c5d05aa0a04a8bd27271365"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide::plumbing::main::main (cyclomatic 123): gitoxide::plumbing::main::main has cyclomatic complexity 123 (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":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1b5036b9e8ceedd43933edf3a1188b24a8370bbcea9d9babdf64ca8776157b"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_inner (cyclomatic 115): gix_tix::edit::rebase::perform_inner has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77dce6a5d3db3479414f93d42dbc6b84ab265b93fc809755337824dbf46b0a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoding::for_label (cyclomatic 109): Encoding::for_label has cyclomatic complexity 109 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/encoding.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbd907cd29e1d3465e54e13de113944fcfd37c86d3fe22d670c2a31f9ddcf38"}},{"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 96): gix_tix::edit::rebase::perform_plan_with_progress has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb5b8044669ae1fd94ad0708f95b03da0f37fdfa4a284b7d1e5bcf3b907781f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::command_menu::commands (cyclomatic 66): gix_tix::command_menu::commands has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"54392460eb8cf057eddb17cd666c520f5fb0f3b06a782d9eedebdfaac19fc340"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::parse (cyclomatic 66): gix_tix::edit::todo::parse has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":1213}}}],"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":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"219a084a53f6a0e9e844a80ffa39e1a945a29ee30d7d1ebc8a8640db3646b021"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadSafeRepository::open_from_paths (cyclomatic 54): ThreadSafeRepository::open_from_paths has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/open/repository.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1553c9f00c6993036a354d3771835a1496b289c3d6d84def54c6d714873d0dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::draw (cyclomatic 51): gix_tix::draw has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6918}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ebd29ab1f0e823862e43d2838b67b463b424c5e26402f718cac41d8028b16d"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::transplant::build_plan (cyclomatic 49): gix_tix::edit::transplant::build_plan has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/transplant/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f402de826ae0285470ee755e2a52b6fb7e3f63fba8f983ea78288adf47153f"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::query::engine::update::update (cyclomatic 47): gitoxide_core::query::engine::update::update has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":"Tree::handle_key (cyclomatic 47): Tree::handle_key has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"278bc8dcba57ad3ebf0677b7cee5a76872bcfefb06ba8640c89cede7c972f4d9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_date::parse::git::parse_textual_date (cyclomatic 46): gix_date::parse::git::parse_textual_date 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-date/src/parse/git.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"350c7b782e799f8ebae3be7e6fe17f99927d00ed8361aae0efe779e5ee098578"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline::convert_to_diffable_inner (cyclomatic 46): Pipeline::convert_to_diffable_inner 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-diff/src/blob/pipeline.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"893d5858d2605b8437550dea4cba3f55d80bfafad41444ab4f9bba29fabaca4e"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::convert (cyclomatic 45): Converter::convert 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":"gix-encoding/src/convert.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"66326fe3bf7d6902028bbfbf14a25aa305df4ad705f888607c7f62ba85a6ebd0"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::auto_merge::order_plan (cyclomatic 43): gix_tix::edit::auto_merge::order_plan has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec327aef26a8adc95f5daf680e33ac638608414040a887760ade09fc9b5b4dd"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::decorations_excluding (cyclomatic 43): gix_tix::history::decorations_excluding has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"31614069d174cdf9cf0decb21d92743b79b2793d27463bca34d39fa833f29a14"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::metadata_columns (cyclomatic 43): gix_tix::ui::metadata_columns has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b26bfac6dcd0f68aa7cecbc90a76890869ae2aed62e40e723b0dc82df26cb0c"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_date::parse::relative::apply_operations (cyclomatic 42): gix_date::parse::relative::apply_operations 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-date/src/parse/relative.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9565368d7c9241d9e60336bd9bc03fdb27afa8abf3615e83a18357f6f4a35c00"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::app_action (cyclomatic 41): gix_tix::app_action 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. This is NOT this file\u0027s highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 44) 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":9575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51d6730784386a70cf2c159863e322b6368983d790d029d0b6fcc3a310ada69"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::prepare (cyclomatic 41): gix_tix::edit::todo::prepare 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/edit/todo.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb62b1903ad90662683ac71782f224820e1c4d249b986ed6ee379c2d174c1c53"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::load (cyclomatic 41): gix_tix::history::load 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/history.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b975aa8d1417fd588d84e796858840e7bd3d0bee88f67a5071e9b9a05c7f3e6"}},{"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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"56db281eef0ceab62ee1ede516e3ad9703a62b0f346a3941c4086125cb27d31c"}},{"ruleId":"D1","level":"warning","message":{"text":"Tracker::find_file_renames (cyclomatic 40): Tracker::find_file_renames 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-diff/src/rewrites/tracker.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028dac7261ed2dc6383344b8de3bfb8b2b94bab3fd29a29d7ee3e6c031b67d7"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_transport::client::blocking_io::http::curl::remote::new (cyclomatic 38): gix_transport::client::blocking_io::http::curl::remote::new 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-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e108e5e3407c2717fd0a22e8f697b1bf28ae8bd4b802922de29803cbc0ed71d"}},{"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::edit::time_travel::move_head_to_reporting (cyclomatic 37): gix_tix::edit::time_travel::move_head_to_reporting has cyclomatic complexity 37 (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":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c729414bd1d9d8c41d5804db5b7470602332dfc14f079e91c364c6a29f4f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::time_travel::perform_reporting_rebased (cyclomatic 37): gix_tix::edit::time_travel::perform_reporting_rebased 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/edit/time_travel.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2eea73ecc8bdce27f16d6c2c1c26a89cb463392e2831f45f686c426214281a"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::consolidate_with_disk_state (cyclomatic 36): Store::consolidate_with_disk_state has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/load_index.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f1e184dd6fbc4c94ce442c0b00fddd0adf7f1bf0898c5b0a66a6d294470c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"App::update_tree_selection (cyclomatic 36): App::update_tree_selection has cyclomatic complexity 36 (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/tree_selection/mod.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5e1574c3b292492e6de7a0033cab43e512ae597668d4c12197dfeeed4ce2f9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_encoding::legacy::bulk (cyclomatic 35): gix_encoding::legacy::bulk has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gix_encoding::legacy::table (cyclomatic 46) 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-encoding/src/legacy.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7744847770941d5a11dfca9be9884f8eff32aa3dd6879309cfff6ff13639314"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::finish_review_with_progress (cyclomatic 33): gix_tix::edit::rebase::finish_review_with_progress has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b6532093a3e7c8692ce94284e48b39a5e645811d55ed8a5dcd75799c7615fe"}},{"ruleId":"D1","level":"warning","message":{"text":"PrepareFetch::fetch_only (cyclomatic 32): PrepareFetch::fetch_only has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/clone/fetch/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0895b6e0ca14506528983bc1c596efc4197e002a77212a4f049af51ba36cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"Cascade::invoke (cyclomatic 32): Cascade::invoke has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/helper/cascade.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2613ac6f8e1c16174302fa236bcc27c9e46572ecf134d870bc7d7cd4863cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryGraph::refresh_inner (cyclomatic 32): HistoryGraph::refresh_inner has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"7097f5025382efb361997ff259e80c49e5d16fd551c6fdd01c9ab33a26129067"}},{"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":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ece027332446bce37fb0b7be446f06046259dc73ffd4fff875a7694dee93a"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_encoding::unicode::decode (cyclomatic 31): gix_encoding::unicode::decode 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-encoding/src/unicode.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f076b5a8816e6488aaaa58459690e7329b2401c2d151bf6e0dc3b65bf8623b21"}},{"ruleId":"D1","level":"warning","message":{"text":"State::handle (cyclomatic 31): State::handle 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-tix/src/prefix_input/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2de1e1c55d1de774a2d2350b1ffa05db169652c4082ed120990aec49385ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::auto_merge::prepare (cyclomatic 31): gix_tix::edit::auto_merge::prepare 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-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0490d000ffa2c3217ec052b367c325a9fb6cdadb823a3acbcb668df606c2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Remote::default (cyclomatic 31): Remote::default 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-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"045c7c267b6503798df6f7618c65b4eb125f8d74a978b65d2a1f087ebe22042f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_encoding::fast::run (cyclomatic 30): gix_encoding::fast::run has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/fast.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e93b14823fbb385c56f7b4bb3492a7ffb9d4678390f9b921edaf14a0a5dba3f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_traverse::commit::simple::compute_hidden_frontier (cyclomatic 30): gix_traverse::commit::simple::compute_hidden_frontier has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5dc9f224f5db7fb6706de71b60636d5986b659c2c07c48469da6213799d1f6"}},{"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":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2f83387fde1415e089f52605fbec646c67e174272a7e4930d89d0cb3c4bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::parse_state (cyclomatic 29): gix_tix::edit::todo::parse_state 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/todo.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b40f9d9b8b596b3b3ea1eb960284d21ce3c0ed41f599ac1db57c417546482c"}},{"ruleId":"D1","level":"warning","message":{"text":"Prepared::finish_inner (cyclomatic 28): Prepared::finish_inner 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":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0bc01477edad416b17015a5fc255954cc5f61e2ecf9c7422c215be01bb3614"}},{"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":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f4e06b52e7d998cdd67334791a7b959bb7b1a46116082054f641f3285a6390"}},{"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":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b37f60477ca39ee8b3623e636477a75812fdaabb48eb788c1c672e6c39239b"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_dir::walk::classify::path (cyclomatic 27): gix_dir::walk::classify::path 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-dir/src/walk/classify.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"40744f043aaf5b367453f265d8004bceeed296b4b070880851da846c41151983"}},{"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":"Platform::run_as_initialized (cyclomatic 27): Platform::run_as_initialized 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-tix/src/command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1775b0899ee4ace606dd5b9d2b439002546ab6674b4c0b4d0be9fb1d992e320d"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::head::perform_inner (cyclomatic 27): gix_tix::edit::head::perform_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-tix/src/edit/head.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd04856c42fe4ddad61167e6b5550882773d938123108c0453cb81bd61c3eebe"}},{"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":"gix_merge::tree::apply_index_entries::function::apply_index_entries (cyclomatic 26): gix_merge::tree::apply_index_entries::function::apply_index_entries has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3eefb3d7befd9775800acadd65ae35367f9079e2f4d10e68ddfea17c92d8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::todo::prepare_continuation (cyclomatic 26): gix_tix::edit::todo::prepare_continuation 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/edit/todo.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c8c8de5944de4205e9cb1788d7431e36e6f49c23faf26065a4d1d0eb536c8"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::commit_title_spans (cyclomatic 26): gix_tix::ui::commit_title_spans has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d87575da6f5008fb1f46f1c645ca90ba3440707465efef494962a693fefa6b"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::repository::status::show (cyclomatic 25): gitoxide_core::repository::status::show 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/status.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebd65c0dcb53b7eb8329e2392e6ded226d70f9d74302566d4672527eab1b35"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::replay_refs::unreachable_owners (cyclomatic 25): gix_tix::edit::replay_refs::unreachable_owners 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-tix/src/edit/replay_refs/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1baec320f8192ede1112ddf35029016f7e8f37e780b6f452af232474f72a42"}},{"ruleId":"D1","level":"warning","message":{"text":"Repository::try_find_remote_inner (cyclomatic 24): Repository::try_find_remote_inner has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong 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/src/repository/remote.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11d9c56358f9fd07e8cc93e9fffd929d84b78ffe9b9dd1f9ace1ad35d2291d0"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_discover::upwards::function::discover_opts_with_trust (cyclomatic 24): gix_discover::upwards::function::discover_opts_with_trust 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-discover/src/upwards/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6c41f981565d258215769ea7f3fea2270da81121bb6baa266e8d1659f8da2c"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration::at_path (cyclomatic 24): Configuration::at_path has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ce052cc7e19ab3781aa6f83e897c4b2358355c3cc4e74e0ffd7b7fa5477a1b"}},{"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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a0b4f941070d7171657a66b3a291f0722533e1ddb24a82e8d9532d43baa306"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::prepare_inner (cyclomatic 24): Transaction::prepare_inner 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-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e12e3c829d66e31bea7b7f2a8376043dad23f80e19afb6e076a6dddb043fdc3"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames (cyclomatic 24): gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames 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-status/src/index_as_worktree_with_renames/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c9d83b48bf615019fabb3bc05d3789acafed734fa22490a61c53b86df3233"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionFlow::notice (cyclomatic 24): SelectionFlow::notice 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/app/tree_selection/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"741ca3b8530e80ed13fbd4484ed4b9f7b7776a511b961108445e801ecb2e19a8"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::command::write_history (cyclomatic 24): gix_tix::command::write_history 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/command.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5871b8d1c99fbef1f5e1bbb5a724afd1e36d785fec12f5262e6fb9541bf160"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::update_refs (cyclomatic 24): gix_tix::edit::rebase::update_refs 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/rebase.rs"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"761c40a4bfaf05e254411ccfe388303be9bfea28ce1a0302314f4cd23de534b2"}},{"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":"gix_filter::eol::convert_to_git::function::convert_to_git (cyclomatic 23): gix_filter::eol::convert_to_git::function::convert_to_git 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-filter/src/eol/convert_to_git.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fd14e5af39308d5e717b5fbdc13b5f505ef7b7dfc359937f5e0d9aadc605ea"}},{"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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb7c55c60eecf88752291e33b16dfaa27a84aeec5457860eac5b24a70acb53a"}},{"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":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd05b2de07b48f8345247c2f11a055dcac2ab91cf33a8038d277476f1b19a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::from_bytes (cyclomatic 22): Context::from_bytes 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-credentials/src/protocol/context/serde.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c27ecf8fe101ff6b127869cbb3d0163eacfa54642a1080c1817da9aa8317944"}},{"ruleId":"D1","level":"warning","message":{"text":"File::resolve_deltas (cyclomatic 22): File::resolve_deltas 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-pack/src/data/file/decode/entry.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c3b0b98be53472b5fbb18e14be3c47e6026586b66a88eef085a11e4a9454a7"}},{"ruleId":"D1","level":"warning","message":{"text":"State::compute_status (cyclomatic 22): State::compute_status has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-status/src/index_as_worktree/function.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e5581d792c257cde81b3eabf8fbbf2a1a4149d0962f166e8645393d740e3dd"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::app::compute_lanes (cyclomatic 22): gix_tix::app::compute_lanes 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/app.rs"},"region":{"startLine":4028}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c535cd74690c71e3874c16dbd47fbc7738d7fec2c125858496a6e86c3abb98"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::time_travel::attach_reporting (cyclomatic 22): gix_tix::edit::time_travel::attach_reporting 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/time_travel.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d303349311f8293ca37129a91b758bd75588b5fe047639c4b6f4fbf4a49bc83c"}},{"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":"Cone::from_search (cyclomatic 22): Cone::from_search 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-worktree/src/sparse.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89b8ceecdc23e5870a27e7dc916d4e44bb1367a217ac00a528a96a5fc573ca3"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::try_from (cyclomatic 21): Command::try_from 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-command/src/prepare.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cbac0ee6d6cf1491880e1c52fa8dd080dc655b6f44c4ffe6e3672d923ba245"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_error::exn::impls::write_error_node_recursive (cyclomatic 21): gix_error::exn::impls::write_error_node_recursive 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-error/src/exn/impls.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0cb60c1be2d2c96435c9991a3687ee276fd40e3f0c6bd2711a2f7391e7210b"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_macros::unstable::item (cyclomatic 21): gix_macros::unstable::item 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-macros/src/unstable.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fc878fbbdf218ef636c7a1fc654e74ee5ddf591d4b8fc9c6867de399e54295"}},{"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":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba102ae8f402c9a546f8300678d3c4dd8c6508bf131279ff6eecb64b6cac9362"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::fetch_progress_snapshot (cyclomatic 21): gix_tix::fetch_progress_snapshot has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 44) 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":6678}}}],"partialFingerprints":{"codehealthFindingId/v1":"7168989a4e4ed5e7c79b2fdf919527eed3669ca6eb9b4c3e66e47b5dee8e73bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ParsedUrl::parse_host_port (cyclomatic 21): ParsedUrl::parse_host_port 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-url/src/simple_url.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afdaa29d247d55cb3d6bec4bb9a82817eb17dbc8ff47d9dffe598b2f6babc21"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_url::parse::url (cyclomatic 21): gix_url::parse::url has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/parse.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffd172c6a9986395a648afa02a4d58dd3a487a4e9c7465d09f081860c47dba9"}},{"ruleId":"D1","level":"warning","message":{"text":"gitoxide_core::organize::handle (cyclomatic 20): gitoxide_core::organize::handle has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b44a7e190b474e1320de353df6311bab78625333565d861d84b2f5e058b7a"}},{"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":309}}}],"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":107}}}],"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":337}}}],"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":51}}}],"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":53}}}],"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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9044b4ad7cb142045901afc22d328055a0ebc8351efb7af9e9e7b07fe4248d95"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_path::realpath::function::realpath_opts (cyclomatic 20): gix_path::realpath::function::realpath_opts 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-path/src/realpath.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabad5a4041ed98cbf403dc83990388e2d4760b5c3f7b881c8c8b1fbaf105ccd"}},{"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_tix::edit::auto_merge::perform (cyclomatic 20): gix_tix::edit::auto_merge::perform 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-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c9f1da8f3fb089d670381fc76655084975d73e92b689207f8077a8961394e3"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::auto_merge::expand_plan (cyclomatic 20): gix_tix::edit::auto_merge::expand_plan 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-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890109bf4d6f9f0e6d866370210100e703c65107f96645c1eedbebfd713fcef"}},{"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":"gix_worktree::remove::remove_root_with_after_scan (cyclomatic 20): gix_worktree::remove::remove_root_with_after_scan 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-worktree/src/remove.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3039373b5ddd69a3f790997376abc910b2f5b5dfb005e1dffa6f74ffa5a4375"}},{"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":11}}}],"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":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d4b6ef7dfcb73504ffb491091b1e47b80518f52b15a90abd07bcd55f647e4f"}},{"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::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 44) 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":8122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4982d9194e788fdc9442a891dd375a7e9a105cd4dadcd10a64204a018d90b72"}},{"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":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f287a4dc5d30a01bb0871c501b2ae0a63246fa3cd95d396744d975c958578f4"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::edit::rebase::worktree_transitions (cyclomatic 19): gix_tix::edit::rebase::worktree_transitions 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-tix/src/edit/rebase.rs"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37560c2f92737d00f380f4f93c00869c7cc9f47b04a5a6c80d69722f1362c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::refs_with_commit_targets (cyclomatic 19): gix_tix::history::refs_with_commit_targets 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-tix/src/history.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6b956000c476da010b63224a167dd5bb75c5e66ebb44af4894f2a00645ff20"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::history::decode_metadata (cyclomatic 19): gix_tix::history::decode_metadata 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-tix/src/history.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5c532e6ccd81b2dd0637c48670af8df4fed9902738d207fbd2b81d4f0e53a6"}},{"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::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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a3c2f66f6dd66d24b36bcf025b85e8595bcda0f27df2c0abf3fe3653c05408"}},{"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":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8058d24ca4ef77df3b7d5f780fe0b1a1d878e41d9bcca31011a4a3c3e970cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"gix::submodule::url::resolve_relative_url (cyclomatic 18): gix::submodule::url::resolve_relative_url 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":"gix/src/submodule/url.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"233aa4bba72e3e278fd57ebc91385bde59a940a6419696ea21893c93a595d37c"}},{"ruleId":"D1","level":"warning","message":{"text":"Mode::change_to_match_fs_with_values (cyclomatic 18): Mode::change_to_match_fs_with_values has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/entry/mode.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fbfe8c4eabefefd509875ea4e1f7aad316320b096749f943e21d1db92f9bda"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline::convert_to_mergeable (cyclomatic 18): Pipeline::convert_to_mergeable 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-merge/src/blob/pipeline.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7934695979c504084c49b7c1cef9baa7ead268acfe6498dd3de3a8f0d22b5c"}},{"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_protocol::fetch::function::fetch (cyclomatic 18): gix_protocol::fetch::function::fetch 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-protocol/src/fetch/function.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893d8b47b9ddc37db35cfa43dd035b3800c0c6e46d1cb7a3f65ba225e66165c"}},{"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":"App::notice (cyclomatic 18): App::notice 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":"gix-tix/src/app.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bb5b220194fbf3e0c5032d3393393644a0ed2dd234067f0054c1ee076aab72"}},{"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":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afc3847dddacf6f3fef26eb6b3bb33a39bd3414f15d08cf02db65c8e3150ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_tix::ui::active_prefix_popup (cyclomatic 18): gix_tix::ui::active_prefix_popup 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-tix/src/ui.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb5dd9623628992fb619e429441f715fa1066e2655c8aae5643c3ef3e28236f"}},{"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":"File::new (cyclomatic 17): File::new has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/init.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"933a19d4bb22ce32ee1070a92622b1cae126af27d98264594c77b4b4ea46315f"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_date::parse::relative::parse_operations (cyclomatic 17): gix_date::parse::relative::parse_operations has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/relative.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94b4461052ff8571ece6d05319ca89b122d52a200cf683527cdb7d1c9d3495c"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_encoding::legacy::decode_iso2022_bulk (cyclomatic 17): gix_encoding::legacy::decode_iso2022_bulk 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_encoding::legacy::table (cyclomatic 46) 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-encoding/src/legacy.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8438526f0f1163f608a16b8f34ee1971dc6bbfa226d3d33d78983dc42f8900f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Myers::split (cyclomatic 17): Myers::split 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-imara-diff/src/myers.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0998a43e6c9afdfe48e69b218b9bf86ef2e3674b0e9db816ff25106d5feb0186"}},{"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::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":111}}}],"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 44) 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":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e431e1c03d4bf0b7f8afa1dfe30846578e89de28492e09f440eaec4a65eda4aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree::draw (cyclomatic 17): Tree::draw 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/ref_tree.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c301f12400be77cbdf0c36fe8786010bbbb436302c979138c2f9640c325584"}},{"ruleId":"D1","level":"warning","message":{"text":"Url::write_to (cyclomatic 17): Url::write_to 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-url/src/lib.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b246f6fef57e0386e43af0d642261659981d4ee7c1e14708b2306ab660991d"}},{"ruleId":"D1","level":"warning","message":{"text":"Url::write_canonical_form_to (cyclomatic 17): Url::write_canonical_form_to has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/lib.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"224782bc86ea54e3c74d0b20497eafae47890544a14d68ca0486945aa08eec6f"}},{"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":57}}}],"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":17}}}],"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":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68e64cd308643809f8e217f41dc256e139d94c64e2dd4ab16e5b85ff7e3d4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Repository::prepare_add_worktree (cyclomatic 16): Repository::prepare_add_worktree 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/worktree/add.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"87940bfd5e8330cdd3f2b00830e2689e158655c625bb363bca8fd8580705b9d9"}},{"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":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"482cd7991626d68c7d52c3817208dada0fb02910181660e0b4606954b866f5db"}},{"ruleId":"D1","level":"warning","message":{"text":"Tracker::estimate_similarity (cyclomatic 16): Tracker::estimate_similarity 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-diff/src/rewrites/tracker.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4a05150a16fee8db474d5424a56a3a8b15188d3d5a256370fc2c8ea71d1192"}},{"ruleId":"D1","level":"warning","message":{"text":"LcsSearch::update_lcs (cyclomatic 16): LcsSearch::update_lcs 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/histogram/lcs.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa35e70da0986919eda93aa12b02e5995041f0f42b390c8336433812939a398"}},{"ruleId":"D1","level":"warning","message":{"text":"gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts (cyclomatic 16): gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/output/entry/iter_from_counts.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a286271d48a8626264333b09086c97730d8e9e8fea302ccf9f6613a280f2dc"}},{"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":3906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042310f8cef677be048d4f72e4774a256aceca09d5eb0d7fb9d0107f17bc171"}},{"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, 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/edit/todo.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71c96644c8e85958de27572370af8d2afe1c0eef59f749d92725298146a2081"}},{"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":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8176881e4693fc6dca646a09227ec4f9d8aa26179c3f41ea72477784489d55"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::event_loop (cognitive 1340): gix_tix::event_loop has cognitive complexity 1340 (threshold 15). Drivers by points: if/else 298 (867 pts), match/switch 93 (343 pts), boolean chains 100, loops 9 (30 pts) (nesting depth added 840). 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-tix/src/lib.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f1db7cff973e0aa73440b5b101455b2c036606d6258c4945b8ce8f8d7da9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_merge::tree::function::resolve::tree (cognitive 952): gix_merge::tree::function::resolve::tree has cognitive complexity 952 (threshold 15). Drivers by points: if/else 141 (659 pts), match/switch 43 (210 pts), boolean chains 56, loops 6 (27 pts) (nesting depth added 706). To reduce it, split the body into named stages: move each independent step or branch into 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 269): gix_tix::ui::draw_with_worktree has cognitive complexity 269 (threshold 15). Drivers by points: if/else 112 (174 pts), boolean chains 49, loops 11 (25 pts), match/switch 13 (21 pts) (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into 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":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"76906835aee4bdee832f073455ed883dabe06438b279f2b71271e24ca0985493"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide::plumbing::main::main (cognitive 176): gitoxide::plumbing::main::main has cognitive complexity 176 (threshold 15). Drivers by points: match/switch 40 (91 pts), if/else 41 (84 pts), boolean chains 1 (nesting depth added 94). 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":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"37db622447e09fb1282edae725dcbd5f110f898ca0857b871aa458160eb9aed3"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_plan_with_progress (cognitive 168): gix_tix::edit::rebase::perform_plan_with_progress has cognitive complexity 168 (threshold 15). Drivers by points: if/else 43 (95 pts), boolean chains 27, loops 17 (26 pts), match/switch 10 (20 pts) (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into 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":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef242dab812678b58360b0b62009e61c3a60bd319727cc119b401db916ca69ed"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::perform_inner (cognitive 165): gix_tix::edit::rebase::perform_inner has cognitive complexity 165 (threshold 15). Drivers by points: if/else 53 (88 pts), boolean chains 54, loops 6 (13 pts), match/switch 8 (10 pts) (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-tix/src/edit/rebase.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7687ef27f20f5f906696490828320033e73d7d60adb5b255ee8cab5f0f3eba"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::parse (cognitive 145): gix_tix::edit::todo::parse has cognitive complexity 145 (threshold 15). Drivers by points: if/else 50 (118 pts), loops 7 (14 pts), boolean chains 10, match/switch 2 (3 pts) (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into 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":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9aa00f1207a9bc3488c2aa08666bdef6f9a31387f57d42ed4154e9cdca7d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::convert_to_diffable_inner (cognitive 120): Pipeline::convert_to_diffable_inner has cognitive complexity 120 (threshold 15). Drivers by points: if/else 23 (67 pts), match/switch 9 (38 pts), boolean chains 15 (nesting depth added 73). 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-diff/src/blob/pipeline.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1ae4e8cf6de54209a7bb10c3c2cf7e09e3fdb9d72d3585095d0a3c44fb55fa"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::query::engine::update::update (cognitive 118): gitoxide_core::query::engine::update::update has cognitive complexity 118 (threshold 15). Drivers by points: if/else 30 (70 pts), match/switch 8 (34 pts), loops 8 (12 pts), boolean chains 2 (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":"gitoxide-core/src/query/engine/update.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2a3dcca11305fd1a60f8d61825342031437f47fb039ce78def114df3988844"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update (cognitive 113): App::update has cognitive complexity 113 (threshold 15). Drivers by points: if/else 43 (76 pts), match/switch 10 (20 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"8810a6902b45164fed597463709d7c562c52eaac71dfc8c8969e134d7184acfd"}},{"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":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ebbb322052e37372a336a95e009d4f8275082c4f170a10933f84601485238"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoding::for_label (cognitive 108): Encoding::for_label has cognitive complexity 108 (threshold 15). Drivers by points: if/else 55, boolean chains 53. 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-encoding/src/encoding.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cfd506a7def051ab9af9c6788e56de1df3374349d89e82c9f941bba36ebb76"}},{"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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"51968f73ed04c2140c1b592dd6e98b64015eaef2393c886451a77eb187152989"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::auto_merge::order_plan (cognitive 105): gix_tix::edit::auto_merge::order_plan has cognitive complexity 105 (threshold 15). Drivers by points: if/else 17 (52 pts), loops 15 (25 pts), match/switch 9 (25 pts), boolean chains 3 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c6816d58fa3583cc7060ef57ad0ab87552a4feda825f5a9a041ca73ba86cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::find_file_renames (cognitive 101): Tracker::find_file_renames has cognitive complexity 101 (threshold 15). Drivers by points: if/else 22 (66 pts), loops 7 (23 pts), boolean chains 11, match/switch 1 (nesting depth added 60). 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-diff/src/rewrites/tracker.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"621b3598a540ec1f77f779b01e678f6b1a4e6d567ad64dda5b802977590b51d6"}},{"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":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c4aa0767a554044ed4d8488d026747e5a93d7d42c0813c6c0964c7d20ca58"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::draw (cognitive 89): gix_tix::draw has cognitive complexity 89 (threshold 15). Drivers by points: if/else 28 (46 pts), boolean chains 16, match/switch 5 (15 pts), loops 4 (12 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6918}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97f948d820676a7b804ef9403002ce7ec271145714f5f9bd43a3b741d093905"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::metadata_columns (cognitive 88): gix_tix::ui::metadata_columns has cognitive complexity 88 (threshold 15). Drivers by points: if/else 35 (64 pts), loops 5 (15 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3ca5b14866f24f9171f4cfcf4a68caf2458258d48aa60758b61e8604a199f0"}},{"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 85): Store::consolidate_with_disk_state has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (62 pts), match/switch 4 (13 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into 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":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"31505f240403b4c83b196c6a0afccf1c88252cb0563cdb5b39b5e607074d2966"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadSafeRepository::open_from_paths (cognitive 84): ThreadSafeRepository::open_from_paths has cognitive complexity 84 (threshold 15). Drivers by points: if/else 32 (55 pts), boolean chains 14, match/switch 8 (13 pts), loops 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/src/open/repository.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea703a625ef682f50c9ea3adab81d9033bcb472e33fb0e5aec21e1b4a115a85b"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::command_menu::commands (cognitive 81): gix_tix::command_menu::commands has cognitive complexity 81 (threshold 15). Drivers by points: if/else 39 (57 pts), boolean chains 17, match/switch 5, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command_menu.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc67436f8623ff8e9206195375f74495ebc4dbb2249bd088695425ca1a5ec72"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::convert (cognitive 78): Converter::convert has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (50 pts), match/switch 6 (18 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/convert.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"564138c6bf067ed1288b976c070cd3ddf1be9a7e15224f8a592430f7344750ee"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::load (cognitive 77): gix_tix::history::load has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (58 pts), loops 6 (11 pts), boolean chains 8 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76649f2077ed02bab939a2a6b07c7bbcde60a7af494d4dd8e8aa1323a4eb25c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_transport::client::blocking_io::http::curl::remote::new (cognitive 77): gix_transport::client::blocking_io::http::curl::remote::new has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (57 pts), match/switch 5 (14 pts), boolean chains 3, loops 2 (3 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-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b0e3ceed13f075c8d2025e65847334032d7a7744445257ba14e3b5f1e2df48"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_date::parse::git::parse_textual_date (cognitive 76): gix_date::parse::git::parse_textual_date has cognitive complexity 76 (threshold 15). Drivers by points: if/else 34 (58 pts), boolean chains 12, match/switch 3 (5 pts), loops 1 (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-date/src/parse/git.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d40eacab507afcde9392816fb694f9ba9e27ece63e6226b406f46b2809928"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::prepare (cognitive 76): gix_tix::edit::todo::prepare has cognitive complexity 76 (threshold 15). Drivers by points: if/else 27 (47 pts), loops 11 (19 pts), boolean chains 8, 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-tix/src/edit/todo.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0ec0bd86f61c53f8885c597ae3f0ffae282538a5e902303bd807855a0af12b"}},{"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::edit::auto_merge::prepare (cognitive 71): gix_tix::edit::auto_merge::prepare has cognitive complexity 71 (threshold 15). Drivers by points: if/else 13 (44 pts), loops 8 (17 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d5040966776aaa92ae3e09b645bfa614b163b0594a731694a8db348a854225"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::transplant::build_plan (cognitive 68): gix_tix::edit::transplant::build_plan has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 15, loops 8 (10 pts), match/switch 4 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/transplant/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b272faf7c92a3825d6ff0ab0033c9cbf324bf885032ea5205faceccd300504e"}},{"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 24 (43 pts), boolean chains 11, match/switch 4 (11 pts), loops 3 (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-tix/src/history.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f655d0cb8536e9b3c91085d35f0f448ea43630c19efce483bcc09b210052a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Cascade::invoke (cognitive 66): Cascade::invoke has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (53 pts), boolean chains 6, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/helper/cascade.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8b8f3ecbfb013560d80d672d49e9af17f62a3453cf81b448e90a3c2951e8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_traverse::commit::simple::compute_hidden_frontier (cognitive 66): gix_traverse::commit::simple::compute_hidden_frontier has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 5 (7 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c546ce2e6fec147751bab507869bcfae26d7dedf67133d2a6cf8336b817ea7f7"}},{"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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc151cc07cd081bebaeabb85d7ca6ba7691255b3ef87aded9d5470883acf862d"}},{"ruleId":"D2","level":"warning","message":{"text":"Remote::default (cognitive 64): Remote::default has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (42 pts), match/switch 5 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e9f59fb2e90a6e14d70215746f881a98e0c038c02a7d2a50561229d496a266"}},{"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":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"048c21a9289373d571224bc6060b3a109364dbf41c47f4e3df2898e1ec06f12b"}},{"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":"Handle::try_find_cached_inner (cognitive 61): Handle::try_find_cached_inner has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 7 (30 pts), if/else 8 (25 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 42). 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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77c684c22c0acee2579ef96a71985845144de31f3610fca38eea6a420b9c0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::try_header_inner (cognitive 61): Handle::try_header_inner has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 7 (30 pts), if/else 8 (25 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 42). 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/header.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec991c138b982183109b3172782dfd78b18c09df3d9dc075f36617e9d1640568"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::fast::run (cognitive 57): gix_encoding::fast::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 4 (8 pts), match/switch 3 (5 pts), boolean chains 2 (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-encoding/src/fast.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"43804189c98cb8e5f0b42ef95e542ac8f05162737cdd4f68d6e292ae8a791738"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::legacy::bulk (cognitive 57): gix_encoding::legacy::bulk has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 12, loops 4 (9 pts), match/switch 2 (6 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-encoding/src/legacy.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd487fe70b97b7a37c560b454211c95a4b26c4484d4517549ae1bc724c38bf9b"}},{"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":"HistoryGraph::refresh_inner (cognitive 56): HistoryGraph::refresh_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 9 (14 pts), boolean chains 8, match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd38fa2c92b9af1c6bc1e30992782181369b14112ddae0bdb97e6fb336aa401"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_date::parse::relative::apply_operations (cognitive 55): gix_date::parse::relative::apply_operations has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 6, match/switch 3 (6 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/relative.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e1643a370eab576efea0e4881811e67823425097cb12b31f741c48d30fe1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::finish_review_with_progress (cognitive 54): gix_tix::edit::rebase::finish_review_with_progress has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 10, loops 2, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1236203c1bae55fcbcc4e218233af6f0b4c34bc59f868e8935bfede6e4992c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::prepare_continuation (cognitive 54): gix_tix::edit::todo::prepare_continuation has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 4 (8 pts), match/switch 5 (8 pts), boolean chains 5 (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-tix/src/edit/todo.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3195303d34bfecdd6bc77a3f74ae38ccf3588d332e4d24f6074d460c59d6e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames (cognitive 53): gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 5 (12 pts), match/switch 6 (11 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-status/src/index_as_worktree_with_renames/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a5655eaecf310eb46125932f91bb5926477c2dff0d71e0094c97b334c7e89"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::app_action (cognitive 53): gix_tix::app_action has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 5 (14 pts), boolean chains 8 (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/lib.rs"},"region":{"startLine":9575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e42b8acb4673906240528c9344fcb25761f6bef6839a8156bc6fbaf306df1c7"}},{"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":"gix_tix::app::compute_lanes (cognitive 52): gix_tix::app::compute_lanes has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 10 (18 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-tix/src/app.rs"},"region":{"startLine":4028}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b4d3a5e7d280b28144ad7c233c60f3d7fd18aa167a977f6ad6778b0978f910"}},{"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":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"712ef5bce4d6e75f35de3347865d03fcfa983422b8adc805005ef3461b5b4d67"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::prepare_inner (cognitive 50): Transaction::prepare_inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 5 (14 pts), loops 4 (9 pts), boolean chains 4 (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-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82dac13c0c90523624affac6dc2e7d2feacf4417b331206cdcf21ca47787788"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::handle_key (cognitive 50): Tree::handle_key has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 17, 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/ref_tree.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b20b5d950dd66b5e67eb2a299fa60aa87563757bde6f8be62746dd001fc0f27"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::try_from (cognitive 49): Command::try_from has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (44 pts), match/switch 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-command/src/prepare.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"456658a4075d8a752eeb4d0e8b023b3873e900d2c01f7ea132759c4e17f3ff6b"}},{"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":"Prepared::finish_inner (cognitive 49): Prepared::finish_inner has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 5 (8 pts), match/switch 2 (4 pts), boolean chains 3 (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/edit/rebase.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ea992c3c9988febabf80cd14d14ff675a561ac5b06ab16fe8f52868dba36e3"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::time_travel::perform_reporting_rebased (cognitive 49): gix_tix::edit::time_travel::perform_reporting_rebased has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (29 pts), match/switch 8 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49331e7743bf041cc183c7c8fd4343cd7f4095bed2c136908e8311ea3ca572c"}},{"ruleId":"D2","level":"warning","message":{"text":"PrepareFetch::fetch_only (cognitive 47): PrepareFetch::fetch_only has cognitive complexity 47 (threshold 15). Drivers by points: if/else 29 (38 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/clone/fetch/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6012ff28082d958f77980e1b3c27c2b9157c4cd05b0838c44608175f5d046b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update_tree_selection (cognitive 46): App::update_tree_selection has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 7 (15 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app/tree_selection/mod.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b54bc0711547ed67b0c75de14dba68921f307d333eabb15ba963edae455559"}},{"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":"gix_discover::upwards::function::discover_opts_with_trust (cognitive 45): gix_discover::upwards::function::discover_opts_with_trust has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-discover/src/upwards/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"599224bd1b67247b156bd3a7c541691162722cef689ce8864d9ad7511c563956"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::convert_to_mergeable (cognitive 45): Pipeline::convert_to_mergeable has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 6 (22 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-merge/src/blob/pipeline.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb11294609404e0c6669b7d12025c8689df55b80491ef0a99f1fdcc8eb9b0b6"}},{"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":"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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66e59560cb30769787a54937230d7e5cb5c7907d6781755a2f72632009f07ed"}},{"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":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"697dba2fd3afed79d9a65752bf5b5699f2889af1a2aa2681ac7c8f97163aa668"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::time_travel::move_head_to_reporting (cognitive 43): gix_tix::edit::time_travel::move_head_to_reporting has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 11 (16 pts), boolean chains 7 (nesting depth added 9). 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/time_travel.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea55801d4300e8d014a6ea5dbb95bf7ce0f8b1a6b68cf3f3033f5f9e74187e3b"}},{"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":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeeae096857c34c9d08be2d7160a036a4e34be369ca265d1978e18b5efa5e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_worktree::remove::remove_root_with_after_scan (cognitive 42): gix_worktree::remove::remove_root_with_after_scan has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (24 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":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c261de973433298c89e98e5aafbcab6690dd6f12e3423811f077dce65cfa011"}},{"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_encoding::unicode::decode (cognitive 41): gix_encoding::unicode::decode has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 4 (11 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/unicode.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"966157ee11d87e9c97182c713c0576c3621df852c29377f4b467b887dc06f6bb"}},{"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":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d6a497725f4e2ff8d319747fa53f8d724eac7bed399610e6f9e3270dbea677"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::update_refs (cognitive 41): gix_tix::edit::rebase::update_refs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (30 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":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"59696da0ff95b4679b8e8159fbb4ead795df70f59f25f5ddf9c944e4cc3cb3fb"}},{"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":"LcsSearch::update_lcs (cognitive 40): LcsSearch::update_lcs has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/histogram/lcs.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3cdfb4020a03180f4bdae10d66947b9ebbc2e887400ec66136ab11017bd65"}},{"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":"gix_error::exn::impls::write_error_node_recursive (cognitive 39): gix_error::exn::impls::write_error_node_recursive has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 3 (6 pts), boolean chains 4 (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-error/src/exn/impls.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f445323f02bae1b3c87513d3b7e939d83cad9fd05c3aa2473a34dcf92e08c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedUrl::parse_host_port (cognitive 39): ParsedUrl::parse_host_port has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/simple_url.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"696acf7a18c0a855e94a7222bee2ae303266a97f8d05482548ce680ddef06910"}},{"ruleId":"D2","level":"warning","message":{"text":"Cone::from_search (cognitive 39): Cone::from_search has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/sparse.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"538b279ac6ac0ef842c6735f456db2272dd7d0262217401148d41fc1daff4d7d"}},{"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":94}}}],"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":"gix_dir::walk::classify::path (cognitive 38): gix_dir::walk::classify::path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 9 (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-dir/src/walk/classify.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4fa86c9545425c37f17a727b5148b91ff25e6b889edb614a10a025fb9b003a"}},{"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":"gix_tix::edit::auto_merge::expand_plan (cognitive 38): gix_tix::edit::auto_merge::expand_plan has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 9 (16 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-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e8602aa29edef8a89c65259cd9cb445b925038eecf80b232f3cae9ff68567e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::replay_refs::unreachable_owners (cognitive 38): gix_tix::edit::replay_refs::unreachable_owners has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 7 (9 pts), match/switch 3 (6 pts), boolean chains 4 (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/replay_refs/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0792d528edeeed6af3a40c5fbc1c88cfd38b595f3319fccbd4b9417f73c17a4"}},{"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":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8118cbd6e2043883fc7b7ac004ec71ec8605b6fce7184d20653c81e69d83d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::parse_state (cognitive 37): gix_tix::edit::todo::parse_state has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"74723c803820091a614b77c1da4170e263d594716da31c507589f65db7c4df6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::perform_run (cognitive 36): Engine::perform_run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/engine.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd8ed9bb43bbe42cbbb8093987a2072febbc28804cf419a844b0a625d949d2b"}},{"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":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3433e625c2ee564ba5296322613dd3c65090defc4b8542ae5dd7c733ddd2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_path::realpath::function::realpath_opts (cognitive 36): gix_path::realpath::function::realpath_opts has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-path/src/realpath.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e184fb63db5f9ced64c0d3a0aad984b1a2bc527e3482b34910d0907b761f1832"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_protocol::fetch::function::fetch (cognitive 36): gix_protocol::fetch::function::fetch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 3, 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_tix::edit::head::perform_inner (cognitive 36): gix_tix::edit::head::perform_inner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, match/switch 6 (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-tix/src/edit/head.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdc09727623dffc1e01b3644cd2f7f8a5e82cbbd37d77223a3763c1c674f100"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_filter::eol::convert_to_git::function::convert_to_git (cognitive 35): gix_filter::eol::convert_to_git::function::convert_to_git has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, 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":"Myers::split (cognitive 35): Myers::split has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 2 (5 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-imara-diff/src/myers.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0f1576a9584eef12780b286232254ecc961c0d7499c2a057a501d02b597a6"}},{"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":"State::handle (cognitive 35): State::handle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/prefix_input/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"67940e63e00bb49c4a866bf34fdbe0dd6dd99c5c598ad5124aa31922210731fd"}},{"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":92}}}],"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":199}}}],"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::ui::active_prefix_popup (cognitive 33): gix_tix::ui::active_prefix_popup has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 5 (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/ui.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7065a75c3ec406e8d784f737c29d576e40711e70c20503c49d4d90da6697006"}},{"ruleId":"D2","level":"warning","message":{"text":"File::resolve_deltas (cognitive 32): File::resolve_deltas has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 3 (6 pts), loops 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-pack/src/data/file/decode/entry.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c652ff612186087cb7a607bd859c564237b3ba14991b1fadf96e06f7ac5232e"}},{"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":"gix_tix::edit::time_travel::attach_reporting (cognitive 32): gix_tix::edit::time_travel::attach_reporting has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 6 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e773852435bb86919e8acb67e6157515b1f3873ad03adee0e863a5513243e77"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::attributes::query::function::query (cognitive 31): gitoxide_core::repository::attributes::query::function::query has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (8 pts), match/switch 2 (5 pts), boolean chains 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":"gitoxide-core/src/repository/attributes/query.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"16888fc81d106c2d61d4a4a787d87bc24a8c9e3677e204e6dd5d462d7078010a"}},{"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":203}}}],"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":11}}}],"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":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7710b6c36aa01254cee5cd8d1121417857a3f37a06f475f751ca9ffb47ef962e"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::fast::utf8_unicode (cognitive 31): gix_encoding::fast::utf8_unicode has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/fast.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ef6ca67d3df54d29dd99a4acd908b92b505ecc10c39ae36db870febd34141"}},{"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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0245528e4e55e7bdda06e4633fd4d8ddf912433ebc7dae1581a12758daa7d867"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::worktree_transitions (cognitive 31): gix_tix::edit::rebase::worktree_transitions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (9 pts), loops 2, 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":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc5ae9911bf270ea88ec307d4e7b9149a91e0dcd1ffae4d07dfe0b08cd53635"}},{"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_encoding::legacy::decode_iso2022_bulk (cognitive 30): gix_encoding::legacy::decode_iso2022_bulk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"9329135b58ef713a155cb41b45f51ae97f38fca3f7df0364d74f3233f18af216"}},{"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":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d956cb67a85805c3cd954098b91f5cc28f9e8ad20d03919f256d7c95e80b83"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_merge::tree::apply_index_entries::function::apply_index_entries (cognitive 30): gix_merge::tree::apply_index_entries::function::apply_index_entries has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 5 (11 pts), loops 2 (3 pts) (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-merge/src/tree/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb5284d31bb3d5b79ddb9509968c0415a55cd388459ea3747d7a45ab064c35"}},{"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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92ead011cce649f13d4e0c60f359d5392ba3c5cddf5ac1532e2b5499836ea39"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::fetch_progress_snapshot (cognitive 30): gix_tix::fetch_progress_snapshot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6678}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a5ac3801a2c6aa52009cca1e3427365873d40b30f8dd5d83c5129df950cfad"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::command::write_history (cognitive 30): gix_tix::command::write_history has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (7 pts), loops 6 (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/command.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fa1b9ee00a81e9ae587540e9bf947e795a96892057983f8c8fc514f5b526a9"}},{"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":161}}}],"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":"Transaction::prepare (cognitive 29): Transaction::prepare has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/packed/transaction.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4db8462f111ed1088c2e742369d1c07dbbe14461d2fd0bbe64f406a3d5c001"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionFlow::notice (cognitive 29): SelectionFlow::notice has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 7 (11 pts) (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, 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/tree_selection/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"845b489af0b1deb4308cfebeff3108a199234b90c762c93aaeb08821432f34f1"}},{"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":8122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cff62186f4926b253d73c666c7a0f0e5e5ed462808bb260930273cd388cae53"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::auto_merge::perform (cognitive 29): gix_tix::edit::auto_merge::perform has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 6 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8d5f2589d402267b1848d9d62f8eba3adffe046e572053a1daf2833fdae5d"}},{"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":"Repository::try_find_remote_inner (cognitive 28): Repository::try_find_remote_inner has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 4 (7 pts), boolean chains 3, loops 2 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 3 belong 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. 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":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7ca53ab778b8fd47e0f9b4261655f8d86a49a8e983a859a15b51a08471339"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration::at_path (cognitive 28): Configuration::at_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 8 (12 pts) (nesting depth added 8). Most of this is not in the body itself: 9 of the 28 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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7513d60721197868699a04a798f255dcf6e2f81b555c84dc078dcaea1b0a13"}},{"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":"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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b93edc38e2a8370ca8a9b8d34c45d1cfd7b9aa941b636edda2a946ee72fbe11"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::decode_metadata (cognitive 28): gix_tix::history::decode_metadata has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (7 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"c045cf0a1bcbe2d4f3c6ac8712613717218fa91dd52182058aca7106d8734fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler::header (cognitive 28): Handler::header has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/remote.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9f60ec1d7315a57e673affee9b64fbea92a8d69f1084899857e6e7cc71f02e"}},{"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":"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":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bc80d17dba5be1eee19bf755f4a6081bffe2bb27d0e1227afcce1552cab400"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_dir::walk::readdir::recursive (cognitive 27): gix_dir::walk::readdir::recursive has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-dir/src/walk/readdir.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb4d6df3908aad855b72ba5831baa66a355ed587453024113b0daf61a31ac2"}},{"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":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf19342af0342d87e67000bc3c28ce940d9ebd75bb19d26d34033f3d4b4d822"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::location_by_oid (cognitive 27): Handle::location_by_oid has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 3 (15 pts), if/else 3 (9 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ff56dc1f2181347286cae1b86716b34ea22a15c873e68aedf1388ad2d39d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_parallel::in_parallel::in_parallel_with_slice (cognitive 27): gix_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-parallel/src/in_parallel.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"849662ec6987201eff6929e23664e8f2f4ce3c02026edb647fa57064d4141ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"State::compute_status (cognitive 27): State::compute_status has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, match/switch 3 (4 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":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f8b936c3fe48168f11f28c12ba15d1055758afb927fcfa32233f10054c5864"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::history::refs_with_commit_targets (cognitive 27): gix_tix::history::refs_with_commit_targets has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 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-tix/src/history.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a036b5e026bf13cd2957f527cd503203b18e2af4e9449033dd655fab496e1b"}},{"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":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b881cab772f16005fb3bb60fc2c0876fa89eae8a3d16f73f0db50fedee488414"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::repository::status::show (cognitive 26): gitoxide_core::repository::status::show has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 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":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e62cf05bfb551c550629009646bc0497bd83956e82fe5074d66ee1d2cad59c"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::from_bytes (cognitive 26): Context::from_bytes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/protocol/context/serde.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38a896cf6a66b954bc4788065bf7e68fc96f91a532161fdbab924b93e94cdf3"}},{"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":"gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts (cognitive 26): gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 2 (6 pts), loops 3 (4 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":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f795df89d03e19832205dd19d078ea9388b081a8612b0dd87d7d6f4b936d3f"}},{"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":18}}}],"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":3906}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe38476633566bfd72f3a8e959ae9929426dea7f444541f3d7ce309612d2818"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ref_tree::draw_nodes (cognitive 26): gix_tix::ref_tree::draw_nodes 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-tix/src/ref_tree.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8422c4521c4c26aa0bd0ee7aa36d584e1807a0e195d11927863579629ef02d0"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_url::parse::url (cognitive 26): gix_url::parse::url has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 10 (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-url/src/parse.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf873fd0f226981cd0c5d715855dd749ec5e0792089314c36e6b188b894af0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Parents::next (cognitive 25): Parents::next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/commit.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea546ce14870fcaeccf2749e30e4265df1695e3f77ae2c294edc65b33b553d"}},{"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":76}}}],"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":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9734c423ba10779a3309c3c4b99091b25d216d5ae63ea2396c63914cfd755e"}},{"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":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"34214b8357048d4356b7b2c64c457bea23f950f16ce634581dac59a964be9cac"}},{"ruleId":"D2","level":"warning","message":{"text":"References::resolve_input (cognitive 25): References::resolve_input has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2345bcbe7a78e6ee386247af3be172c8984be68fa7e8253377b15f3d38e40214"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::draw (cognitive 25): Tree::draw has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (22 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":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e681b5c6cd64f80f27843b1924e973e72db4d091434d769ccbfe106618efb82"}},{"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":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4552c5855682f035cb243e53386b0a3cdedeb0660be1f7a1bb1d6b5882d704"}},{"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":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa70692336cdbd11ff89f012b53eef98bc1f80cfbe921b68d94050540d7a883"}},{"ruleId":"D2","level":"warning","message":{"text":"gitoxide_core::organize::handle (cognitive 24): gitoxide_core::organize::handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 5, boolean chains 2, loops 1 (nesting depth added 6). Of this number, 20 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":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00ccc44252957adac4fd93986d2539f2b1dd682655ac22b7ae7acd2162fa1ed"}},{"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":309}}}],"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_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":51}}}],"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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df56c7d329efc8dca19023072e0c6ae3f854b26ff9f05a04025e676b66df636"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::auto_merge::rebuild (cognitive 24): gix_tix::edit::auto_merge::rebuild has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"21851d735f971ad74e12847159d28cf64657cbda091e203c393e2bc4711f626a"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::autosquash (cognitive 24): gix_tix::edit::todo::autosquash has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (7 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/todo.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7a57b611f52d7783fa5002984512002726a8f69e738c81deb20aec4229a43c"}},{"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":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd536053ba3d5827ba563685c4ebb11695df2bf6189a6c0699e8345bfa5e428"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository::prepare_add_worktree (cognitive 23): Repository::prepare_add_worktree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 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":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5338c13c6839d82f8914348db5accdb0c0ebd746acb6858c3a678962a64c4a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::config::cache::init::apply_environment_overrides (cognitive 23): gix::config::cache::init::apply_environment_overrides has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 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":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd9b8b8fd0f42e69965435ab01cc96ae75a2445ae6eb0387ef8fe0a99d4486"}},{"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":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06a8e49ef044754b1bbf34cd8f87d6acb3bb04730b8714b85d9c8213c2907ab"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::submodule::url::resolve_relative_url (cognitive 23): gix::submodule::url::resolve_relative_url has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/submodule/url.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"301ea256cf0e56870e72ea482aca69cc1443934863fdb1cf3710b2e5b94e8992"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::write_to (cognitive 23): Context::write_to has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/protocol/context/serde.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e563592ff7ca65c1bbd52efa74357a6bb1f3c3790c531f223763c703f10ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::legacy::decode (cognitive 23): gix_encoding::legacy::decode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b3438d624970eb1e3f741a8fe840381d540c888142fac63ad80a8f861da046"}},{"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":122}}}],"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":"Definition::message (cognitive 23): Definition::message has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35fd42a6b927fccd1b6115593c4843a634ec5389e0bfea86a081f02541888d5"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::push_branch (cognitive 23): gix_tix::push_branch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":5598}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa70395e1083fb4fbfaec757e50b939f72cce5de705d050256858359b2f41b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_traverse::commit::topo::iter::collect_parents (cognitive 23): gix_traverse::commit::topo::iter::collect_parents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), match/switch 2 (4 pts) (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-traverse/src/commit/topo/iter.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d64ea5198e9669e8316c286e1fe30fcda78973b9c8b9af42ed462fdfcb6291"}},{"ruleId":"D2","level":"warning","message":{"text":"gix::clone::fetch::util::update_head (cognitive 22): gix::clone::fetch::util::update_head has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (8 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/src/clone/fetch/util.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7739dd2de163712241df1d2a0a30a5468d4a2aa01580a68b70c7de30a73b444"}},{"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":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e707d13f065baab54f829c482687823cab585226eabe8f591e5f1b4888fd6dd"}},{"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":"App::notice (cognitive 22): App::notice has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43459496cd4354f7daa1d03d3e86098817661f0565d6740225a3bf22d8a6dc3"}},{"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":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"909dcc4d02ff38627cc2fb01661e74ee0e87ec295d2619000deb25386f0a4852"}},{"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":8221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b77d19864b0f1859947a2d981de50d512080d5384320e3487cdea7f2f002316"}},{"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":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b91016ee08cd471788538c88ba0cdab3c78588bb91c0c89f115360a6965d69"}},{"ruleId":"D2","level":"warning","message":{"text":"Url::write_to (cognitive 22): Url::write_to has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-url/src/lib.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d31eb568df3933d768a8f98b11fa4997776104f9efd16a07a6c5f47b1dc8c24"}},{"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":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f1b583f5495d30e0e95612acd536f7cc6ae678595bf9618b2f9b9b02f24aec"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::legacy::decode_gb18030_bulk (cognitive 21): gix_encoding::legacy::decode_gb18030_bulk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c97886a67db52fa38c3dde114e2aafd70e70a023d9f64ebc291d6cd172f768c"}},{"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":339}}}],"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":505}}}],"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":43}}}],"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":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f4c4241b15f2dee9553fd9cd2bdcc7f3a2143b8a3115be15e5b015baebb3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::unstaged_change (cognitive 21): gix_tix::unstaged_change has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 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-tix/src/lib.rs"},"region":{"startLine":8892}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b02e2c4e32bc0b19eff9308a9fcbf4cc26e58b212be5557630dacf7541efe24"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::auto_merge::ordered (cognitive 21): gix_tix::edit::auto_merge::ordered has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afc74a323fb515c6975801e13019bdc4f83f28b11d51472f5274ede00f65e14"}},{"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":40}}}],"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":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1a6d3de56abf884685d5de9f59cb4f84ad151948d427e2e680df5e32874e03"}},{"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":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c8f49050f2699411053963eac4bcc75c14963ef1d54a98cc5a0a5d1de7f15e"}},{"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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe14512a6b29a3e9e32c5c2ed38b8b5c97ca4441d78787739ce6b1272ea825f"}},{"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::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":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afdadea2aa1b932eb17adbbdeee3311cbdfd6d0cf6874333cbb5d90e300f76e"}},{"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":"gix::repository::worktree::insert_head (cognitive 20): gix::repository::worktree::insert_head has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/worktree.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7996dce5c2095fefb7ed6b689f4b2c07cb926cc20ccc185e2595615de72294f5"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_date::parse::function::parse (cognitive 20): gix_date::parse::function::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b437931f334ef8f28b957238f6af241f9043b1262984927ba4985f770f67e8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_date::parse::relative::parse_operations (cognitive 20): gix_date::parse::relative::parse_operations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1, 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-date/src/parse/relative.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"034ac83ca29e3d3b1c1c6ce429f25d7e64cff0a1ae1cf81cd8cc7823bf353b89"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::estimate_similarity (cognitive 20): Tracker::estimate_similarity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, 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-diff/src/rewrites/tracker.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"867f26528f0b1726d53efc911ba178f421be6703e0812161958a29ed643eb4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Transcoder::read (cognitive 20): Transcoder::read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/read.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e74d732327ccc4b906ea020202d5cab260bea7e68229490e824d8eca9374be0"}},{"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":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"58876d75ad3dbb1d923f690d66982e2482b08a855094dc31d100b5377e2d44eb"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_fs::symlink::target_is_dir (cognitive 20): gix_fs::symlink::target_is_dir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-fs/src/symlink.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf4d3191dcfb2a31bbd308940e719975de12a3514b8a7a105300e2976ecd24f"}},{"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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71cadae5e2e9e14fa7306eb82c5bacef1d74dca09a0e3b89845bdde400cd93b"}},{"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":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6967a1451f625cb66d831c98bb0f105a27ed291104189072e60c70983f31ac92"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::auto_merge::removals (cognitive 20): gix_tix::edit::auto_merge::removals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9a61b1d725bd1825067f01ccb783db5b16384d439fcec96bd51b60cd9ed4b"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::squash_message (cognitive 20): gix_tix::edit::rebase::squash_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (9 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"85de96e0e27e1269e2de97b1a6e1f2cfe14be5e75e19c9e4ea4d9acda122d2b2"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::review::finish_with_progress (cognitive 20): gix_tix::edit::review::finish_with_progress has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/review.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b72729480a56076683117fa408ae682e6b8e4a872b8bc4b7b4def0b3a3e5213"}},{"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":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2aeb99df5bfb52c10d3fe758d3a6841323ab154bc61443416d07c38912798c"}},{"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":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4236a5027176ddece637392f47bde8102a82c01031fe474421eed59d1ecab883"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::verify_integrity (cognitive 19): Graph::verify_integrity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (7 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-commitgraph/src/verify.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b093e659ee2e047e4d2940bc26a4dbb8c7502a7d93d8f3d750b7369e384685"}},{"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":"gix_encoding::detect::function::detect (cognitive 19): gix_encoding::detect::function::detect 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-encoding/src/detect/function.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1af40832359e23e5d1d985ecde0f62f23b437faf93564332fce5f04b44b3eb1"}},{"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_macros::unstable::fields (cognitive 19): gix_macros::unstable::fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 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-macros/src/unstable.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf47e98887cf8500f1b6985743c35268076daf0744b81db08e4f1cc1d3bb7eb5"}},{"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":"Store::lookup_prefix (cognitive 19): Store::lookup_prefix has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (7 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":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ba5dcffb835448c2b5ee6e71f0742349e8560c1f97a08719d018cb2fdc5101"}},{"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":227}}}],"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":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"249adebe45d83b65eefb9ebe110a16fc8cb97b85b26218611f16dd7e2f496333"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::find_one_with_verified_input_filtered (cognitive 19): Store::find_one_with_verified_input_filtered 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":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab05a498564a28c09de9b80d7fc03a531b73a699be43097828b3187c0725c46d"}},{"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":"App::begin_tree_selection (cognitive 19): App::begin_tree_selection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app/tree_selection/mod.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ccc8e70f874397a19617b6abd82519e1419e10420823fd669d06b4de17c8f1"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::run_ui (cognitive 19): gix_tix::run_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 1, match/switch 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":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fca5b34380bdf98e6f136a93c4a4bc383b89d0042decf30b56165fac6b40730"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::reword::parse (cognitive 19): gix_tix::edit::reword::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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-tix/src/edit/reword.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b49e27cf541537530cb6062b303257cb2e1bbef9b521fa58a7e4a5763abfccc"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::patch_id::fingerprint (cognitive 19): gix_tix::patch_id::fingerprint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/patch_id/mod.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d869db611811710d20ad1dd412f51d5dbc2d84a844d6d475df936f910d1cb29"}},{"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":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"4926664801bcdf202102615ed792450c965882e8fc7469054897d3a303669861"}},{"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":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4182d6ced46a994e95a7592d8c15a3fa4af98480a09a37b27f4df72cbacd90"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::worktree_file_to_object (cognitive 18): Pipeline::worktree_file_to_object has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 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":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aaa8f11ee8d5019bed4a716c6eb84620fa2aee1766f37ca37c9744d097a97f"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository::transport_options (cognitive 18): Repository::transport_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/config/transport.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"692792be4d898749c4f2cebf1153abc8813c191368ee5f7932412f8081b05915"}},{"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":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d1d43f0e234d084773617bd0c1f59731509cfd0d69afeb9472a9297fe7fb03"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::legacy::encode_iso2022_bulk (cognitive 18): gix_encoding::legacy::encode_iso2022_bulk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff36281ac98934d2da175f1a6301c30ae6f63564aac3d5715dd31147e177f67"}},{"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":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd637d30b8ea06c595e4fe919fadd5962fe0243cb0d10e257678fa0f0d7390"}},{"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":95}}}],"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":144}}}],"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":"HistoryGraph::descendants_in_parent_order (cognitive 18): HistoryGraph::descendants_in_parent_order has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca60ccb9c1783913cf9bacc45a02de422416ed22a4d6ff354c56a1b6ff70f2"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::merge::rewrite (cognitive 18): gix_tix::edit::rebase::merge::rewrite has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), loops 3 (4 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-tix/src/edit/rebase/merge/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab84d6521438a916cdc3f6c791a34497584076c3cdd3c6f72f58fed7c15c1eb2"}},{"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":1593}}}],"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":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45f13895aab2d175094c9e109e1cb30b98f4ffc8caac86f06293dfe94a71c56"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::color_graph (cognitive 18): gix_tix::ui::color_graph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":3230}}}],"partialFingerprints":{"codehealthFindingId/v1":"af193ed2e455e18b9911ba7ea8d9879a897b6788cb45092dd46afa20eed7b9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Pretty::format_span (cognitive 18): Pretty::format_span has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-trace/src/forest/printer/pretty.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"96130a10b645189b9c5ea51ff5420deeca860122d55a6ae2dc44fbb5044f2248"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::build (cognitive 18): Builder::build has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 6). 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-traverse/src/commit/topo/init.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b21b1040eae9587306666b24e3bb8873dfa45675232e89d24aca159a28bd226"}},{"ruleId":"D2","level":"warning","message":{"text":"Url::write_canonical_form_to (cognitive 18): Url::write_canonical_form_to has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: 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":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2134222e97fb0c435c8aea1cf46ffa8f26ab32350246b498b3997692db761dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedUrl::parse (cognitive 18): ParsedUrl::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"gix_worktree_state::checkout::entry::checkout (cognitive 18): gix_worktree_state::checkout::entry::checkout 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-worktree-state/src/checkout/entry.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"63662c87bb671324dff12ae61c41bbe7f93f87a9328908f5a3a3ae4cf4ff04a6"}},{"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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a9a264aabe3aa6e82df6edf8b19af7b704d567ad07848e680c2e26bae53376"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinSubmoduleStatus::status (cognitive 17): BuiltinSubmoduleStatus::status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 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/src/status/index_worktree.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fda9c1be1faff426aad06b9be97676c00369e259449e440a369484281fea83e"}},{"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::new (cognitive 17): File::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 1, match/switch 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-commitgraph/src/file/init.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5c04fe489a5392ec8d35f6f827516b5839878143c0030cdde3d771d6d0e53c"}},{"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":"EncodeTable::encoded_scalar (cognitive 17): EncodeTable::encoded_scalar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"374c14727f816c31274b0c1b7eb94fedc4bbf708201670370fab14b0efd53dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_encoding::legacy::encode_gb18030_bulk (cognitive 17): gix_encoding::legacy::encode_gb18030_bulk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"775bd46c9f819c1dff1d299eefe4ff9f5d33bc3e282b5a74ebe87805ac19feb3"}},{"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 5 (10 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/extension/tree/verify.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56a5fab451d7e56a7897650bf0c8ee4ceb06a03db71f90b9eb28d2e7bcd3a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformRef::builtin_merge (cognitive 17): PlatformRef::builtin_merge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/platform/merge.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"086ad2a8d3b960d8a7f17d2a94065c276252c342de23451e446f8adb9006ed4c"}},{"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":"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":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ccb9858451ec147f0a0232e41b107f0086d6359cc7547c259ae6b1cb5ab930"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_revision::ahead_behind_counts::function::ahead_behind_counts (cognitive 17): gix_revision::ahead_behind_counts::function::ahead_behind_counts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revision/src/ahead_behind_counts.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ede63f3bb7656d0d6ad3189739920cd4c00ccff6f75a38fa71c48acf3a38906"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update_hidden_branch_targets (cognitive 17): App::update_hidden_branch_targets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"33afde80ae1b50e64ea84ed9f62546d5bb3a4b0ffcdd704d83f48c52caaef001"}},{"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":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"66afe0f59229fb72a909010dc1e4a21abab09dce41c30f4844ff074b13d00d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::index_resets (cognitive 17): gix_tix::edit::rebase::index_resets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae30196febb6c278d62d501baf2eb126299e83a80b7335a9136cc119def33b44"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::replay_refs::prepare (cognitive 17): gix_tix::edit::replay_refs::prepare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3, match/switch 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/replay_refs/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"72841c38569a342ed9b9c679712ba419c2765f4061b1c28ab0da2789b3037ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::commit_states (cognitive 17): gix_tix::edit::todo::commit_states has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3, 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/edit/todo.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"246026f62f8af601b4e9a9980cd2b652284ca0d8adddbcbc7dc3005285cb47bd"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::todo::validate_state (cognitive 17): gix_tix::edit::todo::validate_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c55d12fe7435ab8df246f7067126b45c8c15f38f1cdd15eb1b46fa3e49ac3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_traverse::commit::topo::iter::collect_parent_ids (cognitive 17): gix_traverse::commit::topo::iter::collect_parent_ids has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), match/switch 2 (4 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-traverse/src/commit/topo/iter.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"864fc5cc870dc5029463aeb4ea1879bd9bea976588761407f106a46afc6c447c"}},{"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":43}}}],"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":94}}}],"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":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f969e2cba0e253e44b0b573f2f15beed804ade0f0f700d6696b46dec130615"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::at (cognitive 16): Graph::at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/init.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcb25a5233df47961c9332ce310dc8c42cddd0f57780a6d5320f94eb461336d"}},{"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":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3a264b109115c7b16cd47bfc8775fc0cb61b298174e4bf519c0c5683e3f924"}},{"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":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d00bad18508a4557ea986fc502462f005aad887662788c50168dc61da4e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::exact_source (cognitive 16): Tracker::exact_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54b9809790283a932da32cc806bdff18ba2ee3d32105df143ccd0414defe0f9"}},{"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":76}}}],"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":135}}}],"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":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2746cdb9a59d11f3df3c8f6ba4e1024022302cc1d2472af8871bc12cd48d8a64"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_path::convert::relativize_with_prefix (cognitive 16): gix_path::convert::relativize_with_prefix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-path/src/convert.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adc11257e72444fe696a634a3e1b242fcd6e8da418832e60dae2eb62abebee5"}},{"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":112}}}],"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":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f02eac43ffe6502dd87376cd4e8b8b6ec6d689358d4e24d244a81452becb99"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform::run_as_initialized (cognitive 16): Platform::run_as_initialized has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe899db490a8468fe65c4c7926a1d2702769eed9a8e2fcbafd5531c9b736c1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"References::resolve (cognitive 16): References::resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 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-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4c89649dae3696239f82a9f690075a15a42125eb5caa964bdee33af9c866c7"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::command::op::run (cognitive 16): gix_tix::command::op::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command/op.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af7ca5c26e770e9302453ab2de82e543c3d70766a3da70c0c93b60ace12d326"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::edit::rebase::squash_plan (cognitive 16): gix_tix::edit::rebase::squash_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, 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/rebase.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6461c8b8191da267d89762bfbad62af69cf2d81b065a5d3e91340997ac24f0a"}},{"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":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae5dc697ea80ea7dea935007215234b2bca2b63eacdb73c5483a7f83b33f26"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ref_tree::pin_references_reporting (cognitive 16): gix_tix::ref_tree::pin_references_reporting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 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-tix/src/ref_tree.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313a6d0c1455b9212f997fde559c542008531b94a468780662e58c16aaa5064"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::ui::wrap_prefix_popup_rows (cognitive 16): gix_tix::ui::wrap_prefix_popup_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c4475d7fe03ab731b4c014fb3be57f6d9b583b1aafc705569f4da203519ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"gix_tix::worktrunk::table_lines (cognitive 16): gix_tix::worktrunk::table_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 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/worktrunk/mod.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f7628aa0cb36b13a68819e3c3b5fc0014975fa0cfd7b0a4c8e16f0cbf3cc57"}},{"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 3283 significant 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 3183 over it, 32.83\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":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62b89bdc7acd5589b06c87201e2c4e6fdb9006fab6b1b0bc94c839e2286fd8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_merge::tree::function::resolve::tree: FunctionTooLong \u2014 gix_merge::tree::function::resolve::tree runs 1623 significant 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 1523 over it, 16.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-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 7803 significant 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 183 free functions. The bar is 500 significant lines; this is 7303 over it, 15.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a9350f813a6060972107333c5482a13b77d965b07b88f4d806eebcd23ca4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitoxide::plumbing::main::main: FunctionTooLong \u2014 gitoxide::plumbing::main::main runs 1099 significant 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 999 over it, 10.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":"src/plumbing/main.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf308f7efcdb897344bd8385dedab106895b7ece692a36d7a1193cb8b9dc63eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::ui::draw_with_worktree: FunctionTooLong \u2014 gix_tix::ui::draw_with_worktree runs 853 significant 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 753 over it, 8.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/ui.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"33681dd96caf922c3e5d116c0b355e7535182c0f081364d72914cd105e3ba2a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 227 methods, declared across 3 files: src/app.rs (207), tree_selection/mod.rs (14), prefix/mod.rs (6). The bar is 30 methods; this is 197 over it, 7.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-tix/src/app.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f1ccfeb06c47e32b8ffd19d3f6c59f618cfbd7af989f91b65e6341b47dbf23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Repository: TooManyMethods \u2014 203 methods, declared across 36 files: repository/object.rs (23), config/mod.rs (21), repository/reference.rs (20), repository/location.rs (19), \u002B32 more file(s). The bar is 30 methods; this is 173 over it, 6.77\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":"FileTooLong: edit/rebase.rs: FileTooLong \u2014 3143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 2643 over it, 6.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f9aa1fa364d3183a36d07844c18ec070415bcfbf136adc54ef1428bfeba4c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 3043 significant 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 (579-3903). The bar is 500 significant lines; this is 2543 over it, 6.09\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":"ClassTooLong: App: ClassTooLong \u2014 2200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 227 methods. The bar is 400 significant lines; this is 1800 over it, 5.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3dffb5752c9593f416c231cc9d22fbf546ac01aa4bb712ae972eb13fa3760b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ui.rs: FileTooLong \u2014 2540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 2040 over it, 5.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e2a11c27a50119e82973c91d62d70061a7019432cb6bc7f9dfbcf10a45b01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.update: MethodTooLong \u2014 update runs 493 significant 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 393 over it, 4.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/app.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9aaf7c49218f1a072d23da504437309f2b48cfb8113927db415b00f4e827d"}},{"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 481 significant 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 381 over it, 4.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-tix/src/edit/rebase.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"16387fc8bdf68d84b903f8931c3ccaf14efd40f5c695768e46491d399335b8db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: File: TooManyMethods \u2014 142 methods, declared across 11 files: access/raw.rs (39), access/read_only.rs (29), access/comfort.rs (28), access/mutate.rs (25), \u002B7 more file(s). The bar is 30 methods; this is 112 over it, 4.73\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":"FunctionTooLong: gix_tix::edit::rebase::perform_inner: FunctionTooLong \u2014 gix_tix::edit::rebase::perform_inner runs 434 significant 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 334 over it, 4.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde845e044a89b11c27a68a507233c5f3df17079401add0bb4f9062e5bfbe9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 120 stored fields beside 227 methods. The bar is 30 stored fields; this is 90 over it, 4.00\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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca97ee87e1163481605f5b6b65ac6de83ab11cdf3cc78ac7935ad097946ad9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/history.rs: FileTooLong \u2014 1835 significant 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 1335 over it, 3.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa4afb147ebcf345a7337f3b2ece644bbc7307e425a8beced9ece835a081979"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function/resolve.rs: FileTooLong \u2014 1715 significant 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 1215 over it, 3.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 306 significant 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 206 over it, 3.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/src/open/repository.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfaee95af2d1e9860f4d74e1cabbca73836fcfcad5c51e020d63b892722ba54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::draw: FunctionTooLong \u2014 gix_tix::draw runs 303 significant 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 203 over it, 3.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6918}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f98ef883d15da04306ef6dc22b9a12705d639459213e4868d9442f194a744e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repository.transport_options: MethodTooLong \u2014 transport_options runs 291 significant 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 191 over it, 2.91\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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548eab0ae0fcd6bfc819c42b7e493ce26a3b72edde430eee6f6f31836ba2344"}},{"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 271 significant 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 171 over it, 2.71\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":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78bdd540c3aedb11facef28356fdec55df30ecf614f197f616486c3aa81988e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ref_tree.rs: FileTooLong \u2014 1315 significant 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 815 over it, 2.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38523dd94f5d16d7ccf8985b591c94a5c97d76da1600e142c0ea2ad698b35aa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/todo.rs: FileTooLong \u2014 1275 significant 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 775 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b529e75888f9a6f9bf55f4def14122f18e401f52eb5235fabe038ccc461659"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_blame::file::function::file: FunctionTooLong \u2014 gix_blame::file::function::file runs 248 significant 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 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39bd2f9b0fa73d34fb8c54bae42fcc25dcedeb41327a54f47b8df805d8733ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix::config::cache::init::apply_environment_overrides: FunctionTooLong \u2014 gix::config::cache::init::apply_environment_overrides runs 245 significant 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 145 over it, 2.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/src/config/cache/init.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb4cf8d52268c0d62f563543f89879606907a138331c2debfee49b99b06623d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::transplant::build_plan: FunctionTooLong \u2014 gix_tix::edit::transplant::build_plan runs 238 significant 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 138 over it, 2.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/transplant/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2373968ba2019b81df4ca4fe5ca09ca2f8752138b7650209c49e3081d748057"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pipeline.convert_to_diffable_inner: MethodTooLong \u2014 convert_to_diffable_inner runs 236 significant 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 136 over it, 2.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-diff/src/blob/pipeline.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dd2da6a4fcc8cd11de037fbdfc2837f980cc05b2c8db2740fe28cd1ba0613b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::history::load: FunctionTooLong \u2014 gix_tix::history::load runs 233 significant 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 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0ad395bc6c7542f94bfa19f992a14f0bd687204f4bd02eb2c300e29b0b138a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/time_travel.rs: FileTooLong \u2014 1162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 662 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c07390009da13ca957fcf3c9bb0d049e33204ee1f9d96881840f78487655805"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::todo::parse: FunctionTooLong \u2014 gix_tix::edit::todo::parse runs 226 significant 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 126 over it, 2.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":"gix-tix/src/edit/todo.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c04de7589847ee8424fb84f56595673c43a2c459d48e72fa6e5ae1fe1193e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plumbing/main.rs: FileTooLong \u2014 1128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 628 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d36bfe16f190ca5478f7529bf53bf282e3898a84983bc8d501a2a95a57c29e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::todo::prepare: FunctionTooLong \u2014 gix_tix::edit::todo::prepare runs 223 significant 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 123 over it, 2.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-tix/src/edit/todo.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0205de4562556ab31c100a52da517852adeec31310ebfbc458be2c66154f524a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: auto_merge/mod.rs: FileTooLong \u2014 1104 significant 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 604 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddab2d1f0b964d276f803a84ebc852cdfbf0b9502e3e62304256477c4c86d414"}},{"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":"MethodTooLong: PrepareFetch.fetch_only: MethodTooLong \u2014 fetch_only runs 217 significant 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 117 over it, 2.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/src/clone/fetch/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173844795c2e01e5acbfee32a71aeca85af00a20084fb9e23bf959728da8f42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Prepared.finish_inner: MethodTooLong \u2014 finish_inner 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/edit/rebase.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af724aa0680b1b87488420d0010c184a06370889e9698ae71d7db56907a91c1"}},{"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 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/edit/time_travel.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b08552fcebb6a9ee53601e56971cfc05e9208ce438b44ba8f1b447e427238"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix::remote::connection::fetch::update_refs::update: FunctionTooLong \u2014 gix::remote::connection::fetch::update_refs::update 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/src/remote/connection/fetch/update_refs/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cc0b6408a56c89d1dbf805d1fcc3aea3545e6312e84b1da5d09bb2098db950"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_date::parse::relative::apply_operations: FunctionTooLong \u2014 gix_date::parse::relative::apply_operations runs 199 significant 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 99 over it, 1.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-date/src/parse/relative.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a495eaecbcb99325ef261c0b8e0aa6b7900f16fa66ebf98246d2a478cb46469d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryGraph.refresh_inner: MethodTooLong \u2014 refresh_inner runs 196 significant 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 96 over it, 1.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/history.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"16039e00eb5b3b18f8eab4b107d333bdae25089392de9a9a7bb65bc59050b89a"}},{"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":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01dcdca6f5b0ff21802196d8b63f3786fe1d8dc5adc81ee174574421b92ed02"}},{"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 187 significant 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 87 over it, 1.87\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":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"af10e0579371f6a78c318d9cd51f97320c19ae3d69cb4c66f3cfe02f9abd698c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: worktrunk/mod.rs: FileTooLong \u2014 934 significant 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 434 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/worktrunk/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ac7a85c323089c4f27c961abf7fdc32dda98f58c82f85b462b76d8d47a741"}},{"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: File.resolve_deltas: MethodTooLong \u2014 resolve_deltas runs 184 significant 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 84 over it, 1.84\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":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65983a31a8f71f4ee05521494f966ec45ab28e4338b33eca4fa57747c24c49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.consolidate_with_disk_state: MethodTooLong \u2014 consolidate_with_disk_state runs 182 significant 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 82 over it, 1.82\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":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dcb58b5111beee8488cff3a280c3cc0d621ed6a5936031a71745b0cc8954de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 53 methods, declared across 9 files: file/find.rs (17), loose/reflog.rs (9), file/packed.rs (7), file/mod.rs (5), \u002B5 more file(s). The bar is 30 methods; this is 23 over it, 1.77\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_tix::edit::auto_merge::order_plan: FunctionTooLong \u2014 gix_tix::edit::auto_merge::order_plan runs 169 significant 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 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d708c58ca4286165a57690f29a5cba8c796ee1858f53aef0429befb645fad131"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::todo::prepare_continuation: FunctionTooLong \u2014 gix_tix::edit::todo::prepare_continuation runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e97964e42674fde65281436e0e2bbaf15f05d466458e5a7034abb3d28c1d11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Remote.default: MethodTooLong \u2014 default runs 165 significant 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 65 over it, 1.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-transport/src/client/blocking_io/http/reqwest/remote.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a556612a0eab3deb192f926e5e222b859a8f115a4be9789ea15dbf05ab77e25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::command_menu::commands: FunctionTooLong \u2014 gix_tix::command_menu::commands runs 160 significant 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 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command_menu.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6b28f5a44d7ceb60c1627fcc27c7fda804c0cfe275c9baeb650770c250e2f7"}},{"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 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849a087aa194baee8dd01d15f95fc1b158b51469c89eea9dbd2dced107f944e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tracker.find_file_renames: MethodTooLong \u2014 find_file_renames runs 156 significant 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 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/rewrites/tracker.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64e2a757ce0749c4034247c2917066d83243ea5d755e3d8796a226dd6f6b978"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::command::write_history: FunctionTooLong \u2014 gix_tix::command::write_history runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0be98c0916b32532d8b35f010de2c5a776d5205c2bce0ba213e3e5cbaaa75b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HistoryGraph: ClassTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 2 blocks, lines 149-996. The bar is 400 significant lines; this is 217 over it, 1.54\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50f7b9b5e3a85af5f3a0865d5143df575dac64b306626808d697d57cf1a2578"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command.rs: FileTooLong \u2014 771 significant 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 271 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb070e7fc4a56eb911fd371a5cda6fd4e58573756bb17ac2fb52c683cbb6d87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/mod.rs: FileTooLong \u2014 768 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 268 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/options/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7a7e14a33ca817d5fad1b4bcd952c61b56fc671e1bc620d4277f31086e186"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_diff::index::function::diff: FunctionTooLong \u2014 gix_diff::index::function::diff runs 152 significant 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 52 over it, 1.52\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":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2865fa72326ff2276f65c0cea9e220f7406a6e0ffc4ea984d92bc151fc5cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Platform.into_iter: MethodTooLong \u2014 into_iter 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/src/status/iter/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"382dd4018b40c57d382ce7357351443525cef97897aab6fe84b6e6bed45d9ff2"}},{"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 148 significant 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 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/write/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62cd7e6f985142fa1e140cf5b9451dff6c3649e781716c8f7cb03b5e152f01c"}},{"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":"FileTooLong: file/function.rs: FileTooLong \u2014 719 significant 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 219 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e5c7730bed515a7a188c951c6745aeb829208e0f18e785d0779d30bf6be795"}},{"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: edit/undo.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), declaring 43 free functions. 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-tix/src/edit/undo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86df6855b6409823db89663283e3326e6aa77219d9531b063e90ec2fe52a67f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Handle.try_find_cached_inner: MethodTooLong \u2014 try_find_cached_inner 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-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e6dfcddeed89532295c487e3643eb4e972c883b70883e883a19a9fcf73a3da"}},{"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":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9722b9f91921db0177e7c4735c64f3a4f517db406eec77c948492d8102cd5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::time_travel::attach_reporting: FunctionTooLong \u2014 gix_tix::edit::time_travel::attach_reporting 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/edit/time_travel.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdf868614a1a64fd1e175f231e880cd665c43b2b3f7f0cbc3d98ab4f34fbb06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrepareDetached.receive: MethodTooLong \u2014 receive 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/src/remote/connection/fetch/receive_pack.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58bd464ce4467dfb076ae3baf3328ad771dce42d8eb48dcea0579c007dd2212"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::auto_merge::perform: FunctionTooLong \u2014 gix_tix::edit::auto_merge::perform runs 139 significant 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 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0084c5eab198360e12fca2866a45de1a32e09f270d3949ca214abb727adc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.verify_integrity: MethodTooLong \u2014 verify_integrity 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-odb/src/store_impls/dynamic/verify.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"92551b7e22d4f9336410af5bb4f6b87ac2b284e353765ae34eec27b1c79d492f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tree: ClassTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 2 blocks, lines 147-865. The bar is 400 significant lines; this is 144 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5044943c85e3be1af65f0894e287a263379359bb64a3614b0cca291cb49b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repository.prepare_add_worktree: MethodTooLong \u2014 prepare_add_worktree 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/src/worktree/add.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bf048039a0eb0d838da72c429dec707368e4618b12da4c2d5db122943b1730"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/legacy.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e97f33dc8b584e883529ad8a79e7c2c59e95707efd1dbc3dd73c68dca998e66"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Converter.convert: MethodTooLong \u2014 convert runs 131 significant 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 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/convert.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"67634c46d99fb2e65de882a3b7a1916be07721e333ebfb17d1044191e29021d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_date::parse::git::parse_textual_date: FunctionTooLong \u2014 gix_date::parse::git::parse_textual_date runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/git.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f6b07e89727b444d14f9842f2d547a162408aeaffe6262caf57373978c2b69"}},{"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":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffb61f3889a48d8c434fa9d2ddc73ba47ba745a5b92f373373a7a949a55e939"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::rebase::update_refs: FunctionTooLong \u2014 gix_tix::edit::rebase::update_refs 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/edit/rebase.rs"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fc2b9d296a6330713b19506fcd251a739b31c332bd6a695597364af4d0e315"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pipeline.convert_to_mergeable: MethodTooLong \u2014 convert_to_mergeable 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-merge/src/blob/pipeline.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4825645f6081c3963206296267a1ba8c4955344d088a62929f05462ac5f199"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitoxide::porcelain::main::main: FunctionTooLong \u2014 gitoxide::porcelain::main::main 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":"src/porcelain/main.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ae280c47fb212b6fc50e195f15abe515231a4afea836bf3efb0cc085d7f97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.update_tree_selection: MethodTooLong \u2014 update_tree_selection 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":"gix-tix/src/app/tree_selection/mod.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2075ef13c6255c896e0d224913667aa3e50d7026341ccc4986aeeb7ec72b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::history::decorations_excluding: FunctionTooLong \u2014 gix_tix::history::decorations_excluding runs 125 significant 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 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5287cc45f6f752f6e434e3141e18a1e65cf5ed3ffe5eeb417ce610466484e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: gix_path::env::windows: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 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-path/src/env/windows/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd6e542645e6f04a8f4a6f98095e847130f50a332714f240782788b3112d6a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.prepare_inner: MethodTooLong \u2014 prepare_inner runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f0d6d4be7a337ad84fcc0f31a74eff73de98028a57db9a55dbe843434db2d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repository.try_find_remote_inner: MethodTooLong \u2014 try_find_remote_inner runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/remote.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1911b40e775b4683a1980f7dae041200600fbbfd4162a2f57017b55ed029cf"}},{"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::unstaged_change: FunctionTooLong \u2014 gix_tix::unstaged_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-tix/src/lib.rs"},"region":{"startLine":8892}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc85ec12f84306ba8c9d410e893fb71d64c385a5290322629fddcec1acdf961"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.perform_run: MethodTooLong \u2014 perform_run 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":"gitoxide-core/src/corpus/engine.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e8c184faf9d44c35ccc42cce149d42ec99c59e8e990b5c1a88abee2a175be1"}},{"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":92}}}],"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":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe2ddb069c7b1c1f67f64d4adfe3ad10f77c8690d9ef2cf6d763cbf90696f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_tix::edit::todo::parse_state: FunctionTooLong \u2014 gix_tix::edit::todo::parse_state runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/todo.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69d9840a9e3102be8736600a0379330f6956859a47bfcf189caaf9b668c97ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_worktree_state::checkout::function::checkout_inner: FunctionTooLong \u2014 gix_worktree_state::checkout::function::checkout_inner runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree-state/src/checkout/function.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed49427db37551622c086f19454d7b30baacf350e05d69f9ac5bee43d93ac487"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tree: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"289babd9d04c3af86df751e5fbd62c4e58f31bf2930618a23bc36e6939940844"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cache: TooManyMethods \u2014 34 methods, declared across 2 files: cache/access.rs (30), cache/init.rs (4). The bar is 30 methods; this is 4 over it, 1.13\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":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d6dcc47dd050d88261b4d4543a5329c9415dc846408ed2b280d97eec73198c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cascade.invoke: MethodTooLong \u2014 invoke 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-credentials/src/helper/cascade.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b857757afd1407a495863e7325734993e240484bb2045f5927a4c715dcc8bc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/init.rs: FileTooLong \u2014 563 significant 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 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1365fcef160bba423cf2c1828e88200c7476b521710c344bdbba8871b77cdfb"}},{"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":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba33267a0288b8914e5f97a287034846a92f52cc2db118358b66ed15dc0fc3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Message: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/concrete/metadata.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"77764d4addfde78e001e2e873d8aabad9f340946541aba603611267b30e83a75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Menu: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/menu.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f891aacc7a70dac12ebff2012f08999f0845f1702277df4d32925d013e96c9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Worktrees: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/worktrunk/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3855312eb97cfd2eaa233baf1b5a968a04729f58439ea359d448f181a825dfdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: File.new: MethodTooLong \u2014 new runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/init.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"879c32a01248ee84e25364b36e94c2b0249443d816850e943fb400dd100eaeea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: blob/platform.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/platform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2ffa1e44cd1e538e0f194851b0952a135677ad180e4fb732cfc950ad863032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Platform.run_as_initialized: MethodTooLong \u2014 run_as_initialized 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-tix/src/command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6f899083c519db54bf0dffc9f641ee2a2519e6458f2eebd74ccbaa163540d2"}},{"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":"TooManyMethods: HistoryGraph: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7496a2b5287bc5214222b8a8b926aebd0737e303433ed3250acb1063a5c1fef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Handle.try_header_inner: MethodTooLong \u2014 try_header_inner runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/header.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c40c5ac65dbef86e7d89fa6d2a7e7c2f04497bb42699587b4537117de5a06a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix_traverse::commit::simple::compute_hidden_frontier: FunctionTooLong \u2014 gix_traverse::commit::simple::compute_hidden_frontier runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce56b4dedaa0a5379ea5a763ad4ea47a7b2c5d5813fffcb5cbac7727bc5ad7fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gix::clone::fetch::util::update_head: FunctionTooLong \u2014 gix::clone::fetch::util::update_head runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/clone/fetch/util.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6258a6c7b223623de59c663b0b7602579945573001b1a8882246fc4241ff1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: open/repository.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: ThreadSafeRepository (56-610). The bar is 500 significant lines; this is 19 over it, 1.04\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/src/open/repository.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"063464c87e1ec809b8b4f57755620980b90eb2ba31d92e5f611c53de0986c9c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run: MethodTooLong \u2014 run runs 103 significant 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 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/command.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"52135f26ed8ae67b18f431f54327cd3d962069a1ce5c9af1bb16a1790e72d9cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.lock_ref_and_apply_change: MethodTooLong \u2014 lock_ref_and_apply_change runs 103 significant 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 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/transaction/prepare.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a171d7598d769a8ec753822b1d244b87f8d152a185a7e396176911a58dd0381"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_selection/mod.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: App (231-665). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app/tree_selection/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c30d2be40a590654f66df13c31b2904e89e273fde7e5ede81093fe9c60c046"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commit/simple.rs: FileTooLong \u2014 510 significant 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 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eec97866ce977536c3fa650309195c479de423b52a2e8af1632834d46f14d43"}},{"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 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/delta/traverse/resolve.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e00b234d1914618923c33f68b1096715eaa7b3a8eb26e6c2da1b01314a73fff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/access.rs: FileTooLong \u2014 507 significant 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 79% of them inside a single declaration: Cache (20-566). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/access.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f8d751b8cebf517d430428565d41db01b5e5a146c8acd379f00c12e5a4baff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: File.verify_integrity_inner: MethodTooLong \u2014 verify_integrity_inner 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/multi_index/verify.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"356d9884e2343d8648d7e4a78e667b608f3f9072fece583e94bb00c475680cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.compute_status: MethodTooLong \u2014 compute_status 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-status/src/index_as_worktree/function.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b48e84eafd75eece62b8816cf9891466d1a53a5753af1e364535aeb3e2db73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.finish_lane_computation: MethodTooLong \u2014 finish_lane_computation 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-tix/src/app.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"9add8c37c13552f7c8b8ce1c5b01d2b8bebfa99398bef912ee4352b4b286edff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exn/impls.rs: FileTooLong \u2014 504 significant 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 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/exn/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e03726e6140383a900ec98d31ce6c86af81593b9cf9b8b5df3c6df72c36d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): gix-config/src/format.rs:130-241 | gix-config/src/parse/format.rs:103-210 \u2014 These two members are one piece of code written twice and then edited apart: 108 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/format.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bccf3df5566bdf2096d4fd873ce12c56e08abec5844d77be7963df41cedf03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): gix-pack/src/bundle/write/mod.rs:74-168 | gix-pack/src/bundle/write/mod.rs:187-273 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/bundle/write/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b8d22fb39a832e2dd94d229146edb77e3061341092d81bd5390f617d944bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): gix-traverse/src/commit/simple.rs:622-705 | gix-traverse/src/commit/simple.rs:707-775 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1e8bfad15c84869ebae3de84809ed558003a2ef4ca45d48fe862e6e7d26999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): gix-refspec/src/match_group/mod.rs:42-114 | gix-refspec/src/match_group/mod.rs:135-188 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/match_group/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"99640485b5a54ba1c7fc131a379ee6d8822cf543958ee83ca87a14ad6b7ab303"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): gix-transport/src/client/capabilities.rs:193-244 | gix-transport/src/client/capabilities.rs:280-331 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/capabilities.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d13103ba8e208ece9bb300552cc2f255cac9494ff8dfe6fa019090a4324603d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): gix-parallel/src/in_parallel.rs:60-106 | gix-parallel/src/in_parallel.rs:131-183 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-parallel/src/in_parallel.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13a150506bc7b88f839ae408e95e0c0108c7ede3c17f8b47f487031524650e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): gix-diff/src/tree/function.rs:198-242 | gix-diff/src/tree/function.rs:252-296 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/function.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ca102a01899c3a645d1df2c1459975d0ca2d74af048f1b6a7f869dc3248a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): gitoxide-core/src/corpus/db.rs:56-161 | gitoxide-core/src/query/db.rs:10-83 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/db.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4f1acf11e5dd820a758ce6da20488d0ee999e4fd4e3a7115ddd8697ca61cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): gix-packetline/src/async_io/read.rs:40-63 | gix-packetline/src/blocking_io/read.rs:38-61 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a80705b0419d58fbe2e87459a0f31851e14384367df45435e81b3a08b34dfcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): gix-utils/src/btoi.rs:109-151 | gix-utils/src/btoi.rs:217-269 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-utils/src/btoi.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb026de149282a3d37e8fe1d0ab588fb5d83c8c4d9ce0404403d3cc1c019d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): gix-transport/src/client/async_io/request.rs:68-96 | gix-transport/src/client/blocking_io/request.rs:58-86 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/async_io/request.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbacceb40a3ef530873a172cebbb1bdb23fae3f325887e33a87a536461bc1bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): gix-merge/src/blob/builtin_driver/text/utils.rs:277-318 | gix-merge/src/blob/builtin_driver/text/utils.rs:325-356 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/builtin_driver/text/utils.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"99501041580693eb918740c25bc5620e090a6a74b33530d4c88b66f6255661da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gix-encoding/src/fast.rs:196-218 | gix-encoding/src/legacy.rs:435-456 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/fast.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2be2a38088c8b720090b94ac3ae70ec52116d8402e256d15fd118bff79fdf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): gix-tix/src/edit/rebase.rs:3939-3966 | gix-tix/src/edit/time_travel.rs:1343-1371 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3939}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3dc0a5eddd3f586045541c7132651b3ce8c328e5481f3be439ed7ec05e52a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): gix-diff/src/tree_with_rewrites/change.rs:204-265 | gix-diff/src/tree_with_rewrites/change.rs:328-389 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree_with_rewrites/change.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c50ad72ba2b7ae2af8f56098896be07ee654ed199ff388a00cb6543613e11d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): gix-packetline/src/async_io/read.rs:135-161 | gix-packetline/src/blocking_io/read.rs:134-159 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6f50c8cdfc1f63d89079f72acb16a043a7232f2a0e0f278a24cdb6fc3a8c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gix-index/src/fs.rs:70-91 | gix-index/src/fs.rs:97-118 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/fs.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8e9959b081a8a8c7030a77e53ac5c8b5c95d376640982bc233d904d065266e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gix-object/src/tag/write.rs:10-32 | gix-object/src/tag/write.rs:52-69 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tag/write.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a815eba083c1d03e3932a0704a8c62ded5e62858296d4865f00cebf5ba62cc8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): gix-tix/src/lib.rs:7868-7896 | gix-tix/src/lib.rs:8364-8387 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":7868}}}],"partialFingerprints":{"codehealthFindingId/v1":"31df3a8efe485f5d20bc73764de8321d04e328f30db537c95695acc76a7edeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): gitoxide-core/src/commitgraph/verify.rs:43-61 | gitoxide-core/src/repository/commitgraph/verify.rs:31-49 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/commitgraph/verify.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6646afb7386c2cd8c4486f7d039e5d1452869a24124675f925ebd7538455665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-object/src/tag/write.rs:38-48 | gix-object/src/tag/write.rs:75-84 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tag/write.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a748a99d19d53e007e06cc5e43da722b6c705753f9229c9c6deb939454d60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): gix-transport/src/client/blocking_io/http/curl/mod.rs:71-110 | gix-transport/src/client/blocking_io/http/reqwest/remote.rs:306-344 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5201cf4f41e9e88e75562cd207ea2c4c217f9a0869e7b793599a961292ae397b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): gix-diff/src/tree/function.rs:132-156 | gix-diff/src/tree/function.rs:164-188 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/function.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97627343fdc5afda4d63679059039e0f2ad2c51e559584962c43ad172115a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): gix-revwalk/src/graph/mod.rs:105-129 | gix-revwalk/src/graph/mod.rs:148-168 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revwalk/src/graph/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc78399d3751a0b9a7eb957e831fa94294e1df909481bdad19e3c8511863513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): gix-packetline/src/async_io/encode.rs:146-169 | gix-packetline/src/blocking_io/encode.rs:85-108 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5327fa9efacd800c1a4e80563e7a03b2c478c9cf74e7c0e7cea85ddf0bc9fcf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gix-protocol/src/handshake/refs/async_io.rs:37-59 | gix-protocol/src/handshake/refs/blocking_io.rs:36-57 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d24e3e848779d26d44051fb954b52a4a458e7dbef3187cc081f75c927ea75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gix-revwalk/src/graph/mod.rs:209-226 | gix-revwalk/src/graph/mod.rs:260-277 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revwalk/src/graph/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea5dd08d76e87d6f98cdd7d6045580e6999baedb75eb81f1390cf394a084207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gix/src/repository/identity.rs:34-55 | gix/src/repository/identity.rs:104-125 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/identity.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c88a7f3206f45d2b304d4c91aba7fd4911126cd2db853d4fac56011ddf8ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gix-tempfile/src/handle.rs:295-316 | gix-tempfile/src/handle.rs:322-339 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tempfile/src/handle.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff8d298232ebf0f00c15bd098fb05d011ed42ca1f2bb8aeedc02a6804e5576a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gix-tix/src/lib.rs:9705-9722 | gix-tix/src/lib.rs:9724-9745 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":9705}}}],"partialFingerprints":{"codehealthFindingId/v1":"73decb55b457ecb52abd12a00901e9135d3d354a5596e0ac146eb0a41a012a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gix-pack/src/data/entry/decode.rs:104-125 | gix-utils/src/decode.rs:5-22 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/entry/decode.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4bcadaeaef1bfbddf6f0da9f162fe8817a3bfe7322b319859904b39c412097"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): gix-transport/src/client/git/async_io.rs:84-110 | gix-transport/src/client/git/blocking_io.rs:81-105 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb0b27abfbfe83017a52750e5af6f91357039a1d82fb629a79514eac980280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gix-packetline/src/async_io/read.rs:167-189 | gix-packetline/src/blocking_io/read.rs:165-186 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e639dd70767f5e4b868ba61d25417f3b5e2b580e9b7a153506869048e55f3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): gix-tix/src/lib.rs:5468-5488 | gix-tix/src/lib.rs:5495-5513 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":5468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dfbb241b2385c03643992d0ffb936414afe78f5ced6379e68e20bc38826e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): gix-object/src/traits/find.rs:215-229 | gix-object/src/traits/find.rs:233-247 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/traits/find.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8708d0e30b411083a245f47fe52ecf1c65ce4785b0e574e54dd23db02dd89eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): gix-tix/src/edit/replay_refs/mod.rs:41-57 | gix-tix/src/edit/undo.rs:143-163 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/replay_refs/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf9c6b179b8777395cd4b8cf1846736aecd1a92d33ffaa3693ab48582f711a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gix-diff/src/index/function.rs:238-255 | gix-diff/src/index/function.rs:261-282 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e2559c65aad254df7b2697585b09df7dec2ea0f92b4b910dfbfb8227249765"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix-pack/src/cache/lru.rs:50-68 | gix-pack/src/cache/object.rs:57-68 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/lru.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5be98c3a1cc6ab986f1c6875ac3c912d391512a3bb27805ad3a98feac4eb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): gix-tix/src/command/travel.rs:219-235 | gix-tix/src/command/travel.rs:255-271 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command/travel.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4924051cb21fc672599464313a893eb30521df158a0af9e29d7a9a90ce00f3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): gix-tix/src/ref_tree.rs:538-552 | gix-tix/src/ref_tree.rs:570-584 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3136a960eeb1e8fccff27f1ce5b39e626889c737ac65d00e4232f6118bb8cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): gix-traverse/src/commit/topo/iter.rs:78-98 | gix-traverse/src/commit/topo/iter.rs:111-127 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/topo/iter.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"698d151f83f5749da4710378f8bc124ef17da894a14193f4067009c32b3624ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gix-tix/src/command/enrich.rs:195-207 | gix-tix/src/lib.rs:6583-6597 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command/enrich.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4b795e99bed58b7cc30468a6cd15a4cf121067b28e3239130225331683a38c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): gix-config/src/file/mutable/multi_value.rs:214-232 | gix-config/src/file/mutable/multi_value.rs:236-255 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/mutable/multi_value.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"008eaca45322cdf66bb2a42e08d3137890a2c9a2050715cff046408b44b5c9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gix-tix/src/lib.rs:8627-8639 | gix-tix/src/lib.rs:8747-8761 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":8627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bd219074832e73bfeb899067eeec3cc61b9cf52a8d2b0af020207fa052a486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gix-tempfile/src/handle.rs:181-196 | gix-tempfile/src/handle.rs:209-221 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tempfile/src/handle.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"04efb00cfbf82c05f64649bd7857f6853ea7fe068428d2889527273863094bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): gitoxide-core/src/repository/merge/commit.rs:82-92 | gitoxide-core/src/repository/merge/tree.rs:176-186 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/commit.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23210ab6335688e09e9098ac5de993be182f5f0fd3ecc1dcd55c4c482366301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-tix/src/history.rs:568-577 | gix-tix/src/history.rs:1097-1106 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c105c88bc1fb3ce8967c50d9a3fbbf9cf44b791e5166b3637f39e1472046eb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gitoxide-core/src/repository/index/entries.rs:400-421 | gix-index/src/lib.rs:218-240 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/index/entries.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d325b617bca2b1a20070d01152b9d96a8a834f09f98976afc3bf1864563a09f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): gix-lock/src/acquire.rs:73-94 | gix-lock/src/acquire.rs:126-147 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-lock/src/acquire.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5cd37302579188ff738f7b8a18d7653e1872e1d456e4b5008506492253de3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): gix-odb/src/store_impls/dynamic/handle.rs:263-276 | gix-odb/src/store_impls/dynamic/handle.rs:281-294 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/handle.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa37295b16cc2436f29d25927bd589b6820ab033b3071915773a78ac7f998a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gix-packetline/src/async_io/sidebands.rs:195-207 | gix-packetline/src/async_io/sidebands.rs:223-235 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/sidebands.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30e81e73bbec84602f77e24571735b6cc0b90feaf1ddcd92da6a9a88706e0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): gix-protocol/src/handshake/refs/async_io.rs:9-23 | gix-protocol/src/handshake/refs/blocking_io.rs:10-23 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3942c960de2da570661bbd222377f327af259e0856ac57a4518a9c1f3aa4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): gix-tix/src/enrich.rs:331-341 | gix-tix/src/enrich.rs:347-358 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/enrich.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4a1903feda8b88949e874f20cf8ce2ee4072cda77b38e98e583cd73b87e6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): gitoxide-core/src/query/engine/update.rs:515-529 | gitoxide-core/src/query/engine/update.rs:531-545 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/update.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a797e6daaf6da0e4ff37307f46d6dfdc1f0a7202db39d8015087f4871ca79f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-tix/src/app.rs:3443-3452 | gix-tix/src/app.rs:3557-3566 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ba18cc02f9a47374265e6fad90c2ec0ade543df9b09cfc72085b16b73f1627"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix-tix/src/prefix_input/mod.rs:208-219 | gix-tix/src/ref_tree.rs:1711-1719 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/prefix_input/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7acfcaf2b26d792707596ce0d1c3ab3e18e029d5492fbcd72092cbad13dfa31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): gix-protocol/src/fetch/refmap/mod.rs:26-36 | gix-protocol/src/fetch/refmap/mod.rs:50-60 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/refmap/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e7d26f9065a1295ef38ff78d3d8a28f9137575e562f2b976f02a132e7c9675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-protocol/src/fetch/response/mod.rs:36-49 | gix-protocol/src/fetch/response/mod.rs:90-99 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/fetch/response/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ff1440625ca7263a03a18a1ab65c4843d542b3cbbfa5526e66df1b5aadbce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix/src/config/tree/keys.rs:269-277 | gix/src/config/tree/keys.rs:302-313 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/keys.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faa2ecf2ec8bd1feddf24dae8e259283180cce284d8acbd62c80da5406430eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/shared.rs:290-298 | src/shared.rs:312-320 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa48cb27601c44694a0e7b6c1b3bbc6014073fd5bb301e58cedd19c1c75216a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): gix/src/config/tree/sections/http.rs:183-199 | gix/src/config/tree/sections/http.rs:210-229 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/http.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe555a0a392e410f4d4ac39b08cd6225d67d75af8834b0e2452c577ab3b3c79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/plumbing/options/mod.rs:813-830 | src/plumbing/options/mod.rs:893-906 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/options/mod.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc12db0a7679643defd41fdff7c4e43f8befa298208c645f3f9b09e71f826b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gix/src/config/tree/sections/core.rs:275-287 | gix/src/config/tree/sections/core.rs:299-311 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/core.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff7d837f9b62296e9277ad069edb7cce6c63fad7687fd4bacc5a9b8d08a0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): gix-odb/src/memory.rs:145-159 | gix-odb/src/memory.rs:186-197 | gix-odb/src/memory.rs:204-215 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/memory.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3baf2fad709a40a289a16ea58d9511de056b4d831958ea43e8e6f6fc1907e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): gix-odb/src/memory.rs:222-233 | gix-odb/src/memory.rs:240-251 | gix-odb/src/memory.rs:273-283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/memory.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eac57f79a3956e0243036a15752ebfce18fdf27c121ce9fadf29efda63cf4f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-merge/src/blob/builtin_driver/text/utils.rs:359-368 | gix-merge/src/blob/builtin_driver/text/utils.rs:371-381 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/builtin_driver/text/utils.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18de3d1b003beb7bab4f53e4752bdf47b83ddfd542e32d498dbb6eb119ba2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): gix-attributes/src/search/attributes.rs:59-73 | gix-attributes/src/search/attributes.rs:84-94 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-attributes/src/search/attributes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8dbfddf1c7f113e3cfbd2349dcd7581a844490cde89a9242cdd1583fc298b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-diff/src/blob/platform.rs:170-184 | gix-merge/src/blob/platform/resource.rs:7-16 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/platform.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6690697402aa6c14c90ee0e773374be9c0a6c5d9ae8ec8bc819ded56fda0541"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): gix-odb/src/store_impls/loose/write.rs:19-26 | gix-odb/src/store_impls/loose/write.rs:33-41 | gix-odb/src/store_impls/loose/write.rs:50-58 | gix-odb/src/store_impls/loose/write.rs:70-78 | gix-odb/src/store_impls/loose/write.rs:88-96 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/loose/write.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0e2e2431fa5158d24ef5508371d53f2ac889492728baff88f6ef9378d4c275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-refspec/src/match_group/util.rs:35-41 | gix-refspec/src/match_group/util.rs:49-55 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/match_group/util.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d51cf85dc544216de547ab91d3d5d41b5e7a6006f90a6f4d47c68796d22b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix-commitgraph/src/file/init.rs:219-227 | gix-pack/src/index/init.rs:91-99 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/init.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8b6cdf366c09ebfe7b561a1f64af9896dedb012d1369ed446c5478d28fbea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix-imara-diff/src/sources.rs:174-182 | gix-imara-diff/src/sources.rs:207-215 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/sources.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1dedb8053f512c718149df291fa15535857125a8bf64785c743e800ca976b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): gix-packetline/src/blocking_io/sidebands.rs:93-100 | gix-transport/src/client/async_io/bufread_ext.rs:115-122 | gix-transport/src/client/blocking_io/bufread_ext.rs:105-112 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/blocking_io/sidebands.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb5e2eeb3a78c2e8b9edb8445cd770cf38b60efda090d0f4e1a9e1e051b4f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix-ref/src/store/file/find.rs:350-361 | gix-ref/src/store/file/loose/reflog.rs:221-233 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/find.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ae81b0ff1555e37156130111ef5c4df942ca2043f74fba25b8358ddd8c11a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): gix-tix/src/app.rs:3508-3519 | gix-tix/src/app.rs:3589-3600 | gix-tix/src/app.rs:3602-3611 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c7b3996fa823c8d2f8c1cb5cdf22b350589a57f99d0c11dd62f03e5edec97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix-pack/src/cache/lru.rs:70-81 | gix-pack/src/cache/lru.rs:171-186 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/lru.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"201e1d64db345671d63f3a35763983567a2cadf41f89cc614241af55ce9f08fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix/src/config/tree/sections/core.rs:331-347 | gix/src/config/tree/sections/pack.rs:33-44 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/core.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9078657f60914ef8c4cd255ccc6b98209db2812f17989ec0217bb96e90eb71b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): gix-config/src/file/mutable/multi_value.rs:138-158 | gix-config/src/file/mutable/multi_value.rs:162-180 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/mutable/multi_value.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7080f93db87441680cb5c736b8f203f566ce5a4057ecb93a434fd87f4df5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): gix-object/src/tag/decode.rs:75-85 | gix-object/src/tag/decode.rs:93-104 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tag/decode.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"39323f9c5cd7ae64a69483e0c14942360598f1438b7883b6150264545ea82b1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): gix-diff/src/blob/pipeline.rs:137-151 | gix-merge/src/blob/platform/mod.rs:87-104 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5aab7e995c7ac79f19819619c10f4e8bd584e3966299bdbb2d587a0d640b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-tix/src/enrich.rs:222-231 | gix-tix/src/enrich.rs:264-274 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/enrich.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"01faa6058dbcd902167df70e94c497590acc9284c97f4d4e376b2104097f1ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix-attributes/src/search/refmap.rs:27-38 | gix-attributes/src/search/refmap.rs:40-51 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-attributes/src/search/refmap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d7b7bc25bda64f84ec9850ab89ceb72678d67fea798e3b5b55f8be185e441b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-tix/src/menu.rs:199-208 | gix-tix/src/menu.rs:214-227 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/menu.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e186e93caa5c4c7d8abaeae52d389fdcfda497234668cb2bb953faee50100f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): gix-error/src/error.rs:893-903 | gix-error/src/exn/impls.rs:508-520 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/error.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3193e99e76b0984e178e1511d2c5b29d62fe519af6d7a24174a0aaa1f6cfd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-index/src/access/mod.rs:581-587 | gix-index/src/access/mod.rs:591-598 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/access/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"48645c5681cf2fd5cf188a9f03ce5907e5b7f0d6447ef474cebbcdb180aea3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix-ref/src/store/file/log/iter.rs:51-59 | gix-ref/src/store/file/log/iter.rs:62-69 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/log/iter.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b302d7b7a00c31eca362d4cab0c6324977125ed9d2fd4da48b03940fccfbdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-pack/src/cache/lru.rs:37-46 | gix-pack/src/cache/object.rs:42-52 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/lru.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c1bfb2f2fe6ea17d9b3be5c46310eee1ffdf64001ebdebd498b9eda6a32f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix-transport/src/client/async_io/bufread_ext.rs:132-139 | gix-transport/src/client/blocking_io/bufread_ext.rs:122-129 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/async_io/bufread_ext.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"22853d2eef56bd00d08295e5f20cb5c82a26160b35c05cc37170370ea41484d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): gix-diff/src/tree_with_rewrites/change.rs:527-542 | gix-diff/src/tree_with_rewrites/change.rs:599-614 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree_with_rewrites/change.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c6b5ebfee54be871f7eb952f119e5423fa84b5e5a6d9282b4abe768cb52e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix-blame/src/file/function.rs:528-539 | gix-blame/src/file/function.rs:543-561 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a78398290290fd03505f2afd93442a903be3b3824c16ef926b02b5c0b73c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-packetline/src/async_io/encode.rs:216-223 | gix-packetline/src/blocking_io/encode.rs:43-49 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/encode.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e55f71b2d7800d45ac626abd51f9333027de2cc053dce9432be66b8bfe7f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): gix-tix/src/app.rs:3299-3307 | gix-tix/src/app.rs:3322-3329 | gix-tix/src/app.rs:3454-3463 | gix-tix/src/app.rs:3521-3532 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":3299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3742245133349a44bb65fe3dfb87eb8c364c666b97dae32479576360cf7f9950"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix-tix/src/edit/review.rs:100-108 | gix-tix/src/edit/review.rs:414-422 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/review.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"792faa65c5d7a6fac0378cce95674accdefdd211e04bffd143321db240d8f34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): gix-config/src/file/mutable/section.rs:311-321 | gix-config/src/file/section/body.rs:49-59 | gix-config/src/file/section/mod.rs:296-306 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/mutable/section.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd5bbca13a91a91eee11259436d9d0d75319e8c20f63a97041f6fdb1f1d73f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): gix-path/src/convert.rs:18-29 | gix-path/src/convert.rs:32-43 | gix-path/src/convert.rs:77-86 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-path/src/convert.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69773037a568c8c0ce3fcff5c767e4c9e8beed302aab33a413c6fc39a8597de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gix-transport/src/client/async_io/request.rs:53-65 | gix-transport/src/client/blocking_io/request.rs:43-55 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/async_io/request.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"91de7223956408f363c0f37e4576e5a8b35517112971191bd8e684b8bee98898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix-ref/src/store/file/find.rs:125-136 | gix-ref/src/store/packed/find.rs:67-75 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/find.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb265954330600e79271bb7d03e73ae02fe099f62e94cdfb63c7caa79e63e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gix-error/src/error.rs:151-160 | gix-error/src/exn/impls.rs:127-137 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/error.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c71b25c1322bd6501c79fea3f19f3073eb2ddae1696cebcfaefe6b2df77ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-odb/src/store_impls/dynamic/types.rs:218-224 | gix-odb/src/store_impls/dynamic/types.rs:226-233 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/types.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9279708f8cac993a7b9b5fc3a3ce344e39626124841f6a08a89afe7bc9de6af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gix-config/src/parse/from_bytes/mod.rs:433-441 | gix-protocol/src/remote_progress.rs:71-79 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/parse/from_bytes/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefac63fd3542885bfcdf778313583b0e3196e6822611f979cbcc8a870481658"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): gix-hash/src/oid.rs:207-214 | gix-hash/src/oid.rs:218-225 | gix-hash/src/oid.rs:229-236 | gix-hash/src/oid.rs:301-308 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-hash/src/oid.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ae53255fd2929619c75694c26e023e8d7a6c08936c0d782d153b75a64d00ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix/src/dirwalk/iter.rs:169-177 | gix/src/status/iter/mod.rs:340-347 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/dirwalk/iter.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae99db6e9b292edbe50e9a4a06028f42d4b0754628cf1461acfcc395bba250d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): gix-encoding/src/read.rs:25-39 | gix-encoding/src/write.rs:24-35 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/read.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"76579c37dc5f72a7a6e1722fefc358ef0fa22fd415f88053ed958752e62ce64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix-object/src/commit/ref_iter.rs:113-120 | gix-object/src/tag/ref_iter.rs:58-65 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/ref_iter.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c73176af30025ef1c5f26ed941af15339fad1d7348323505ffb16d7be7915e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): gix/src/config/tree/sections/remote.rs:71-84 | gix/src/config/tree/sections/core.rs:469-482 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/remote.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb89cb765045a1b3162e561e269edd3f170a55df81f5f9bec39b3636164abd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-attributes/src/search/attributes.rs:112-120 | gix-ignore/src/search.rs:197-203 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-attributes/src/search/attributes.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3bdad445d28e3005f8e3b625cedd47ba877aa77732ff38357fa68eeb2945d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): gix-pack/src/index/init.rs:28-32 | gix-pack/src/multi_index/init.rs:25-29 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/init.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"528a58a087740cf7b46e6645ad3a08ebcf9591c13f21be027dffb9eae3bae3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): gix-object/src/signature/sign.rs:87-92 | gix-object/src/signature/verify.rs:423-428 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/signature/sign.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"76be416de38cb5839421ab709078b6dc6263860234b7068423795481f96e5a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-actor/src/signature/mod.rs:97-103 | gix-mailmap/src/snapshot/mod.rs:167-173 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-actor/src/signature/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ef88e8905dda8b63ec0175ab3678c3002a6983cf4dc9369a77d2a2d01482a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-attributes/src/parse.rs:74-80 | gix-ignore/src/parse.rs:17-24 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-attributes/src/parse.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7711dccab67b6999288b5f7fc8af9d5cc962ea548cb655dccbfc908d13a49613"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): gix-bitmap/src/lib.rs:34-37 | gix-index/src/lib.rs:253-256 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-bitmap/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"41abe108cbf4db5e10b163a9a84d5c77fe26ac3fae2dd1566dc74a3a1ad558a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): gix-tix/src/change_id.rs:106-111 | gix-tix/src/patch_id/mod.rs:191-194 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/change_id.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a701999b4682dda73491ee3aaf08ed7bde0188ccf1d45e32366df35a58902cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): gix-diff/src/tree/visit.rs:61-66 | gix-diff/src/tree_with_rewrites/change.rs:569-576 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/visit.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac7e4e7a9a1b1aa001030267fcc42686bd758f0cedc360c285baa8da0ce7c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): gix-diff/src/tree/visit.rs:75-81 | gix-diff/src/tree_with_rewrites/change.rs:579-586 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/visit.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ff5832a2991f395dabaa50772b02e66b270fd9dfda69388fbe4bbc7f963471"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): gix-object/src/commit/mod.rs:118-123 | gix-tix/src/edit/auto_merge/mod.rs:73-80 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefda28313ba86cbb1ff8163400dc7a3ba3a3d8a7fe79f51b2889fbeeec1d519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix-diff/src/tree/recorder.rs:49-56 | gix-traverse/src/tree/recorder.rs:45-52 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/recorder.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb262c3578e1bf1b7785e5bb01219de748d342e6ac1b622750c78ca698c2177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix-pack/src/index/traverse/with_index.rs:47-56 | gix-pack/src/index/traverse/with_lookup.rs:51-58 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/traverse/with_index.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccab70700484621c4b5f72cf4b880c0998ab14b163f3d42afea7df64d5a955f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): gix-ref/src/store/file/find.rs:452-455 | gix-ref/src/store/file/raw_ext.rs:111-114 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/find.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9d2fe02ffabeeea504bcd4a95e0be862b8df3c99e675d3dd12330593166723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): gix-diff/src/tree/visit.rs:69-73 | gix-diff/src/tree_with_rewrites/change.rs:618-625 | gix-tix/src/patch_id/mod.rs:279-285 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/visit.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af83c1381e94288814440cbcbbff6a88545bda6466456119ab4c67fcdac6ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gix-object/src/tree/ref_iter.rs:112-121 | gix/src/object/tree/mod.rs:174-181 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/tree/ref_iter.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4844ac544ab06f71bd768af083ee4c00596770912a251c57f032946922315b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): gix-diff/src/tree/recorder.rs:102-106 | gix-traverse/src/tree/recorder.rs:104-111 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/recorder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"13791a7f257e65b735d3deb930ecf05f12e17e9b8479dffbcd84d592e7f11e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): gix-fs/src/precompose.rs:89-93 | gix/src/revision/walk.rs:395-399 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-fs/src/precompose.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc5c663320c697b327fa49c6865255606e100f5c3a589f7c63e460bd622b862"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): gix/src/config/tree/sections/checkout.rs:49-52 | gix/src/config/tree/sections/core.rs:534-538 | gix/src/config/tree/sections/pack.rs:66-70 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/checkout.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"238277869bc473e935a6fc6163c08628cd44020bdac279b98e6cab1c175a3c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): gix-tix/src/edit/rebase.rs:482-487 | gix-tix/src/edit/reword.rs:58-63 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9557b476aff86b58cec590f730d1e3d41c750158afa88a71647ec34dcf1995"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): gix-error/src/concrete/metadata.rs:482-486 | gix-object/src/signature/sign.rs:200-206 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/concrete/metadata.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"868dda6b35caefe88438f492d4425ec272bb18617edec3bd17e28a960ca10926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201349 lines \u00D7 2): gix-packetline/src/async_io/read.rs:79-126 | gix-packetline/src/blocking_io/read.rs:77-125 \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 95 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-packetline/src/async_io/read.rs:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabfba47a304eb9f3cce2a4598fd12c547ef616a104181e47003263ca947fd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): gix-tix/src/lib.rs:2653-2688 | gix-tix/src/lib.rs:2771-2806 \u2014 both copies are in the same file, so extract the block into one function there 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":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99398519531a27500e0da024ee190b6667d0544c4cc37323800d0af948753f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): gix-odb/src/store_impls/dynamic/find.rs:85-113 | gix-odb/src/store_impls/dynamic/find.rs:351-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-odb/src/store_impls/dynamic/find.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/find.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7f3af84ed7b9eadc98eed7309e5cdd961ef620abed81d1701eed1ff93651a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:890-920 | gix-merge/src/tree/function/resolve.rs:1747-1777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/tree/function/resolve.rs:890\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b33f8397dd471fbe77cf666db32f8cda301442b7555f6f92926fad9e2b91fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:1090-1116 | gix-merge/src/tree/function/resolve.rs:2310-2336 \u2014 both copies are in the same file, so extract the block into one function there 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":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda8d718c01ede3fdc5960e6b98cec4e91d7a1e6b7b80c4f8845096f4f51062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): gix-tix/src/history.rs:831-857 | gix-tix/src/history.rs:881-907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/history.rs:831\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ffcc3b41672246fbe14e403e6e42bd467dcbe0d631df2295dc524bbceff61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): gitoxide-core/src/repository/fetch.rs:295-320 | gitoxide-core/src/repository/remote.rs:224-249 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gitoxide-core/src/repository/fetch.rs:294\u0060 calls \u0060consume_skipped_tags\u0060, \u0060or_error\u0060 and \u0060gitoxide-core/src/repository/remote.rs:223\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7c36157a8f12c9348674e833f6a2a104552fc77f5d8e6232abb15242c5fc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): gix-parallel/src/in_parallel.rs:82-106 | gix-parallel/src/in_parallel.rs:159-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-parallel/src/in_parallel.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-parallel/src/in_parallel.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f554647d48000bdb14abb5220744f01aa0f60ceac0962910934d4f5273576252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): gix-transport/src/client/capabilities.rs:220-244 | gix-transport/src/client/capabilities.rs:307-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-transport/src/client/capabilities.rs:220\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/capabilities.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba335f0bdf64a728e185a247f6703ee7948ac50cf9d87a8b362eb736739324f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): gix-tix/src/lib.rs:1536-1558 | gix-tix/src/lib.rs:2653-2675 | gix-tix/src/lib.rs:2771-2793 \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/lib.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f20ebe17e5534f3a7905ff0d6ab795b21b0dec99c4594ef9a05e4dde54f556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:1631-1652 | gix-merge/src/tree/function/resolve.rs:2135-2156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/tree/function/resolve.rs:1631\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db8701968da80f2268d55ff3e490802a7ec788ceb76033189f9ab61ec70c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): gix-tix/src/history.rs:916-937 | gix-tix/src/history.rs:1372-1393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gix-tix/src/history.rs:1394\u0060 calls \u0060is_empty\u0060, \u0060extend\u0060, \u0060iter\u0060 and \u0060gix-tix/src/history.rs:938\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb1e33be883abf812b056a677c6d9d52999a8f1701c16e0d7361b285fe49f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): gix-worktree/src/stack/state/ignore.rs:180-200 | gix-worktree/src/stack/state/ignore.rs:213-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-worktree/src/stack/state/ignore.rs:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/stack/state/ignore.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b85555201742bab65f8b73d2102c39fda5a0b40bb7fad72f718818cdd857ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): gix-merge/src/tree/function/resolve.rs:871-890 | gix-merge/src/tree/function/resolve.rs:941-960 | gix-merge/src/tree/function/resolve.rs:1378-1397 | gix-merge/src/tree/function/resolve.rs:1728-1747 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/tree/function/resolve.rs:871\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gix-merge/src/tree/function/resolve.rs:891\u0060 calls \u0060remove_if_leaf\u0060, \u0060toc\u0060 and \u0060gix-merge/src/tree/function/resolve.rs:961\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":871}}}],"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-blame/src/file/mod.rs:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:136-155 | gix-packetline/src/blocking_io/read.rs:135-153 \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 95 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-packetline/src/async_io/read.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edfaf28e4fbc52583a0292039b6da9dcb94942f0a4bf312e01bedb18756a048"}},{"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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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-pack/src/index/traverse/with_index.rs:85-103 | gix-pack/src/index/traverse/with_lookup.rs:88-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/src/index/traverse/with_index.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/traverse/with_index.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caab5d661b40a752a9b8caf42b0755b2b38523382177361de8f55f4871b7e22"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-utils/src/btoi.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:999-1016 | gix-merge/src/tree/function/resolve.rs:2173-2189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/tree/function/resolve.rs:999\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"209da441ed3e1c2f433e74dfc1224c47a2f1e2c50b9504411b271b13e826a54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): gix-tix/src/lib.rs:6728-6745 | gix-tix/src/lib.rs:6773-6790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:6728\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6728}}}],"partialFingerprints":{"codehealthFindingId/v1":"6645dbb558a93131bb7b98695c90e3b7657c050e60504a24d6600d899b1e75ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): gix-transport/src/client/capabilities.rs:201-218 | gix-transport/src/client/capabilities.rs:288-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-transport/src/client/capabilities.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/capabilities.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"92041d0559274201c19b7583ecf86458c67dae25aa6fed5d7cfc819017b6e572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gix-diff/src/index/function.rs:240-255 | gix-diff/src/index/function.rs:267-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-diff/src/index/function.rs:240\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"587fb0dd097b06bf326ea774151f63b973d95fb572602d68b5b2352a50591270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gix-tix/src/app/tree_selection/mod.rs:270-285 | gix-tix/src/lib.rs:9764-9779 \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/app/tree_selection/mod.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdf638c729e62d22677892743fcd690a9a517f0d7c3defa726f64b2cd840ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): gitoxide-core/src/commitgraph/verify.rs:64-80 | gitoxide-core/src/repository/commitgraph/verify.rs:52-68 \u2014 before extracting anything, compare \u0060gitoxide-core/src/commitgraph/verify.rs\u0060 and \u0060gitoxide-core/src/repository/commitgraph/verify.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060stats\u0060 to \u0060\u0026Outcome\u0060 in one and \u0060\u0026gix::commitgraph::verify::Outcome\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/commitgraph/verify.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"655eadd4d49b2a97c7828858e6fbcac7608b7ebbb402cb20f8858d53a921b52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-imara-diff/src/myers.rs:159-173 | gix-imara-diff/src/myers.rs:182-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-imara-diff/src/myers.rs:159\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/myers.rs"},"region":{"startLine":159}}}],"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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060src\u0060 to \u0060impl IntoIterator\u003CItem = u8\u003E\u0060 in one and \u0060impl IntoIterator\u003CItem = char\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:208-222 | gix-merge/src/blob/pipeline.rs:291-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/blob/pipeline.rs:208\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/blob/pipeline.rs"},"region":{"startLine":208}}}],"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 before extracting anything, compare \u0060gix-protocol/src/handshake/refs/async_io.rs\u0060 and \u0060gix-protocol/src/handshake/refs/blocking_io.rs\u0060 as WHOLE FILES: 87% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-protocol/src/handshake/refs/async_io.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"280e98ca8e6bc4e9dd7354f7cbb1a778aed85b1ec8a1a95dd24b8080b9802d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-tix/src/edit/time_travel.rs:434-448 | gix-tix/src/edit/time_travel.rs:665-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/time_travel.rs:434\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cbf6bd2c5953ad75538d9442ec48c369f07c2aef9fa7ebbe5a56e1a48f0932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gix-tix/src/lib.rs:4803-4817 | gix-tix/src/lib.rs:4915-4929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:4803\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":4803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceec7b3cdbad6f31ba5e2a7df0508426cfaf9336095366a46056dfa07c072ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gitoxide-core/src/commitgraph/verify.rs:46-61 | gitoxide-core/src/repository/commitgraph/verify.rs:34-49 \u2014 before extracting anything, compare \u0060gitoxide-core/src/commitgraph/verify.rs\u0060 and \u0060gitoxide-core/src/repository/commitgraph/verify.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/commitgraph/verify.rs:46\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/commitgraph/verify.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2468c8f0432d4582d4bac4d541f80eee599c935a4eb2e2c36d9c91f4479745a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gitoxide-core/src/repository/attributes/validate_baseline.rs:84-97 | gitoxide-core/src/repository/attributes/validate_baseline.rs:137-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/repository/attributes/validate_baseline.rs:84\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9698432e1dad761112f9dc18affb96b5da3d76ba32bef2f22f5e5dec6c7f1d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gix-object/src/commit/ref_iter.rs:246-259 | gix-object/src/tag/ref_iter.rs:123-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/commit/ref_iter.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1594355689acf20e66ceda993ecbcd095be39a011c559adecb68c8d6789669d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): gix-packetline/src/async_io/read.rs:168-181 | gix-packetline/src/blocking_io/read.rs:166-178 \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 95 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-packetline/src/async_io/read.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/read.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6568c15fac63b66f5d5e02eb452848eb78fef6b27653f4a15d1af02327f985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gix-refspec/src/match_group/mod.rs:96-109 | gix-refspec/src/match_group/mod.rs:170-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-refspec/src/match_group/mod.rs:96\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-refspec/src/match_group/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a43eeefd49dde040087a350fdb0cc87bb7de19b01869d6ed5d311d370eb2cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gix-tix/src/lib.rs:6683-6696 | gix-tix/src/lib.rs:6752-6765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:6683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":6683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac8cf328ac1906c9149a4e0471882c91b89c086d5d1de882930c56ea5ed699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): gix-tix/src/lib.rs:3894-3906 | gix-tix/src/lib.rs:4807-4819 | gix-tix/src/lib.rs:4919-4931 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:3894\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":3894}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bb7ed39f155b843a2f95ffec15f47f70dd69dbd28a6e09ffd1fe0c324b73e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gitoxide-core/src/index/checkout.rs:140-152 | gitoxide-core/src/repository/clone.rs:128-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":"gitoxide-core/src/index/checkout.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"71acbe085ee3eea4f41772aad28b1c74e1271a05338bd5cedd08ed7b802d078e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gitoxide-core/src/repository/index/entries.rs:404-416 | 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":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa19b810f4df19dd5909f9398a8e223f3d79bcc408a33547471b8865d3daa6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): gix-blame/src/file/function.rs:989-1001 | gix-blame/src/file/function.rs:1020-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"c543e19926c5ee95aeeb73fae7ae11d7e3cf56e68c325961ce75bf6a7a8ac4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-merge/src/tree/function/resolve.rs:1040-1052 | gix-merge/src/tree/function/resolve.rs:1523-1535 \u2014 both copies are in the same file, so extract the block into one function there 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":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d70c1a9a796334ad5c0cb7253ba368997508e77fa08f9a71805a48e8fd18403"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): gix-pack/src/data/output/entry/iter_from_counts.rs:217-229 | gix-pack/src/data/output/entry/iter_from_counts.rs:234-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/src/data/output/entry/iter_from_counts.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/output/entry/iter_from_counts.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd229b62356a79c097b6b8d682ec4362c324102a90f6e7795b343c8e64ccb94b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-packetline/src/async_io/sidebands.rs:286-298 | 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-packetline/src/async_io/sidebands.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-packetline/src/async_io/sidebands.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"364ff686e01b749dea8ad33cbddf2d314af1db9fe74fdd91c8c226f8d1d2dd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-parallel/src/in_parallel.rs:61-73 | gix-parallel/src/in_parallel.rs:132-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-parallel/src/in_parallel.rs:61\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gix-parallel/src/in_parallel.rs:145\u0060 calls \u0060clone\u0060 and \u0060gix-parallel/src/in_parallel.rs:74\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-parallel/src/in_parallel.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"86873248d7179364024a925fd85d367bc562de057b3687f681f50fc5031b3ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-traverse/src/commit/simple.rs:630-642 | gix-traverse/src/commit/simple.rs:713-725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-traverse/src/commit/simple.rs:630\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-traverse/src/commit/simple.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd42438442d7ce1cf9dab2301d827f8bb53b819621c00c7dc61eeab4223f80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gitoxide-core/src/corpus/db.rs:63-74 | gitoxide-core/src/query/db.rs:17-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/corpus/db.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/db.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b495c7cb5218598ed3e628f18f90e8862471963ba91619437c36a0fa9df56336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-imara-diff/src/slider_heuristic.rs:210-221 | gix-imara-diff/src/slider_heuristic.rs:230-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-imara-diff/src/slider_heuristic.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/slider_heuristic.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ec114eee29ca120c8947805d6bd765c6ce520cafdf0f3e71771fc6772c934"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pathspec/src/search/matching.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pathspec/src/search/matching.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1565c93f8a24af7f360e2beb3e60764c52434200811b4e777ae0cb64689305f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-tix/src/edit/rebase.rs:583-594 | gix-tix/src/edit/rebase.rs:3808-3819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/rebase.rs:583\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b96b36235511da990a5060eaf55e31eba1815364f99a2425677b10fa6b5a748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:147-158 | gix-transport/src/client/git/blocking_io.rs:142-153 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef95ab469b853d56aef87a682b741f87bfe7230e2bd0c3d35ac38e27a278ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-worktree/src/stack/state/attributes.rs:110-121 | gix-worktree/src/stack/state/attributes.rs:150-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-worktree/src/stack/state/attributes.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/stack/state/attributes.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aef1a250ca2ad8c05fa516c3df71a34d08b41367b5acce29ef728954e6c6f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): gix-diff/src/blob/pipeline.rs:496-505 | gix-merge/src/blob/pipeline.rs:261-271 \u2014 before extracting anything, compare \u0060gix-diff/src/blob/pipeline.rs\u0060 and \u0060gix-merge/src/blob/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-diff/src/blob/pipeline.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"30336db0b0db71991d2d8417e8652ca605fee6b5bdf03b1989687141220d213f"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-diff/src/tree/function.rs:225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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-hash/src/object_id.rs:70-80 | gix-hash/src/object_id.rs:85-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-hash/src/object_id.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-hash/src/object_id.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c0284819e126ad19ac5407a8fdc9c56043a91c52b1ada8605cfbe7c13c1b28"}},{"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:449-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/access/mod.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a92e5808cd9b1ce1e875b07dd03986914ee529fb597aa8d8158035fbb139d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-pack/src/bundle/write/mod.rs:100-110 | gix-pack/src/bundle/write/mod.rs:213-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/bundle/write/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f018b6c37231b90233303e625a3bbde2e4948bbee5c7f8753e7b7eb1d3a05fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-tix/src/command/enrich.rs:261-271 | gix-tix/src/lib.rs:7782-7792 \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":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daddabf2d2df075f32fbe95edd481a8faa73b5cc3461c8463294858a1d0bb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-tix/src/lib.rs:1650-1660 | gix-tix/src/lib.rs:1754-1764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:1650\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"a411d72c5cd0820c1f985cbecb1a263d246c55621cf6bd43462ed32236dc6f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:85-95 | gix-transport/src/client/git/blocking_io.rs:82-90 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-transport/src/client/git/async_io.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8e190e242d680eb6019b342d393853495af7829e4353697e600f4562fd70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix/src/config/cache/access.rs:50-60 | gix/src/config/cache/access.rs:104-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix/src/config/cache/access.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gix/src/config/cache/access.rs:117\u0060 calls \u0060into\u0060 and \u0060gix/src/config/cache/access.rs:63\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/access.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a1dfee37f3fc411511ffc228c8d86f2af49ba361649634c5b3457622c99285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/plumbing/main.rs:1258-1268 | src/plumbing/main.rs:1310-1320 \u2014 both copies are in the same file, so extract the block into one function there 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":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"158e89dc0c28dedb8b5deefc513ef7fa25e58bfd627cb0bba4f6ce51392b8ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): gix-merge/src/tree/function/resolve.rs:891-901 | gix-merge/src/tree/function/resolve.rs:960-970 | gix-merge/src/tree/function/resolve.rs:1748-1758 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/tree/function/resolve.rs:891\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gix-merge/src/tree/function/resolve.rs:890\u0060 calls \u0060remove_if_leaf\u0060, \u0060toc\u0060 and \u0060gix-merge/src/tree/function/resolve.rs:959\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e8d5ae3e6538dd3b1691981790c14e0aee2f4d32f3537bf9136a3d80dd74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): gitoxide-core/src/repository/merge/commit.rs:46-55 | gitoxide-core/src/repository/merge/tree.rs:75-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/repository/merge/commit.rs:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/commit.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a22535b4e09e597a92923afc8d0167d1ab905c35377699d3bf8c0fc1682a1c3"}},{"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:1803-1812 | gix-merge/src/tree/function/resolve.rs:2214-2223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-merge/src/tree/function/resolve.rs:1803\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-merge/src/tree/function/resolve.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5951ed1a725653338e58f38a8a56b3a0be75f5bc16eaa4d39526c017499d01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-packetline/src/async_io/read.rs:46-57 | gix-packetline/src/blocking_io/read.rs:44-55 \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 95 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":46}}}],"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 before extracting anything, compare \u0060gix-protocol/src/handshake/refs/async_io.rs\u0060 and \u0060gix-protocol/src/handshake/refs/blocking_io.rs\u0060 as WHOLE FILES: 87% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-protocol/src/handshake/refs/async_io.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a197bb6b866de717549492964541ef9cc72e75ae3c1adc5c70c143ed6f1ad61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): gix-tix/src/app.rs:2436-2447 | gix-tix/src/app.rs:2467-2478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/app.rs:2436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/app.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d752961f9b2d1de1817e2aa6941b6206aea7aaef731a1f0310cacabd8214c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-tix/src/edit/rebase.rs:3825-3834 | gix-tix/src/edit/rebase.rs:3840-3849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/rebase.rs:3825\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3825}}}],"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-validate/src/tag.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-validate/src/tag.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"25686a8e4490fdd8a3b82af3a0e569480241152f23917c53d4caf180fb88a577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix/src/worktree/remove.rs:382-391 | gix/src/worktree/remove.rs:397-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix/src/worktree/remove.rs:382\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/worktree/remove.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c523a22f8214a5f33a51dea85fafe6d2bf48516ca96d07a8c68f981d25032f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): gix-worktree/src/stack/state/attributes.rs:107-115 | gix-worktree/src/stack/state/attributes.rs:147-155 | gix-worktree/src/stack/state/ignore.rs:182-190 | gix-worktree/src/stack/state/ignore.rs:215-223 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-worktree/src/stack/state/attributes.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/stack/state/attributes.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51328edc8aa8e3d2751c4420d082f8d5722857e548acb0f2b0186819d99420f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gitoxide-core/src/repository/fetch.rs:235-243 | gitoxide-core/src/repository/remote.rs:176-184 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/repository/fetch.rs:235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gitoxide-core/src/repository/fetch.rs:244\u0060 calls \u0060Some\u0060 and \u0060gitoxide-core/src/repository/remote.rs:185\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebd910c3133732913f7daf19635da38daf7b146ea9fc65d65b750907a97b96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-config/src/file/mutable/section.rs:313-321 | gix-config/src/file/section/mod.rs:298-306 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-config/src/file/mutable/section.rs:313\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/mutable/section.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0162a093702424beace286ef0b8270e48527bf09229d959135e9f93896ee13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-odb/src/store_impls/dynamic/handle.rs:268-276 | gix-odb/src/store_impls/dynamic/handle.rs:286-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-odb/src/store_impls/dynamic/handle.rs:268\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026OwnShared\u003CSelf\u003E\u0060 in one and \u0060\u0026Arc\u003CSelf\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/dynamic/handle.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feab39143dbbc57bd615c6d6510beeb45f2249984e84b30e9c7aa65d66e3c77"}},{"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 (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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/src/index/access.rs:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-protocol/src/handshake/refs/async_io.rs:11\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-protocol/src/handshake/refs/async_io.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87d7042ac487c4b473723dbeb12026f38c8c72a0168d3ee70b050640e620e42"}},{"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:145-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-refspec/src/match_group/mod.rs:68\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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/app.rs:2308-2316 | gix-tix/src/app.rs:2334-2342 \u2014 both copies are in the same file, so extract the block into one function there 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":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb02d083b1613ef8ae54090e85ff4ae9a8126580a6a842bae4e0a31df0ab9684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/edit/review.rs:324-332 | gix-tix/src/edit/time_travel.rs:183-191 \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/review.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1057319c706e860c7663b13b25e64c6e803d40db2e9a498e465e77440b8aec5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/history.rs:1876-1884 | gix-tix/src/history.rs:2153-2161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/history.rs:1876\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4debde3c6bbbaa9b2d12ff25f365099f5a6fb09e53e8fe1e2ee7bc83af5a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): gix-tix/src/lib.rs:8629-8639 | gix-tix/src/lib.rs:9161-9171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:8629\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":8629}}}],"partialFingerprints":{"codehealthFindingId/v1":"853799e7d1f1b8c350a09d5036608d325d2e7342500de00bd93480a6a619623a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/lib.rs:9109-9117 | gix-tix/src/lib.rs:9150-9158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:9109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":9109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a962005ae77a00381d2ce8523843fbbd4791cf158b0ef7fd3b2c8a72a7e7dfdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:55-63 | gix-transport/src/client/git/blocking_io.rs:53-61 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec0e933f9abfae70b9204ca502399515bcc7d5ce9136d64f5ac6c96e54293b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/plumbing/main.rs:128-136 | src/porcelain/main.rs:20-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f4cfdc4ad4bf771fd697ec9b2ebf7ca529864715f4501d728f525cd0ae56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/plumbing/options/mod.rs:814-822 | src/plumbing/options/mod.rs:894-902 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/plumbing/options/mod.rs:814\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/options/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c62377da14bb68246ad0c5e20cdea9f089ace56a0994f40076bcfbb1a59fc59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gitoxide-core/src/repository/attributes/validate_baseline.rs:99-106 | gitoxide-core/src/repository/attributes/validate_baseline.rs:152-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/repository/attributes/validate_baseline.rs:99\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbd223e0f30d89cbd4d24f113a867e492dd11259c43f00b76160a6972e9c0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-blame/src/file/function.rs:579-586 | gix-blame/src/file/function.rs:589-596 \u2014 both copies are in the same file, so extract the block into one function there 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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"248dd03d852ffcbaee8f75c9934f53c7490dc69a3b6b4f9be3bed1dd7e1f1d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-encoding/src/legacy.rs:609-616 | gix-encoding/src/legacy.rs:784-791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-encoding/src/legacy.rs:609\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65ed37044d9a137a0ad98d10ff596806d09f7d2d3554649d7150382034f793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-packetline/src/async_io/encode.rs:88-95 | gix-packetline/src/async_io/encode.rs:115-122 \u2014 both copies are in the same file, so extract the block into one function there 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":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd97978115f013a0d35385183242990cd58363088860e9d07cd029ba1a56cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): gix-blame/src/file/function.rs:580-587 | gix-blame/src/file/function.rs:590-597 | gix-blame/src/file/function.rs:895-901 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-blame/src/file/function.rs:580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-blame/src/file/function.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bed385d3a251d0d63382491f31f3126fdd4e9bb335508d0c1cb806bd60d2b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gitoxide-core/src/repository/diff.rs:206-212 | gix-tix/src/lib.rs:7561-7567 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gix-tix/src/lib.rs:7560\u0060 calls \u0060Some\u0060, \u0060count_additions\u0060, \u0060count_removals\u0060 and \u0060gitoxide-core/src/repository/diff.rs:205\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/diff.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c03eec33c548831c5fc65d67f8499ef4b5ff1e2e6bed9c25822da16de83635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gitoxide-core/src/repository/merge/commit.rs:61-67 | gitoxide-core/src/repository/merge/tree.rs:96-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/commit.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8f2c31ff94a83e6175dfbdd57562e51530e0e9733d9170f410121e46ebfeb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-object/src/parse.rs:20-26 | gix-object/src/parse.rs:86-92 \u2014 both copies are in the same file, so extract the block into one function there 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":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca09d05a77db55ba5eac7995da0130f6d704d4746d3d6d3465a4e12a8937b671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-object/src/traits/find.rs:219-225 | gix-object/src/traits/find.rs:237-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-object/src/traits/find.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/traits/find.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"471490b66a333852f9b66455128aac364274072cfe9850853e2cbd64e8b04082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-ref/src/store/file/overlay_iter.rs:398-404 | gix-ref/src/store/file/overlay_iter.rs:408-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-ref/src/store/file/overlay_iter.rs:408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/file/overlay_iter.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fc61c52654276491fc5e6f1e25feb4cb276e2ed95e74dd71a41a013087aba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/edit/rebase.rs:3943-3952 | gix-tix/src/edit/time_travel.rs:1348-1354 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/rebase.rs:3943\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a2f6fff9af01cfd7600dec051a2a69c3d71166c24bac4d2c6140263c92e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/edit/time_travel.rs:624-630 | gix-tix/src/edit/time_travel.rs:929-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/time_travel.rs:624\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gix-tix/src/edit/time_travel.rs:928\u0060 calls \u0060filter\u0060, \u0060contains\u0060 and \u0060gix-tix/src/edit/time_travel.rs:623\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91cec7662078367eb58e6c1acfcc1e9adffce0ba498862384935da2e51d9cd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/history.rs:417-423 | gix-tix/src/ref_tree.rs:1130-1136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/history.rs:417\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f59163f9a0b0a4d9b16434ecaf3cccdd9fbab3752aca917a868c3ee56e33780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/lib.rs:1457-1463 | gix-tix/src/lib.rs:2101-2107 \u2014 both copies are in the same file, so extract the block into one function there 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":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc9aaf6544ee8fb903025beec7d776b79126ad15b941051de5f2b0a348088f3"}},{"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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 3): gix-encoding/src/legacy.rs:608-613 | gix-encoding/src/legacy.rs:744-749 | gix-encoding/src/legacy.rs:783-788 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-encoding/src/legacy.rs:608\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060output\u0060 to \u0060\u0026mut [u8]\u0060 in one and \u0060\u0026mut [u8]) -\u003E (usize\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/legacy.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b714d67d9bcf1f15ae42d622ee423086193b8420a9b98d22ad6995e6b24a7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): gix-tix/src/history.rs:226-231 | gix-tix/src/history.rs:791-796 | gix-tix/src/history.rs:1238-1243 \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":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c86b72eac523a6a16c3543abafc312970d489f010b4e15f5135ec8a3763416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-packetline/src/async_io/encode.rs:74-80 | gix-packetline/src/async_io/encode.rs:99-105 \u2014 both copies are in the same file, so extract the block into one function there 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":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c06ed6e3f67b8f0177cd0cfe2bc365b961c7093de9e3f71918419f889a52ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-revwalk/src/graph/mod.rs:210-216 | gix-revwalk/src/graph/mod.rs:261-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-revwalk/src/graph/mod.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-revwalk/src/graph/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4399f147cd194e1737c9b5a7ce7ef386bd9706adddd5fd3501e5cc4032ec2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/edit/auto_merge/mod.rs:1319-1324 | gix-tix/src/edit/rebase.rs:1915-1920 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/auto_merge/mod.rs:1319\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f868cea61aa3a1e10b45396634e5eb1546c684265a8352e080d93b6e56c092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/lib.rs:4282-4287 | gix-tix/src/lib.rs:5034-5039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":4282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6d6e7545a2cdf50e1c6ce19500ac224c376f16e5d171005f22a2c1c9ce1cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/lib.rs:4349-4354 | gix-tix/src/lib.rs:4403-4408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"044d5a248e089275ffb3ef14713b8349dba62a5c2560945de1289e0186ba8690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/lib.rs:9706-9711 | gix-tix/src/lib.rs:9725-9730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:9706\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":9706}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9f9eb2de3bbc8b5ed428304c2c5a3e8721321fa29d9d8258b37ff3fb18d44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-date/src/parse/git.rs:354-358 | gix-date/src/parse/git.rs:392-396 \u2014 both copies are in the same file, so extract the block into one function there 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":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca653b0eeb214b3c59bc048aca71ff0be1297d82b94ee10c61cf7ff3d2653a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-diff/src/index/function.rs:148-152 | gix-diff/src/index/function.rs:154-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/index/function.rs"},"region":{"startLine":148}}}],"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:121-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-odb/src/store_impls/loose/find.rs:97\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 (6 lines \u00D7 2): gix-tix/src/app.rs:2217-2222 | gix-tix/src/app.rs:2228-2233 \u2014 both copies are in the same file, so extract the block into one function there 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":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"082360a16cd5237019d6c587ec16550afbb92c8bdbacf19f5257953c75326800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/app.rs:3301-3305 | gix-tix/src/app.rs:3513-3517 \u2014 both copies are in the same file, so extract the block into one function there 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":3301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc151d00a29998175f87c0b03ad93d95648348ce974c3a17fae389987e8ad44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/app.rs:4013-4018 | gix-tix/src/app.rs:4030-4035 \u2014 both copies are in the same file, so extract the block into one function there 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":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e90b090342879dc6de3ef3499e797f276d67973b8fac8150cc95def61319e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/edit/time_travel.rs:405-410 | gix-tix/src/edit/time_travel.rs:650-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef6a1d9c32e8e5ea4b3315810423975e90a2d653a9465476594c42728bd243c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/edit/time_travel.rs:1431-1435 | gix-tix/src/edit/time_travel.rs:1459-1463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/time_travel.rs:1431\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/time_travel.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"19980db822e1687ef32858dc294cb81dbddf6a0aec486f09fd2f51ea1d5b8a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/history.rs:1505-1510 | gix-tix/src/history.rs:2222-2227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/history.rs:1505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/history.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df27ea6db076e4a1423e303c1e347246035af49d391926f9d5f22c2eb0ecf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/lib.rs:5097-5102 | gix-tix/src/lib.rs:7238-7243 \u2014 both copies are in the same file, so extract the block into one function there 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":5097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec83e538da6c7fa42e779db29751b42192b08892e202c4b90d4656c384299d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): gix-tix/src/lib.rs:5104-5108 | gix-tix/src/lib.rs:6968-6972 | gix-tix/src/lib.rs:7248-7252 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:5104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gix-tix/src/lib.rs:6966\u0060 calls \u0060area\u0060, \u0060as_ref\u0060, \u0060map_or\u0060 and \u0060gix-tix/src/lib.rs:5104\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac99cf033dea3a0ab14b17c8acf7aae081e1c773206a92c46b430d4183a2f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-transport/src/client/async_io/bufread_ext.rs:117-122 | gix-transport/src/client/blocking_io/bufread_ext.rs:107-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-transport/src/client/async_io/bufread_ext.rs:117\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/async_io/bufread_ext.rs"},"region":{"startLine":117}}}],"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 \u0060gix/src/open/permissions.rs\u0060 and \u0060gix/src/repository/permissions.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 1 separate duplicated blocks between them, totalling at least 193 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix/src/open/permissions.rs:37\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:55-61 | gix-diff/src/tree/recorder.rs:82-88 | gix-index/src/init.rs:197-203 | gix-traverse/src/tree/recorder.rs:56-62 | gix-worktree-stream/src/from_tree/traverse.rs:38-44 \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":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f832e11df22080969261b21f384b4360b5657231ab12b90f4e0a5fe67c4780d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): gitoxide-core/src/repository/tree.rs:63-71 | gix-diff/src/tree/recorder.rs:90-98 | gix-traverse/src/tree/recorder.rs:64-72 | gix-worktree-stream/src/from_tree/traverse.rs:46-54 \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":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbce0b3b08fc2b5d68b33abebeb858ac6d682e379d45caa213b8902969a1846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-config/src/file/section/mod.rs:202-206 | 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":202}}}],"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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060Options\u0060 in one and \u0060\u0026Options\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:544-550 | gix-merge/src/blob/pipeline.rs:317-323 \u2014 before extracting anything, compare \u0060gix-diff/src/blob/pipeline.rs\u0060 and \u0060gix-merge/src/blob/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":544}}}],"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:203-208 | gix-error/src/exn/impls.rs:306-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/error.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a824d4b30531a5dbfdbeeed2f8e824ad421dd99e65b8f4c86adefbd58be43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-error/src/error.rs:216-222 | gix-error/src/exn/impls.rs:319-325 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/error.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89586d9739085170a8b265c887ac996bd80a4c29ab2438ed8228c33c7704f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-hash/src/io.rs:107-111 | gix-pack/src/data/input/bytes_to_entries.rs:307-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-hash/src/io.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacfe81a7f85ca426c049ece9db4ff91dd061f471f6f5155ac9c2eae0ad9fc05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-object/src/commit/ref_iter.rs:155-161 | gix-object/src/tag/ref_iter.rs:74-80 \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":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"638cf21c1430930f54ff7f11bc09419449fc45f7ab5eba4176ebb8bcf139faf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-pack/src/cache/delta/traverse/resolve.rs:646-652 | gix-pack/src/data/file/decode/entry.rs:513-519 \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":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c267ede405bb34edc2ba4b551a794a523a9edf882d6f4abab36fa39cc9a8c637"}},{"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:150-155 | gix-transport/src/client/blocking_io/http/reqwest/remote.rs:390-395 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026dyn std::any::Any\u0060 in one and \u0060\u0026dyn Any\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/curl/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b6807a75087b61fdccf6a0a4406af02d1ca2af27fb4a8f3622f820d4977c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-transport/src/client/git/async_io.rs:117-125 | gix-transport/src/client/git/blocking_io.rs:112-120 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-transport/src/client/git/async_io.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/git/async_io.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8273105b6f5eb0793e5c08a1f87fe1790e00e1a26da77ea085e2b2571692bd93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-pack/src/index/verify.rs:116-125 | gix-pack/src/multi_index/verify.rs:51-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/src/index/verify.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/index/verify.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaa761a51aef22062e9a35cf1a2cbc176f4df2ae6983150afd9e3621a2f90f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix/src/config/tree/sections/diff.rs:230-234 | gix/src/config/tree/sections/merge.rs:159-163 \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/diff.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12da1ef300d8e57444e1d9d2277e896f65ceeae0101164382397669815a4ed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): gix-diff/src/blob/pipeline.rs:360-371 | gix-merge/src/blob/pipeline.rs:210-222 | gix-merge/src/blob/pipeline.rs:293-303 \u2014 before extracting anything, compare \u0060gix-diff/src/blob/pipeline.rs\u0060 and \u0060gix-merge/src/blob/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-diff/src/blob/pipeline.rs:360\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"057b8a0369a60600d572379455b49cd0d433fc3aaf0eb4e0c07a72e360238d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gix-tix/src/lib.rs:4756-4768 | gix-tix/src/lib.rs:4810-4822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gix-tix/src/lib.rs:4769\u0060 calls \u0060Ok\u0060, \u0060leave_attention\u0060 and \u0060gix-tix/src/lib.rs:4823\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":4756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d668c0fa1732c6a213da73bd6875488cd2d87586ca04d2f3a7bc92933f3dc666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gix-diff/src/blob/pipeline.rs:350-359 | gix-merge/src/blob/pipeline.rs:198-209 \u2014 before extracting anything, compare \u0060gix-diff/src/blob/pipeline.rs\u0060 and \u0060gix-merge/src/blob/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-diff/src/blob/pipeline.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/pipeline.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"67794c6e35f325bf3de7a84d9a88e33be5fc58d52a3dc97ec516089a47225cb1"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-filter/src/driver/process/client.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gix-filter/src/driver/process/client.rs:89\u0060 calls \u0060reset_with\u0060 and \u0060gix-filter/src/driver/process/server.rs:90\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:7882-7891 | gix-tix/src/lib.rs:8375-8383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:7882\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":7882}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c75de88a85b36233c7f6043f155e49c9c1315ed679893f8666681068910d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/lib.rs:7736-7744 | gix-tix/src/lib.rs:7793-7801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:7736\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":7736}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e459f4f00181f2371567824fd201e1624dab4c2faf393c3eef6aa6a1f476e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/lib.rs:1433-1441 | gix-tix/src/lib.rs:1630-1638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:1433\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae24be95f837a289cf0208e29183afa8ea735e443cd267dd3c39844f064a171c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-filter/src/driver/process/client.rs:40-48 | gix-filter/src/driver/process/server.rs:40-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-filter/src/driver/process/client.rs:40\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/driver/process/client.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75c84bf4a38a3d39ceceacd7877f1f25c21fd9f3a10acc6521ea055b9d1ce46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gix-tix/src/lib.rs:4597-4605 | gix-tix/src/lib.rs:4610-4618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:4597\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":4597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6a54c98517b9144a38e7ca084e8b67fa97b47c866e512f15c2ec5eb98b0f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-tix/src/edit/rebase.rs:2768-2775 | gix-tix/src/edit/rebase.rs:2834-2841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/rebase.rs:2768\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41f9a53935cd57265082af54051c09ec03213e5b0c5bca48ad8541b61fb38d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gix-tix/src/lib.rs:1728-1735 | gix-tix/src/lib.rs:4038-4045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:1728\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf76c7747d7868f644a062408153b0a9bf1353ddbe911c412a9784c04c28b0d"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-imara-diff/src/unified_diff.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/src/unified_diff.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c974b33b3c60e9d87c1610148dd7a03df754555e6afde5da076537ec70565f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-tix/src/lib.rs:1521-1527 | gix-tix/src/lib.rs:3763-3769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:1521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"117db6e0e7ab6eda5fd5576c477e368b2887bece324620293d2d3cd94eca83b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/edit/delete.rs:138-143 | gix-tix/src/edit/delete.rs:150-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/edit/delete.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/delete.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"835286d2a4ee692b086d83337e7712a9cb588db45d4ffc1a9479f2cab64e5782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-tix/src/lib.rs:629-634 | gix-tix/src/lib.rs:639-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-tix/src/lib.rs:629\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"9074ad45820fe9a2afc8cdd483560bc4add0a7f6cc1edb8bc3ffb694aa655abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-filter/src/driver/process/client.rs:30-35 | 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":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc79aa5f24606aed93cfe8568793d11c1ee8586468dd29aea621a53653a97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gitoxide-core/src/repository/attributes/validate_baseline.rs:78-82 | gitoxide-core/src/repository/attributes/validate_baseline.rs:131-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gitoxide-core/src/repository/attributes/validate_baseline.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0b4b8b31e6c29c19d8a21b9050d8279f0ab87c3beae6ac677018c5c3312ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): gix-tix/src/history.rs:1506-1510 | gix-tix/src/history.rs:1761-1765 | gix-tix/src/history.rs:2223-2227 \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":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"81078947cd2cb3827adf43b731bb27c70a159d2c81b9b460d6d4571d7f470e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-tix/src/command.rs:838-842 | gix-tix/src/command.rs:931-935 \u2014 both copies are in the same file, so extract the block into one function there 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.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9201f3894dc2d4e27541ee0e6ff377602b3e19820cb5bea8269e97a088a42646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gitoxide-core/src/repository/fetch.rs:169-173 | gitoxide-core/src/repository/revision/list.rs:127-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gitoxide-core/src/repository/revision/list.rs:125\u0060 calls \u0060show_throughput\u0060, \u0060Some\u0060 and \u0060gitoxide-core/src/repository/fetch.rs:167\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a6b51d792ec952082117e483e4bdf72e76ae6adeb2e6f827c3f647cb377900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-config/src/file/includes/mod.rs:158-162 | gix-config/src/file/includes/mod.rs:179-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/file/includes/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"408dfa51ffc27338d76a7534c1bb3b669767453060d571dc9003d248531e3cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gix-credentials/src/protocol/context/serde.rs:65-70 | gix-credentials/src/protocol/context/serde.rs:78-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-credentials/src/protocol/context/serde.rs:65\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/protocol/context/serde.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73fac2cf705c4ed7d81893ba195aafd9e7ab691b0e052a6f9fb75891b4da17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gix-date/src/parse/git.rs:254-260 | gix-date/src/parse/git.rs:443-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-date/src/parse/git.rs:254\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-date/src/parse/git.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb83a13b2d8cd40f83c1283c37c6184a676c3ca71bf0929fc91ae788c6729ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-odb/src/store_impls/loose/write.rs:35-39 | gix-odb/src/store_impls/loose/write.rs:52-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/store_impls/loose/write.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc791a7248e6cb44623aac8e9683df1bee7786354d691a3420e9c979417bbea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-odb/src/store_impls/loose/write.rs:72-76 | gix-odb/src/store_impls/loose/write.rs:90-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-odb/src/store_impls/loose/write.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5645d4fcf46fff8da37153c2f5a708ec8050723fc0858047020c2e2864d0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gix-pack/src/cache/delta/tree.rs:120-124 | gix-pack/src/cache/delta/tree.rs:176-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/src/cache/delta/tree.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn set_pack_entries_end_and_resolve_ref_offsets( \u0026mut\u0060 in one and \u0060crate) fn add_root(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/cache/delta/tree.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ed49e717dbe18a5f29efebc3dc4a27377d9ec85e473e9ee5f20aded8721b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): gix-pack/fuzz/fuzz_targets/index_file.rs:11-44 | gix-pack/fuzz/fuzz_targets/multi_index_file.rs:13-47 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/fuzz/fuzz_targets/index_file.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd13aa3c643e5dc3e632cac6ada244fd4f4185c68311112b59e7c5887e128d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): gix-imara-diff/fuzz/fuzz_targets/comprehensive_diff.rs:35-49 | gix-imara-diff/fuzz/fuzz_targets/unified_diff_printer.rs:28-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-imara-diff/fuzz/fuzz_targets/comprehensive_diff.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-imara-diff/fuzz/fuzz_targets/comprehensive_diff.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5036659a9c337c51146cdeefaa474965fe1166f0ce4ce94db998d81b5e9de2de"}},{"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:37-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/fuzz/fuzz_targets/index_file.rs:34\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gix-pack/fuzz/fuzz_targets/index_file.rs:13\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gix-pack/fuzz/fuzz_targets/multi_index_file.rs:24\u0060 calls \u0060black_box\u0060, \u0060num_indices\u0060 and \u0060gix-pack/fuzz/fuzz_targets/index_file.rs:22\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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.86 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1889a3e9d6690d5b5fbe1a555eda686ad38545d3540105ed4b345895d496cde8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project gix-pack: gix-pack has instability 0.81 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3f4afd98691db9d5e79845293977f9088ede79bc8c6ff5057244f95beb1a436f"}},{"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.88 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.91 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.85 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ef809b8dd09b53d34b57d2528ccf7f3affae1f2928ea4f2fde831ab7c3cea22"}},{"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 29 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a8afc1db9c425a76c685d2a877fd5cbf759871a70cf9128e52379ec32deefc65"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-hash: gix-hash: abstractness 0.00, instability 0.11, distance 0.89 \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-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-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-trace: gix-trace: abstractness 0.09, instability 0.04, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 27 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86d587427ba31c0d4fbc8d6e73c0649b331b3a29c0ac43712454406eeb79e677"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-tempfile: gix-tempfile: 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":"09509002be46494bcdcfcee339469efb810797d4065d28fc7b7302b950e39035"}},{"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-date: gix-date: abstractness 0.00, instability 0.14, distance 0.86 \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-error: gix-error: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 54 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.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b48c9b9611d5c6bb56f386297d93f99a0feb1a8bb50ae9b85099d910db9d9a4b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-utils: gix-utils: abstractness 0.16, instability 0.04, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 22 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c8c51bd1a61d65657d9a4e37cfdeaf2b33300ed94bc3888883ff68986147f23a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: gix-parallel: gix-parallel: abstractness 0.20, instability 0.08, distance 0.72 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6333c7f95e89f64590f6a5a14ae8e4b50e9183bfb246a26fff65c69ccd9f75d5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Reference (LCOM4 28): Reference\u0027s methods fall into 28 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 28 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/raw.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"805fd46e428da1ea10cc8fe173b8f1aecb9fc346bd37d5d48c50e95da7721d42"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FullNameRef (LCOM4 11): FullNameRef\u0027s methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/lib.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"901ca6348f4a4a7dcd48026634567b0bd7f76ea5216d69343a537cd4a51d1cca"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PartialNameRef (LCOM4 11): PartialNameRef\u0027s methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"828cd9027b0f77e9fb8642ceee616c459fc4480c0107ea106498038be12904ff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Prepare (LCOM4 10): Prepare\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-command/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0a912995e5578b5c628a77e9076ae9a34df84d1f5fb7cd863377291b3d913e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FullName (LCOM4 9): FullName\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/lib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a1f7a201216de2e7baba96262f9a318ba18c221b81abdea524c4661aaba7f7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PartialName (LCOM4 9): PartialName\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/lib.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"679eefdf0b1ef786a320c6a3c3bb814bfed3489982ba72885ab02301e821c0e9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Any (LCOM4 8): Any\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/keys.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a041d54e88d2408327c9f23c99e86edbd36d6a45f94e117090c6f95673cc3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 7): Namespace\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/lib.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf392c48e2c63534605e9b38c336dba694994494318e167e86a268a92c39056"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CommitRefIter (LCOM4 6): CommitRefIter\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/lib.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"703bb63ce10a7042b3985322ce732430bf5982d7d19c446791893dfcf155f893"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Object (LCOM4 5): Object\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/types.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88de6c1da99ad348d8cdbee82716f749a22b32e09b144c6115e987686d00f78"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vec (LCOM4 4): Vec\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-bitmap/src/ewah.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"983b284856d6da98ba8fbbefdf218e85d608805c3e245844a2637d418f15002c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/commitgraph/verify.rs: 0.0% line coverage (0/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/commitgraph/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdc097001d94800337118750e5ebb7c66579c4ea029716cb755b44cbf58b773"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/corpus/db.rs: 46.3% line coverage (87/188)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0357ff0289aca3053a337bbfc00053b3ecd0cb11fbff32ffb9c4d7d83cb601"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/corpus/engine.rs: 0.0% line coverage (0/266)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be9386d66de60d1a0831b65abb639ae5e48f6768c5a750212c163ccdd24615c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/corpus/run.rs: 0.0% line coverage (0/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/corpus/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c95f0e0c9639654392a8d0122e75a4ca5406be3e9829b90391b13ad3b252ed7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/discover.rs: 0.0% line coverage (0/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/discover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345694c9b2f7bd8ecc33dca134de1eede394dbcfcda51ad924ff824b4adc7d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/hours/core.rs: 0.0% line coverage (0/159)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/hours/core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"185e4e20543570adb8ac31fdabc815a4c220c93ad129ad72b4d863503c010d71"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/hours/mod.rs: 12.5% line coverage (38/303)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/hours/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2164cf91376c7ef581046438d74897aeb8e5b9d12fcd5d2d33ad0a17edd1e88"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/hours/util.rs: 0.0% line coverage (0/101)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/hours/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782447d91645fc8d19b7be200023adf92baf9dcfe70b25b42919a2a4ec6709c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/index/checkout.rs: 0.0% line coverage (0/143)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/index/checkout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"888cffa15cdb3e7ff383c798bd67432067edd61f8be3f58dab3d44e7e3b00e3c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/index/information.rs: 0.0% line coverage (0/76)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/index/information.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8267f7fb711e6404cf5d7c95daec2cc69c2de685bac5a77fa8f0e7f0307cd5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/index/mod.rs: 0.0% line coverage (0/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/index/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3de2c281795aa375373e2b037f47c22b93abf947317b0491d4c63714d29b3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/lib.rs: 8.6% line coverage (5/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8084f3da7353704c87180482bfa45bfecfcf5a6328bcedfa4199eaa1a1ea9f22"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/mailmap.rs: 0.0% line coverage (0/27)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/mailmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0780f5e2b3e971d65956d202f0d6a7e054268d780cbfdc974b8c15a94c0335"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/net.rs: 0.0% line coverage (0/26)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/net.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"718fb3348245be97de8bfecd440b90364c6878320d2cb0d56ba409bdbb3cc95a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/pack/create.rs: 0.0% line coverage (0/226)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/create.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf737a0ba80c79dd738c92cc616e86ea930d0f88326910593c4cf6baa96035e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/pack/explode.rs: 0.0% line coverage (0/159)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/explode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f69c7b57a7325f0b9501ed335c66ea7b3f1eeb2f9b4210962ca48654791849"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/pack/index.rs: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc68d9859529d174ce095f619fe7917c51f94d77d978c13efc63835dd79082e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/pack/multi_index.rs: 0.0% line coverage (0/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/multi_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d584fb435ade2b79e1f95285a9f5ac7b54c9af09e5f1b7fa9a100a11ac9ffd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/pack/receive.rs: 0.0% line coverage (0/212)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/receive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c213c02087a3fe8601550e328e70115deeba2f370c580a31666e95b31de0df0c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/pack/verify.rs: 1.9% line coverage (3/162)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/pack/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8839fee391446c86f81eb3fb0180ffde64e4096a2ef40db17ee3f166791712ed"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/query/db.rs: 0.0% line coverage (0/61)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8024acc55e10f3d4b1dcad6f72b4a162d2ad19b09684aa8e0abb0588253bc788"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/query/engine/command.rs: 0.0% line coverage (0/144)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"313db653b476a0a4e5abb7cd70865aeb138f732b5778212ed05e18db9c8e7557"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/query/engine/update.rs: 0.0% line coverage (0/440)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/engine/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654cf7a9ac8835b3e1d1aea47f85ca1f5f5002a25b63866cca024c5eda3d939"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/query/mod.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/query/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44eccad02ee55c463022830504f4f1a5cfd7735ac07643e628abcadbd03d077"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/remote.rs: 0.0% line coverage (0/115)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b34d42d2196ad7c89d3c776642c411091cfbed69d1f7378ec90350b9a39d88"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/archive.rs: 0.0% line coverage (0/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/archive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc58dec31c8a56946a64ede514abe0acfe8b9bb2e6932c5bd1627d90d22f031"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/attributes/query.rs: 0.0% line coverage (0/94)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c9357950291da643088eee6147b40080e3e2546d4f26c217841f223a950175"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/attributes/validate_baseline.rs: 0.0% line coverage (0/270)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/attributes/validate_baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7243cc5d9fe8a8137bebc0fdc8e0f04c1dd1d8f5136f402ca296a51a032939e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/blame.rs: 0.0% line coverage (0/100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/blame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2039bddfa057eedd3b3da24a35ac04f3daabec97cb371c1f979b8cafa0850ec0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/branch.rs: 0.0% line coverage (0/35)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/branch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8905910674f30a8e988fa0deeaeeb543350b0fe4fdb0f82599ab6fca7db7bd8b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/cat.rs: 0.0% line coverage (0/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/cat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e05c83cec7dbe0792d29b891bc66c7c12137c1bc5750c6638a89c240132ca5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/clean.rs: 0.0% line coverage (0/276)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/clean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ac5cb432f1d450ad78b4db552097f67d52cdc0bb194a2ef1747bbbfdc9d81e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/clone.rs: 0.0% line coverage (0/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/clone.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc86ad4913faad7dc74e32eb718d005350836ff8f5462e38e61ac03d4db6503"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/commit.rs: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/commit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d2a22c227511aab36803f97b639509d0e512cb452d67bdb3d38b4c5d733ac6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/commitgraph/list.rs: 0.0% line coverage (0/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/commitgraph/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"952f21231f17a7c3478b3781cf783026bc25d6316cfbed7ca249740dc786914c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/commitgraph/verify.rs: 0.0% line coverage (0/35)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/commitgraph/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7484d309da0e7aedfdc24e1310798c765a33752b6b2bf27dac2cc06707877b71"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/config.rs: 0.0% line coverage (0/140)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1487b849ea77834b2bfacea74e9e0a152ec495077b5efe15867ba516d2247f0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/credential.rs: 0.0% line coverage (0/36)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/credential.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc92fc6526043d9bff366410952bf480c1a87dd60a8b824c474b6e93c38fe6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/diff.rs: 0.0% line coverage (0/147)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"132654d78ae719eed6ed88e6935ae849306c043987d1ee6200d46658503d2be8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/dirty.rs: 0.0% line coverage (0/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/dirty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fd977c875b4550b6ac83e99c8e6b65d93e2b69358b6c34561c70f5f9a1d4e1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/dirwalk.rs: 0.0% line coverage (0/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/dirwalk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2a03d9c26b86a42ed7b40e7200914463cce6a9f511e93bf158c1fdb287ab7b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/editor.rs: 0.0% line coverage (0/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0957a0c54b4d945bf54bef4a6b7cd684e09a5623a00220e8327091c71b3f8b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/exclude.rs: 0.0% line coverage (0/74)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/exclude.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f41b3dd1dbcf7877e8a51cddb0a9e181872156c415748699037af1609b5d1e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/fetch.rs: 0.0% line coverage (0/239)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe4c613941bf96a2df2d2446343003ce93f2d28b3dbbc1bcc732a1609f37e84"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/fsck.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/fsck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c92aa40a62aa865e71c475017d6e93e1cd8b3d4bbbc47f61abc166fb56b2c0c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/index/entries.rs: 0.0% line coverage (0/314)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/index/entries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7e0585d8b6c5d69c06419d2a5f22f1462099a4ee1cdacdb0c243fcaeac524"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/index/mod.rs: 0.0% line coverage (0/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/index/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faad092691329242f88a06b1b1de7699c329eb251e77f538ddf2c765f1fe5e3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/log.rs: 0.0% line coverage (0/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e88e036c911a25670351bb0625b299835fe5097fdf1f63358d0fce6107eaa2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/mailmap.rs: 0.0% line coverage (0/68)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/mailmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ebe51450027bfcf742cf242c02cb30f09d5955f937146a011670768e16919e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/merge/commit.rs: 0.0% line coverage (0/73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/commit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328bf02ffcbcf0f39911ef1018024d50d280ab4c8dc8cd09597fd53b09f528a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/merge/file.rs: 0.0% line coverage (0/82)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13037ce2cd605516c8cf0e8799f5ecf7c16523ffc50d08cdba47fa11e39411f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/merge/tree.rs: 0.0% line coverage (0/141)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c3fa3e978ff2d8334a48a44ef6fac8f40d807d28d6c753993be7852aee63e3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/merge_base.rs: 0.0% line coverage (0/30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/merge_base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c99022f2d7d79560370a9c3e3c79ac0df438ed7c2f5dfe938fa5c30d7e73a3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/mod.rs: 0.0% line coverage (0/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8342f6ec425b7f6e8c7eb0ecf9a2f5615be68881e6d4f44edfe1665e50482f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/odb.rs: 0.0% line coverage (0/157)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/odb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e9194fd90e7aba00e5739c0ad671e2ae873f131eb4eaed951eddd3ea3c1cb4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/remote.rs: 0.0% line coverage (0/247)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fade5dbb7a2d2507caa0f2f90e987f29d0bd81fc77bbbfc423f6834a4711b1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/revision/explain.rs: 0.0% line coverage (0/161)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/revision/explain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b77f45586988f4fa332b18095b3c048346f1447aaf3a69c1bf55cf5e4c18bd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/revision/list.rs: 0.0% line coverage (0/90)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/revision/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd49946f5e4365b8f9d4d05bb716c72657d051dd23630f102803548a1c05a11a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/revision/previous_branches.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/revision/previous_branches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be420106f53e6f84c5f69234592abd6902a6998ba227bb02d0c26f082214de2f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/revision/resolve.rs: 0.0% line coverage (0/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/revision/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1528d8c6a55cf9fdf6cbcdfd0b183277eef6b155406fceceb73d1104bd7023ea"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/status.rs: 0.0% line coverage (0/192)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe73e7addfb314449225fd4d0a5e6c1785745ccf214986ef73e22f25fbc7727"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/submodule.rs: 0.0% line coverage (0/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/submodule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"775741a9cdee9ce0e4c096c1e1cb1ace07113d7e0cb278c47c49a1a000474afc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/tag.rs: 26.2% line coverage (11/42)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/tag.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"365f7eeedd5aec829559ee7b945311bb08b0a319f828088f0f950d526957c05c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/tree.rs: 0.0% line coverage (0/130)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73141dccf5b4e4186af53b304d663bbf4156678cd823cc56faff9a04545579a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/verify.rs: 0.0% line coverage (0/37)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"127d0ddb5b447c3c0021c2a213833a57feea99a2f98096e403e952ad3e2b7d06"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gitoxide-core/src/repository/worktree.rs: 0.0% line coverage (0/144)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gitoxide-core/src/repository/worktree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7194ba6f0e55eaa5812a79a6842a445e6b9ecb4dffe421396cb37f7db86a0868"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-commitgraph/src/file/mod.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef101e9a373524ac9370f2c9d4e005656dd6870ca4eaf4edd930d057c514a960"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-config/src/key.rs: 46.3% line coverage (25/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-config/src/key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8764626a21134c145d9adfeb065acf989ce5610a77798614f048dfa4a561fa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-credentials/src/lib.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-credentials/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aabd26e8b2bae297e2ffb1d5d4d260704099ea02d64e01c4dc9f256cc8c2d1e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-diff/src/tree/mod.rs: 41.7% line coverage (10/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/tree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f2b0bb2983b1a2bdc528b6eff486abd919841a118e7c2a832a9c17d6719e71"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-filter/src/driver/delayed.rs: 45.9% line coverage (34/74)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-filter/src/driver/delayed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e013666e7d36463838c026bb4d74519d844221c6fb7393a8f47662d6522ad65"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-index/src/access/sparse.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/access/sparse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"307bbefa09ff5af6727d74e21c2a6521bb939c621be171de603265f0ccecbf02"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-index/src/lib.rs: 48.8% line coverage (39/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e411d1991fb7c807d49ce6a5b94ace236fa1107d8c3d9372d7ee5e7938cc053"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-macros/src/bisync.rs: 0.0% line coverage (0/26)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-macros/src/bisync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffe34e426e25c05ce108ecb5287763d8c96cf703435c2ebb71ff236e9c1627f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-macros/src/lib.rs: 0.0% line coverage (0/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-macros/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc5a704a32f58424168db3d103d66da29469bbf76dad7e76c453cbc87e58576"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-macros/src/momo.rs: 0.0% line coverage (0/204)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-macros/src/momo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ada85ce33a673573679e9e1ffcc05b4b1512a2187bf2265e58354c6d3a80559"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-macros/src/unstable.rs: 0.0% line coverage (0/180)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-macros/src/unstable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dbf0fa4a410d3ed3a681cd9b00ab11776835319e6f382cc17ae25b52384dd4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-object/src/object/mod.rs: 43.8% line coverage (77/176)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/object/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f125a1f5001f079f2aa35364b2503affc5084fb6c1fd2bdb5502bdaec70707"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-object/src/signature/sign.rs: 49.7% line coverage (76/153)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/signature/sign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f57396b993ad0e7e52fbcea08e9ed544f8d993808e16ba65f347d519e595f44"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-object/src/traits/_impls.rs: 11.1% line coverage (6/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-object/src/traits/_impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce38a4fe2c90d95570d406eec50acfe9164129d7c6e375c2981556386beae04b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-odb/src/sink.rs: 37.1% line coverage (26/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-odb/src/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"862ac2d540c943cf87983cac185c3b1f0248c251a5b4c1a4d09f60f307613fc3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-pack/src/data/output/count/objects/types.rs: 33.3% line coverage (7/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/data/output/count/objects/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9080705df33d7b21642036ab507a8d3c40ce8f5b3b1358648e9d09358df31c1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-pack/src/find_traits.rs: 21.2% line coverage (28/132)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-pack/src/find_traits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c566d57813b9cc89809816c2c2ba74f22c2226a0925e87526a63b4e3cd98177"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-parallel/src/threading.rs: 42.9% line coverage (9/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-parallel/src/threading.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dec5110af017ab4b05eade5d2c21a354866d5c762d893d85c3b4495ea5584c3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-prompt/src/lib.rs: 13.5% line coverage (5/37)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-prompt/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7591721a99f03ac8cebea1e6daae07f97dc68833b8f95e77158c062097bbe8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-prompt/src/unix.rs: 5.1% line coverage (4/78)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-prompt/src/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"932c5a3e8e1de294c88cdea0df277b42f88dcd62a78b4db9270fd0af76fd4daf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-ref/src/store/general/handle/find.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/general/handle/find.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43a656a59f08729966122b05efed64035172f1e4b1581b2aac075e3cc35395"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-ref/src/store/general/handle/mod.rs: 0.0% line coverage (0/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/general/handle/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51169a19f46052e0d2363321c05337b9a381d776810b3aa83ef72b0a22e73bba"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-ref/src/store/general/init.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-ref/src/store/general/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f77365d971211c6808dd718bb07b2ab14e9307a6edbdf4025761a131f9f21b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-sec/src/lib.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-sec/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e90b8ce0201452c3f88561ad9529d82c8fb7d99b36d3d7986d24487fc963114"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-tix/src/lib.rs: 36.5% line coverage (2909/7965)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02839c4f7678e8c78d9c1140252fb38cc6241e9dbfbdc27c4e31c72746fd5313"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-tix/src/main.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc188ddf0b9649e92b82f21fbbae99bd5b748cb935b0b822f18416c2803382da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-trace/src/forest/mod.rs: 40.0% line coverage (6/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-trace/src/forest/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ef1cd2b668beccd6104aa38844fe6f3bddec24cec712be9207644406570de0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-transport/src/client/blocking_io/connect.rs: 42.9% line coverage (15/35)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/connect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d85a2d838e1b895a03ad610de231e74559fccb2307a4f31ac6feb1c0f7cd9a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-transport/src/client/blocking_io/http/mod.rs: 48.9% line coverage (159/325)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/blocking_io/http/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6da580e4b2dd774886a7d6be81f322e72bd2c8eac9f03292f261b534f5c7736"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-transport/src/client/non_io_types.rs: 48.0% line coverage (24/50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/client/non_io_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a8022b8562c2c6bed534626f4bfc8871718ca160095099513ee95d1ac82214"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix-transport/src/lib.rs: 40.0% line coverage (4/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-transport/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bfee3accece36d6f378807d55b93d0faef84c223efc173753e80447020e127"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/commit/verify.rs: 44.4% line coverage (24/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/commit/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c938833dd26b2de672a699b56bb72699fe2de8658c479e93b3cd28d1ae0de"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/config/cache/mod.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/cache/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccdeca6ec7563b6018d9cc9d7e51cbbcc76a256f81d638a5684fd57fd7af689"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/config/tree/sections/credential.rs: 0.0% line coverage (0/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/credential.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fb51b388b08342713f1396b860f710da9e4d0a3dd477d36b1a6f9721380ecf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/config/tree/sections/gitoxide.rs: 47.0% line coverage (86/183)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/gitoxide.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0e7e4492d4144d56c428d049283730609ce8cdb622602c4a3234f1d57ea84f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/config/tree/sections/url.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/config/tree/sections/url.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a605ef6028878bcaf3076027e3d7da6054d3f85b0c6dd8af023823ed5399b4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/dirwalk/options.rs: 31.7% line coverage (39/123)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/dirwalk/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2836ac49a34fa9c1954bb820dc8dadc1997bc603bb98524a0805532bcc9eaa82"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/env.rs: 18.8% line coverage (3/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f300a20a927b4c42acbb9499b7cf4d992e92b5363e02b2aa6166444fa9385b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/ext/tree.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/ext/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d29d94ab98181b2fc5feb2e62871b1f82adcf7aecbc49da69f42f544ea1f50b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/head/log.rs: 36.8% line coverage (7/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/head/log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e83406b011f083465031fedfee084e06f557149c79ca8c8f417b7321cfb2e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/merge.rs: 42.3% line coverage (41/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a75952a2c08dd87513b26f733631789780ea479fc3fe6aeff0fe46fa0bcf47"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/object/impls.rs: 45.0% line coverage (49/109)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/object/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98160624acdcd9c2d581356933a6af7705440872c0ab55933029a9dcc4ea263e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/object/tag.rs: 45.8% line coverage (11/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/object/tag.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1dd15c5d653cc88b9608c9cba475d672dda4b9c74db8d296afeb877ee003e4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/object/tree/entry.rs: 30.5% line coverage (18/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/object/tree/entry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e2e0ae90f0d0428c5ebe7af3a155e7c5e58cc1f87afbfd7901598f423f952c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/object/tree/traverse.rs: 0.0% line coverage (0/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/object/tree/traverse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"298314e556d8acc7a288441f11ddd75db3b1bfda34c6bba7e58b592368242790"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/remote/connection/fetch/update_refs/update.rs: 48.8% line coverage (20/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/remote/connection/fetch/update_refs/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf45a3c57e9328f9efb38e29dddc374c32315d9716378edd0490eee4dfab849"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/repository/thread_safe.rs: 26.1% line coverage (6/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/repository/thread_safe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da96b54115402b7663b989aed3c6c38c12e722439a0e207caa754963518f9b9c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: gix/src/worktree/mod.rs: 44.3% line coverage (39/88)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix/src/worktree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4a1cf6eb9f14a3f582f843dca584bb4e574a71240b55470a60db25eb195f3b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/plumbing/main.rs: 0.0% line coverage (0/1070)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99bad35b522698d2c15a6516dbf5f9ad557a42aeeb1c379359eb8b77f02ebb0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/plumbing/options/free.rs: 14.6% line coverage (7/48)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/options/free.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0269fd746e029082cef25b84fe88b412a2bdf4e05856c38a286c911c7e19d66c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/plumbing/options/mod.rs: 0.0% line coverage (0/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/options/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a620703442bac883508c3ae77c2371830ac8ea3aaa48091805df77694431d0e5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/plumbing/progress.rs: 0.0% line coverage (0/111)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plumbing/progress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff07f53a2641af6313ec543a0527b39060754dba19478e7ed8f59e41ec01da57"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/porcelain/main.rs: 0.0% line coverage (0/114)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/porcelain/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dade6026117f4c3852786288013c18ce6b0c55b6cf535a5d9d64972ffd63129b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/porcelain/options.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/porcelain/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5afcbe3ef23a29ebe141da69b198db92cd0fb918bdcaf69fa53711110ae5be0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shared.rs: 29.2% line coverage (49/168)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d445e025b9a41d94c7e948012b623f06e36c98d9b5f946b2046f8b42b5e1b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/lib.rs: gix-tix/src/lib.rs changed 238 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 570 in gix_tix::event_loop at line 1389. 78 of those changes were fix/bug commits, and the other 160 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64d5146577aed16c9731b571c92be8a5c96edd3bd717a623758afad95f3f18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/ui.rs: gix-tix/src/ui.rs changed 169 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 170 in gix_tix::ui::draw_with_worktree at line 426. 47 of those changes were fix/bug commits, and the other 122 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4c6e57badd05aaed3b0c0ac25be1b847e6ba6a0d056fc14eecf792b85ea5eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/app.rs: gix-tix/src/app.rs changed 149 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 180 in App::update at line 1950. 43 of those changes were fix/bug commits, and the other 106 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"836c86aa05c2d2a5c6b80fbaf5ae1de89a8a70b7690237889ff0d7fc2101a011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/rebase.rs: gix-tix/src/edit/rebase.rs changed 96 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in gix_tix::edit::rebase::perform_inner at line 982. 34 of those changes were fix/bug commits, and the other 62 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e96faf7bedbefc60b24bb5a46d4f9022db7e66bed1636eae71db3f496ee6c83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-merge/src/tree/function/resolve.rs: gix-merge/src/tree/function/resolve.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 254 in gix_merge::tree::function::resolve::tree at line 97. 6 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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: gix-tix/src/history.rs: gix-tix/src/history.rs changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in gix_tix::history::decorations_excluding at line 2208. 29 of those changes were fix/bug commits, and the other 55 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867ffbd1f10209727d9d0e09c36d65db7aba7b5c218f53cfdd92aed7ec05d83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/todo.rs: gix-tix/src/edit/todo.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in gix_tix::edit::todo::parse at line 1213. 18 of those changes were fix/bug commits, and the other 33 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":1213}}}],"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 71 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in gix_tix::edit::time_travel::move_head_to_reporting at line 249. 28 of those changes were fix/bug commits, and the other 43 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"de77b2d1e26a575fac3b69153ef641c963925de1460a3c1f7adcb91d2cd73d69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/plumbing/main.rs: src/plumbing/main.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in gitoxide::plumbing::main::main at line 30. 2 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3106c5d6c2eb3c222a86c6f989915c298a70758f45b3f765ca29237423369df5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/command.rs: gix-tix/src/command.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Platform::run_as_initialized at line 347. 15 of those changes were fix/bug commits, and the other 64 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7ab07aea6aee035634ba9e8ccf20e1f800d87eb6d3c08a16ff46fc9b53280d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/ref_tree.rs: gix-tix/src/ref_tree.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Tree::handle_key at line 274. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c062a3a652d16c4ecf722f0f79be3020fcdc4dba58070c70de2adcb1090f927"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/open/repository.rs: gix/src/open/repository.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in ThreadSafeRepository::open_from_paths 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79dc488203a17c22c445628c22cba03d8e9309d5f6a1f6a340476f377d9894a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/command_menu.rs: gix-tix/src/command_menu.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in gix_tix::command_menu::commands at line 244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-tix/src/command_menu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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_menu.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b520dd277ac847808f6fc012800848dcf64cf0dd2e23ae2924ff39c9eeed57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/head.rs: gix-tix/src/edit/head.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gix_tix::edit::head::perform_inner 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d4486047d4e668c2bc6469673a010af5d7ae07ce613137d96a0893c0a366ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-diff/src/rewrites/tracker.rs: gix-diff/src/rewrites/tracker.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Tracker::find_file_renames at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e2f0b04b6083b752311d460dc96a0e2ddadd48812a4932087636cb3628a4c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-tix/src/edit/auto_merge/mod.rs: gix-tix/src/edit/auto_merge/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in gix_tix::edit::auto_merge::order_plan at line 1269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-tix/src/edit/auto_merge/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-tix/src/edit/auto_merge/mod.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3294e6f87486a5becd1bc695e2d94277e7afa888a0ec5db82fb99fd293444c8c"}},{"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 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in gix_transport::client::blocking_io::http::curl::remote::new at line 412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"542e982cd0caf20b9a5e569578b312579e18ed3634a82a9f1eaa032f430d5a25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/query/engine/update.rs: gitoxide-core/src/query/engine/update.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-odb/src/store_impls/dynamic/load_index.rs: gix-odb/src/store_impls/dynamic/load_index.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Store::consolidate_with_disk_state at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"899871e0d7cd599ff30908b8497e994c7f5aca98f5157b14f16d5b18dfa62e88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-date/src/parse/relative.rs: gix-date/src/parse/relative.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in gix_date::parse::relative::apply_operations at line 293. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-date/src/parse/relative.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/relative.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"05446575d1356e363e863e2c29710df18e42597c57814eb04be979c46a447ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-diff/src/blob/pipeline.rs: gix-diff/src/blob/pipeline.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Pipeline::convert_to_diffable_inner at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17ae3378c0e59152745f7dff81efa19d22b4a1c53f67596082c4afb362a1201"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-traverse/src/commit/simple.rs: gix-traverse/src/commit/simple.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in gix_traverse::commit::simple::compute_hidden_frontier at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-traverse/src/commit/simple.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-traverse/src/commit/simple.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2299c7be55f356e9738d76471a2ce6983311efa4175a837e5bab92c09ef274a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-blame/src/file/function.rs: gix-blame/src/file/function.rs changed 11 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 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d05bcf2e8adfedbcf25e1e6e4bae7fdf1d7a387ee4d2725da3b7151510fd46b"}},{"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 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a3bbf01bf8cf1b450924c4aba05001b92ef627bdfae5e733bb7c4d687bfdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/clone/fetch/mod.rs: gix/src/clone/fetch/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PrepareFetch::fetch_only at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e86f5e8008a08ea7f96a59fb0eb9510cb7117d78466af6e72dddff8ef7523c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-error/src/exn/impls.rs: gix-error/src/exn/impls.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gix_error::exn::impls::write_error_node_recursive at line 405. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-error/src/exn/impls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-error/src/exn/impls.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e2ec8180f015c407f80e8d2a02432d82fe591b2baa92548d707d1beb92fa6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-status/src/index_as_worktree/function.rs: gix-status/src/index_as_worktree/function.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in State::compute_status at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fe1d555bbbe5aaca90d5edd7993369e04de42c5a196f93b19045a616cf64cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-date/src/parse/git.rs: gix-date/src/parse/git.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in gix_date::parse::git::parse_textual_date at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-date/src/parse/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-date/src/parse/git.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d17498d429b676218596ad6fb557eceb493a624638305de6cd5e319c59ac10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/find.rs: gix-odb/src/store_impls/dynamic/find.rs changed 18 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 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7c9b99f5828c032aeab013f71caee9f40b4e649cdc7b63b88ec168d1854fa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-ref/src/store/file/transaction/prepare.rs: gix-ref/src/store/file/transaction/prepare.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Transaction::prepare_inner at line 218. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0227dcc723aea733da9b37810e776de5ca3201706fa6c30f0dc7bd4c0d49f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-credentials/src/helper/cascade.rs: gix-credentials/src/helper/cascade.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Cascade::invoke at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e1e456f8f46c615b1d6a5c686f8f7f55d2ed4a0176883491c42ded05dfed11"}},{"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 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Remote::default at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1b58e17019ed8369a9241c8ef1a4393959973cae18adcff642baf29606de21"}},{"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 11 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 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"03644836c548a7eabe469c972855f05910a13fffca0184610e0c9f73657d5cf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-date/src/parse/function.rs: gix-date/src/parse/function.rs changed 21 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 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1297815537afc25ffd81efde361be6463bb3d88aec39771fbaf610a0fafc9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-glob/src/wildmatch.rs: gix-glob/src/wildmatch.rs changed 3 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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: gitoxide-core/src/hours/mod.rs: gitoxide-core/src/hours/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in gitoxide_core::hours::estimate at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gitoxide-core/src/hours/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":"gitoxide-core/src/hours/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6701c853e7528e54e994aa767bb0c3b3a6046d3778f798218fb9a7a455b25b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-odb/src/store_impls/dynamic/header.rs: gix-odb/src/store_impls/dynamic/header.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Handle::try_header_inner at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cea30b565dcbe78429cd296ee5c4e3c50697f30b3d6babbe33888ff75110b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-pack/src/cache/delta/traverse/resolve.rs: gix-pack/src/cache/delta/traverse/resolve.rs changed 16 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-discover/src/upwards/mod.rs: gix-discover/src/upwards/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in gix_discover::upwards::function::discover_opts_with_trust at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00307e13979d90184dce3ad496849d538cf9e6b53bdd554bab65bacc096a74c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/repository/remote.rs: gix/src/repository/remote.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Repository::try_find_remote_inner at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"78202484911c15de51ed3bb7573926c6db5b0f4bbce3efb572525796da832f72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-pack/src/data/file/decode/entry.rs: gix-pack/src/data/file/decode/entry.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in File::resolve_deltas at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdecbff8f95bfdca628c0a7d1fb4d367df44dec84ce9e667d3fe15026220e174"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-diff/src/index/function.rs: gix-diff/src/index/function.rs changed 9 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 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f63442234ef79cc8e7f8a71122b537db926d253275ebec18b5c3e292a729cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-dir/src/walk/classify.rs: gix-dir/src/walk/classify.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-merge/src/tree/mod.rs: gix-merge/src/tree/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in gix_merge::tree::apply_index_entries::function::apply_index_entries at line 556. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-merge/src/tree/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-merge/src/tree/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2e0c67d74fdb23347034dc519c002530a62459a90fb2eeec2b8e416433067a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-merge/src/blob/pipeline.rs: gix-merge/src/blob/pipeline.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Pipeline::convert_to_mergeable at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"67524eff40cbe40eea60907d26c2ace45c465bf2e3758e3fcf8319ee54fb432f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-protocol/src/fetch/function.rs: gix-protocol/src/fetch/function.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-credentials/src/protocol/context/serde.rs: gix-credentials/src/protocol/context/serde.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Context::from_bytes at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce1a15e1362bd72e2ec404e76ac5ec0bc37d5efd6af43135d2a414945073cac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-ref/src/store/file/transaction/commit.rs: gix-ref/src/store/file/transaction/commit.rs changed 8 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-url/src/parse.rs: gix-url/src/parse.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-fs/src/stack.rs: gix-fs/src/stack.rs changed 11 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 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b4c792cacebdd46a690b34cadac0d5c7502c591a2a36491cf7c937d8f00134"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-object/src/tree/editor.rs: gix-object/src/tree/editor.rs changed 8 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 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29b31a9943b779e369992b13f20fd3c696accac1f4d3778e1d426b2360fd160"}},{"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 10 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-protocol/src/fetch/response/io.rs: gix-protocol/src/fetch/response/io.rs changed 8 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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/src/worktree/remove.rs: gix/src/worktree/remove.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gix::worktree::remove::resolve at line 309. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix/src/worktree/remove.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/worktree/remove.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb692da4ecc8074d8dd4c04fed2bc6d2179a9fcb838b962e5582e6e1751ba32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-worktree/src/remove.rs: gix-worktree/src/remove.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gix_worktree::remove::remove_root_with_after_scan at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-worktree/src/remove.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-worktree/src/remove.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bba8e79643ad6f767b624a703b4179c02ad5121b34f16254ce6b765d2b2ebb"}},{"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 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"42680db1ceb2989885e1b61e476862e085730d86c779409cdd43fd21de4c0eac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-url/src/lib.rs: gix-url/src/lib.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Url::write_to at line 717. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cdf6dda7f39f70fbce3965ce8534d0572bf3fb362b373400c470872b5993de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-filter/src/eol/convert_to_git.rs: gix-filter/src/eol/convert_to_git.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-refspec/src/parse.rs: gix-refspec/src/parse.rs changed 7 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 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fab3a54a697685aec6799aed5f3e738e0d7b3507830bad609f06e7cabd6466"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-discover/src/is.rs: gix-discover/src/is.rs changed 8 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 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca0e3db3c6f0dad39e91560dc9384ce61424949780f467c11f5d29ca4556045"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/worktree/add.rs: gix/src/worktree/add.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Repository::prepare_add_worktree at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix/src/worktree/add.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/worktree/add.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2507a3df61916d4591eeafb8d12d75c52d0e26a8909b8af989eb82886b56413"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-path/src/realpath.rs: gix-path/src/realpath.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gix_path::realpath::function::realpath_opts at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"190765bea13a1e1c9be8c7f16daf9fc937fd820bec0afd6e94a615666803da32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/organize.rs: gitoxide-core/src/organize.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gitoxide_core::organize::handle at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cf26ad9a0631e5c4b332ddee12e383671c8378b864fe479ce39bfa0e6c55b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-revision/src/merge_base/function.rs: gix-revision/src/merge_base/function.rs changed 9 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 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eecc54db72a9536fbd34364f5415cd1ae891d6c47e22bae7e4601a3cbe0e86e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/repository/status.rs: gitoxide-core/src/repository/status.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in gitoxide_core::repository::status::show at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b67ac02b112b4845ea8fc5aed240933a8a378ecdd9f68fbde4536e40b0a64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-filter/src/pipeline/util.rs: gix-filter/src/pipeline/util.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Configuration::at_path 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfec3ecdca6fb2dde119466644b8fad28a112d83c68a9c57b1e45c3d6a8524ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/config/snapshot/credential_helpers.rs: gix/src/config/snapshot/credential_helpers.rs changed 9 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-protocol/src/fetch/negotiate.rs: gix-protocol/src/fetch/negotiate.rs changed 8 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-config/src/parse/from_bytes/mod.rs: gix-config/src/parse/from_bytes/mod.rs changed 7 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-url/src/simple_url.rs: gix-url/src/simple_url.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ParsedUrl::parse_host_port at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4523e1aad3361ae98f34e4ac78b4059728e5f8cd028938eea19df561bfa72309"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/repository/clean.rs: gitoxide-core/src/repository/clean.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in gitoxide_core::repository::clean::function::clean at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gitoxide-core/src/repository/clean.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/clean.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d02679e3f66431f39defbadf7f8526675bb90e3b2f51da74b7fb58b8940479a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-commitgraph/src/file/init.rs: gix-commitgraph/src/file/init.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in File::new at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-commitgraph/src/file/init.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-commitgraph/src/file/init.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d7e625976b013758911c37f894128eed2c4aa7e3a9f7888d0959059f949e10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-quote/src/ansi_c.rs: gix-quote/src/ansi_c.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gix_quote::ansi_c::undo at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-quote/src/ansi_c.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-quote/src/ansi_c.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c757ed8f7405e3287b05cd098fc2c823780252c21ce435bd5d302a532e2c1531"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/index/checkout.rs: gitoxide-core/src/index/checkout.rs changed 6 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 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4e91b8dab715f7385875192c3070d9ae3b7fc72715704dd2b922268c10bda8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix/src/remote/save.rs: gix/src/remote/save.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Remote::save_to 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06678c14a4b39df32d5c3bcc74491ecf934886ed5275a01dfe23d6de64c6ae2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/hours/core.rs: gitoxide-core/src/hours/core.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in gitoxide_core::hours::core::spawn_tree_delta_threads at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gitoxide-core/src/hours/core.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/hours/core.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f3393d55d22e2f421cec25d3a5b649dcc8b74f29d9a01eabb76539f484fc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-imara-diff/src/myers.rs: gix-imara-diff/src/myers.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Myers::split 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-imara-diff/src/myers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-imara-diff/src/myers.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84733f237b91658d89d05db674e4210cf662d4b5ec4b60e3052bc6fde92e727"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gitoxide-core/src/repository/merge/tree.rs: gitoxide-core/src/repository/merge/tree.rs changed 4 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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-packetline/src/async_io/encode.rs: gix-packetline/src/async_io/encode.rs changed 4 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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/attributes/validate_baseline.rs: gitoxide-core/src/repository/attributes/validate_baseline.rs changed 3 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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: gitoxide-core/src/repository/odb.rs: gitoxide-core/src/repository/odb.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gitoxide_core::repository::odb::statistics at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gitoxide-core/src/repository/odb.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/odb.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e9b3135b185d493ce650bb0d5a27aa217a6ec90c85f0900b7a557fb0ce358"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gix-utils/src/str.rs: gix-utils/src/str.rs changed 3 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":"Repeated repair: gix-path/src/env/mod.rs: gix-path/src/env/mod.rs changed 27 times in last 90 days and 23 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is gix_path::env::shell_command at line 102), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-path): skip the Git query without \u0060/etc/gitconfig\u0060\u201D; \u201Cfix(gix-path): infer known Unix config paths without running Git (#3182)\u201D; \u201Cfix(gix-path): share MSYS2 path conversion across discovery calls\u201D; \u201Cfix(gix-path): reuse native Git prefixes across discovery calls\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-path/src/env/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-path/src/env/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25b488bcc4bb02c4ebd2ab3499bf00f4e18a2ae66df0bc39a769b4777a56025"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-path/src/env/git/mod.rs: gix-path/src/env/git/mod.rs changed 22 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is gix_path::env::git::config_paths_from_config_with_origin at line 126), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-path): skip the Git query without \u0060/etc/gitconfig\u0060\u201D; \u201Cfix(gix-path): infer known Unix config paths without running Git (#3182)\u201D; \u201Cfix(gix-path): share MSYS2 path conversion across discovery calls\u201D; \u201Cfix(gix-path): prioritize cheap Windows Git discovery probes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-path/src/env/git/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-path/src/env/git/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"87460862441a403d059ef90b82f863b90bcaa8a337bc118b9e22fae4234c01ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-tix/src/edit/review.rs: gix-tix/src/edit/review.rs changed 32 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is gix_tix::edit::review::finish_with_progress at line 277), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-tix): make finishing reviews undoable\u201D; \u201Cfix(gix-tix): preserve commits below a finished review\u201D; \u201Cfix(gix-tix): Isolate Tix tests from the invoking worktree and environment\u201D; \u201Cfix(gix-tix): keep metadata-only descendants fully replayed\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-tix/src/edit/review.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/review.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c93b68158f45ad14329a6430950e2119e2ffa74c0d167cc8a6dcad9283a83e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-tix/src/worktrunk/mod.rs: gix-tix/src/worktrunk/mod.rs changed 19 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Worktrees::edit_search at line 264), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-path)!: return path conversion errors instead of panicking\u201D; \u201Cfix(gix-tix): Isolate Tix tests from the invoking worktree and environment\u201D; \u201Cfix(gix-tix): track detached offspring from unpinned sources\u201D; \u201Cfix(gix-tix)!: hand worktree switches back to the shell\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-tix/src/worktrunk/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-tix/src/worktrunk/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e0d27b3f54b2f5e82255a42e8e518f8be4d5b2d1ec7f0b1d7edfc1b990dc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-pack/src/lib.rs: gix-pack/src/lib.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is gix_pack::source_name at line 94), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-pack): allow more metadata for packs with small objects (#3199)\u201D; \u201Cfix(gix-pack)!: enforce allocation limits for pack traversal metadata\u201D; \u201Cfix: map packs read-only on Windows so large ones can be opened\u201D; \u201Cfix(gix-pack): avoid aborts in remaining capacity hints\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-pack/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-pack/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef3850d14a611d8250124d834f6e088d3231cb5635147c12d5fc34a8ae4ecd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-command/src/lib.rs: gix-command/src/lib.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is gix_command::win_path_lookup at line 166), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-filter): run filter drivers from the worktree root\u201D; \u201Cfix(gix-path)!: return path conversion errors instead of panicking\u201D; \u201Cfix(gix-command): safely split commands and ignore shebang options\u201D; \u201Cfix(gix-command): invoke existing absolute paths directly\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01: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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"251867d761dcfe8cb0763daf6d7843b573372d973ebc87e9500b14784cd5f6eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-worktree/src/stack/state/ignore.rs: gix-worktree/src/stack/state/ignore.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is Ignore::push_directory at line 162), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-path)!: return path conversion errors instead of panicking\u201D; \u201Cfix(gix-worktree): skip symlinked ignore files and protect checkout writes\u201D; \u201Cfix(gix-worktree): keep descendants of ignored directories excluded\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-worktree/src/stack/state/ignore.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-worktree/src/stack/state/ignore.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a503bf84395c54f83b00c32521eb8251ff9bddc635dc9ff010d94996301de5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-fs/src/symlink.rs: gix-fs/src/symlink.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::symlink::target_is_dir at line 177), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-fs): guard indirect Windows symlink targets before probing\u201D; \u201Cfix(gix-worktree-state): resolve Windows directory symlink chains\u201D; \u201Cfix(gix-fs): avoid probing slash-prefixed symlink targets on Windows\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-fs/src/symlink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/symlink.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f2ceac951aed2e1aa136e3f37db9de34fdf8a07895afe9ad757a83b4ed5d80"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-transport/src/client/git/mod.rs: gix-transport/src/client/git/mod.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is gix_transport::client::git::message::connect at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-transport): connect to \u0060git://\u0060 URLs with an IPv6 address\u201D; \u201Cfix(gix-path)!: return path conversion errors instead of panicking\u201D; \u201Cfix(gix-transport): reject control bytes in git daemon requests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-transport/src/client/git/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-transport/src/client/git/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c25585664b12d2c656e4803cd36e4303829ec74e9765bb1e12d1a5a9ffeb99"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gix-discover/src/repository.rs: gix-discover/src/repository.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Path::from_dot_git_dir at line 205), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gix-testtools): return absolute read-only fixture paths\u201D; \u201Cfix(gix-path)!: return path conversion errors instead of panicking\u201D; \u201Cfix(gix-discover): derive trust from all detected repository paths\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 05:32:08 \u002B01:00\u0027 --until=\u00272026-11-13 05:32:08 \u002B01:00\u0027 --full-history --no-merges -- gix-discover/src/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-discover/src/repository.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3b86f09c871724607ffb5e96b72977ad5d721a61575254447fcf467d12e7d"}},{"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":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6037e0972fa08a714aff3d43e0ff3df6dbad5b995eae467feb54c4ed83b0ac7"}},{"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: 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":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc3fb88f44451c6ea2876fdb9c09e1d7a520a98810fa363d21a286bc3ce3492"}},{"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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9349256a5d9ba4083cea907842b7f114ff31d456410431fbaf2fd0e47f1b5b5"}},{"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":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc15f524f0c6b375113591db0b2fc0270c5cbee3f0cf27b0a0025cff32099efa"}},{"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":60}}}],"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":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c692b9e2187e88623f61d07c0a081b33f0ea1abe88cca5b6ce9d9f8aa81032"}},{"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":123}}}],"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":152}}}],"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":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bedc368d8b9d0bfddc3ead193d1cd3aa08c6a5d0184b8ea3cff79f720d4efcc"}},{"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":56}}}],"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":215}}}],"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":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"34719192057a63841055c4820dede499ea3b20d5a4da6230a787fdf2b576b3d6"}},{"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":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72d687485cfe41fbe444941ea638617acbd6831ece25d84b1afccc001556c43"}},{"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: 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: 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":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05d60d5fb998432e3af20accd9e4e884d1ff543f60d4d3493d519bc3da2a18d"}},{"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":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fe02b67b1c5865eae81f9792b85f8ae501d13be2faa56a7f0073c1e0229d51"}},{"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: 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":148}}}],"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":464}}}],"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":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b05bea223bbf6dfd1fba98b1676d1ec71fbeffb4e003229cab9e3dae79793b8"}},{"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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"864bb4c77e5f6988fc3e4814115c3b2c646a3ee8422d7ca985b17a5f29b90021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): Make worktree status scale (like they do on Linux) with more threads on macOS instead of capping them. \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/types.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99f0f08f8da69ecbef9845819fbb355bc57c35762b51f4eafb67bf097ffc1f5"}},{"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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"874031918ac3fee491ebedc53eab8476e4e2e49a2e67c537d7c11421eea93594"}},{"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":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6618cbe0dc1f435b7193e5c200d54381ed662ff13dd7f81636f460bcfe342860"}},{"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: 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":4}}}],"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":93}}}],"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":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d396879a522f3a09b66b15509be182b881c39e760197d090249bb74a62471a58"}},{"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: 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":"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: 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":"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":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2b77695e61e723c2f0ebfa6dc603c602c8f51bbca8ef9a727fc44be9619a6a"}},{"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":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d64a47c31a41361207c83502b4d4efcf6b1bf9da994decc5241b9ace7090241"}},{"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":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"811de68cf4184f8f6aff40a2cec93a853a7e945f86a8f97fe4274af6c827941d"}},{"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(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":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ef1ea341f1d861560116aaaf7b3e9ba5d326abc07664597e346e047b1cdff8"}},{"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: 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":259}}}],"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":304}}}],"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":275}}}],"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":312}}}],"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":690}}}],"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":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"b419fc6a7a582ff6606dd496db14e1e8b7cadd024dc1df8aae44e47d7f42ef5d"}},{"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":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa149d6e77e25c157b55212a4fec08bfe183747210668ff5418888a77beb8b"}},{"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":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ba073b038c4d1a72fae39b28f8499ca564a42cd57c8be50657d28d92c512da"}},{"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":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d65edfe3becda9e3e7aaaff1377601b789eb4dc2bd29c3047eef51548e340e"}},{"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":266}}}],"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":447}}}],"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":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc334d3f8592891d8e965179c8a9290e4f11ab084ae7e72f6d0b19d4253e8629"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(odb-parallelism): restore shared/concurrent malformed-index coverage for location, \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/error.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"275f6067f905ed9766978a9d03623edd1686737cc47580a05ae35f72b0c34f60"}},{"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":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"be695b5682bc3ca556497a62716fe83cef4603fc8f99314ad0af9421f7a7cfec"}},{"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: 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":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b818023b87966d47a52b47da897f58854794eac42f6e863520aab8fc800507"}},{"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":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adc05c59e851e8976aefb38ac3e5f0e644507333018c588a2be539d31a8ce09"}},{"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":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c7067b1c39fa38cba0effe4aa51975e66753e30cbcb082208239182dda5f6"}},{"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":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099d74795398242e952ca5865f256f06142b98df05d6a86e3a1b5fdb62b2561"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(odb-parallelism): consider to search fresh indices, \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":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"759d602030087467a60f6aae5fcc423e46b20d0f93a24ea7f9227928366372dd"}},{"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":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73b9bd26a42613700e1b6b3db6e4fa2d4d2d2a5c0be598c6cf9637f2a861419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(odb-parallelism): only NotFound should become Missing; retain other 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/types.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3813bee467d63e65706502ebb238d9e8d1bf8cfec26817dfba8ef38a25af8702"}},{"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: 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":"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":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"929a752435350d41b4aa1b72509ec18e7cd448eacff676c62465de7f4e17263e"}},{"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: 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":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb0adde5a79fec9be998983e1d0e3e230f549fa18cda96bdcb7b121b2854903"}},{"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":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"561d2a256c9aad9f37308063fad3a2f5a5bd63dcc8805a1a8180d7f635aa7345"}},{"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-discover/src/upwards/types.rs"},"region":{"startLine":173}}}],"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/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":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c9390b6b6213d42d8d00962c917aa9e979be8f33e14d0c3850abac6c01d8b0"}},{"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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1694988c54b805eeb56201bfb26328fe1e7d35d86d22c8b33f9c1047e4bb206"}},{"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":120}}}],"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":141}}}],"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":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69e02b60920bf9438124519a78972842afd14b1766756c1009ba3e88ab24947"}},{"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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fed3fd767e072bbb6dd74260315a4cc793bf3c15062481365a403aa88bdd31"}},{"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: 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: // 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: 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: 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":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d8b4b9f63acf713cf18ab1e3ae909e2c2d39dd8071adffce777048c9be7b1d"}},{"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(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: 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: 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":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2393d42c176695ed3a531c41b079b7d6b8d78039831a9d90fa85d9ed7cf74b96"}},{"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":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"799ec6005fefddcdda8d665f71c28c4b8b835c335751009e527845ec80484269"}},{"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-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/src/pathspec.rs"},"region":{"startLine":137}}}],"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/reference/iter.rs"},"region":{"startLine":65}}}],"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":74}}}],"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":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6366628050f8eb8a1fc3c4a0e05b21835d71ab99eeff4ac4f54619fb5aa40a6d"}},{"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":128}}}],"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/object/peel.rs"},"region":{"startLine":8}}}],"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":60}}}],"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/clone/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"605e0ccdbdc006c4786cb474c3b0319a0a32c5137b55a38c3a74d16667bb5fb9"}},{"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":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b16bf5ad0b4b697cb52f4bd0582513690c911d16988c1c39623112cfe7c3dd6"}},{"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":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c2d8d270648c174a1ed536eea6c73a801a2e1ca0266fc0a435cc53f1a6606c"}},{"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":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f769be6db07660e56ba9108ad1a0823e327a6396f5e06249037254a71e9cf28"}},{"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: 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":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1454d96f78d680c8a75c40a71664a15c66f20f6d007bfa6d3cd7bc156c708ae0"}},{"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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba2e98d88b2b8b6ff9064ea4cc8baac9d05e7461e67a0b7d049d535467d9064"}},{"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":132}}}],"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":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"675369fd390063c9544fe507926aec810e5ce7fc07a51d9d5b4c96f95c48510c"}},{"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":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6b2ab52512a0bdcf69882eefc226cfd6ee6b1a8bfc32b4c32da252147c8636"}},{"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":378}}}],"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":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc29037ac04804324aa3c1707aaa9946ccfa94f747bac588a035e15a8833a05"}},{"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":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997db8e9cbbb6002abb95119f488ed94141062c192d6879b42f4274e5b4fb47"}},{"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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ebdea4552922bc4b26ead75a708a4e7915f017442c0abb29bab0ce8e58aff"}},{"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":115}}}],"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":561}}}],"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":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80dd99afc5e160f69d1caf0a79b688c5ac949ee4508d4e2355a1f14947f1893"}},{"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: 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":50}}}],"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":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa484a2c88f85d6107de450469f29e29c10fbd00688663ad735837975da51684"}},{"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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88c73ef34716cb8f513568c0f33d4ae89a4bd155c7e1289b8c187cee378996"}},{"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":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5341804f256dbda5e185cfd12cea9a72e0aa134627a6d894b53ccc27b1cb0098"}},{"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":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"891dbab657d0fc6afe855cb38863b061c35c5579d12025e3004ea11ae1f5c587"}},{"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":604}}}],"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":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"01567338d228e2ff64eebafc4ca35ece23fe0b2847a6010e921d4afab5cde8f1"}},{"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: 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(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(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: 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":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"da630488b61ba9691e48b3570439f9728ef1d39cf77de7e978f27fab89bc5b76"}},{"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":190}}}],"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":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b11a6a76532c08aaba8414bfa7b6e186d150c3678b90c530a8038467b2699c"}},{"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(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":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"374593a2bd88457ab4c44ef814a40d666596320ac67f935f84d345e111db0570"}},{"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":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"830c257479f7defbf57434d53ce63606cd6e5903e01441bb31080fa01eff4054"}},{"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":289}}}],"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":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3de807e6599d881462421dd069b0ba6647089d3e2504503d6459c2833330ad"}},{"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":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b7ce1d57fa5f434612714640d0bc5b4b087fbad6da2100c98a7c4b27836e81"}},{"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":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c1d7cf1af5bd9604658118a64ee65a32e4abaee8caed466cdbdc0fda74ca8c"}},{"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":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12d29f7b4954ba18627d08d20023a0727a16d5dd516e90568529a7c9cc58564"}},{"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":166}}}],"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":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc48b424a79dbb12b13e927ae106ee136ea53e92a9f765a74a0a98098be49838"}},{"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":142}}}],"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":143}}}],"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":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b182881cc4f30c6519f7c99bc0a34f113e3da9c07b46dbfc17a53a39ae075e6"}},{"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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c236d70f79eda85dbd093a9582cd0a414fdd950bc6086e56155e9a062e16d8c"}},{"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: 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 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":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3045ae7ba34a588abdb33f145e7b2958fad2569108dce86bce75e30797a046d9"}},{"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: 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: 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":13}}}],"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":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17132b033a2b382c8d6b3838499cdd2e591f10f91c9f4b6588199281f51ebc1"}},{"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":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a87599377eb0cf5a23187ae51fb72e047964cb62afb0836a776084c5156ff"}},{"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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ccba9d18be0d6232045e4856e358d1c16a1ad6241a36baa8dec3b5fe776aa6"}},{"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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9725a45974e6a23b20be3db474e48b1c7c52f2080b723eab54a3fbff8729a7"}},{"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":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c361bea8b278fa7fae046a02720d9a0942b4d63f937b302fe0b4b81fb0b24"}},{"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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"709d2ca7dbf7e310f761fe0373b53345903816551b30c2c3d5e62237fa468308"}},{"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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"030dbad3690ab83f26d79d167946cf4f87184dcf9c7535b9bc09e56ec40b8b89"}},{"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":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f14dd1737edc709d4ce2d7cca336daa7dcc87c36e9b06e849f502cbac6a86fc"}},{"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":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"763922863a638e69334b46596f2d8a2221d2ee2cd84d8acd18eb67e5c3a52e67"}},{"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":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"10701b61a4ec7312678ebae1b6854938c1b309802b39beb57b71a92e806f6c0c"}},{"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. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 4 of 70 project(s) overshoot their size bounds, lowering Project Cohesion to 8.9/10. The most over is \u0060gix-tix\u0060 (87612 LoC, 47 module-visible types across 12 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5954fbcc1b79d94642fc79190de871b2ef5079235c5fdeaba5259fd5059be3e3"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c14919ef3ec61e6e7d808810e0a27f33a5a61fa6d9dc913eb4a6489a4a641ccc"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"97de2d9afba19ac7d5526d587e8aa29754fd1ff1c9caccbe9740917d4dd5ff14"},"properties":{"dependency":{"package":"async-std","version":"1.13.2","advisory":"RUSTSEC-2025-0052","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.1","advisory":"RUSTSEC-2026-0441","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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 781 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 781 of the 1054 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":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-utils/src/btoi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc15dc3dfbeb2dfdaeb5662fe74fbb84d96725b8f9839f797bce3575032570d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-index/src/entry/stat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f86352d85b22b0de3634576f66d8798e6ae09448de4a6916df545632bb6f81"}},{"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 73% of the time (8 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) \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 (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: 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 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; \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 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 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-actor/src/signature/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5db3d19349e2500534be3adb3e3b298d3374ffaf093b47ceacc5977a5ce63b4"}},{"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 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/tree/ref_iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45acc87e3f635f52d4e6c0ac1f6f457ee1d9537e8a96be1847317667a57670f9"}},{"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 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; \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 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 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; \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 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 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; \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 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 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 (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: 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 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) \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 (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":"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 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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":"c8d527bdd9326f98c219f9375cd1b0f1002928f96707f01f2cb739b77bb57319"}},{"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 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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; \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: 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 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 5 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":"warning","message":{"text":"Change coupling: body.rs \u2194 decode.rs: \u0060gix-object/src/commit/message/body.rs\u0060 and \u0060gix-object/src/commit/message/decode.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \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":"d5f4425599fcaf36977cb624a7717791108648bae3ebbf9771525f213d0640f2"}},{"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 50% of the time (8 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 8 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 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 7 shared commits counted here, the most recent 3 are \u0060f7cbe279\u0060 feat(gix-credentials)!: support negotiated HTTP helper credentials (#\u2026; \u0060d0360639\u0060 change(gix-credentials)!: migrate errors to gix-error; \u00607496ef16\u0060 feat(gix-credentials)!: support HTTP challenges in credential context\u2026 \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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"Animation without a prefers-reduced-motion guard: \u0060::view-transition-new(__bespoke_marp_transition_osc__)\u0060 moves (\u0060animation-name: __bespoke_marp_transition_osc__\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd8b629d7904cc36380ee7d449300261f4720eb1a27f8dc64c77f3c89a3d800"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060svg.bespoke-marp-slide.bespoke-marp-active.bespoke-marp-active-ready *\u0060 moves (\u0060animation-name: __bespoke_marp__\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fd56a37e0316fa6f8d222148a4ecebcb3a7b68b7c320b7c19b648eeaf5a2ea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060body[data-bespoke-view=\u0022\u0022] .bespoke-marp-parent\u003E.bespoke-marp-osc\u003Ebutton\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"etc/speak/gitmerge-2024.marp.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"276dc394a17613f23b49af1f5fca9cfdbecfb182ff23029a3b62d152348adf6d"}},{"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":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060gix_diff.blob.unified_diff.impls\u0060 is marked as implementation by its own namespace, folder or name: \u0060UnifiedDiff\u0060 (gix-diff/src/blob/unified_diff/impls.rs:11, \u0060impls\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-diff/src/blob/unified_diff/impls.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1923980aeb2c7a6170256ebdf1c5ba9c1039e9425c9b17083b2c95559a561f"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 3 public types in \u0060gix_error.exn.impls\u0060 are marked as implementation by their own namespace, folder or name: \u0060Exn\u0060 (gix-error/src/exn/impls.rs:115, \u0060impls\u0060), \u0060Frame\u0060 (gix-error/src/exn/impls.rs:524, \u0060impls\u0060), \u0060Untyped\u0060 (gix-error/src/exn/impls.rs:884, \u0060impls\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-error/src/exn/impls.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c44e923b8a2e637181d5b6b75a38ac4965e1133ad2df90f267b4db8685b18"}},{"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"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!head.is_detached() \u0026\u0026 head.id().map(gix::Id::detach) == Some(target)\u0060 appears character-identically in 2 files \u2014 gix-tix/src/command/enrich.rs, gix-tix/src/command/reword.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/command/enrich.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dca5f466b8351aec4536a6b1e2520719fa6cfae0ec508e95edc293deac0083c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060graph.is_in_edit_scope(commit_id) \u0026\u0026 !graph.is_read_only(commit_id)\u0060 appears character-identically in 2 files \u2014 gix-tix/src/edit/review.rs, gix-tix/src/edit/transplant/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/review.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e82e6e026404215e5f2fe524293766a50c3827b47f29ff3847678aad800eb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060read \u003C input.len() \u0026\u0026 output.len() - written \u003E= 4\u0060 appears character-identically in 2 files \u2014 gix-encoding/src/fast.rs, gix-encoding/src/legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-encoding/src/fast.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff14759cdee2110a7f1d8374874e5ca5f318e2d2fd87ac8e3135271a272c3ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060worktree_repo.workdir().is_none() \u0026\u0026 worktree_repo.is_bare()\u0060 appears character-identically in 2 files \u2014 gix-tix/src/edit/rebase.rs, gix-tix/src/edit/undo.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/edit/rebase.rs"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39b2533a3b53e896cdeaf3ff6922de3125b92978095c7ac68ea7e55dc7ae11a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003C bounds.x || x \u003E= bounds.right() || y \u003C bounds.y || y \u003E= bounds.bottom()\u0060 appears character-identically in 2 files \u2014 gix-tix/src/ref_tree.rs, gix-tix/src/ui.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/ref_tree.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8ecb6da809485dbbd0547e731e1915dde77b62d1f70623e2690bff9c8a1966"}},{"ruleId":"X21","level":"warning","message":{"text":"Pattern guard mutates state while matching: The \u0060if\u0060 guard on line 3270 (\u0060ref_tree::Input::PinReferences { .. } | ref_tree::Input::ResolveRemoteReferences(_) | ref_tree::Input::DeleteLocalBranches { .. } | ref_tree::Input::DeleteRemoteReferences { .. } if { pending_rebase_conflict.is_some() || pending_todo_rebase_conflict.is_some() || { dirty |= refresh_rebase_session(\u0026mut app, \u0026repository_path, repository_is_bare); app.rebase_continuation_pending() } } =\u003E\u0060) changes \u0060dirty\u0060 with \u0060dirty |= \u2026\u0060 while the \u0060match\u0060 is deciding whether that arm applies. Rust tests a guard during PATTERN MATCHING \u2014 after the arm\u0027s pattern has matched and before the arm is chosen, going on to the next arm when it is false \u2014 so the change lands whenever this arm is merely TESTED, whether or not it is then chosen, and never once an earlier arm has matched. And \u0060||\u0060 can skip it, so it does not happen at all whenever what decides first already answers the guard. The accounting therefore depends on evaluation order and on how many arms the subject was tested against, not on any statement a reader can point at: a counter kept this way misses exactly the path the deciding operand rules out, so it cannot reach a limit it is checked against on that path. Move the change out of the guard \u2014 leave it reading only (\u0060if dirty \u002B 1 \u003E= limit\u0060) and put the assignment in the arm\u0027s BODY, where it runs precisely when the arm is chosen, or hoist it above the \u0060match\u0060 if it must happen for every subject."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-tix/src/lib.rs"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac0fbcee013dcbe2384d8a016383e90b8756882a04f9eb3ed19c82cff75682f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060config_paths_from_executable\u0060 turns every \u0060Err\u0060 into \u0060ConfigPaths::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gix-path/src/env/git/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"344ca0d3f6c47e920e348bb339b60a4b6670b05d640fb204c68146a4710197b9"}}],"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":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":18,"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."]}]}