{"$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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"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":"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":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"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":"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":"PanelState::on_internal_generic (cyclomatic 118): PanelState::on_internal_generic has cyclomatic complexity 118 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/app/panel_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"187d6fdb03f52dc053ca1a56ff2230fea56c324340810ca0219977011af56499"}},{"ruleId":"D1","level":"warning","message":{"text":"StyleMaps::create (cyclomatic 83): StyleMaps::create has cyclomatic complexity 83 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/style_map.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be31f1c422b10362437f78f791b06ffe6f6d33ce6f860ba6c847b0013387fcb"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_command (cyclomatic 70): App::apply_command has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/app/app.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"129dd4506069eee8fc627125957038a8dc58d46fa0ef731fec9f8f47d8502a62"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserState::on_internal (cyclomatic 69): BrowserState::on_internal has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/browser/browser_state.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b935e01749655a972a4412d26411e970816a733b611fee67fc5c746ba058e3"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayableTree::write_on (cyclomatic 36): DisplayableTree::write_on 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/display/displayable_tree.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f94d7a6a613461a8dd03e363b405add57d265c21b0882a61f2021c3dcfd55b"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemState::display (cyclomatic 36): FilesystemState::display 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/filesystems/filesystems_state.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e31a2df3dde772704aed4383ccacd851016ac6080f6e53f9aac446f9e353819"}},{"ruleId":"D1","level":"warning","message":{"text":"TextView::display (cyclomatic 33): TextView::display 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/syntactic/text_view.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab81da10919a0a881bd5d196e8065b1823c754dd5b38c36a15e519dfa2633da0"}},{"ruleId":"D1","level":"warning","message":{"text":"HexView::display (cyclomatic 32): HexView::display has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hex/hex_view.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ace040fa8b21b418d101ebecb73c2984fad383243d85797f650c431d203e07"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeOptions::apply_launch_args (cyclomatic 31): TreeOptions::apply_launch_args has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree_options.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbbf8cd1e8497fb73a2db47da88ba99b2f043e1a0443c5b7a407c7b26eb32d4"}},{"ruleId":"D1","level":"warning","message":{"text":"PreviewState::on_internal (cyclomatic 30): PreviewState::on_internal has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview_state.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc0a6739ca323d9b482567cdb8b139a55d1b2e772a63d2b77a61557e0742587"}},{"ruleId":"D1","level":"warning","message":{"text":"DirSummer::compute_dir_sum (cyclomatic 29): DirSummer::compute_dir_sum has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/file_sum/sum_computation.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3c46a801aa6a1972fbaac520d7366d1b871315806590f24bccb64861c6407"}},{"ruleId":"D1","level":"warning","message":{"text":"TrashState::display (cyclomatic 27): TrashState::display 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/trash/trash_state.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"004b70aac59f28e908b9eaa56f892b8094b0bd08b56116ba572df2801ebbce7f"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeBuilder::gather_lines (cyclomatic 27): TreeBuilder::gather_lines 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/tree_build/builder.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a92116f5196989f9709042b4d52008726b377891f18e9240c96f95f886b883"}},{"ruleId":"D1","level":"warning","message":{"text":"VerbStore::add_from_conf (cyclomatic 27): VerbStore::add_from_conf 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/verb/verb_store.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2268bebbcef81682eae299670cb90908f27d9a1806dc5edb2c584f468d13bc6b"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedDiffView::display (cyclomatic 25): UnifiedDiffView::display 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/preview/unified_diff_view.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"87409e442534dd4e2508f59c537558ab7626157c37d6cc0f6d058da9b3d2b1dd"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run (cyclomatic 24): App::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"385f7e47ad0da93e58c3bd0a89345b64346bf957498be77df2716005a943b3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandParts::from (cyclomatic 24): CommandParts::from 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/command/parts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"28420794545fb71511c11e7a26b9b84af2861ae3fc3cd18aec0b17f7ca71b27d"}},{"ruleId":"D1","level":"warning","message":{"text":"Areas::compute_areas (cyclomatic 24): Areas::compute_areas has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/areas.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa0b97374464c188b2ee10bff9a1e611ff9bff666b0825898f5dc9b8c903500"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree::after_lines_changed (cyclomatic 24): Tree::after_lines_changed has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f18bf837cc189d9affc68d7d8549f7acd1aadc23cbb2f80c639ce30185f85"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardStatusBuilder::status (cyclomatic 23): StandardStatusBuilder::status has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25c85045447d71cca2ab2d61714fc67b148a21f1c14536cfed7b130f7b38eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"PanelInput::on_key (cyclomatic 23): PanelInput::on_key has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/panel_input.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"650e8f8f9f2d30e4448828bb932effae4d44b5b85083423609c5aeccb67455bb"}},{"ruleId":"D1","level":"warning","message":{"text":"TrashState::on_internal (cyclomatic 23): TrashState::on_internal has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_state.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d4d25c9b17ecc8b53ab5ecb2191fc9b7cc1064e027fd99b220e40fd4b41af5"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemState::on_internal (cyclomatic 22): FilesystemState::on_internal 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/filesystems/filesystems_state.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ae81c003648719132d643802b9ec8dc6554e2b3e69bd23734af3f74bfb6062"}},{"ruleId":"D1","level":"warning","message":{"text":"StageState::display (cyclomatic 22): StageState::display 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/stage/stage_state.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"216ad6f296d6f6cfd6c72583ec094f1a7ad45343e8b533522e89657fb7fc6e79"}},{"ruleId":"D1","level":"warning","message":{"text":"TextView::read_lines (cyclomatic 22): TextView::read_lines 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/syntactic/text_view.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8659f75fc37a802a1a430876190d8ffafdb01e5732c7bc2d5840709ce1bfe23"}},{"ruleId":"D1","level":"warning","message":{"text":"PanelInput::handle_input_related_internal (cyclomatic 21): PanelInput::handle_input_related_internal has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/panel_input.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac66da02cc73080bc6a886f761fb6bee6168a980f9e5fac9806145603d8e7546"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeBuilder::make_bline (cyclomatic 21): TreeBuilder::make_bline 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/tree_build/builder.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2ae9cfbe5c2216cdf07328e5abfe8dff29a059e839a2fb765d25963cb92e88"}},{"ruleId":"D1","level":"warning","message":{"text":"broot::cli::run (cyclomatic 20): broot::cli::run has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f6909dfe73ed78b2d6f3b75e99d8a80c05d7c32050a95fdebf148c7e5cc7a8"}},{"ruleId":"D1","level":"warning","message":{"text":"MountSpaceDisplay::write (cyclomatic 19): MountSpaceDisplay::write 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/filesystems/mount_space_display.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3882b7454b407b4d95fa0b8fb1d017f5198fcf3d6fa9d76f0c0dec7dd0dcfb19"}},{"ruleId":"D1","level":"warning","message":{"text":"FuzzyPattern::tight_match_from_index (cyclomatic 19): FuzzyPattern::tight_match_from_index 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/pattern/fuzzy_pattern.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d7a461757e84f7004eb729efaed2e511ff6c184f337cf0ee1dcfd0546276ec"}},{"ruleId":"D1","level":"warning","message":{"text":"StageState::on_internal (cyclomatic 19): StageState::on_internal has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage_state.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29c9942894a0f78e8b967a22e8ece68c7aa08e6a60610de90272a7f84fddbf4"}},{"ruleId":"D1","level":"warning","message":{"text":"VerbStore::search (cyclomatic 19): VerbStore::search 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/verb/verb_store.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd115d8bb7fbe8b5fa60a9d8343130dc02dae0e7e90fa235f21b60085d32e915"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchModeMapEntry::parse (cyclomatic 17): SearchModeMapEntry::parse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/search_mode.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edd08d4b24938462386cea9abc50d3e9b57aef94831399bf445f2fb65dfded2"}},{"ruleId":"D1","level":"warning","message":{"text":"broot::kitty::detect_support::detect_kitty_graphics_protocol_display (cyclomatic 17): broot::kitty::detect_support::detect_kitty_graphics_protocol_display 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/kitty/detect_support.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70db9cf9ddfbd66fedafb4df2fd6d5a2abccdb439565392d5e9f080a4d0edbd"}},{"ruleId":"D1","level":"warning","message":{"text":"PermWriter::write_mode (cyclomatic 16): PermWriter::write_mode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/permissions.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bfc476c11917cdf7a7d97d9451a807afbb3f47f35207dd7c44e05004e06cbd"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceImage::fitting (cyclomatic 16): SourceImage::fitting has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/source_image.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb24cf59fb1e94645e41078af80f886a59207b898b4d1f42ad08e6db6c5d32a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Launchable::execute (cyclomatic 16): Launchable::execute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/launchable.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"854a734438db55b6716f02f039d89d07b6a0034e224c37acd8e1a3b4bd2b4b50"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::new (cyclomatic 16): Server::new has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/net/server.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bce0552412ef1e907b4e8d14c78c4a58e67fbc0514d3570e57a651de4971e23"}},{"ruleId":"D1","level":"warning","message":{"text":"VerbInvocation::from (cyclomatic 16): VerbInvocation::from has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/verb_invocation.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7660b4b56b3eb6f364fdf7360504be89c6422d8ed9a4caecc40297a3093bae4"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelState::on_internal_generic (cognitive 124): PanelState::on_internal_generic has cognitive complexity 124 (threshold 15). Drivers by points: if/else 65 (101 pts), match/switch 8 (17 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 47). 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/app/panel_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"041da6e38b3b5e5fe3874d2c4588d97db22d8e3a64810d8531ced313fb96f4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"TextView::display (cognitive 118): TextView::display has cognitive complexity 118 (threshold 15). Drivers by points: if/else 33 (91 pts), loops 4 (14 pts), match/switch 2 (7 pts), boolean chains 6 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/syntactic/text_view.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"3592522b8e9f39144e9be17229917475530bc924c644263495816644b52252df"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_command (cognitive 116): App::apply_command has cognitive complexity 116 (threshold 15). Drivers by points: if/else 48 (105 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 63). 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/app/app.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4de3b5e3162f1df1eb9c5c2e3f323464b77c440ab08bf32b2e3dc4b5d7ad15"}},{"ruleId":"D2","level":"warning","message":{"text":"DirSummer::compute_dir_sum (cognitive 102): DirSummer::compute_dir_sum has cognitive complexity 102 (threshold 15). Drivers by points: if/else 24 (88 pts), loops 5 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 71). 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/file_sum/sum_computation.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6953f089b1860bf3eaa5fec55a6406f0b55c85f832746039d6b5c2e0f21709"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemState::display (cognitive 88): FilesystemState::display has cognitive complexity 88 (threshold 15). Drivers by points: if/else 40 (84 pts), boolean chains 3, loops 1 (nesting depth added 44). 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/filesystems/filesystems_state.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccd74be06890f23b435a02f53479845dcbac31216e9065f743e034bec22950f"}},{"ruleId":"D2","level":"warning","message":{"text":"Areas::compute_areas (cognitive 84): Areas::compute_areas has cognitive complexity 84 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 6 (24 pts), match/switch 2 (5 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/areas.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66d1998733b200306efaea1dc409b3ce0a0f821a105fdf8fcf76ee61fb933cf"}},{"ruleId":"D2","level":"warning","message":{"text":"StageState::display (cognitive 83): StageState::display has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (74 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage_state.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e243e6ae9810161410161497c14a1e1a0acd3c3584d4c0119d37f9bbfef0df0b"}},{"ruleId":"D2","level":"warning","message":{"text":"StyleMaps::create (cognitive 82): StyleMaps::create has cognitive complexity 82 (threshold 15). Drivers by points: if/else 82. 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/skin/style_map.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4044d70046e49a6c0f23d007abcfa3822c0afdae9ad2468577f3fc6aceb7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"TrashState::display (cognitive 77): TrashState::display has cognitive complexity 77 (threshold 15). Drivers by points: if/else 36 (71 pts), loops 4 (6 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_state.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b682a1ed6f614760210b204a1675abea3cfc2a5ce53a0416f0345f31b813bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayableTree::write_on (cognitive 74): DisplayableTree::write_on has cognitive complexity 74 (threshold 15). Drivers by points: if/else 29 (61 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3cf3ad436c98a8ad0a7dea3f4cb81620446500534c57942e2385664bf195a3"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedDiffView::display (cognitive 73): UnifiedDiffView::display has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (57 pts), match/switch 3 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/unified_diff_view.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6432beb7b2d755a7b28f332265769f1161c9aeac807648ecd88e3a06f95cee"}},{"ruleId":"D2","level":"warning","message":{"text":"HexView::display (cognitive 70): HexView::display has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (55 pts), loops 3 (8 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hex/hex_view.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f660d00598e0927420702fd41fc6cb4ec93102e83f94556b5362ae3befa9353"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserState::on_internal (cognitive 69): BrowserState::on_internal has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (51 pts), match/switch 7 (13 pts), boolean chains 5 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/browser_state.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f0ab3d788b2bf10099be61d5ceebaf283f93a08a52104b1b1bc83e1f585dac"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeBuilder::gather_lines (cognitive 67): TreeBuilder::gather_lines has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (52 pts), loops 4 (11 pts), boolean chains 4 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_build/builder.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5da0fd9a0b1f9572016f919c24a5bd568e1e80471bd8b9880a8a79ef4106276"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::after_lines_changed (cognitive 56): Tree::after_lines_changed has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 8 (13 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd05ec074ef2df6250b00cb701a01999f4295ca66e27325c16b72dfaf078b11"}},{"ruleId":"D2","level":"warning","message":{"text":"FuzzyPattern::tight_match_from_index (cognitive 50): FuzzyPattern::tight_match_from_index has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/fuzzy_pattern.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583f6cbb2276db06e69e5a9a9b14ddee9480a2c13afeff919d12cedc1465833"}},{"ruleId":"D2","level":"warning","message":{"text":"TextView::read_lines (cognitive 49): TextView::read_lines has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 5 (13 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/syntactic/text_view.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4616d26be11142da16af58baaf222bdd0dffc9fe1ac9b4fdb3f408104266e6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run (cognitive 45): App::run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445e948c330c8f37b521935bd45bbd09b7710df461111a6a003c75a4bd80621"}},{"ruleId":"D2","level":"warning","message":{"text":"VerbStore::search (cognitive 38): VerbStore::search has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (31 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/verb_store.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3230f826cffc6f5f6c81d70cb3253aecaf396b88470bacdeabf3c6f4512c5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"MountSpaceDisplay::write (cognitive 37): MountSpaceDisplay::write has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/mount_space_display.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"623bb2a37497f58ff7fecef4649101ea3088d068801f7e10fd9b2f8b2e1d71fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Launchable::execute (cognitive 37): Launchable::execute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (36 pts), match/switch 1 (nesting depth added 24). 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/launchable.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f0391146393e7b7499804cc635d3a30935e0294fc79fe5841967748ff4c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"PermWriter::write_mode (cognitive 36): PermWriter::write_mode has cognitive complexity 36 (threshold 15). Drivers by points: if/else 30 (36 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/permissions.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1654b42205e294de6d1b20aebda9fae66d692a71a0eb45169ec19e7f31137"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardStatusBuilder::status (cognitive 32): StandardStatusBuilder::status has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 3, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51072b00551bf826c6e2cc3915d945493ad440318a53967dfa05a0f8cee72da"}},{"ruleId":"D2","level":"warning","message":{"text":"VerbStore::add_from_conf (cognitive 31): VerbStore::add_from_conf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 3 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/verb_store.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1900d8692d7747a6adc7c711b6fde736f8287483ee688e7335e760cbd2016"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeBuilder::make_bline (cognitive 30): TreeBuilder::make_bline has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_build/builder.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e2b9b93318d48dce52b219ab40e45203e4e094eb46ae4a7098aa0a154963ff"}},{"ruleId":"D2","level":"warning","message":{"text":"broot::kitty::detect_support::detect_kitty_graphics_protocol_display (cognitive 30): broot::kitty::detect_support::detect_kitty_graphics_protocol_display has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kitty/detect_support.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb605d87a8f09832d2465d722976da525b0cf40a1c3429c0371c7b88fff66e"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelInput::on_key (cognitive 29): PanelInput::on_key has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/panel_input.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6198e635ebf453f3559b160f880cf8c757a4e5d62c8beb3f1bdff535a4a42db3"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeOptions::apply_launch_args (cognitive 29): TreeOptions::apply_launch_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 27, boolean chains 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree_options.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4007fc7c02d2be79814c2cff3fbf69362671d8c417dd4161a155c26faed4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"VerbInvocation::from (cognitive 29): VerbInvocation::from has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/verb_invocation.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc59ec88e636f5d38be5578c7420316f79d3485cbb92e6067690df3efd44bd7c"}},{"ruleId":"D2","level":"warning","message":{"text":"KittyImage::print_with_chunks (cognitive 28): KittyImage::print_with_chunks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kitty/image_renderer.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5c659a121e76f5ad0bc7a375fe35561ef70cacb8aebe2904e95c23b133e398"}},{"ruleId":"D2","level":"warning","message":{"text":"BLine::can_enter (cognitive 28): BLine::can_enter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_build/bline.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14a7669288b2dfce0f1e993bf043ec44049e61ca3ecb987bfd8da21d44e776"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::new (cognitive 27): Server::new has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (11 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/net/server.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebf863489907c6bbd50d2a3ec35dc03ecd9abd98d3da0c0b4e7b2243ee92535"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandParts::from (cognitive 26): CommandParts::from has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 4 (8 pts), boolean chains 5, loops 1 (nesting depth added 12). 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/command/parts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"116742926ea3ff31cb490e2502cce7ab2447c4f9c0448ca6a8be6f97442331e7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLine::draw_range_in (cognitive 26): TLine::draw_range_in has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/tline.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb326feefa73f99f67104396aed2a0c77f0bd918236d1af61068c4cb49207b0"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayableTree::write_line_label (cognitive 25): DisplayableTree::write_line_label has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f59d81fbe183409844bc1b811097153cebee4e5acb2cf4bcb50e841b55bfaa"}},{"ruleId":"D2","level":"warning","message":{"text":"broot::git::diff::hunks (cognitive 25): broot::git::diff::hunks has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/diff.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1934f8cef330528caf796b779ad81d0f802543b566233bf74ab2af9cdadef39"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchedString::queue_on (cognitive 24): MatchedString::queue_on has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/matched_string.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ebd01c6e4ab86bd26ffc8d3959dc79d2c4ed2ffe349feb7f80c652cb37894"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceImage::fitting (cognitive 24): SourceImage::fitting has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/source_image.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fa119bca685ed0034fe5cbabeafc2936b41c8305b784a527f690b53b4a3fad"}},{"ruleId":"D2","level":"warning","message":{"text":"broot::cli::run (cognitive 24): broot::cli::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"600258f2ca07ea96970e075578d3abed0602596247717b7e7ad5d9d866edf2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"TrashState::on_internal (cognitive 23): TrashState::on_internal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (7 pts) (nesting depth added 11). 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/trash/trash_state.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9353466e5343a84fd2746e55be1ac92e4fb17014ad51f70d6d79a596a1f074b1"}},{"ruleId":"D2","level":"warning","message":{"text":"TrashState::move_line (cognitive 22): TrashState::move_line has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (22 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/trash/trash_state.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bc496888ff6877eea3444216aa61abab4db0c44d0454c9361dcbd17088cc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"broot::help::help_verbs::matching_verb_rows (cognitive 22): broot::help::help_verbs::matching_verb_rows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), match/switch 1 (2 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/help/help_verbs.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf9552722b1f5516b9a3b9732355aafb9fb6944571c00d313ace56bc2519e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelState::get_status (cognitive 21): PanelState::get_status has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (4 pts), match/switch 2 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_state.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7778ffdc46e5a215102b03138bf68a819c28ea11aadf5d113080151308c9f1a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayableTree::write_branch (cognitive 21): DisplayableTree::write_branch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30b77a99e747099e416c9305d3739bf11e8616a74b86405c1b95b2abe16207"}},{"ruleId":"D2","level":"warning","message":{"text":"FilteredStage::compute (cognitive 21): FilteredStage::compute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (5 pts), loops 1 (2 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/stage/filtered_stage.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"861ccc2adbf6122baddf260b3ba497cae9ba34f67f26e812c8b2446c0fcc9d90"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::move_selection (cognitive 21): Tree::move_selection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb0c86384a2a30b5f9b183da60a992ac76f6caade1c5afbd2c036edbd5d5c98"}},{"ruleId":"D2","level":"warning","message":{"text":"TtyView::display (cognitive 21): TtyView::display has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/tty_view.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7723166e69bef2ee408ca13fb967747c63320e6d486f76a3d76d0df52442841"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionBuilder::expand_tokens (cognitive 21): ExecutionBuilder::expand_tokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (6 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/execution_builder.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abab7f6117d32e206504811417a6727766ca315559cd3e63f91a0f1a43137a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Ignorer::root_chain (cognitive 20): Ignorer::root_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 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/git/ignore.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e14ec0122b0a8f043de575b25a6bec65175e8083c3e07bb2fbfab86c1d724"}},{"ruleId":"D2","level":"warning","message":{"text":"StageState::on_internal (cognitive 20): StageState::on_internal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage_state.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"215638e5050b8b5c6e20a2f142bdb43e5be1f999d7bc14eaf4c2b90f1c39453d"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayableTree::write_root_line (cognitive 19): DisplayableTree::write_root_line has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf76b25e6a719fe84cfe2b0aa04f18664688c617386fc14ffaa2954e5a49874"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemState::on_internal (cognitive 19): FilesystemState::on_internal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/filesystems_state.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c156c36eb5eeb33e5971010aceba3075b2c764f92a4792ecac2bbab375be45"}},{"ruleId":"D2","level":"warning","message":{"text":"TrashState::on_pattern (cognitive 19): TrashState::on_pattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_state.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5841c06548a4f79145f62e00e1f6d1fda43af102128e6e5e48323d41a15becd"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeBuilder::load_children (cognitive 19): TreeBuilder::load_children has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). 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/tree_build/builder.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"170b6c97f5c0c63e9af57f90fccdb869075ef83925effdc9551fefc82bc65e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions::list_for_path (cognitive 18): Completions::list_for_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/completion.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b4155401bef471e536a65384cd6155acdd51bdccb51277515c4b0636b01b68"}},{"ruleId":"D2","level":"warning","message":{"text":"FilteredStage::move_selection (cognitive 18): FilteredStage::move_selection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/filtered_stage.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dac69bbe326387bafaa068f3722bbba849cbfde59fb49b88ee570e82c02957"}},{"ruleId":"D2","level":"warning","message":{"text":"broot::launchable::resolve_env_variables (cognitive 18): broot::launchable::resolve_env_variables has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (17 pts), 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/launchable.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"40244123c78ec1134bebe1091e4fce36796e874d9f090b4f11c2a790ad32305a"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayableTree::label_style (cognitive 17): DisplayableTree::label_style has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"256037d97071ed50dc052066b3347e5e7443565b69fb5a602c542a861ba8f8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Ignorer::accepts (cognitive 17): Ignorer::accepts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ignore.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"938a6da00c0e421ee25d1534ca9e37103851f32392b92f414909ce81bb0fe6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageView::display (cognitive 17): ImageView::display has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3, boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/image_view.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"365bc2e91bb2b4319d824bf87bc6b05c7cb8e4b8567c4399d422016d6d5ff912"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalExecution::cmd_result_exec_stay_in_broot (cognitive 17): ExternalExecution::cmd_result_exec_stay_in_broot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/external_execution.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ef7c85f84f3a478f2013f9a8672d44a5427f39f8c36c661e7c8641bfc1d10"}},{"ruleId":"D2","level":"warning","message":{"text":"broot::verb::internal_focus::on_internal (cognitive 17): broot::verb::internal_focus::on_internal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/internal_focus.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc539f80f8685379481ec045467cdd9875b6c93c1501e6232131ead3df3c4ac"}},{"ruleId":"D2","level":"warning","message":{"text":"AppPanelsAndInputs::draw_panels_once (cognitive 16): AppPanelsAndInputs::draw_panels_once has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 1, loops 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/app/app_panels.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1cd3c39867d080be887c10224e91034dfa8a12d533ab7b464ed83952b8aa68"}},{"ruleId":"D2","level":"warning","message":{"text":"IgnoreRule::from (cognitive 16): IgnoreRule::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ignore.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f3b154345b946fc414a47c8b380144e3c71a69645ba5778ba70b8f86dc08d7"}},{"ruleId":"D2","level":"warning","message":{"text":"TrashState::take_selected_item (cognitive 16): TrashState::take_selected_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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/trash/trash_state.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1a49db01766bc619d60abdffde5ea6a4dc2b431d9e8209d10889517486128f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PanelState.on_internal_generic: MethodTooLong \u2014 on_internal_generic runs 489 significant 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 389 over it, 4.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7f7f129a09b8098b6949e48445e15dfe2355d3228958caff58754347c9acb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrowserState.on_internal: MethodTooLong \u2014 on_internal runs 303 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 203 over it, 3.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/browser_state.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"25031c069313801164769490ab2a01fb01c0b2f516c684de1c2444212bb0e3de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StyleMap: TooManyFields \u2014 83 stored fields beside 5 methods. The bar is 30 stored fields; this is 53 over it, 2.77\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/skin/style_map.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8decda5d006ec9e0fb5c22855641afe3d440751ba841c5fdc75b365d2f11b3cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VerbStore.add_builtin_verbs: MethodTooLong \u2014 add_builtin_verbs runs 263 significant 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 163 over it, 2.63\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/verb/verb_store.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2613807e38aa9c2c7b22757d624ffe087ff4424b30b9a4153351f388499866d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemState.display: MethodTooLong \u2014 display runs 250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/filesystems_state.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"597bc0c90d102c305d8321ad35b9e64919d4cf6ae0911ea7c50845f03481f88e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply_command: MethodTooLong \u2014 apply_command runs 244 significant 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 144 over it, 2.44\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/app/app.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a4e1a00adaac1c45e9a4fc50b25c293f2d3c89c8832606827962420e9b19a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PanelState: ClassTooLong \u2014 885 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods. The bar is 400 significant lines; this is 485 over it, 2.21\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/app/panel_state.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ea3ddf3ddad192756beea00375a205f9154b9e99f02858be043384523c90f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/panel_state.rs: FileTooLong \u2014 916 significant 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 97% of them inside a single declaration: PanelState (29-1231). The bar is 500 significant lines; this is 416 over it, 1.83\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/app/panel_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e8b194e3dbd4580c66968e7a476df6c8d06ebc1c4ec92eb6d58185971c24c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppPanelsAndInputs: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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/app/app_panels.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d57aede121c8960b09c9e1c3be893cc2cc7603b002e8a715c4aff598464004"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57\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/cli/args.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf696742139d946cf65197381a5ca7f1d927c6b1ec295499ffa772b091983e0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BrowserState: ClassTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 27-884. The bar is 400 significant lines; this is 226 over it, 1.57\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/browser/browser_state.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11babffc852ec8b43d92d32a2ce0caebd11864b9aa4d8fe5f8cc3fae9a7594e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextView.display: MethodTooLong \u2014 display runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/syntactic/text_view.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eadb475ea1b637831bc887717993dc93a0ca3b1a6ba0429da3ef2eac49d895"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DisplayableTree.write_on: MethodTooLong \u2014 write_on runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3de0c7646c6852263e56b666c49d5441244126de8123dd402506f57f21441c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VerbStore: ClassTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 33-734. The bar is 400 significant lines; this is 135 over it, 1.34\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/verb/verb_store.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"806b7fda9bb9e8fb0e76c3b3cdb40c6be9fb8355a2c2e73b90c2992c8b6fca73"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppContext: TooManyFields \u2014 40 stored fields beside 3 methods. The bar is 30 stored fields; this is 10 over it, 1.33\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/app/app_context.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e3bbb46633517654d0c808261d5d5ffabfd98523c48590b436842f77ee1433"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrashState.display: MethodTooLong \u2014 display runs 132 significant 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 32 over it, 1.32\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/trash/trash_state.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0c51d3e53a889e4fcc4c94e2ba1a7ab51379f4435000ef07ce8802402b94bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/browser_state.rs: FileTooLong \u2014 654 significant 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 96% of them inside a single declaration: BrowserState (3 blocks, 27-884). The bar is 500 significant lines; this is 154 over it, 1.31\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/browser/browser_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4590a316d7516a7f29a63bcae2d4e955bf105af362b1d7ab5e4d5086d0b2356e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Conf: TooManyFields \u2014 39 stored fields beside 4 methods. The bar is 30 stored fields; this is 9 over it, 1.30\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/conf/conf.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"69909ef3537bce5bd3417af1b6bc1d7ef663bc55d7e6b286171057a4c4608bc8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppPanelsAndInputs: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 33-798. The bar is 400 significant lines; this is 109 over it, 1.27\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/app/app_panels.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"96174e1f67d3818dc66b8e2009a9c43ff1e623085b0257fadeea480af03e562a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FilesystemState: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 3 blocks, lines 44-677. The bar is 400 significant lines; this is 98 over it, 1.25\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/filesystems/filesystems_state.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"12859a1869a1b2152524f3cb8fb759f8c96e37fe96b854e0a3026257132367d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run: MethodTooLong \u2014 run runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5531dad37eb1641e9cfac11dde79dd3691643aeddc614294b66f97fb3f6156f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/app_panels.rs: FileTooLong \u2014 583 significant 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 87% of them inside a single declaration: AppPanelsAndInputs (2 blocks, 33-798). The bar is 500 significant lines; this is 83 over it, 1.17\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/app/app_panels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a383b783c5978251bebb6bb632f3cdecb57c3e59fd6ef47f00405d534a7656"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DisplayableTree: ClassTooLong \u2014 464 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 59-676. The bar is 400 significant lines; this is 64 over it, 1.16\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/display/displayable_tree.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"241258acde4e45629d5ec254ca9a6c3b9a9be85544971c3e34b46b3ad7b46b65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntactic/text_view.rs: FileTooLong \u2014 569 significant 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: TextView (2 blocks, 109-728). The bar is 500 significant lines; this is 69 over it, 1.14\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/syntactic/text_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd13b5c67ced32122e4967df95489a9b66c7da61bd4b67aa9d6cddbe62682d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verb/verb_store.rs: FileTooLong \u2014 565 significant 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 95% of them inside a single declaration: VerbStore (2 blocks, 33-734). The bar is 500 significant lines; this is 65 over it, 1.13\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/verb/verb_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3647a01527058ff6480eb1fe5e1603fa0262f9a4c69a920c1572b306b72c59a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppContext.from: MethodTooLong \u2014 from runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_context.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7e7bade0ab803260030dec98fbc25866f3ca8e8ac94664974ce9bfef712709"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TrashState: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 43-631. The bar is 400 significant lines; this is 40 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_state.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8713b4e1485d354bd2351cfb54842b5cd710243ffb1ee9cc62e2a09b245e51"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tree: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 33-674. The bar is 400 significant lines; this is 34 over it, 1.09\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/tree/tree.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9f9b18881b61c0f65ad4b406a14feb3f96f34c9fde6ab16f750916c0419a87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystems/filesystems_state.rs: FileTooLong \u2014 530 significant 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 94% of them inside a single declaration: FilesystemState (3 blocks, 44-677). The bar is 500 significant lines; this is 30 over it, 1.06\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/filesystems/filesystems_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd7d11f2ec9291303e1ec0baa1f0754f236814ee4a7f3522eed063821d140d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnifiedDiffView.display: MethodTooLong \u2014 display runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/unified_diff_view.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fded08ae859f452232c8aefe09380ed4879a039ef9729432471fdc025c4561cd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TextView: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 109-728. The bar is 400 significant lines; this is 18 over it, 1.05\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/syntactic/text_view.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d271fd0629857d41c55d2306beb428c2815aab6b21c059e2617335291feff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 52-647. The bar is 400 significant lines; this is 5 over it, 1.01\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/app/app.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af5a8d1d49b6371c6bd2f876c70497ae0be2bb45da15facca50fefe5a27a615"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreviewState: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 3 blocks, lines 47-586. The bar is 400 significant lines; this is 4 over it, 1.01\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/preview/preview_state.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cedff0c1c2305e04cf4c2b910871891389dcfc392dad4759f2c87c630c265d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DirSummer.compute_dir_sum: MethodTooLong \u2014 compute_dir_sum runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/file_sum/sum_computation.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df119f864224adf67ad03256ae16855c91222ce5264c5b53470abc3450579f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/displayable_tree.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: DisplayableTree (2 blocks, 59-676). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a014b3b5b82fb69e10d11b9da25f7026990168f162f49f357e0f545129a984f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 30\u002B corresponding lines): src/pattern/composite_pattern.rs:32-61 | src/pattern/composite_pattern.rs:66-99 | src/pattern/composite_pattern.rs:104-140 | src/pattern/composite_pattern.rs:146-180 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/composite_pattern.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b54211c5931c1085b1bc25b82516839fda5e955526ac80fd67bd411ba7d6968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/pattern/pattern.rs:179-194 | src/pattern/pattern.rs:199-214 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/pattern.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fa189f0c674701590b16ab34aa51fab8992c2ade61256ce8ce818b3c9c5be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/verb/internal_focus.rs:111-158 | src/verb/internal_path.rs:79-120 \u2014 These two members are one piece of code written twice and then edited apart: 42 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/verb/internal_focus.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9485317b5f9353907c1c251f8de6e439c84bf470f9d5dc2c59e32d4b4bcb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/hex/hex_view.rs:238-255 | src/preview/dir_view.rs:91-106 | src/tty/tty_view.rs:199-214 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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/hex/hex_view.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e613bdb8dcb0286543af787c01c8779a9f98ee3b84ae4c0c74e8812830ca6af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/pattern/composite_pattern.rs:192-216 | src/pattern/composite_pattern.rs:224-244 | src/pattern/composite_pattern.rs:249-267 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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/pattern/composite_pattern.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eebe8982818fb88af5027e32c526c7e43c9aa7673d533cfa9109e5761717fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/permissions/permissions_unix.rs:11-25 | src/permissions/permissions_unix.rs:27-39 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/permissions/permissions_unix.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a041bd9c13405baa410e9c97502b2492dbb99ad28fe9a1829730b800ca6d4136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/preview/preview.rs:167-189 | src/preview/preview.rs:194-205 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b7d607e8732470fc06da097db108d5bbc1e2e6b63e0d954941806aeefbd7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/pattern/pattern.rs:99-108 | src/pattern/pattern.rs:113-122 | src/pattern/pattern.rs:222-233 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/pattern.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44addee5bb9d902b52b297262a477f6952a19fb9edbf643f83508aee5bc00f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/content_search/needle.rs:74-90 | src/content_search/needle.rs:97-117 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/content_search/needle.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf8cca194448e8488f98c5fe46219d822815b6d51dda8472239b5ec1b2024c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/verb/file_type_condition.rs:36-48 | src/verb/file_type_condition.rs:52-64 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/file_type_condition.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e43f682e5f6b7d1f539414007f3715a071d13ff206f3301cc1f718cdbf729cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/preview/unified_diff_view.rs:225-238 | src/syntactic/text_view.rs:446-459 | src/syntactic/text_view.rs:460-473 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/unified_diff_view.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4060177d7812c5853934bd964ed736ce25b22dcf77043c4e0c9e86ce9dd42488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/app/cmd_result.rs:67-87 | src/trash/trash_state.rs:80-100 \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/app/cmd_result.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"198c0e95824ccacc4f2972871d091230ad094067c55fc00d116be44d5e2d24a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/tree/tree.rs:404-417 | src/tree/tree.rs:421-434 | src/tree/tree.rs:442-453 | src/tree/tree.rs:461-472 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0ebb456cbc7d15b2e422a68cfc165b1daf8deba7d0c58e5d2bb52e466166b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/display/wrap.rs:47-60 | src/display/wrap.rs:67-80 \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/display/wrap.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7acce53cae52df8a2faf4ee411aabb8cad1dd84986dba0f2228225ef590ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/verb/external_execution.rs:107-123 | src/verb/external_execution.rs:134-150 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/external_execution.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"464388fc3fe73d9748fa37d239cf7d077868d592748c1ab092817ea29853c6a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/display/layout_instructions.rs:30-39 | src/display/layout_instructions.rs:50-59 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/layout_instructions.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e97976eb273849fee8c68993ac3481e42ee8b263e6595083c28efb58f79e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/pattern/content_regex_pattern.rs:108-118 | src/pattern/exact_pattern.rs:110-120 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/content_regex_pattern.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a9e130e0bd0a9f48154b259632c7878db0631ab876c2038c7d0f09c77a2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/filesystems/filesystems_state.rs:667-676 | src/trash/trash_state.rs:621-630 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/filesystems_state.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f77505b668cb95914d02d23c5f2d8b66e49d705ccb2370b27e673b92b4a422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/hex/hex_view.rs:62-66 | src/stage/stage_state.rs:65-69 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hex/hex_view.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4790bc681b35ac2a78370dac0958bbaea62c95ad3998c554ce01b6d584ba44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/verb/internal_focus.rs:112-136 | src/verb/internal_path.rs:80-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/verb/internal_focus.rs:112\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/verb/internal_focus.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d3843a3c8ede68202c717e77cb19db7f4b9506534b97251d9bdaa7935186f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/app/panel_state.rs:219-236 | src/app/panel_state.rs:243-261 \u2014 both copies are in the same file, so extract the block 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/app/panel_state.rs:219\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/app/panel_state.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0faac80293f5367fe3208c3cd1c3f574227cc824ed22fad6e8a59a1c205b254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/file_sum/sum_computation.rs:128-144 | src/file_sum/sum_computation.rs:190-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/file_sum/sum_computation.rs:128\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/file_sum/sum_computation.rs:205\u0060 calls \u0060md_sum\u0060, \u0060incr\u0060 and \u0060src/file_sum/sum_computation.rs:144\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/file_sum/sum_computation.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1b5395811cb1b40bc9617d0509cacb0e0e267865e593ee1c23e67be934a73c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/pattern/composite_pattern.rs:38-61 | src/pattern/composite_pattern.rs:76-99 \u2014 both copies are in the same file, so extract the block 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/pattern/composite_pattern.rs:38\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/pattern/composite_pattern.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7ceda64316b40db00e91adeb9677deba13581c6c561e63e749b4f95f7de37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/filesystems/filesystems_state.rs:253-268 | src/trash/trash_state.rs:350-365 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/filesystems/filesystems_state.rs:253\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/filesystems_state.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6e2c8f67c8526d6aa569ea368f338294a1080ec91e931c65c7401bf95f6511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/browser/browser_state.rs:603-617 | src/browser/browser_state.rs:621-635 \u2014 both copies are in the same file, so extract the block 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/browser/browser_state.rs:603\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/browser/browser_state.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4adee40099a15faa8b20de877b90f447571d4286ad73aadb2b302d16056a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/filesystems/filesystems_state.rs:568-581 | src/trash/trash_state.rs:571-584 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/filesystems/filesystems_state.rs:568\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/filesystems/filesystems_state.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7414dd4b369ccb51e0ade1868ce6f5c3e1b4d2e91ba894da85565a26753288d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/pattern/composite_pattern.rs:127-140 | src/pattern/composite_pattern.rs:168-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/pattern/composite_pattern.rs:127\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/pattern/composite_pattern.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e7ac00afef623f5d4e55c65d227661c349ba9302158cff767e2393d4a6b1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/pattern/composite_pattern.rs:230-244 | src/pattern/composite_pattern.rs:255-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/pattern/composite_pattern.rs:230\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/pattern/composite_pattern.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4eb9350072d2337aa5055e1c7d0968cb63af3af937a169cf314797f2e5c617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/trash/trash_state.rs:377-390 | src/trash/trash_state.rs:403-416 \u2014 both copies are in the same file, so extract the block 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/trash/trash_state.rs:377\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/trash/trash_state.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda78924150933a7c3e31f62330301b90854f55eca628467a9dbaa8119c200a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/shell_install/nushell.rs:245-255 | src/shell_install/powershell.rs:152-160 \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/shell_install/nushell.rs:245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/nushell.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c65f6d2e42167db805f457a66fab129f87aeedb0b2ef6a1870795b7c661a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/syntactic/text_view.rs:450-459 | src/syntactic/text_view.rs:464-473 \u2014 both copies are in the same file, so extract the block 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/syntactic/text_view.rs:450\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/syntactic/text_view.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d70947fde1e88835e9efe94fc09f06791a8baf8905020c5508e858d5ab1df10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/trash/trash_state.rs:381-390 | src/trash/trash_state.rs:448-457 \u2014 both copies are in the same file, so extract the block 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/trash/trash_state.rs:381\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/trash/trash_state.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"96821198194b10e3e56e9f3f2690f8fd3a97075e6a353b0e5ce30129eb7c6405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/browser/browser_state.rs:695-703 | src/stage/stage_state.rs:491-499 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/browser/browser_state.rs:695\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/browser/browser_state.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6510556d370f2bc14b076d2ce18a16312f0f7f369b77a0a75a355d9fa968ce01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/content_search/needle.rs:102-109 | src/content_search/needle.rs:152-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/content_search/needle.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/content_search/needle.rs:160\u0060 calls \u0060get_unchecked\u0060 and \u0060src/content_search/needle.rs:110\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/content_search/needle.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"05458f296bfd5a81397134669a800ff7e91b1b5704291193ee581a3e184ec416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/preview/unified_diff_view.rs:308-313 | src/tty/tty_view.rs:152-157 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/unified_diff_view.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc8f833eda04f4d6cb6195ef53194caea31c1d03f956e66522bca0519b29e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/command/scroll.rs:37-44 | src/hex/hex_view.rs:261-268 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/command/scroll.rs:37\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/command/scroll.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75c2145f4c25d721e29b4a64688bd54e939aedcdc1981300f73e73c2bfa5d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/verb/internal_path.rs:127-136 | src/verb/internal_select.rs:47-56 \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/verb/internal_path.rs:127\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/verb/internal_path.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f6200169b3ed3b52f1ac8adfc4a1a27e73bc5540c6f76458539a49536498e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/hex/hex_view.rs:247-254 | src/preview/dir_view.rs:98-105 | src/tty/tty_view.rs:206-213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/hex/hex_view.rs:247\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/hex/hex_view.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"870d0d9716d8cf8a77179e5d593b91c82aa65e6588415c232b459da6908cf1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/pattern/composite_pattern.rs:112-119 | src/pattern/composite_pattern.rs:152-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/pattern/composite_pattern.rs:112\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/pattern/composite_pattern.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef79cee715c5fe935ddcd219a16f941afcf47b885400149d65577832a758026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/pattern/pattern.rs:100-104 | src/pattern/pattern.rs:114-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/pattern/pattern.rs:100\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/pattern/pattern.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6ca019cdd8df302ac61bbe18c03648ff5b68187a57a4238a6dca32e4e30af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tree_build/bline.rs:82-86 | src/tree_build/bline.rs:101-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tree_build/bline.rs:82\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/tree_build/bline.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b89cdd4a67bf19a02b12f9caf1d8849e287bbe2a3e43812c2ae5c47f2a8198"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Verb (LCOM4 6): Verb\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/verb.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"254a41315c4c02f3825a3f76e372265a8a27b109421da65a2c124a206ec11b93"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/app.rs: 0.0% line coverage (0/435)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8faed4d353f04ff9b7eba36c793f6b093c5d7901a9f56cfa3609e1732835039"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/app_panels.rs: 0.0% line coverage (0/655)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_panels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b218047893094a82f1b00cfaba0f76afce6418967b85dd8c25849967e00cb3a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/cmd_result.rs: 0.0% line coverage (0/98)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/cmd_result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bac1cedb4a5051c2f7829e89d62de16fac9063e465f0ba9dcaecbcbed782459"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/panel.rs: 0.0% line coverage (0/140)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f64be3bf5b3a55fd333e579e15d8feaabf3e45f3bd2a93c518a75ddd7cea2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/panel_id.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6c3e002af78d696214ebb6c4121d08e16a98f949e3d1ca528fad1c8a10cc84"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/panel_purpose.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_purpose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbc2dd7d64735bdc37680d275d0657e130cbe7fb70e0f1f24e499f1110834e2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/panel_reference.rs: 28.2% line coverage (11/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_reference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b6a09e8cd93b7a304e59b06ed04c9db78bb87a61bde2ae4815e9c3354dac21"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/panel_state.rs: 0.0% line coverage (0/847)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04933b7e7b59a59e5c13a71fdc7744ff3552140e868a46afed6c7745539f9c34"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/sel_info.rs: 11.1% line coverage (9/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/sel_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76365541de48a7a62ab13373087da126ea2da62ec8449796dbc0419be8f90422"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/selection.rs: 25.7% line coverage (19/74)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/selection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d68dfbba35aa87d6d2c29e2bea28f8b50fce3ee984c56ee270302f2e67ecb5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/standard_status.rs: 31.7% line coverage (58/183)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"706e793064d59b704aea6f86ee6cea19b37f960def7b6c4437f26c08e2b56fcc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/app/status.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bc07bb275e3231b7ea58681b75243c6036c99991b701402a9de728116fe2f6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/browser/browser_state.rs: 0.5% line coverage (3/623)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/browser_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6376f1af0b6f2cbb268da0006d2fdb2cc00093842accd09423e9ccda1440a3ff"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cli/args.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b0400adddc76565cb439b4f9cb3d7faa37cb351a4759c779c38b262a2fc0a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cli/install_launch_args.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install_launch_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc01515f028afb5db0817b9793d5c6a5db2151c8811230ee2c9f9cf606ab4ed"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/cli/mod.rs: 0.0% line coverage (0/124)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b456882708291e68deb594722b33850478a91da74a443004789a33e67794a779"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/command/command.rs: 13.8% line coverage (8/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b5eff346fae81dbc7e4dede2b45efc370c6a015c3bc930110f66eee36743e6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/command/completion.rs: 0.0% line coverage (0/168)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada3bfe9058902e2d52df7b5b8abee66a6be03f9c9981ac40fe5cd4f7284f277"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/command/panel_input.rs: 0.0% line coverage (0/328)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/panel_input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f878bbda48ea7408e918bc88b47e7b93479aff51ecb97c24372f91e92030a34"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/command/scroll.rs: 35.3% line coverage (12/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/scroll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61629aaa38d168d975c624bbe380ee86270967b2430bb2690ec86cd80bf3bed"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/command/sequence.rs: 31.9% line coverage (23/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/command/sequence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"656036e2fd4393af9815d001faa3f72cef4294809a04c77898e25fe07f896f5e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/conf/conf.rs: 0.0% line coverage (0/101)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conf/conf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4162e86feab78f0ecdcdc5e840315cb42daf54746273462039db4ea9e188877"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/conf/default.rs: 39.4% line coverage (13/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conf/default.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ddfa8f55eb53dfda20f3744e798ac214f9da67391515b6f7ddd36a62a02917"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/conf/format.rs: 48.8% line coverage (21/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conf/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f924f9b6f1677f6cb496848f5128444f51b610e2bb125df0643a5556224705"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/conf/import.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conf/import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254ec7b28241f055187d63b3c3f01da95c997daa299507820e26349d829dd233"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/conf/mod.rs: 0.0% line coverage (0/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conf/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1986f3c6a011830d1e8c5da64d8b68d68ac86dbe4fcb702b4e1e725a476660e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/conf/special_handling_conf.rs: 9.4% line coverage (5/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conf/special_handling_conf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"623b59bb9ba59864326725b9e1e51024cc42b438ddaf5b75f0eb1e39590c793d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/content_search/needle.rs: 36.5% line coverage (69/189)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/content_search/needle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30b59b77441e06884c96ba297db7e3b2da5285ba1077d245a8c6c1609a7cab7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/content_type/mod.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/content_type/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d8313c6d03bead66ef5b489fdebdc1ab856970889a4712c008d3bbd1fdf85e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/areas.rs: 0.0% line coverage (0/154)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/areas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2b5064dba1199cb93c393fea70ce4a26dd2b0932f1cac264707504a5a3e34e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/cell_size.rs: 45.5% line coverage (20/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/cell_size.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51d506ea878237ce3a10bdf65ccb9774daa6386ecbb4bf2c645f17726db9ef"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/col.rs: 0.0% line coverage (0/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/col.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46568f81201c70ba69bcf7d49b2e1888cf927f17fe8c322bf613ad17f9efd518"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/displayable_tree.rs: 0.0% line coverage (0/452)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d5e0630a35210cdff07385e413edffcbb015a22fac3d1cd2d716b049c53da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/flags_display.rs: 0.0% line coverage (0/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/flags_display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3288f8a7e33fc8de6759af1f5c74f76fcec5e5800fe605db8790659f191b0e94"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/git_status_display.rs: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/git_status_display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22bca73742abb19b862d1484a312f8ebcc626f4237ada92e690070579708681"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/layout_instructions.rs: 0.0% line coverage (0/47)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/layout_instructions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd1fc2a7e7c3ee2038fd842ce3ab55fb261646d2581e7b48d8403bfc0704f9e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/luma.rs: 0.0% line coverage (0/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/luma.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db04482619e8ced35334f3f7b5979271757948b2e7a8782b94e47843a14255c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/matched_string.rs: 35.5% line coverage (43/121)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/matched_string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"830468a4c2c29a0b5690f59e3aae416a1e8911f57d6b520a29ac2e781cbd71e5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/permissions.rs: 0.0% line coverage (0/94)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/permissions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d117ff7e5a46421970390e0a4d05cd996e679b452efb9e4145e221a6d51175"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/screen.rs: 0.0% line coverage (0/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/screen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a21c74e8d5a4f88d1f9e2fbe8242da0d14711e0b527266a73824a92cb17c035"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/status_line.rs: 0.0% line coverage (0/52)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/status_line.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfc055dbfd4b4bb001c390a60d3dd3baffa793c74956ffa015460a5da6ab4f3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/file_sum/mod.rs: 0.0% line coverage (0/77)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/file_sum/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c7c3b1ebd45723e47fb7ba1dc53fad041bb851cf9793d121808d5faff5ceab"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/file_sum/sum_computation.rs: 0.0% line coverage (0/161)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/file_sum/sum_computation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa36a5bba80bf9c603127db70caba06f766c12ab8686fbdc1d716aaf3af4423"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/filesystems/filesystems_state.rs: 0.0% line coverage (0/520)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/filesystems_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd13e3d07ebde348dc25d1321b6db7797edacc22b2a74892fbca3c65e3b0b1b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/filesystems/mod.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8519d47f77c8b395fde63ec3dd86e46b77c9789be7191c97c40355e3e0435b54"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/filesystems/mount_list.rs: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/mount_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7db4731006a0f543c88737abfc2cc5e47f5cc757905a0b064aef2f52db4c24c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/filesystems/mount_space_display.rs: 0.0% line coverage (0/96)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/mount_space_display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9323823d3fcef1e7c82353e38e966dde705704f8706e1269f21efa56ecbb149"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/git/diff.rs: 0.0% line coverage (0/176)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4c3846f2446e29d5c1b42f396e5c84f8a78656fda5e77e0414dc765f7d42ec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/git/ignore.rs: 0.0% line coverage (0/204)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ignore.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97fa1d743c88d1c4fce4ba5a4f5ac42da0a4dfd5c1868f5a2e6f9c4dc87bca0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/git/mod.rs: 43.8% line coverage (7/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bac06459c453a9f3eec9c8140a16623aa622f46f5c8c3859be0eba2da4385f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/git/status.rs: 0.0% line coverage (0/231)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8e63a5541ffb0f9ac377a52e1908c3ab0b5b6263845580a03088cd6738d42a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/git/status_computer.rs: 0.0% line coverage (0/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/status_computer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbaf231446d77e8e655ab45f576f5921fec2d274f20d326855cc86b243ba871"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/graphics/terminal.rs: 41.3% line coverage (19/46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graphics/terminal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf89b8f9a296a40c3ded9260a8a35953434b160b16b67ba66634d64d6c65e6f0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/help/help_content.rs: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4115ab003abe89135217936ff074a52774559463abf4d2c403dfe470d6374e2e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/help/help_features.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_features.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf504a603690f0127aaea715605e0f067258170dc5b367abff51cbab00bda7b2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/help/help_search_modes.rs: 0.0% line coverage (0/32)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_search_modes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ca94830287a9716251f372541be75a04fec26b35da9cd7c5a07e950e6d277d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/help/help_state.rs: 0.0% line coverage (0/192)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f22db6ac2da1b63094481e69744fe97fdade988a35679816df64fe1bd2a7e55"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/help/help_verbs.rs: 0.0% line coverage (0/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_verbs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354836e8fe1022c0e355afc15235270c3411554e4eab4438f8f50f599cb55e4a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hex/byte.rs: 0.0% line coverage (0/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hex/byte.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cc261b146690c31280334b8db4cd271f692213b82f210b871bf7ac57b57ccb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/hex/hex_view.rs: 0.0% line coverage (0/200)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hex/hex_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b76c91a692bc7c5ef65981fa1b94b6375e5d35e080d7e40a215f57ea1ac082"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/icon/font.rs: 0.0% line coverage (0/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/icon/font.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfc2c50517b164109cfe92788e8a9ba419c170a72fe4f0d7f5fb755752cb85d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/icon/mod.rs: 0.0% line coverage (0/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/icon/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fd63ef0fef2f54faa36f1111e8c4f4c232800b2a32944d168eb5cd8eb0905a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/image/double_line.rs: 0.0% line coverage (0/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/double_line.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0236d79dec5f9d1bf3f84f1ff77078cd498b93da71e5bb9b3455fab27b42da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/image/image_view.rs: 0.0% line coverage (0/140)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/image_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2bc8b5e41475c6de9b195ab9f69990cd7086786c1eca23736b0579bf36c308"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/image/svg.rs: 0.0% line coverage (0/73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/svg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0823f444731cc555cdada113b5884fcb9a9b37f6fb96598cdf565ef9cdf36ad2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/keys.rs: 12.5% line coverage (1/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5568d9b179fc102b7f2694e822a9d006137c5d999e5163f67bb4f6681126b93"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/kitty/detect_support.rs: 34.2% line coverage (26/76)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kitty/detect_support.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0606bfc566b78814703f8dea40b613841ab8b771a7d34f27f364e7585ab59d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/kitty/image_renderer.rs: 0.0% line coverage (0/300)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kitty/image_renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d54ad4307ecaf33f3bb36711ddcde0c8357ef20d3862b6981fb9394eab30b38"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/kitty/mod.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kitty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbf282cd89f176202b474f1765d7f0eb70b4ff070e1fffb868dff2d290c26c8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/launchable.rs: 3.5% line coverage (6/171)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/launchable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e4a5b74492d5ca4a5ae9be67bdd504eda2e70ab424be0b956174dfbbff988a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 0.0% line coverage (0/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/path/common.rs: 0.0% line coverage (0/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/path/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fb99e4966558c3852d246bff2f81058e7ff13ab47a6e283ab36c6360808ba3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/composite_pattern.rs: 14.6% line coverage (27/185)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/composite_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366447b3008bc7775d384491f4d1e96805a3b380e0ecadc9f97cb279b8139e0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/content_pattern.rs: 28.0% line coverage (14/50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/content_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82681e07e1c42e2c90d159aa01b093800188237d013fc28211d12830d569f570"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/content_regex_pattern.rs: 0.0% line coverage (0/88)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/content_regex_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125a5bfea6ce9332c27bcd7a9556b2ddade8280f60134f827604e6402f8c56b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/name_match.rs: 22.7% line coverage (15/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/name_match.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737011990a819301062b52d136d51c3084d49f4d98e4509fbfcd65da54b6eb2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/pattern.rs: 23.9% line coverage (42/176)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5526aeab948154a4059085e64fb21c78160192be63b7fea3b6755cf0c622eb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/pattern_object.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/pattern_object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"261c5a96bec3fedc377f4f70d4baf10020513af25ba5a617759f2dacffc15e22"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/pattern/search_mode.rs: 28.0% line coverage (47/168)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/search_mode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"800d5354575e1435fd060cedcd22ee1f93e06ec3606adefd496d5407170429c8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/permissions/permissions_unix.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/permissions/permissions_unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c457ecddd139e7f6edf568b3683b7c84e98e0461c495c2f8fddae506192ce12c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/preview/dir_view.rs: 0.0% line coverage (0/98)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/dir_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9838053fe21ed2af417a4835490cbf9d9fa9f925293eb479376dfc3337af81"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/preview/preview.rs: 0.0% line coverage (0/308)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c433c5e48ae27665c5ff3b178e691743a361f3bab3afa41d39e8314e83729aa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/preview/preview_state.rs: 0.0% line coverage (0/411)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acec814aa9e5da0431b85b7b02a07d88c6957dfd77d0a14465ebf5c074a4a3b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/preview/preview_transformer.rs: 7.4% line coverage (11/149)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview_transformer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9db705e116f902fe6182ac47d082a4600d529124808be0d07d47279ef281a68"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/preview/unified_diff_view.rs: 27.5% line coverage (90/327)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/unified_diff_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab2399021b47ac993aee9e20330f2bea8f381d18e270b71573baac7fbddb1d8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/preview/zero_len_file_view.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/zero_len_file_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36a5ec3fea19cb43883fad94022dd435d0447b70e9b7d80e234ca315319821f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/print.rs: 0.0% line coverage (0/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/print.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea7ecde7272a3fb33f447ade8215e19a2c92319358f5b1cf265cf3cefe1e727"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/program_error.rs: 0.0% line coverage (0/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/program_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f73e6c1409c70956130e8afc1f5ea62ec039674ec8f69a76094c86ecfa0310"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/bash.rs: 0.0% line coverage (0/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/bash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f88f660c0a3de0a88220fa52645b2b839457e099d7ae50ca9f1726a180e6383"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/fish.rs: 0.0% line coverage (0/42)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/fish.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b963af46f53059e88c91690be4941bdefb46d270ba6966f77098015931fcc5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/mod.rs: 0.0% line coverage (0/129)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d71c6b72dd07529b55496e595b28c951de4d86c93123e121ed145960804a8db"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/nushell.rs: 0.0% line coverage (0/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/nushell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe41ba99b5fdabca037befd2f377bc29aa1224fe088fd94640bc3cdbf7ce06d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/powershell.rs: 10.3% line coverage (4/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/powershell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"111af36285a57856e99275e0354b641332c5a11c51fe3d59950bd5328abe370c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/shell_install_error.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/shell_install_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa83187d1e972d076d18deda43208aebefe845c9cc69feabe7cdcc1af473c4e2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/state.rs: 0.0% line coverage (0/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8691f6716854dc3af004c0a3dbe133d0c56e222c99fa25ee2df531548d39b507"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/shell_install/util.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_install/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e28fdb5f9c6f32c42e77abd771642ad20f824e697a85856d1e665b7ec333cb9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/app_skin.rs: 0.0% line coverage (0/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/app_skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c366be28c6109e87054164a514494875cfd7b4472c00621ce1fcfa47a6b967"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/cli_mad_skin.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/cli_mad_skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d18d8fde5dd00ecd6be61933a15c549585e3319641ffa5ed9809cba4cbc9a36"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/ext_colors.rs: 21.7% line coverage (5/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/ext_colors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2422d7a0b35062f613f8bb3c128ea10b1594d8675c08b08d8c1ead0fbc5c4bb6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/help_mad_skin.rs: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/help_mad_skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5753675bb1df602dad9e38cf12c21a51906a80cd5ff7ee1a1b2cc82bcfd5e986"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/mod.rs: 0.0% line coverage (0/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2b0d12933965616f31a05329c1fe0d563988a5e3723e4cb8c68ec7307442f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/panel_skin.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/panel_skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8cadb317f42268b36062bd2041f73c3fbd42fd0620aaed51f9c268ce15c659"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/purpose_mad_skin.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/purpose_mad_skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cad824079ed152ace82328a62d915d13b05ee3409c61f0c7ff7ee19dd543ae"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/status_mad_skin.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/status_mad_skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8ddf9eef083de41b1b03870cfa6ff903687a80cc29e7e310dc18e90cc08ef1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/skin/style_map.rs: 0.0% line coverage (0/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skin/style_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d21878d2bd0fc558e595f47733f665eb22d26ec9575217ebc3149c94ee336a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/stage/filtered_stage.rs: 0.0% line coverage (0/156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/filtered_stage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0396fea3fa380b40a6ebeb2784c401935a4b49622478a31dbe2b2b42e18f606"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/stage/stage.rs: 26.6% line coverage (21/79)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c73166a0f7e7564f4e54085156cca8293f2b47a8f4c62398199a89ba5ff724"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/stage/stage_state.rs: 0.0% line coverage (0/380)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3435966579eda50e39b031a0ac5bc3ea3aacbae56970be68a280238b99a17022"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/stage/stage_sum.rs: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage_sum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1854c05d01c7b91569305ffd4727e7655175df51f07a1b2279b13ab37533aa9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/syntactic/syntaxer.rs: 0.0% line coverage (0/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/syntactic/syntaxer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d77dd15b040053d9064e254352c0fda5e7e99f7506b401414dfd1a2ae2e85c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/syntactic/text_view.rs: 4.0% line coverage (22/545)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/syntactic/text_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a13495af766b506e09340be2ef22fd9b9900c977867ff886ff7a2469ce217cd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/task_sync.rs: 0.0% line coverage (0/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task_sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d00df1e8f1cb14fce5a2d44112025c528f50150feb5d359b1b29adbebc259"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/terminal.rs: 0.0% line coverage (0/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/terminal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f3d74f2cd3a5f2495115d99493a2558c7bf98fecf05ddf03ec5b14b6192516"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/trash/mod.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef17aa9f154383a9f12804bbbd1026159ed49df708e63f4c6dd7dc7be030ca57"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/trash/trash_sort.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaacf81ff8e6a04e5a60c042bfba6ab6b6dfa72480f7095e79c52c177cb168a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/trash/trash_state.rs: 0.0% line coverage (0/451)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdb6876006cb4b1321fed9210d423d0bfab94b0a9e4eef14ea9d0c0bc24c585"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/trash/trash_state_cols.rs: 0.0% line coverage (0/100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trash/trash_state_cols.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3787065e839ae341bb5e5d2d18a2b76ff1894ee813b81c2731036d8947210423"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree/sort.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f45b95a497e8230c8e7a727c597f090469b83c1401c884b1e78bc34bc6fba0c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree/tree.rs: 0.0% line coverage (0/492)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e9f6caf7709dbfff33fa0f67806c1d2a8d650c4232923b043e8c21d49fb5df"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree/tree_line.rs: 8.9% line coverage (12/135)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree_line.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"367ab791d1ef1dd01c48f91fbfd7fb8461b2654894d85e91bdd80add77aff29d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree/tree_line_type.rs: 0.0% line coverage (0/61)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree_line_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662af3211185f9bda601f7e3ffee0fcf42eab24caad8d882d0c6b5bdc90748d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree/tree_options.rs: 49.0% line coverage (99/202)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree/tree_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e798b3dd3ad68b476ad51c9881590d8ce64144b9542696b57476fa75e3e96ac"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree_build/bid.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_build/bid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ce6850514fcda78c5a255e400c218585120ca5cfcd0c64324cf91e64549f57"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree_build/bline.rs: 0.0% line coverage (0/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_build/bline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"881b55f2787fadc9d7826123d4336d4857356ead12ffe4adc33d39fa868e0cf3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tree_build/builder.rs: 0.0% line coverage (0/404)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tree_build/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2a6713d4e00b3148d0c8e16549a644c4484685750e38dfbbcfaf7aa976b9df"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tty/mod.rs: 0.0% line coverage (0/10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc198d68c2329e43e41d890f38a494005772f24c7f0bb5c3a2c61b79591a293"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tty/tline.rs: 6.0% line coverage (10/168)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/tline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b734c021e4c0a78e4b86f02ed873953978deb45dda1b7875788127adb6b55b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tty/tline_builder.rs: 0.0% line coverage (0/90)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/tline_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dad428696749f616453641be2800ad3fe33d38b81dcdb4a66a7cabfc657de3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tty/tstring.rs: 0.0% line coverage (0/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/tstring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c395a400d00814b7eeb56830bd5cc6d18c9bd521c09baaf0ca566f3b568ae"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/tty/tty_view.rs: 13.0% line coverage (18/138)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tty/tty_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"337db360dee8f7d2f323752391031dcca9d88e39b4720e028d4438b5296233f7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/external_execution.rs: 10.9% line coverage (19/175)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/external_execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7e2c5c68aa7a4403daaba6fe42e78501be5400a512053bc84db47d55e7cf5c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/file_type_condition.rs: 25.7% line coverage (9/35)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/file_type_condition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e573753ba808254fd9b019ab9ca45d04087a25108409b800efd09e3e660e7e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/internal_execution.rs: 23.6% line coverage (13/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/internal_execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08119f3a92df19d7c45e659e1a2ab459268342c06acec69b5933f58e89e6039"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/internal_focus.rs: 0.0% line coverage (0/159)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/internal_focus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74844a4a8b438cac8d01211de72b104eac351a55f263e3bc04e4ce31169fcc3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/internal_path.rs: 0.0% line coverage (0/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/internal_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3d5a5a9f77101b8b8218d0442e7f299766b89c60b420522f4a41fde5dfc7f9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/internal_select.rs: 0.0% line coverage (0/38)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/internal_select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"939b358288e5a5aaae4a2bbbbecfa2ff904bbba5923f4f2b8ea8858470c48bf6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/verb/write.rs: 0.0% line coverage (0/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/verb/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b79d1c7443829917955d730d614c9fec8b86f5180c416b4c6d6f872c3c95790"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/watcher.rs: 0.0% line coverage (0/105)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa40ddecc5aa9b04233193a4577f8ad4e190fc6c3b2aa782a97794a4326fb12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/panel_state.rs: src/app/panel_state.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in PanelState::on_internal_generic at line 110. 1 of those changes was a fix/bug commit, 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/app/panel_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app/panel_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"912b09875e250f02989724b7a29fcbdc47e2b788dfc536969b8a206d1490465a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/browser/browser_state.rs: src/browser/browser_state.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in BrowserState::on_internal at line 336. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/browser/browser_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/browser/browser_state.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"019af637f3073498fa688e83784bdbbdb687d8cd505a98af609691a8f07c6496"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/verb/verb_store.rs: src/verb/verb_store.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in VerbStore::add_from_conf at line 459. 2 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/verb/verb_store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/verb/verb_store.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"58478b04e951910c229f786c983da33ffcbac4b2e36b984c71c071da4740f3f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/skin/style_map.rs: src/skin/style_map.rs changed 4 times in last 90 days, max cyclomatic complexity 83 in StyleMaps::create at line 72. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/skin/style_map.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/skin/style_map.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac62db6de9ff692dd0c830857ef0bdab70eda93496c9fe7a1652db675662d933"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/preview/preview_state.rs: src/preview/preview_state.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in PreviewState::on_internal at line 435. 1 of those changes was a fix/bug commit, 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/preview/preview_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/preview/preview_state.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d868cb4f14832f9aa475ce1dd6284c0a12708d65e24d66e4f12794bacb20f3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/app.rs: src/app/app.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in App::run at line 449. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/app/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/app/app.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ba7cff15558529038eb7bd040c708193cfd3416fc52793e570f89613b6d508"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/mod.rs: src/cli/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in broot::cli::run at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/cli/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf926830e9464e9d083c52d68a0dba6c6996c5a4f3bb1999058dd3449872c61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/launchable.rs: src/launchable.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Launchable::execute at line 180. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/launchable.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/launchable.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e5647d6133f63db12c5c574ddc6c0fc5d71aa737b40842712f79606bc47d46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/net/server.rs: src/net/server.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Server::new at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:19:52 \u002B01:00\u0027 --until=\u00272026-11-12 15:19:52 \u002B01:00\u0027 --full-history --no-merges -- src/net/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/net/server.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa87fa2c0adf90b246daf738092bffdade0215e653eb048791d990f7ebe5dc82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to (crop_writer ? termimad ?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stage/stage_state.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9cf1f75cce661820432c3aa779fd8434d47aabce7deabb8b8093524e608c28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME try as unstyled if syntect crashed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70052061c23a57565d0cdc0ad703dfaaabbd4babee20e872eae271ad460392d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO open tree if true \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview/preview_state.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdb4fbf216f05c3597a79e98651d68d4a557549f1d972fdfe1256ecefb2b867"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO open tree if true \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/filesystems/filesystems_state.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afe7419627f8c9c2de01484a5c8b3c05cbb042f30efcc15ac537909ad246f5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize with regex::bytes ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/content_regex_pattern.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf3c6d0b58fe8f3463e426eb866979a8f22711ac82980cee12a1ffc6b874156"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO look at issues and/or code in serde-toml \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pattern/search_mode.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dc34b5d9f8b7a75338c2931e61e681bb638519e79ee844acdefcc38bd1d846"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO open a tree if true \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_state.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad34bed8fa32c435f48106e56979afe73b72ca7ca6880f4a93f9f2c44ee11b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME check we can\u0027t use the generic one \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/help/help_state.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d3604b525e2ebdca6e2f32b21f65c1c12794e51e8b0fdddf53eace9096340e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rename without the \u0022Git\u0022 prefix, as it\u0027s not only for gitignore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git/ignore.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"422491bb23d04047aaf1d4ca7a6b0c22c88325d8f5b15f5dce22754441724250"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If a theme is on, remove the horizontal lines \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/displayable_tree.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ccfbb9e299a2aacb1f4438b7745566dda6f095d99432b3f265997bc48bd3da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Some non ASCII UTF-8 chars start with FE or FF - check it\u0027s OK"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/content_type/magic_numbers.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"625139c2cc73caf5bb03c4d21881e507d3923eb0596f217048244f53315188d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO the Windows equivalent might be PrefetchVirtualMemory \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/content_search/needle.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4cee8d7536765f296ccbc376c292270b071795cd84658d6fbca626d512642"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO clean the next few lines when inspect_err is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc0deea68ebfb59a70792eb9fa4aac3c9aa3424a841418db287ab7d132e8fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo replace instead ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_panels.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"377e11777564b7e7ae0221235e9371c5fc5a17a3ac2f82273bd41459c1c68486"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo replace instead ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_panels.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"500678e84f1809f9c60cc9d8e6b93c3cade9a3aa861e524490b8561afee71827"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME unconsistent naming with activate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_panels.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ab43cb89d116619261cf7d90fa1ba4e8739e021940aa0bc37bb27d1e1e5c0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME the returned command is never used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_panels.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0115ced8e072270f88b951b1cb3c5144a92662558f9d5e757fe18b32c91441"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME avoid clone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_panels.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30567b9dc0647dd9d26074823909d4910cabb34c5fc9fba2ac27af9115ffed5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO keep the message ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/cmd_result.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af7e088cc588020f12474336247ed4c7432556cf9a652699a81d051b3fdf3f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO display error ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_state.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab18f7306524eba64f971effc6d5e944b117e6d577dfd63a5287adf1197526e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this command is never used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel_state.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd44242266acf6f29817bdb0f9eccd681abbaff5f6c3af9e66f84becabf690a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check outcmd \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9e35dfb8979ba2adad8a000fa7b8e777aa965d2ecaeafd7405770c8763a777"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //let tree_file_enter = None; // TODO (for when enter is customized) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8d3f8c27101929aeb791d2aa3e2a42ee8c37691f1faecd7776d610ae6dfc23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fs status \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff92b6da69e1f6879aeb5b09c3ee39d0c53c5c5f08d4c34026acc67be7f7320"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stage status \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"383dfde94208eafe80c798a4a081c7fded71937db326f17c402852fe61c79477"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stage status ? Maybe the shortcuts to restore or delete ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20e84a911831de3e996b0dcbbd628d5c75c1fa592a12fa58ba0b1b1464bf56"}},{"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":"1ddd4a3eacb5abc26b76d406ddb70aae9070bf3a368b86a2ade443eb3e11ee6d"},"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":"a2faf708a19c10bb6a3d6ec4bae6bcb9d1a57f2dd774f609f030cd152fa4fc9a"},"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":"2468ab8c7bee83680c0e726f23e6322ee87315b4717e187d85b3f449597ab250"},"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":"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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.38.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85ffa314d77812277deab31fb2264e02366c4034561614d82315c198cb6bb99e"},"properties":{"dependency":{"package":"time","version":"0.3.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0009"],"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":"5ceb9040e13548b3df718b94867858f8e5659519eb178fbf2fd0e4e23343e0da"},"properties":{"dependency":{"package":"yaml-rust","version":"0.4.5","advisory":"RUSTSEC-2024-0320","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/icons/vscode/data/icon_name_to_icon_code_point_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5905f6164d732cd2727b570bfe3c2f0cd79cf7df5db63baf06bbf69282e655e8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: browser_state.rs \u2194 help_state.rs: \u0060src/browser/browser_state.rs\u0060 (context browser) and \u0060src/help/help_state.rs\u0060 (context help) sit in DIFFERENT parts of the tree yet change together 69% of the time (75 of the 109 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 75 shared commits counted here, the most recent 3 are \u00607d0cc736\u0060 modal mode\u0027s initial_mode setting; \u0060c641b27f\u0060 version 1.19.0; \u0060c372aef8\u0060 Status message on toggling tree options \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/browser_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daa8c7181acae15c9cd5a69c5eb9ec79219fd60e3607436549c00f264e35c76"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: image_view.rs \u2194 mod.rs: \u0060src/image/image_view.rs\u0060 (context image) and \u0060src/kitty/mod.rs\u0060 (context kitty) sit in DIFFERENT parts of the tree yet change together 67% of the time (10 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00603317dd01\u0060 refactor: extract a protocol-agnostic graphics layer from kitty; \u0060db4a05f3\u0060 Show images via *Kitty* in unknown terminals, *Tmux*, SSH (#1034); \u0060d8f891a7\u0060 remove temp files used by kitty (#952) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/image_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164d7b049c34b7835326b9fa338da8d251cbab713bf850b687453936d4f75f2"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hex_view.rs \u2194 text_view.rs: \u0060src/hex/hex_view.rs\u0060 (context hex) and \u0060src/syntactic/text_view.rs\u0060 (context syntactic) sit in DIFFERENT parts of the tree yet change together 59% of the time (13 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006082c43756\u0060 Wrap (#1215); \u0060c2848b6b\u0060 upgrade termimad to 0.16 (at that commit the file was still \u0060src/syntactic/syntactic_view.rs\u0060); \u0060d6ceba05\u0060 move some fit/crop utilities from broot\u0027s code to termimad (at that commit the file was still \u0060src/syntactic/syntactic_view.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hex/hex_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f616590c916519343a147fc2e36b55415a001adabb602e081a2faa2c9caa9ae9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: browser_state.rs \u2194 help_verbs.rs: \u0060src/browser/browser_state.rs\u0060 (context browser) and \u0060src/help/help_verbs.rs\u0060 (context help) sit in DIFFERENT parts of the tree yet change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00607b2663b1\u0060 version 1.41.0; \u00604bd189ae\u0060 refactor: \u0022display\u0022 ntmodule; \u0060acc14860\u0060 background computation of git repo statistics (at that commit the files were still \u0060src/browser_states.rs\u0060 and \u0060src/help_verbs.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/browser/browser_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"679ee62f24db1c4a8543024c45289546569d564fdac2b945dbf4037d93eb6ad9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: image_view.rs \u2194 image_renderer.rs: \u0060src/image/image_view.rs\u0060 (context image) and \u0060src/kitty/image_renderer.rs\u0060 (context kitty) sit in DIFFERENT parts of the tree yet change together 50% of the time (12 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00601c6ff059\u0060 restore lazy detection of graphics capabilities; \u0060d53ba0b3\u0060 feat: add Sixel graphics support; \u00603317dd01\u0060 refactor: extract a protocol-agnostic graphics layer from kitty \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/image/image_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"475290438cd90abe1ae51fedaaaa95014ec231083c6083beede63a4c1441d4df"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 server.rs: \u0060src/cli/mod.rs\u0060 (context cli) and \u0060src/net/server.rs\u0060 (context net) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00608becd440\u0060 refactor sequences; \u00609eeed804\u0060 merge; \u0060442e304c\u0060 \u0022client-server\u0022 no longer feature gated \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"847e52378d7346810f79cca6a36f27837b05fbc78d714fcfa1ada2f8460aec6f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: standard_status.rs \u2194 browser_state.rs: \u0060src/app/standard_status.rs\u0060 and \u0060src/browser/browser_state.rs\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00604e8009db\u0060 status line now suggests using alt-g in git repository; \u00608cb3d9d8\u0060 :toggle_ignore internal, should be prefered over :toggle_git_ignore; \u0060b61e53a0\u0060 improve the status line \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/standard_status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc778ca165d371797d6e0978b965c2cc3691ad6b8d6a2bc7faeaf0a8f928409f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app.rs \u2194 panel.rs: \u0060src/app/app.rs\u0060 and \u0060src/app/panel.rs\u0060 change together 59% of the time (29 of the 49 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 29 shared commits counted here, the most recent 3 are \u006065dd815c\u0060 version 1.52.0; \u00608d3b6595\u0060 don\u0027t ask notify to watch the tree: we\u0027re doint it (#1049); \u006060667598\u0060 fix application waiting for event to quit \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9584f0406117df45edc98c0ee53c542afd0d063e27d8054ac2767eb2b3cdccd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: panel.rs \u2194 browser_state.rs: \u0060src/app/panel.rs\u0060 and \u0060src/browser/browser_state.rs\u0060 change together 55% of the time (27 of the 49 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 27 shared commits counted here, the most recent 3 are \u00608d3b6595\u0060 don\u0027t ask notify to watch the tree: we\u0027re doint it (#1049); \u006060667598\u0060 fix application waiting for event to quit; \u006085b44004\u0060 search_again internal (#909) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"925c516cf6ee025fc8d241d0e9838ef7c30007783d8e12dac326963df431de1c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app_context.rs \u2194 col.rs: \u0060src/app/app_context.rs\u0060 and \u0060src/display/col.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006026bebaca\u0060 Fast fail on verb conf error, clearer error message; \u00601480427f\u0060 improve determination of whether a space is needed left of the tree (at that commit the file was still \u0060src/app/context.rs\u0060); \u0060aab4f132\u0060 use serde\u0027s derive to deserialize conf (at that commit the file was still \u0060src/app/context.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/app_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf673390706f4f3347d192695e69cc9d59f49af878a87191ddca2d61f450ad"}},{"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":"16306b945c4d23f63233ca9e436ca6f07b29beb9e894901775fc18bf267cb0a8"},"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":"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/tests.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060areas.is_first() \u0026\u0026 areas.nb_pos \u003C con.max_panels_count\u0060 appears character-identically in 2 files \u2014 src/browser/browser_state.rs, src/filesystems/filesystems_state.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/browser/browser_state.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaabc3abfdafd23020fb71d3747887f6761d5630bdb2d932e95a5d7210b2b2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060areas.is_last() \u0026\u0026 areas.nb_pos \u003C con.max_panels_count\u0060 appears character-identically in 2 files \u2014 src/browser/browser_state.rs, src/filesystems/filesystems_state.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/browser/browser_state.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b15c002324cf46b1c86a4d0ddea74dc2d017a980717cb2c6f80ed56057fb8be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.ends_with(\u0027\\n\u0027) || line.ends_with(\u0027\\r\u0027)\u0060 appears character-identically in 2 files \u2014 src/net/message.rs, src/syntactic/text_view.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/net/message.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1753162774cf58d9330bdd6241ff86d041bdb6967fa142f58f51776f463e7d77"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060replace_args\u0060 turns every \u0060Err\u0060 into \u0060String::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/verb/execution_builder.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0c2013f052257e32dc40544199fc72c3bcace549210eb8e63448e49ada65c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060component\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/kitty/detect_support.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb744682befb873538f3fe7ad379e78147c4e5f937b46c43fc81de58192443"}}],"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-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"}]}],"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":11,"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."]}]}