{"$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":"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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"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":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"App::update_inner (cyclomatic 173): App::update_inner has cyclomatic complexity 173 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/ui/app.rs holds 5 of the 32 functions over the threshold \u2014 including the worst \u2014 and 297 of the 696 points over it (43%), 5.4\u00D7 the next-largest file (src/runtime.rs at 55). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a7c3dfd9923745ac8457f68976e0fb0331f9d367d3d0b2738510a1efb3195"}},{"ruleId":"D1","level":"warning","message":{"text":"App::key (cyclomatic 117): App::key has cyclomatic complexity 117 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/ui/app.rs holds 5 of the 32 functions over the threshold \u2014 including the worst \u2014 and 297 of the 696 points over it (43%), 5.4\u00D7 the next-largest file (src/runtime.rs at 55). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d34c416c67cf95167dfca50583d13f2673c41d47e53f8fde1dfad70c037b3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::runtime::run_interactive (cyclomatic 57): gitgui::runtime::run_interactive has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"357617bd01aad75cac96517b738442d9471d066dc83bb10259760bc39ff2593e"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::modal::view (cyclomatic 56): gitgui::ui::modal::view has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/modal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d19c2ce865c00721ae64d6ac5e2fe6b40bc78192a526a887d575011e6e8c0e"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::highlight::tokenize (cyclomatic 55): gitgui::ui::highlight::tokenize 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":"src/ui/highlight.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8abd40941f3218c895c24f51148d5da3fabaed8d81099cd20c31db121d94fb"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::git::ops::write_op (cyclomatic 50): gitgui::git::ops::write_op has cyclomatic complexity 50 (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/git/ops.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"f872d1d5878f6f2e73f126201e7f5fe4c49c9fa38745c8ee1e58c3507eee2449"}},{"ruleId":"D1","level":"warning","message":{"text":"DiffView::draw (cyclomatic 41): DiffView::draw 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":"src/ui/diff.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f88796c172a1b906dc2ce96678625c596cd0b48018ff05bc1d28924f3d5210"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply (cyclomatic 38): App::apply 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/ui/app.rs holds 5 of the 32 functions over the threshold \u2014 including the worst \u2014 and 297 of the 696 points over it (43%), 5.4\u00D7 the next-largest file (src/runtime.rs at 55). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"c863909bc8769f12c17afe5cef598f25c92d41e448f25ff456f2b4c802e6de1e"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::menu::items (cyclomatic 36): gitgui::ui::menu::items has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/menu.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d26ce1c5f699680abe48615f1a3882d76ca51e7fdce4557a58fbd7e97747c03"}},{"ruleId":"D1","level":"warning","message":{"text":"DiffView::update (cyclomatic 33): DiffView::update has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4819389fc9a87589a2216e33004816d29cf8e621f8ad859b6ca00aa1c3b400"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::cli::parse (cyclomatic 33): gitgui::cli::parse has cyclomatic complexity 33 (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/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f127fb14f738d219fa324f8f06e2a498c37771e4be9024de9329c4a2a3bd6e92"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::git::ops::spawn (cyclomatic 32): gitgui::git::ops::spawn has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Command::label (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c545befad952c788efc55adf9d6467439f56d9b650e0a3afdd5cff9f8453511d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::step_csi (cyclomatic 31): Parser::step_csi has cyclomatic complexity 31 (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/term/input.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"73498f5605ab654c2b8ddafc7d443632f7bf5a658daf16648f285720e87280ea"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::runtime::run_headless (cyclomatic 28): gitgui::runtime::run_headless has cyclomatic complexity 28 (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/runtime.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1763ab6bb47724df3b9b487d6e06358b5315fecd25ac7b0f7c209231f44962ee"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::changes::worktree (cyclomatic 28): gitgui::ui::changes::worktree has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/changes.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfbcb5bdc52b4443fd70d5af33230f0f8bdde9db32f622a13d0e4f8cfdf9308"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::sidebar::view (cyclomatic 27): gitgui::ui::sidebar::view has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/sidebar.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2d114de01f0b0967d9b866bba79590bb80a8405a7bbe6233bf4fa8a86499a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::step (cyclomatic 26): Parser::step 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. This is NOT this file\u0027s highest cyclomatic complexity: Key::from_codepoint (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/input.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d072f8854a4e69a4b035f39d404507622935c76e9a83dc54daa912026a05f2"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::git::actions::partial_patch (cyclomatic 26): gitgui::git::actions::partial_patch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/actions.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dece107f75dfe40031be80cb8f7b446f002f3d8d4b643cca5b1386dcc23ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"LogView::update (cyclomatic 25): LogView::update has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/log.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da146409b7406db1dc010050d1c6f100075d87ebc7c7a48fcfc4b7283304ec0"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::main (cyclomatic 24): gitgui::main 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":"src/main.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c0122401cc79b4cf6d489f722392323989b2294922998b64d563ac715b404a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::modal_confirm (cyclomatic 23): App::modal_confirm 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/ui/app.rs holds 5 of the 32 functions over the threshold \u2014 including the worst \u2014 and 297 of the 696 points over it (43%), 5.4\u00D7 the next-largest file (src/runtime.rs at 55). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdb6d117dc3cff31ad85979dc0c572d7c7cd4ba16501a663614b3c061d91918"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::term::probe::parse_replies (cyclomatic 22): gitgui::term::probe::parse_replies has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/probe.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d367167ff0e293ad196c52935f85341d191e1c0b891f52f184a8692fccde832"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::diff::view (cyclomatic 22): gitgui::ui::diff::view has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0299f880ddfac9d7ecb747d2032fac599a66914ee053ff8074c6dfe151f28d"}},{"ruleId":"D1","level":"warning","message":{"text":"Repo::diff (cyclomatic 21): Repo::diff has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ddb63d2c546e26c412a9cb21e0fa5944867c3ad8e0058a6943d034687876d"}},{"ruleId":"D1","level":"warning","message":{"text":"App::commit_action (cyclomatic 21): App::commit_action 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/ui/app.rs holds 5 of the 32 functions over the threshold \u2014 including the worst \u2014 and 297 of the 696 points over it (43%), 5.4\u00D7 the next-largest file (src/runtime.rs at 55). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2e0f4ec46cef68b8e3bb7624e55b63a5d21ce01e2569d3ea38b9ebe79f6de8"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeView::draw (cyclomatic 20): MergeView::draw has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/merge.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"774d2091c41529f4f16dd59566b873ad185a8eab5f8909d997b2a2b47f43d37b"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::editor::view (cyclomatic 20): gitgui::ui::editor::view 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":"src/ui/editor.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cf76b2052c5648ebcf8abfff94131179adeccb68afa05ead084564413e3890"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::footer::view (cyclomatic 19): gitgui::ui::footer::view has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/footer.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"13871d37fd70e3a858ee3de65019cbed7016c3edbdca51b15e10397a4d4184e0"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::ui::merge::parse (cyclomatic 19): gitgui::ui::merge::parse has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/merge.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1e07bdfe29b5dec7de7fe5e7f23ba7e6bf75cd03dcdf928eb8655e3fc07102"}},{"ruleId":"D1","level":"warning","message":{"text":"Shell::frame (cyclomatic 18): Shell::frame has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gitgui::shell::iced_key (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"41882f48f238b268bc63684ea4e3727ce11cadb650a868c9aff61abc9c9ccac8"}},{"ruleId":"D1","level":"warning","message":{"text":"gitgui::agent::handle_in_app (cyclomatic 18): gitgui::agent::handle_in_app 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":"src/agent.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec40e46e6e350d1ffc50c1d2583e4cdc757d67e7cbf901c16a1d91ac434275f"}},{"ruleId":"D1","level":"warning","message":{"text":"Repo::status (cyclomatic 17): Repo::status has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"458beec161071acd866c651802ff49af43fc07b432102f0c7b33c93ac9112a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::runtime::run_interactive (cognitive 147): gitgui::runtime::run_interactive has cognitive complexity 147 (threshold 15). Drivers by points: if/else 37 (106 pts), loops 8 (21 pts), match/switch 8 (18 pts), boolean chains 2 (nesting depth added 92). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbcf6e2dc54bed3a927e6fcd1b9a893990bfe2e4bf1d17c35c98979f452e239"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffView::draw (cognitive 131): DiffView::draw has cognitive complexity 131 (threshold 15). Drivers by points: if/else 36 (101 pts), match/switch 5 (16 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e839339a07fcf7ce06ad440e1ad292052d9818075129238bcb4ffec2ab985e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update_inner (cognitive 115): App::update_inner has cognitive complexity 115 (threshold 15). Drivers by points: if/else 44 (93 pts), match/switch 8 (14 pts), boolean chains 8 (nesting depth added 55). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e8d5af3d95b6da6903ea8c2aa0722abff69dc65196d95261aa5480880cb245"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::highlight::tokenize (cognitive 105): gitgui::ui::highlight::tokenize has cognitive complexity 105 (threshold 15). Drivers by points: if/else 26 (61 pts), boolean chains 21, loops 6 (18 pts), match/switch 1 (5 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/highlight.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d43114d974b24bc4e22a5da80f8243fe4618928b6d1d7d08431ec758695cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"App::key (cognitive 99): App::key has cognitive complexity 99 (threshold 15). Drivers by points: if/else 40 (79 pts), match/switch 9 (14 pts), boolean chains 6 (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":"src/ui/app.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4faa2659388c429fa62ff919f77cdbb6dc58cd8343107cd5ca185981e09f73"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffView::update (cognitive 69): DiffView::update has cognitive complexity 69 (threshold 15). Drivers by points: if/else 23 (58 pts), match/switch 3 (6 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc1b4d26640e9271ba80fef2a0383d01917677a67069ad52cfd68fdb1206ad"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply (cognitive 68): App::apply has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (54 pts), match/switch 6 (12 pts), boolean chains 2 (nesting depth added 39). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74e4e8db49a2eb62f675f3f9ffd6caabecdf91106346fcbd007dc2063c806d7"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::menu::items (cognitive 64): gitgui::ui::menu::items has cognitive complexity 64 (threshold 15). Drivers by points: if/else 35 (57 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"src/ui/menu.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c33ffe9a01575acf4dbb4d55c003a8b315900c4f6ec16afcb19e2137fa5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::modal::view (cognitive 62): gitgui::ui::modal::view has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (47 pts), match/switch 4 (6 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/modal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5942548e5178b8e66e9eb81cca3fcbeeecd51932afd1e3ae6070b2ac61433de"}},{"ruleId":"D2","level":"warning","message":{"text":"LogView::update (cognitive 59): LogView::update has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (51 pts), match/switch 3 (8 pts) (nesting depth added 38). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/log.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb5081cd3517048f7cf4f8e81fdb51ad4fc5d6f82163c9d6fc54047490a4277"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::merge::parse (cognitive 45): gitgui::ui::merge::parse has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 1 (5 pts), loops 2 (4 pts), boolean chains 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":"src/ui/merge.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6feee6f4553a8ee15a789b9c781a9a12db17087e2b078a5e23d4be953318f9f"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeView::draw (cognitive 39): MergeView::draw has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (9 pts), match/switch 3 (9 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":"src/ui/merge.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb3a3b6e990be1cee2d65ea23917b5886c500c19e6e202a790950f19caba6b5"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::term::probe::parse_replies (cognitive 38): gitgui::term::probe::parse_replies has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 3 (11 pts), boolean chains 1, 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":"src/term/probe.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a62b0c33657ce5055e6b9ad91ba84fc289667abe2989714801a92b26d7ca99"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::diff::view (cognitive 38): gitgui::ui::diff::view has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (28 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab8c4e325c2baaf68c4af6c71f426815914f6771d512dbab2047a126dd81a7"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::sidebar::view (cognitive 37): gitgui::ui::sidebar::view has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 7, loops 5 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/sidebar.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1fce3f1acee6d2fec3c773ec5262c88650970c4fe7ab3f8838dff66c6e8bda"}},{"ruleId":"D2","level":"warning","message":{"text":"Repo::diff (cognitive 36): Repo::diff has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"402323fc4efae38847f53279190b402f6866982b2290932512bf1af509ed9a77"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::footer::view (cognitive 35): gitgui::ui::footer::view has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 2 (6 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":"src/ui/footer.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1a9927a623c82b78a3ae1f8424bc994706228a442e69d84ab9136046ad986d"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::cli::parse (cognitive 31): gitgui::cli::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc59330f4b27901665d33dede890ee8c2c377c3b6226daa580a4f25ba47c005"}},{"ruleId":"D2","level":"warning","message":{"text":"LogView::draw (cognitive 28): LogView::draw has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts), match/switch 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":"src/ui/log.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"171fe4198068e50d01473a8229512be609a543497414b4138ef7a111096d6aef"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeView::update (cognitive 28): MergeView::update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/merge.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec86c1a04595676d1e4122c4e1b7576cab543e0b724149d5f129f6cd667126c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Shell::frame (cognitive 27): Shell::frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c09d549959dd5e20d364f1748dbd83cfaf4864ed541416897a88486019fea6"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::main (cognitive 27): gitgui::main has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 11 (19 pts), if/else 6, boolean chains 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":"src/main.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285c0b710e9a8591f29ac6b62ad5bb1c8927bc84a37ab35d4b5199ecef7a19e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::changes::worktree (cognitive 26): gitgui::ui::changes::worktree has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (9 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/changes.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"451d02d139fdb427351c9a2af539943641acbf215dd2b2021f388bdae44f0c00"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::highlight::tokenize_html (cognitive 26): gitgui::ui::highlight::tokenize_html has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/highlight.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77999344f3a7f68b23b9da64967789414c46f3286d6260f5f812e733abcedf4"}},{"ruleId":"D2","level":"warning","message":{"text":"Repo::status (cognitive 25): Repo::status has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40a2ef8c71f3493b3ab5d937076d6eb262e5cfb2bd383dfb27069b37f61bb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::ops::spawn (cognitive 24): gitgui::git::ops::spawn has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (10 pts), boolean chains 2, loops 1 (nesting depth added 11). 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/git/ops.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8a6dc259a9727baa1e2fc02a180c72a3a902b36b9455fc8095f833001c1a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Repo::branches (cognitive 22): Repo::branches has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (7 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":"src/git/repo.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f99ee40ef09bfd8406dace31544aa9ad369eeb89e2510f61491025902c5d926"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::step (cognitive 22): Parser::step has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/input.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b98b75c3839be00cf202de18ae97c849d4dfe7c09eb98c8ee89b788740e0c92"}},{"ruleId":"D2","level":"warning","message":{"text":"App::field_undo (cognitive 22): App::field_undo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (22 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50be1df552965313d36562a3fc1887384380994be5d4d492afdee8f509aca7"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::agent::resolve_socket (cognitive 22): gitgui::agent::resolve_socket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbbf4cf162f097f91fc10832460f9c211c007a82a6f9045c3ea4f7f534d9476"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::actions::partial_patch (cognitive 22): gitgui::git::actions::partial_patch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, match/switch 2 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/actions.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce58100e67e6e3ce3f37f6cf74dd4b3c23dfacab6b6f30c1105b95b834dac41a"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::ai::clean_output (cognitive 22): gitgui::git::ai::clean_output has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 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":"src/git/ai.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f97ed2df2153d216c9db700f3404b384f5c787c1df611b6c67babac5861895f"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::runtime::run_headless (cognitive 22): gitgui::runtime::run_headless has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f0080d5c9b9f6ad74e46287a76770c51e818683ed4c72d391314be446ceb04"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::highlight::tokenize_line (cognitive 22): gitgui::ui::highlight::tokenize_line has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/highlight.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4111b9b6f76434e9863b77106b731b2ad65b15f41e4a9bdd3b93be7637cf53"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::runtime::run_dump_input (cognitive 21): gitgui::runtime::run_dump_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3b5bab80a43b0d74a7112e373da9b199d8cb4efdb62a935f30da585a474a1"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::repo::conflict_view (cognitive 20): gitgui::git::repo::conflict_view has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 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":"src/git/repo.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9939cdbce591eb5b26bd98bc0a2be8e348e73ac75305fe65cda2a11e31207fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::term::input::parse_kitty_key (cognitive 20): gitgui::term::input::parse_kitty_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/input.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c207d38893faf8cc24354282d696c9b0747219708bb0271ef1a640eb790d4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::graph::layout (cognitive 19): gitgui::git::graph::layout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/graph.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9880de206b2d6fd814bad6d055e9dc69fe311ed540b4da3e7fd58951620602"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::term::probe::probe (cognitive 19): gitgui::term::probe::probe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/probe.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf4feebb37e4af062b68e75a999361082c7e6f02b8b7335c33640b8f1c0acf8"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::editor::view (cognitive 19): gitgui::ui::editor::view has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/editor.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"532430dfbfed3e8163a678b2b1a0980f8afa1b9a065fbfd60e90dfbf35873a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::menu::view (cognitive 19): gitgui::ui::menu::view has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/menu.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"510a95de431cd1331e8465457a56ce9adf6b6ea69df8bdd9fa286425833be53d"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::ops::run_git_cli (cognitive 18): gitgui::git::ops::run_git_cli has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gitgui::git::ops::run_gh_cli) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"9349706faef14a4a01e0d71f6f66238678f6ab49d53c181ca4ac5cf47d349c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::git::ops::run_gh_cli (cognitive 18): gitgui::git::ops::run_gh_cli has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gitgui::git::ops::run_git_cli) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7a6010b700afb9971ec6218c87e7d6bdd9a541023fadbee06aa002aef96e83"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::drain (cognitive 17): Parser::drain has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/input.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e69d44d387c2d55fcd7b8753866ab434c6ef5e9b0fabf08b62d4864fdd0814"}},{"ruleId":"D2","level":"warning","message":{"text":"App::commit_action (cognitive 17): App::commit_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb86674aabe37645594a4642fa9fa68e5f168e914dbb7acbf08534df7cfacb76"}},{"ruleId":"D2","level":"warning","message":{"text":"App::modal_confirm (cognitive 17): App::modal_confirm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"7945e641d1baf17f697bb7fa8c8897a60df4f4990749dd322772ee3a9560c871"}},{"ruleId":"D2","level":"warning","message":{"text":"gitgui::ui::log::draw_graph_row (cognitive 17): gitgui::ui::log::draw_graph_row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/log.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1ec65877ea9bb93303efb2e829aa413fd376250f87b532fa631c7ee11011ab"}},{"ruleId":"D2","level":"warning","message":{"text":"App::diff_selected_text (cognitive 16): App::diff_selected_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a605dec32cb23b49c78027ed45684df035ce221195cb5b06519a3e7d375c677a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 1919 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 100 methods, 2 blocks, lines 560-3265. The bar is 400 significant lines; this is 1519 over it, 4.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e79c8e11c29ee815d526eebe0d41676aadb5b93f9422e5a972dd1ba0b3806be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/app.rs: FileTooLong \u2014 2344 significant 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 82% of them inside a single declaration: App (2 blocks, 560-3265). The bar is 500 significant lines; this is 1844 over it, 4.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9710c8852ab1c6348a3d4f38834cdc17278f590d0c2f471262799565102a8b9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.update_inner: MethodTooLong \u2014 update_inner runs 360 significant 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 260 over it, 3.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":"src/ui/app.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfb0f71dd4d986f46acf9692f855865b424fea2ea2bbffb44a3b9014b6c229c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 100 methods. The bar is 30 methods; this is 70 over it, 3.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04da2cb9db4f78d8d48508e0eee2199e20892e1e0e1d3f6f67630e24f113440"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::ui::menu::items: FunctionTooLong \u2014 gitgui::ui::menu::items runs 274 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 174 over it, 2.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/menu.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc0a2359aa894855e465e0315042557eabb36daf6fe4fd0ab119a0f0eecef4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::ui::modal::view: FunctionTooLong \u2014 gitgui::ui::modal::view 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":"src/ui/modal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6ebde943f42c71427dc354476ad14ea9a5ce648a0772260a43081804cbf93f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 79 stored fields beside 100 methods. The bar is 30 stored fields; this is 49 over it, 2.63\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfb48f618912c508d3c0278c59635ed1efb80286ed773c6c8ff11c4023be43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Repo: TooManyMethods \u2014 74 methods, declared across 2 files: git/repo.rs (44), git/actions.rs (30). The bar is 30 methods; this is 44 over it, 2.47\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":"src/git/repo.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65321a6b91203e427551b175e0687c81ad7613f22e40472e1d8a91dedfcff64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::runtime::run_interactive: FunctionTooLong \u2014 gitgui::runtime::run_interactive runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ebcfc53106d6e130d611d45716843a710fc6a572c9ced026e42e94d6bc089c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/repo.rs: FileTooLong \u2014 1053 significant 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 73% of them inside a single declaration: Repo (2 blocks, 288-1312). The bar is 500 significant lines; this is 553 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8f1ce69dde02db4b50674085427e02f34847e5e75297804981e5243366a3ac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Repo: ClassTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 74 methods, 2 blocks, lines 288-1312. The bar is 400 significant lines; this is 373 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81449a85fc82de4367f88c1cc5f0dafa97d86ae04e0fd87504d5e4a2a6a8862"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.key: MethodTooLong \u2014 key runs 183 significant 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 83 over it, 1.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":"src/ui/app.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1bedb9400d0566aec9752cca3be67b2eea46be273954d2d78c4dadac8ef3c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::git::ops::write_op: FunctionTooLong \u2014 gitgui::git::ops::write_op runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e51f67a796731b2e0b4a9d130ee76b3325a64575c7f58ceb6cc5969b9e93242"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::git::ops::spawn: FunctionTooLong \u2014 gitgui::git::ops::spawn runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36949a7e9549823858c97999ee7c00d1ec57aa43e84a006e5f7c2c726c687db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: git/ops.rs: FileTooLong \u2014 834 significant 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 334 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7804d15047da55d0cd8efe6ccdcedaa893c84c01458b311cf8f01055f53d7b3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiffView.draw: MethodTooLong \u2014 draw runs 166 significant 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 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf312989af2d6922f2c0822908aa99f6ebcb0d94b465b4dee9ad8c6df8d1cf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::ui::diff::view: FunctionTooLong \u2014 gitgui::ui::diff::view 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":"src/ui/diff.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51348bf4e6e6ac8f62c99de4a482b136a09b1280ade623e996fb39ed45af190"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::ui::sidebar::view: FunctionTooLong \u2014 gitgui::ui::sidebar::view runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/sidebar.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d88b697d81d28d8bccaa118b2fc325ada689523a3183f4ef9baa35f7424659"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::ui::highlight::tokenize: FunctionTooLong \u2014 gitgui::ui::highlight::tokenize 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":"src/ui/highlight.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e00a6a08ada3a74223946b4497093494caf865bb4b95aa411f36379fa9e2989"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply: MethodTooLong \u2014 apply runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a443146c973fab7c257f9031cfe4cc85624b0fd1ad1dfa298a185162dd24257b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/highlight.rs: FileTooLong \u2014 586 significant 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 86 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/highlight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1b8bc613eb3259f9fd21dea8b569ee956827d7430c74c7c0eda5ab768bb626"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/diff.rs: FileTooLong \u2014 579 significant 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 60% of them inside a single declaration: DiffView (3 blocks, 253-778). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2800a040f572a8d6f383dd6bcb4db8204398d687837657a1cad044e8ef0a302a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gitgui::ui::changes::worktree: FunctionTooLong \u2014 gitgui::ui::changes::worktree runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/changes.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"270d15b15015856ba863f35bfd57104876966b007f1ded5c61f1cb2b93b0bef3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogView.draw: MethodTooLong \u2014 draw runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/log.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad28ba247746fd5ebdd00cbd7f8c2eea8de9d8a761d7057e67c071f63c545d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.new: MethodTooLong \u2014 new 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":"src/ui/app.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"7168ad5250e6d601a7b6bed1e7b64aac24052098f5e2c6852c8ee2842a532dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lang.rules: MethodTooLong \u2014 rules 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":"src/ui/highlight.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6054510931e838e894145a59fd5328acb2a32ee6eea3874e84802de2b909ec3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/widgets.rs: FileTooLong \u2014 540 significant 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 40 over it, 1.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":"src/ui/widgets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"486e7f811e57a38b1c5e84fb85ff73d5097621b4e0dac76ddd0015a857d1751a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): src/git/ops.rs:964-1023 | src/git/ops.rs:1053-1109 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/git/ops.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb68b5754f68901e652e0696ec57501bae6fb2e20cd7a1e9b627e4fb55919ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/ui/widgets.rs:54-83 | src/ui/widgets.rs:86-114 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f11c47f89d4560e794ac8168f920fc95443a9f3a7b8aea3d37fdf2994a922a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/git/actions.rs:146-166 | src/git/actions.rs:169-190 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/actions.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daeadc07dc8ae93ae7543d3fb721d71455d1c18e155ad776dd8ec304b7db4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/ui/widgets.rs:355-384 | src/ui/widgets.rs:399-423 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa1d175df91e0eb986177c80136a5bee40e1012abde03c4f45939db5f947b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/ui/app.rs:2259-2274 | src/ui/app.rs:2276-2290 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40461301598cfd2c145ccffc188fa4869a14ba5bab7dc83650d9e865a30fa24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/git/actions.rs:468-474 | src/git/actions.rs:477-483 | src/git/actions.rs:487-497 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/actions.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72d91932259c3faa4cce005796340b40d0b35ea62afb15242fb5fc9781f20b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/ui/log.rs:471-489 | src/ui/log.rs:542-555 \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/ui/log.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d22bf1fd7852e74b1a561210fa8f80f8abf0beae412cdef537f5e7344864e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/ui/widgets.rs:34-41 | src/ui/widgets.rs:44-51 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"303b1ed391ef28e0a5d13d38aae089bc10c423afc284a5253fd0f51243dd8c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/git/repo.rs:295-303 | src/git/repo.rs:306-313 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"775b2710a9e30167978c60a2d881670ac06cbca5fd92b6c45432b7dff2eb8f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/ui/vsplit.rs:352-365 | src/ui/log.rs:433-446 \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/ui/vsplit.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac2616b2feccd63bdd6b267296c79d86d202ba74eb4760f1aac7577f1b7de7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): src/ui/theme.rs:46-82 | src/ui/theme.rs:85-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/theme.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea166728030cd865feadbd2e305788f83f6e6de29c8e9a9c552a056aa9ab4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 2): src/git/ops.rs:978-1014 | src/git/ops.rs:1065-1100 \u2014 both copies are in the same file, so extract the block 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/git/ops.rs:978\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/git/ops.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de90a57cb51af63b8847a0ecad6d6f0197785f26575a4eb047a9248bfa132a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/git/repo.rs:680-699 | src/git/repo.rs:719-738 \u2014 both copies are in the same file, so extract the block 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/git/repo.rs:680\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1342198b28c1ba6fff92c05309c4831a943feab9e0cd1c723915005e9c8af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/cli.rs:71-85 | src/cli.rs:109-123 | src/cli.rs:136-150 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli.rs:71\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0657505e0244f45237bfc7b203982c185e65c0c63fc80f0fa9566f231b4be86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/ui/diff.rs:470-484 | src/ui/merge.rs:440-454 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/diff.rs:470\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, \u0060src/ui/merge.rs:439\u0060 calls \u0060geometry\u0060 and \u0060src/ui/diff.rs:469\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"83378b1c9f69f09c851ad7bd5b26d0aefe42647553b7d61f19755a17f73fb164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/ui/diff.rs:765-777 | src/ui/merge.rs:601-613 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/diff.rs:765\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb2345f6f744cfd4b06c6788368cca0d13a8bc68339b04a791963beb9c61eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/ui/widgets.rs:366-377 | src/ui/widgets.rs:409-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/widgets.rs:366\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060status\u0060 to \u0060iced_widget::text_input::Status\u0060 in one and \u0060iced_widget::text_editor::Status\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"de82a73782e6a65d3250011b78d2e284bd6d43258b3d9d25c3adb1f9ebdb3817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/ui/highlight.rs:352-361 | src/ui/highlight.rs:564-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/ui/highlight.rs:362\u0060 calls \u0060is_ascii_alphabetic\u0060, \u0060is_ascii_alphanumeric\u0060 and \u0060src/ui/highlight.rs:574\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/highlight.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fa1a1f46ba05454720aa2a4d76743235da9a1b9e99570b92df546986bb7324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/ui/app.rs:2260-2268 | src/ui/app.rs:2277-2285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f85033aa3f072b3181b0a8251bfeaba7931cbfd36d5f1ae9a40c2684e148e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/ui/widgets.rs:357-364 | src/ui/widgets.rs:401-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/widgets.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d782a08d46d417b45affff9fd31d5e58dc519cc5276b84f5209c261d536f28d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/ui/app.rs:3226-3233 | src/ui/app.rs:3257-3264 \u2014 both copies are in the same file, so extract the block 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/ui/app.rs:3226\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":3226}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d1dbf65e3842d5c737b5dc66ba90beb7e1d097767cfd713c999acb37a61d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ui/footer.rs:61-67 | src/ui/sidebar.rs:44-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/footer.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/footer.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e45eb6264231a60e6ec07181995a2f79b45617583d49a029658e3722f5041a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ui/widgets.rs:719-725 | src/ui/widgets.rs:729-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eaa3ad6ed9dee7dc544d96ae25d4bb71426c96f6400a33035b6a5acfab4c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/ui/highlight.rs:629-639 | src/ui/highlight.rs:641-652 \u2014 both copies are in the same file, so extract the block 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/ui/highlight.rs:641\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/highlight.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dba5fd5e3e583565d51105ee2867ec5a0e59f490e61e02fba2396483158db37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ui/widgets.rs:35-41 | src/ui/widgets.rs:45-51 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbeb9b13992db98319b4f23f646d5506de8c4eaae2abee1ad9b967c592b299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ui/modal.rs:82-88 | src/ui/modal.rs:201-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 \u0060src/ui/modal.rs:82\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/modal.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cccbf2424b52aebb697679b243eba5bdaec247f31bb9a755de0afe67f75295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/split.rs:143-148 | src/split.rs:318-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/split.rs:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/split.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7c6d7bd5fd4a270ebb651630407e8af97b191fe2d58300ec2c61f5dbe57b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/ui/widgets.rs:55-59 | src/ui/widgets.rs:87-91 \u2014 both copies are in the same file, so extract the block 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/ui/widgets.rs:55\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/ui/widgets.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e580f3404b08c4afc21ae9d8e62d0f938b7f4879003cdbd2a4e90f5c8912f38"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/agent.rs: 33.1% line coverage (96/290)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e168e3340c98a09b8638396842b1440e8b750d26b87faf88f3c6fc63039dc9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/git/ops.rs: 49.6% line coverage (334/673). 3 more line(s) were executed in some of the 3 runs of the suite and not in others, so they are not counted as covered."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfd8f4c6f1809a988d5afea77fa749f55c19276ed0a5ba9e3364f53c00cf995"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 0.0% line coverage (0/101)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/runtime.rs: 6.7% line coverage (33/493)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33237c0ee647f7db2dbb56e7d58fdc4fcd2cac40119c53abdbc1199055327c6c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/split.rs: 30.3% line coverage (72/238)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/split.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12fa453832e8d740c6d9af1fd1ff4e23873fc9b40f842e163dbd022eae19194"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/term/mod.rs: 6.6% line coverage (10/151)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5214cd20caf5a1b2df9d5678191f2de0138dfec593493a6c2037a5569f3554"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/term/probe.rs: 47.3% line coverage (112/237)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70584275531da75a5309df83c6fde3d978ada56666f8cb7579c86222c32933a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/ui/app.rs: 49.4% line coverage (1158/2342)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b8f34352e649fca1887c0dcb8f63d61a272fcd704bff3d6c3d355c8f2ca23b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/ui/footer.rs: 46.8% line coverage (66/141)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/footer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cf024214c142527a3ffaf3b7b343f257df782a94316a7596c6e9a2dde1fcf9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/ui/help.rs: 0.0% line coverage (0/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93de6affaf4076774ea56d676106b05b16778be5e9e21acbfca704680b6071c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/ui/menu.rs: 0.0% line coverage (0/350)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/menu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b7907a0e6745ae1645355b2eb630011c943c024a576e910dac1dce316f367c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/ui/merge.rs: 37.1% line coverage (164/442)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a2a51548d5605f480dd29ec79c7623f42c1964764f6522594d104b43c122b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/ui/modal.rs: 32.1% line coverage (94/293)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/modal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eaaf89762c18edcfb221c8decbbfe58400df871e2c4e568bd79c1459a6455a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/update.rs: 31.8% line coverage (42/132)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9da2c5b737c6d7f0ba0cbfa5127cca7ac3852675f64cd901f2a39f205fad2b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/window.rs: 0.0% line coverage (0/131)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7f2a3c4bdffbcfd58b2e5219cb3eadd93931a9b4118efa6e0d5ccae124e7b7"}},{"ruleId":"D8","level":"note","message":{"text":"Tests reach code only in some runs: src/git/ops.rs: 3 line(s) (388-390) were executed in some of the 3 runs of the suite and not in others. A test that does not take the same path every run only tests the part it always takes, so these lines are not counted as covered. Make the tests that reach them deterministic (a fixed clock, seed or ordering, or waiting on the event instead of on time), or test the paths directly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0915c297df23f10213d734e243e6abf77467534ab61b90f233083b8bfb430f"}},{"ruleId":"D8","level":"note","message":{"text":"Tests reach code only in some runs: src/git/repo.rs: 1 line(s) (354) were executed in some of the 3 runs of the suite and not in others. A test that does not take the same path every run only tests the part it always takes, so these lines are not counted as covered. Make the tests that reach them deterministic (a fixed clock, seed or ordering, or waiting on the event instead of on time), or test the paths directly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed958055365a8e693465e8c6e67e3519d2a94620cab04145ef6763de4200422a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/app.rs: src/ui/app.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 173 in App::update_inner at line 2307. 2 of those changes were fix/bug commits, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/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":"src/ui/app.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceb87c04fbb7cc8ad3126b2247fa8474357ea6cbde6f3f057f1fedd3a45ca9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/runtime.rs: src/runtime.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in gitgui::runtime::run_interactive at line 350. 2 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7412f65f67a1f5c652109c136149c1d7806ec01c09232463ceefb7e1fd31d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/diff.rs: src/ui/diff.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in DiffView::draw at line 575. 2 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/diff.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/ui/diff.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"efafad0a51512336ab7086b74423680c5b1e5990c8d52617aa51c62ed8293db3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/changes.rs: src/ui/changes.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in gitgui::ui::changes::worktree at line 98. 3 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/changes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/ui/changes.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c8696b62a0317c755a7596497d5184c14ca1a60fad4c8d3b02950c42e16499"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/git/ops.rs: src/git/ops.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in gitgui::git::ops::write_op at line 719. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/git/ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/git/ops.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"df39ec7887ac779eee5a0edda19ad8c14bf59fac30b7e98b8d773fc3c6ececda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/sidebar.rs: src/ui/sidebar.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gitgui::ui::sidebar::view at line 14. 1 of those changes was a fix/bug commit, 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-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/sidebar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/ui/sidebar.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c447861fc9e3ed16870f49af048228e2bd39d72127d4c7fdf3240e09e972f7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli.rs: src/cli.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in gitgui::cli::parse at line 64. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"344c7030d79234e68ae6632d76eb368a0e485c478a1b4c7f5dd052125763e7c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main.rs: src/main.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in gitgui::main at line 38. 1 of those changes was a fix/bug commit, 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-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4bd697ce412d5d6af59543f06e4a0481b7a56e4bd52631de4c8462fa4ed51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/log.rs: src/ui/log.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LogView::update at line 173. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/log.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/ui/log.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"726dc84b0770aa09841b5cd8621816d06bb55614dc67b112e236d816a47ad07a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/modal.rs: src/ui/modal.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in gitgui::ui::modal::view 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-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/modal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/ui/modal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc868102d801d98ee354f1192a43f32243025480ed74717eccbd58941cd1f8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/git/repo.rs: src/git/repo.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Repo::diff at line 826. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/git/repo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/git/repo.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f45c3126df8c4addbfa3356166b0a274f038b091d3baba7ce87b7f8660c8841"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/editor.rs: src/ui/editor.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in gitgui::ui::editor::view 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-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/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":"src/ui/editor.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dd7547de2f2c94dd9d56eb1e8ab96dfe8d631191b9177893a12ecaa70835a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shell.rs: src/shell.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Shell::frame at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d104af0f407200b8f3b1e72ae3f006dbd2f5fb4927b9a27cad07ae09ee39c207"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/footer.rs: src/ui/footer.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in gitgui::ui::footer::view at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/ui/footer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/ui/footer.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4bcc865148703b4f2d955b796dea56d5ce149acb343a6d7462f3062c491b52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agent.rs: src/agent.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in gitgui::agent::handle_in_app at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/agent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/agent.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd179c200afe6686359e681ea6b2749e99cc8024177369650b88407fcb903bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/term/probe.rs: src/term/probe.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in gitgui::term::probe::parse_replies at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-13..2026-09-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-13 08:54:40 \u002B00:00\u0027 --until=\u00272026-09-11 08:54:40 \u002B00:00\u0027 --full-history --no-merges -- src/term/probe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/term/probe.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ed8f200382c31f1b5efca4277823f6bb22f7e1341231bde3c9b7a614805fa"}},{"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 \u0060src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9269d57ae2d0fdd9d36822295cd584b0a25a4bc0ab67d0b10f33f28c4e6b88"}},{"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":"7eae8a2d0eea63207780a0886f1a23aec8bcd6d91e8ed6ac677b7b94d5733b21"},"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":"51dcabf4e03ca17e98458aa5a64f2d2cf46094369b421ffb6452660dbd7e26ab"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"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":"925a1751e8d41c7a13a4890cf62f333e20e1b9979e60753140251f2431b1053b"},"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":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"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":"49c16b6fbc91670e61b639ab9c9270b4df42b6b11889eae216a02e4dd9c52b80"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"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":"c60ddfa9ff4321aee1b89dfac95d9c978236ee4622a6c2eb51d2a9dfd910ec4c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.31","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.16.4","advisory":"RUSTSEC-2026-0253","severity":"medium","fixedVersion":"0.18.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4b242fff2a4af12e0854e43eb6cba1d0e6de8cc9271a11c6139a7fa2c9c0451"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060unused\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f40c38399bafe0319e6b0e5ab910a079108e2a407804acaaba856d43e29be4c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060unused\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/log.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0e6605d489f7c13011394bb759afea6174f8481a8eef18bcee5157eac42640"}},{"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":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Cargo.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f1258ac0739cd1e0a2e83a9aae67bcefcf633d7f90f15ee6eb51c19cdb530"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(mods.control() || mods.command()) \u0026\u0026 c.as_str() == \u0022y\u0022\u0060 appears character-identically in 3 files \u2014 src/ui/changes.rs, src/ui/editor.rs, src/ui/modal.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/changes.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ef805f0efe646612090d08e18133c7787826f1c03caa679f318ceaa3b9ed46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(mods.control() || mods.command()) \u0026\u0026 c.as_str() == \u0022z\u0022\u0060 appears character-identically in 3 files \u2014 src/ui/changes.rs, src/ui/editor.rs, src/ui/modal.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/changes.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6e0ecbea8c9afd66b9dd71327cb496f33f11f3809bddd31b4dfe833d79c271"}},{"ruleId":"X13","level":"warning","message":{"text":"Redirected process stream is never drained (deadlock): This \u0060Command\u0060 pipes stderr (\u0060Stdio::piped()\u0060), and \u0060status()\u0060 then waits for the child holding that pipe. \u0060wait()\u0060 closes only stdin before it waits: a piped stdout or stderr stays open and unread, so once the child writes more than the pipe holds (64 KB on Linux; measured: 200 KB hangs every time) it blocks on the write, never exits, and the wait never returns. Nothing fails loudly: the thread hangs and the stuck child holds its resources until something kills it. Use \u0060wait_with_output()\u0060 (or \u0060output()\u0060 on the \u0060Command\u0060), which reads both pipes while it waits, read the pipe on another thread before waiting, or stop piping what you do not read \u2014 \u0060Stdio::inherit()\u0060 or \u0060Stdio::null()\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/split.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2824e7add3052d90d8af91d1c11d70e29df288d52227e60a0a4ec599cfac8df9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060update\u0060 is public and takes \u0060msg: Message\u0060 from its caller, and it recurses at line 2296 through \u0060update_inner\u0060 and back with a piece of the document (and at line 2658) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060update\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"848a025a69ddaa5efaf5f5d2e2a8fc170b3103ebd00bc378c92420e233ec78bd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Persisted.version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/state.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ece2c3db39d5c9513da795cde464ba8ba21ce1f34e5faa6f7f702ea8b8688d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026json!({\u0022ok\u0022:true,\u0022data\u0022:data}))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ok\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887ba0b403649883e3c13a17bd694bab49b54401d7688ef742c3aebbb5e7e6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026json!({\u0022ok\u0022:false,\u0022error\u0022:msg.into()}))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060err\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"639565660b7594f857d8fe51116f82015e9931c5db913d2dd06a677b9556fe5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060class\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/macos.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"466b52a7373f13b0d99ccb344d6c1f4195082ad6f9de5fbc484a3e20f99ab0e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/macos.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa6f15c6a3e2a684a822f7f4a0199deccd0b919616d433c74e0f3c56cbf7d65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022stdin\u0022.into()).spawn(move||{let mut buf=[0u8;4096];loop{match term::read_timeout(\u0026mut buf,Duration::from_secs(3600)){Ok(0)=\u003Econtinue,Ok(n)=\u003E{if tx.send(wrap(buf[..n].to_vec())).is_err(){break;}}Err(_)=\u003Ebreak,}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_stdin_thread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57f2f6709e3c71d8d9b869b6424f0404f4256499dd8f433d1903285977d4d86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022agent-bridge\u0022.into()).spawn(move||{while let Ok(job)=agent_job_rx.recv(){if agent_bridge.send(Msg::Agent(job)).is_err(){break;}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_interactive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f288743ab8d16c52360773f13248ab1b5bb199b89ebe2af80516f116d76e012d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022agent-bridge\u0022.into()).spawn(move||{while let Ok(job)=job_rx.recv(){if tx.unbounded_send(External::Agent(job)).is_err(){break;}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060boot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/window.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7249f7bee99a20e27034223018a7b92d141035c8f2c23c9301c11afe6e66df44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.queued_ops.pop_front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060settle_queued_op\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed03b0ffbc1f1fe9a1aac92bb3b94f6d14d19f23ee548f3d753db8fe2545e79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060offs.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060row_at_y\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/diff.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d79c982ed0ad273f9e352bcd171f30d0b33cb700442f85b83b7d3c1f9e43e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060enc.write_all(rgba)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode_direct_place\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/kitty.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b6df6f26a87c9f0217fee341e9781f26457cb92294ec2bbfeb4dfe92cdc82e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060enc.finish()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode_direct_place\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/kitty.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"929468433d7ae79321ede4b3076b8c7eb55acfff16619a44e2a860bf0028bbd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shm_name\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/term/kitty.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"63061f4bf21e4163f929055f601ad539dd6cde2a566b65f9ff42f350d451fc5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060truncate_diff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ai.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea0c8b82cf2ef42c256726b5fbfcc04efd898b6a00bb081e871348207dba362"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdin.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ai.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6369c5bcda9bf2b3f318263d1d09152a137ba83555540318df22d72c77d7e9ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ai.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"812736675be3ed766595ae13e4511be0d202fbb58c8a64a9c3ba321e2d62ffba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ai.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"58929736594fb9262e951c9cf8531d293e76cc7bf956720585fba3098f9db16b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1a5c485f448bb37c615fe81e6388efc3df485c65525fc15cf50e87632d0134"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81f9f5696d0d72611739bca7208c2a7b532aff5b3d535d212e6dfb5e4bf0f42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f503773a4ee93760053bc2efd3b608ab0e23d01bae6d17a38ba8f3920a1d1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00b9b7fdabf6bc942ac5f820e4c0087b225ea326f5b75b97342cf378d383ea9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420cba8fc222295fcdae1b235ed42418758332409080415df82fa00893e9e1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ca554ffd81d1070a3116888c311a12eac47f2aa52510c6031950b576f26b42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"28708cc47518c202e01d6da04a90b8621dfaa8f5bd560c398bba48a561ba799d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f3a5cd830a93a2d0f6623599afc2ee4e2a3817dc4aa25bfccb30fbf14c3049"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9bee4c0c7708ad6e6fdd1d5a3a8131c976cae098cc9af0a7b4403f5a0feb8d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022ai\u0022.into()).spawn(move||{reply(Reply::Suggestion(ai::run(\u0026workdir,\u0026tool.command,\u0026prompt,ai::TIMEOUT)));})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ca88462056f31a9abe8f67fd1a3b5d681f0ce3a700e28bcc172ff8c64e9a08"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e325f240238f02358c265d6c0464dc412ea9f3fe52ec5c405f0235cc1e680aa8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64a4bf6c09df17bd83c1a153f54b1f2301b591411fd11c348f5f33fc723f919"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a90b27fed5afa83c788938cf3b5321c8bf52cedb0852178e1f287cb84f2ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"056de4c540fc2be62491d8c5a9a15c8dc4c6a3647b47ec29b6ffa2f09ecc6d91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb7f4baf05ff5d82b8a4889e2a351f3cebb034b35c4c0b165e4981f6ebac51f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022git\u0022.into()).spawn(move||{let reply=Arc::new(reply);let mut repo:Option\u003CRepo\u003E=match Repo::open(\u0026path){Ok(r)=\u003ESome(r),Err(GitError::NotARepository(_))=\u003E{reply(Reply::NoRepo(path.clone()));None}Err(e)=\u003E{reply(Reply::Error(e.to_string()));None}};let mut workdir=repo.as_ref().map(|r|r.workdir().to_path_buf()).unwrap_or_else(||path.clone());let mut limit=COMMIT_LIMIT;let mut diff_opts=DiffOpts::default();let(mut stamp,mut work_fp)=repo.as_ref().map(refresh_tracking).unwrap_or_default();let send_snapshot=|repo:\u0026mut Repo,limit:usize|-\u003EOption\u003CArc\u003CRepoSnapshot\u003E\u003E{match repo.snapshot(limit){Ok(s)=\u003E{reply(Reply::Snapshot(s.clone()));Some(s)}Err(e)=\u003E{reply(Reply::Error(e.to_string()));None}}};if let Some(r)=repo.as_mut(){send_snapshot(r,limit);}loop{match rx.recv_timeout(POLL_INTERVAL){Ok(Command::Quit)|Err(mpsc::RecvTimeoutError::Disconnected)=\u003Ebreak,Ok(Command::Open(new_path))=\u003E{path=new_path;match Repo::open(\u0026path){Ok(r)=\u003E{repo=Some(r);limit=COMMIT_LIMIT;let r=repo.as_mut().expect(\u0022just opened\u0022);workdir=r.workdir().to_path_buf();(stamp,work_fp)=refresh_tracking(r);send_snapshot(r,limit);}Err(GitError::NotARepository(_))=\u003E{repo=None;workdir=path.clone();reply(Reply::NoRepo(path.clone()));}Err(e)=\u003E{repo=None;workdir=path.clone();reply(Reply::Error(e.to_string()));}}}Ok(Command::InitRepo)=\u003E{if repo.is_some(){reply(Reply::Op{label:\u0022init\u0022,result:Ok(\u0022already a git repository\u0022.into()),});continue;}match Repo::init(\u0026path){Ok(r)=\u003E{repo=Some(r);limit=COMMIT_LIMIT;(stamp,work_fp)=refresh_tracking(repo.as_ref().expect(\u0022just opened\u0022));send_snapshot(repo.as_mut().expect(\u0022just opened\u0022),limit);reply(Reply::Op{label:\u0022init\u0022,result:Ok(\u0022initialized git repository\u0022.into()),});}Err(e)=\u003E{reply(Reply::Op{label:\u0022init\u0022,result:Err(e.to_string()),});}}}Ok(Command::Refresh)if repo.is_some()=\u003E{let r=repo.as_mut().expect(\u0022checked\u0022);send_snapshot(r,limit);(stamp,work_fp)=refresh_tracking(r);}Ok(Command::LoadMore(n))if repo.is_some()=\u003E{limit=n;let r=repo.as_mut().expect(\u0022checked\u0022);send_snapshot(r,limit);(stamp,work_fp)=refresh_tracking(r);}Ok(Command::SetDiffOpts(o))=\u003Ediff_opts=o,Ok(Command::LoadDiff(target))if repo.is_some()=\u003E{reply(Reply::Diff(repo.as_ref().expect(\u0022checked\u0022).diff(\u0026target,diff_opts),));}Ok(Command::LoadCommitFiles(oid))if repo.is_some()=\u003E{reply(Reply::CommitFiles(oid,repo.as_ref().expect(\u0022checked\u0022).commit_files(oid),));}Ok(Command::ListDir(dir))if repo.is_some()=\u003E{let r=repo.as_ref().expect(\u0022checked\u0022).list_dir(\u0026dir);reply(Reply::DirEntries(dir,r));}Ok(Command::Focus(_))=\u003E{}Ok(Command::SuggestMessage{amend})if repo.is_some()=\u003E{let r=repo.as_ref().expect(\u0022checked\u0022);match suggest_job(r,amend){Ok((tool,prompt))=\u003E{let reply=reply.clone();let workdir=workdir.clone();std::thread::Builder::new().name(\u0022ai\u0022.into()).spawn(move||{reply(Reply::Suggestion(ai::run(\u0026workdir,\u0026tool.command,\u0026prompt,ai::TIMEOUT)));}).expect(\u0022spawn ai thread\u0022);}Err(e)=\u003Ereply(Reply::Suggestion(Err(e))),}}Ok(Command::CommitAndPush{message,amend})if repo.is_some()=\u003E{let r=repo.as_mut().expect(\u0022checked\u0022);let commit_result=write_op(r,Command::Commit{message,amend,},diff_opts,).map_err(|e|e.to_string());let commit_ok=commit_result.is_ok();reply(Reply::Op{label:\u0022commit\u0022,result:commit_result,});if commit_ok{reply(Reply::NetStart(\u0022push\u0022));let args=push_args(r,false);let arg_refs:Vec\u003C\u0026str\u003E=args.iter().map(String::as_str).collect();let push_result=run_git_cli(\u0026workdir,\u0026arg_refs,\u0026[],\u0026*reply);reply(Reply::Op{label:\u0022push\u0022,result:push_result,});}send_snapshot(r,limit);(stamp,work_fp)=refresh_tracking(r);}Ok(Command::PublishGithub{name,description,private,})if repo.is_some()=\u003E{reply(Reply::NetStart(\u0022publish\u0022));let args=gh_repo_create_args(\u0026name,\u0026description,private);let arg_refs:Vec\u003C\u0026str\u003E=args.iter().map(String::as_str).collect();let result=run_gh_cli(\u0026workdir,\u0026arg_refs,\u0026*reply);reply(Reply::Op{label:\u0022publish\u0022,result,});let r=repo.as_mut().expect(\u0022checked\u0022);send_snapshot(r,limit);(stamp,work_fp)=refresh_tracking(r);}Ok(cmd)if cmd.is_network()\u0026\u0026repo.is_some()=\u003E{let r=repo.as_mut().expect(\u0022checked\u0022);let label=cmd.label();reply(Reply::NetStart(label));let(args,envs)=cli_args(r,\u0026cmd);let arg_refs:Vec\u003C\u0026str\u003E=args.iter().map(String::as_str).collect();let result=run_git_cli(\u0026workdir,\u0026arg_refs,\u0026envs,\u0026*reply);reply(Reply::Op{label,result});send_snapshot(r,limit);(stamp,work_fp)=refresh_tracking(r);}Ok(cmd)if repo.is_some()=\u003E{let r=repo.as_mut().expect(\u0022checked\u0022);let label=cmd.label();let result=write_op(r,cmd,diff_opts).map_err(|e|e.to_string());reply(Reply::Op{label,result});send_snapshot(r,limit);(stamp,work_fp)=refresh_tracking(r);}Ok(_)=\u003Ereply(Reply::Error(\u0022not a git repository\u0022.into())),Err(mpsc::RecvTimeoutError::Timeout)if repo.is_some()=\u003E{let r=repo.as_mut().expect(\u0022checked\u0022);let(new_stamp,new_fp)=refresh_tracking(r);if new_stamp!=stamp||new_fp!=work_fp{stamp=new_stamp;work_fp=new_fp;send_snapshot(r,limit);}}Err(mpsc::RecvTimeoutError::Timeout)=\u003E{}}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ae9d4bab559fe742e31274cb0b78a90ceeefe356659a5a4de8acad7f4fc493"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_git_cli\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e9905b87e4c497d1f0dc92adfcb2de23d96c837d45659ed8b0e14dc3eb896d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_git_cli\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"56df18fa403fd780aca51f58f811af1eba84e0d508056a535911dc416056618b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_gh_cli\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8788bed3a9637487ec66f6f9c5d89af922d709133b7db1c4728829ef31e85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_gh_cli\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ops.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca6befa78659e1c8cc5b22e7dd6664eceb483a56492ffd6ed8b1072d11e0b2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diff.get_delta(idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060diff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72e7cf008aab5839b31df93f10e7bc6c98873828f7c5d8912eea89f096d5172"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recent_subjects\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/repo.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1d9cbb897fda5bf6bf1b29efd4fcd1a1c4c67c833f25cda628c26428f2b5cb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cmux_bin\u0060 turns every \u0060Err\u0060 into \u0060\u0022cmux\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/split.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89d1a7b864a9c1ee8ee2df0f4dc62ea8ffc6ae68808d900053f3aaa25e46ab4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_subfolders\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/app.rs"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f4957e71bd281e257cb6fe864448e9aa06acc32bd0c0b582b46f86d2cc9057"}}],"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-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-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-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-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":"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-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":23,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}