{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"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":"Editor::handle_debugger_message (cyclomatic 76): Editor::handle_debugger_message has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7ef5539ad719923e8dc78423310837f5c8b9a63ae385b4cf43ea878f69fa50"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyEvent::from_str (cyclomatic 69): KeyEvent::from_str has cyclomatic complexity 69 (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":"helix-view/src/input.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede5e11c4f571c15d717605e02dbcca06acb75a0206c23126897359b3335d2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Application::handle_language_server_message (cyclomatic 60): Application::handle_language_server_message has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0d60e436f72c7f771301ba0728ce8cc5dc0b80d1bd242c097d3bc0898f7374"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdown::parse (cyclomatic 40): Markdown::parse has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e8df3dd9171fc9ad870a502d1a69930bcc07bc94a84010d690c3bf24587407"}},{"ruleId":"D1","level":"warning","message":{"text":"Prompt::handle_event (cyclomatic 38): Prompt::handle_event has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/prompt.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f783d5be449284c008dbe1ca1b2563408a8d35bfa4ce1bf21739e3c45eb69dbc"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::parse_args (cyclomatic 34): Args::parse_args has cyclomatic complexity 34 (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":"helix-term/src/args.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"866448699928904b38968537158f776323b869792c8ce67b99318a117cc9fa33"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionItem::format (cyclomatic 34): CompletionItem::format has cyclomatic complexity 34 (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":"helix-term/src/ui/completion.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf94bb01503a0ee499a9ac5b1827ca877095233b8fb38ed0040d405710fa792"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::indent::containment_accounting (cyclomatic 30): helix_core::indent::containment_accounting has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bb9206397340ca92082737c141a291e43ec30f98e6dbce1f99dff32997a200"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::save_impl (cyclomatic 30): Document::save_impl has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"1276897d371efcb9cfa07a68c375f7b328fe2a7b2d7fd031584cdd7a8fd7f4ea"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::handle_mouse_event (cyclomatic 29): EditorView::handle_mouse_event 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9295c7b91cb656115a0082ef71fb7916c6ec17448479970e271b2b8c98ddf1a6"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_tui::layout::split (cyclomatic 28): helix_tui::layout::split has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/layout.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f7e13983e53740120d8ba0b013eee7eac8552cf6a835bb0683a10f22587249"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::increment::integer::increment (cyclomatic 26): helix_core::increment::integer::increment has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/increment/integer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"596af2f951e9c7cef891e5c106b406011c3d2d049b4b759a2c21114ae87c99d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Picker::handle_event (cyclomatic 26): Picker::handle_event has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7c08c339a93d10bba30fa7db8e08e0c82ac329ed215e516fce6f815b36fba1"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::tasks::highlightcheck (cyclomatic 26): xtask::tasks::highlightcheck has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (xtask::tasks::highlightcheck::capture_scopes) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1899e97013a69d12c13caa87c7861629244166cddb5b9a68af3642e230ad202f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::handle_event (cyclomatic 25): EditorView::handle_event 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4bf42e41123569d1566c530a93f0a0f7e0841997564ddaccfbf2941d5494c1"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::movement::reached_target (cyclomatic 24): helix_core::movement::reached_target has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/movement.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcd436887d686bb49f90d258d926805f8aaa95f41d484d5ad2b4418c64e175f"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::commands::goto_file_impl (cyclomatic 24): helix_term::commands::goto_file_impl 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":"helix-term/src/commands.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d296b32f9dfbabf254d0a5354312b6ed71f64ca8a358edf367c319d3e69857"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::commands::syntax::syntax_workspace_symbol_picker (cyclomatic 24): helix_term::commands::syntax::syntax_workspace_symbol_picker has cyclomatic complexity 24 (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":"helix-term/src/commands/syntax.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d6622c1d831c37cc0a160253775926cc7ae7d81ed916782efc3bffafd49bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::doc_selection_highlights (cyclomatic 23): EditorView::doc_selection_highlights 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f385ad658ae8c8d5d0a163103584a8e22e105d8b7a9181bdc518849853c53f04"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::indent::auto_detect_indent_style (cyclomatic 22): helix_core::indent::auto_detect_indent_style 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":"helix-core/src/indent.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c692eb3edf247233b963c6c42cb163b15cb4237689d09d6b1fab8aa72f440e"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::textobject::textobject_paragraph (cyclomatic 22): helix_core::textobject::textobject_paragraph has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/textobject.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c29c79c530b51166b00432f18ce61d29539de23754425323ef303c8d98e0524"}},{"ruleId":"D1","level":"warning","message":{"text":"Prompt::eval_movement (cyclomatic 22): Prompt::eval_movement has cyclomatic complexity 22 (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":"helix-term/src/ui/prompt.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadd0a636bc593b29ee80665f1e2aec0250dcaaac827dbc296b769d03f4059c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::apply_impl (cyclomatic 22): Document::apply_impl 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":"helix-view/src/document.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb576cafeb5732892374efde7240315420eb45f01669cabefce276121eedf5"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::match_brackets::find_pair (cyclomatic 21): helix_core::match_brackets::find_pair 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":"helix-core/src/match_brackets.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"13162fb0d073b57ae3945137d268002d8be439d59a583821300a954e386e3900"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::render_view (cyclomatic 21): EditorView::render_view 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d9375a5cbcc81cd4a3e703bc9e3da6ccfa39f30c670dc6ab37227dbdeb5cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::commands::select_textobject (cyclomatic 21): helix_term::commands::select_textobject 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":"helix-term/src/commands.rs"},"region":{"startLine":6253}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c0ca7ef8ac1956bff004e87435605ad583abde5a118a4cf2c7fcbf9e2120ce"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_loader::grammar::build_tree_sitter_library (cyclomatic 20): helix_loader::grammar::build_tree_sitter_library has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/grammar.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3672f50c11c335a1e855d32d90c767149459dd61799c95ab1ba47b1f3edaef2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport::send (cyclomatic 20): Transport::send has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/transport.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb101cf2258e6f898115e866ca49b57e67656cf1cad7b8d299cd22fe1cf4284f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorConfig::from_pairs (cyclomatic 19): EditorConfig::from_pairs 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":"helix-core/src/editor_config.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f5f4c077ce214e14dbe1091ad4295f88e8b6802a0a81d739735f4c4ca30a88"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeSet::compose (cyclomatic 19): ChangeSet::compose 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":"helix-core/src/transaction.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"823d47e679b5374d6095a2b03d43a2e54fec0dd63fc90f7e8c6365084a2360d8"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRenderer::draw_grapheme (cyclomatic 19): TextRenderer::draw_grapheme has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/document.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf8de0b9bbc15682691cd17654432444babe702e5eddd4d6b5c7524b2185070"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::render (cyclomatic 19): EditorView::render 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bb72e2027ce981123d05e551f630e43a834720537b20099d82463581f7b47a"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::handlers::code_action_hint::register_hooks (cyclomatic 19): helix_term::handlers::code_action_hint::register_hooks 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":"helix-term/src/handlers/code_action_hint.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4d1b02553a1e04f337fdf4fc5347cbfcb19f3556e0ea252b104fbf83a1c6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::commands::lsp::compute_inlay_hints_for_view (cyclomatic 18): helix_term::commands::lsp::compute_inlay_hints_for_view has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: helix_term::commands::lsp::display_symbol_kind (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2206636a917998004f3a578d9f64d747d755f68948242a7e5717cb23b2aa8db7"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::commands::typed::get_character_info (cyclomatic 18): helix_term::commands::typed::get_character_info has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a849bc0fdd776a0e11f47d7106ebda64d9ded7eb029d8ef14370b36d81365c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModifierDiff::queue (cyclomatic 18): ModifierDiff::queue has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: SetUnderlineColor::write_ansi (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1042d0b629b6318553fa944502116604d32d049ff3b572853cb767cbe5ea5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Buffer::set_string_truncated (cyclomatic 18): Buffer::set_string_truncated has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/buffer.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaf8fcb164f3f6fe5a6781bec1acd2aa1b5fb361ab1289c727af2aa8610c490"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_tui::backend::termina::diff_modifiers (cyclomatic 18): helix_tui::backend::termina::diff_modifiers has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8de7914c2a34221ccacbf13b3eed629ccf5b88130d4d356de60a7265f2c23e"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::tasks::indentcheck (cyclomatic 18): xtask::tasks::indentcheck has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce384d7a0f2c883a0d66731eb42d39245f74cc17f8bdf9afe07a574be939c4aa"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::indent::query_indents (cyclomatic 17): helix_core::indent::query_indents 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":"helix-core/src/indent.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"5222d0af2279584b87a367b8cd92ad0d6dacfc1df85957a9a282f65afd132e97"}},{"ruleId":"D1","level":"warning","message":{"text":"Completion::render (cyclomatic 17): Completion::render 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":"helix-term/src/ui/completion.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85d616e074dd23b830bf937674446b6332ca9b3ebc0c4929c70a0e3ddbed109"}},{"ruleId":"D1","level":"warning","message":{"text":"Picker::render_picker (cyclomatic 17): Picker::render_picker 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":"helix-term/src/ui/picker.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5fabd879e2401258145133ec564f76f2dba297aa548a1f3b5b17740564a0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Prompt::render_prompt (cyclomatic 17): Prompt::render_prompt 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":"helix-term/src/ui/prompt.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"35295e14c1ba9ea3f9107413cb58e262ed5b9b1b95532577e83c69aaac01439e"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::commands::typed::write_all_impl (cyclomatic 17): helix_term::commands::typed::write_all_impl 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":"helix-term/src/commands/typed.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919721fb3238274d168438c746e7660e32766d9c91fae8ef071322343124185"}},{"ruleId":"D1","level":"warning","message":{"text":"List::render (cyclomatic 17): List::render 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":"helix-tui/src/widgets/list.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41cd28fe89f69ec6d1f3d32614dc8624cd2abe5506d7554b711794afc7fa52f"}},{"ruleId":"D1","level":"warning","message":{"text":"ClipboardProvider::set_contents (cyclomatic 17): ClipboardProvider::set_contents has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/clipboard.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f297c4e8805a957818d8f817642a2e63a23231adeb5d9cb6b903130bddd8ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::lsp_diagnostic_to_diagnostic (cyclomatic 17): Document::lsp_diagnostic_to_diagnostic 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":"helix-view/src/document.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d33451dabf63e0fa5db23af82d86c92c8cb41941094270bc409d3376cfee00b"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_core::auto_pairs::get_next_range (cyclomatic 16): helix_core::auto_pairs::get_next_range 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":"helix-core/src/auto_pairs.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8394a0830f8e8e934ddd18dbab8dae521e0ae1aad24b4d117a1cbc88e0d0113"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_stdx::path::normalize (cyclomatic 16): helix_stdx::path::normalize 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":"helix-stdx/src/path.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ce07b49ba6a02f7f477254a384a3318391aeef24c195260bf1c5c11d1ecdc8"}},{"ruleId":"D1","level":"warning","message":{"text":"Application::new (cyclomatic 16): Application::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":"helix-term/src/application.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3efe8c154f4cea15ed765a1fd92f1311a1bc344a4ff6e14625fce0f1c30fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"Application::event_loop_until_idle (cyclomatic 16): Application::event_loop_until_idle 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":"helix-term/src/application.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d281ad1dd64ff277a5168f97a2605bcf11fcfa3bb0a06b607c92504b2d3d973"}},{"ruleId":"D1","level":"warning","message":{"text":"Completion::new (cyclomatic 16): Completion::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":"helix-term/src/ui/completion.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"311264f2ecf6f7e82c85e02a731b1343f9489429c211abc5e5c1554da69e2338"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::doc_diagnostics_highlights_into (cyclomatic 16): EditorView::doc_diagnostics_highlights_into 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"758b3058b9840625e018b9cd59a6567373bb204086f8b4af47c430c220bc1fdd"}},{"ruleId":"D1","level":"warning","message":{"text":"helix_term::handlers::document_highlight::register_hooks (cyclomatic 16): helix_term::handlers::document_highlight::register_hooks 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":"helix-term/src/handlers/document_highlight.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9e996f761c0d9baf21e3ceb8e6b1775f23283545b46436fbbc58e0571a2df1"}},{"ruleId":"D1","level":"warning","message":{"text":"WordWrapper::next_line (cyclomatic 16): WordWrapper::next_line 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":"helix-tui/src/widgets/reflow.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e7ad81cdf7ced98c2409de825a970622a13f7da5cd407d51cd234fd516c9a7"}},{"ruleId":"D1","level":"warning","message":{"text":"View::offset_coords_to_in_view_center (cyclomatic 16): View::offset_coords_to_in_view_center 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":"helix-view/src/view.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6e720ff3fdb58568d46771b94cc706c23bad1c042a4852e9d21c9b6bd96d2b"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::tasks::highlightcheck::capture_scopes (cyclomatic 16): xtask::tasks::highlightcheck::capture_scopes 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. This shape REPEATS in the file: one other method here (xtask::tasks::highlightcheck) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfc4f297c9f8868d7da96e6d1927118dbf0c31a1589be3e805d8e311818d2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::handle_debugger_message (cognitive 188): Editor::handle_debugger_message has cognitive complexity 188 (threshold 15). Drivers by points: if/else 36 (115 pts), match/switch 22 (48 pts), loops 6 (25 pts) (nesting depth added 124). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"46752388ec7d4b91e4dcbf0666359db7d2bb94792b670d58c8471f88bfffa544"}},{"ruleId":"D2","level":"warning","message":{"text":"Application::handle_language_server_message (cognitive 129): Application::handle_language_server_message has cognitive complexity 129 (threshold 15). Drivers by points: if/else 24 (73 pts), match/switch 12 (36 pts), loops 5 (18 pts), boolean chains 2 (nesting depth added 86). 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":"helix-term/src/application.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d346d5fbc5d453f234ab6126a33e2fe9292bf561ef0e5004e0970e0374c2495"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::handle_event (cognitive 67): EditorView::handle_event has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (58 pts), match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 45). 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5148ebaa4b3566be32d93b1847c14884c9b88f6bb26d64ded8659c242d1baf"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::goto_file_impl (cognitive 57): helix_term::commands::goto_file_impl has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 6 (11 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9141fbf9c7bfa1bbe092d6b96fa19d88cb60ae19be196ca34d6c1ee02dfaed10"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::tasks::highlightcheck (cognitive 55): xtask::tasks::highlightcheck has cognitive complexity 55 (threshold 15). Drivers by points: if/else 25 (66 pts), loops 12 (24 pts), match/switch 3 (8 pts), boolean chains 6 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (xtask::tasks::highlightcheck::capture_scopes) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a72fcd475208fbcc20c263586252ca887b9ebb261bef5d15b422f7a9262912"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::handle_mouse_event (cognitive 54): EditorView::handle_mouse_event has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 6 (14 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c295e7972ba3dbf234cb98bd656666bd9bdc779869edb293e5329cdee3ff3c35"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::parse (cognitive 54): Markdown::parse has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 7 (22 pts), boolean chains 2, loops 1 (nesting depth added 30). Of this number, 53 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6729f86faf137ccbf19894158b1d22376d81f4e735b6119c07d02452a2b672"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::indent::containment_accounting (cognitive 52): helix_core::indent::containment_accounting has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 10, match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3177f5b3b1976aac65d844f217795a76cc5eef5f3ace6db40ccaf7085ac31da"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport::send (cognitive 51): Transport::send has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 6 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 32). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/transport.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4748ad17031ef79ac784f0281cbe0cebb181472320aef52cd2c5d6a0ba8770"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::match_brackets::find_pair (cognitive 50): helix_core::match_brackets::find_pair has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 30). 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":"helix-core/src/match_brackets.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d53442bf9d381d49deff16ad781c2b2a7b89609a1014a7141c16b6b926b2b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::save_impl (cognitive 49): Document::save_impl has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (42 pts), match/switch 4, boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5cc46ce1ff7f33f1479b07b2ce391ee5900eec2dbf6dbf2cc1268a57f15fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_loader::grammar::build_tree_sitter_library (cognitive 46): helix_loader::grammar::build_tree_sitter_library has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/grammar.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"801dcce2f07c8f77617d9f8c1c4d329a4d9bb50af36e7d83882cd85adf536bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::increment::integer::increment (cognitive 43): helix_core::increment::integer::increment has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (30 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/increment/integer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"74086a1e35cddad31107202022ba625ba91e7a8f5b53754ce3b47d2a17b06dec"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::tasks::indentcheck (cognitive 40): xtask::tasks::indentcheck has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (31 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 23). 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":"xtask/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f18c21ee0de5ed72ca9e4eceb6e3c5bc453eef171c243c5d30e4fb6ced35c93"}},{"ruleId":"D2","level":"warning","message":{"text":"Prompt::eval_movement (cognitive 39): Prompt::eval_movement has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 7 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/prompt.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"056e509f2c3b12d00b64c02ef978e58767a7d7c24124f434b7f5398840483cec"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler::run (cognitive 38): Handler::run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/file_event.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfce05b4f0ecb745d43e87078a09d3ae9443b4b095264c386f807b86420e2db"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::doc_selection_highlights (cognitive 37): EditorView::doc_selection_highlights has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 9, match/switch 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d9d5a996c3fc27e1bb5cfa4fe387b4311a61924cc18901f7a2bf6e1fa2cc22"}},{"ruleId":"D2","level":"warning","message":{"text":"Picker::render_picker (cognitive 37): Picker::render_picker has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1313285c6fe73fd2654795678d9252293be2df2d7ab68a57f8819c53e8420e74"}},{"ruleId":"D2","level":"warning","message":{"text":"Picker::render_preview (cognitive 37): Picker::render_preview has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 1 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 22). 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":"helix-term/src/ui/picker.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a3cc90f51037754a2992f9ea8d658e7ab2d7491e2ad1ded4cb07bd4f44ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeSet::update_positions (cognitive 36): ChangeSet::update_positions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (9 pts), loops 3 (7 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cc91ef04fd9d23466b58111a37ef02c955de846ae7d81c9b125d8c3f590feb"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::parse_args (cognitive 36): Args::parse_args has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 9 (23 pts), if/else 4 (8 pts), loops 3 (5 pts) (nesting depth added 20). 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":"helix-term/src/args.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf1a446e1b66322130fc097452eb5086e18b66dbbe6722ce661415a547ea57c"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffer::set_string_truncated (cognitive 36): Buffer::set_string_truncated has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/buffer.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4256d4d27282ad3859fd9bb2eeaa10637d823edeec78d058c30219f833698e3"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::tasks::highlightcheck::capture_scopes (cognitive 36): xtask::tasks::highlightcheck::capture_scopes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (10 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (xtask::tasks::highlightcheck) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4156a5726630235ac31d6bfd040f9bd6f07fdbb93fae4349834a641edbc2d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::indent::candidate_body_for_new_line (cognitive 34): helix_core::indent::candidate_body_for_new_line has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd496a60f125f4ed93ac9a37e72ccb8c686b38d23b0dd5169e1a21f295c2b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Prompt::handle_event (cognitive 34): Prompt::handle_event has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 2, match/switch 2 (nesting depth added 19). 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":"helix-term/src/ui/prompt.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"0992e244e755088de69a28369bfb79a909f47b71d5bc2dcde6d99e55dd2e9db7"}},{"ruleId":"D2","level":"warning","message":{"text":"Application::new (cognitive 32): Application::new has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (10 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1879851bef3f0cb146b40e677f0322a3500af0702472c9595a3c56db9538cc1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Prompt::render_prompt (cognitive 32): Prompt::render_prompt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/prompt.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd406fced06239b65d54b2123a4477b510af7cafd1e16a55896af717da8bee8a"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::indent::auto_detect_indent_style (cognitive 31): helix_core::indent::auto_detect_indent_style has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c8b03c470b3b51a41f65fdb25ef6df2dc281e002e147ba419a6ae997ec4517"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::indent::query_indents (cognitive 31): helix_core::indent::query_indents has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4910b3a85379631c89363896875ac3772ec10c54706dd0e2f59af674678394"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::lsp::compute_inlay_hints_for_view (cognitive 31): helix_term::commands::lsp::compute_inlay_hints_for_view has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (8 pts), loops 2 (5 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":"helix-term/src/commands/lsp.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b898dfac79520f00265ca4c03dc97841d28937cd05d3bbc3ed78fca766fe475b"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::syntax::syntax_workspace_symbol_picker (cognitive 31): helix_term::commands::syntax::syntax_workspace_symbol_picker has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 5 (6 pts), loops 3 (4 pts), boolean chains 1 (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":"helix-term/src/commands/syntax.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef57d73e775ae30349667262cf309403c12bb98b2942b0ee98273cb15e580a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::apply_impl (cognitive 31): Document::apply_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef04c7428a25c626cb9cdd091c9ff7e165d87f6b120ec122dc6cc577b7bd3c33"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::indent::extend_nodes (cognitive 29): helix_core::indent::extend_nodes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c3c541d4e5ac454950fddcd0aaecf3ae871a61093c4341dde33f2a9867f23"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::render (cognitive 29): EditorView::render has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a89034fd81aba6fe8f3086f8be104b2df41751cb255c76b9fa57f43ef4c09f"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_tui::layout::split (cognitive 29): helix_tui::layout::split has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (12 pts), loops 7 (11 pts), if/else 5 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/layout.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f30c501235516d87738dda6c19869ebd9cfb8ebe81cf6d3b3823d5e5e31a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Completion::new (cognitive 28): Completion::new has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 5 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c5b368437a526249d8111aa3ce7c80fc5ad370aa9c27b9b64a22d102ea6682"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::render_view (cognitive 28): EditorView::render_view has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bb4d0660e0247a364d18d25391dbb35f39dc40e91769b9898596f04b142e6"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::copy_selection_on_line (cognitive 28): helix_term::commands::copy_selection_on_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8b29bb7d211e4f8bc509c24b7f5a7e423f902859fd0a84ac0ca1d602f6e109"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::typed::get_character_info (cognitive 28): helix_term::commands::typed::get_character_info has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (9 pts), boolean chains 1, 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":"helix-term/src/commands/typed.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d743364406daac3409c8a69c6e6dd6df99375a4b20c3ab95f0c1d806ce679456"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::textobject::textobject_paragraph (cognitive 27): helix_core::textobject::textobject_paragraph has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (15 pts), boolean chains 7, if/else 4, match/switch 1 (nesting depth added 7). 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":"helix-core/src/textobject.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac696b049662e89e2f56ae67bfecc0fa09c2a5f9d3fc8e23a051791025759ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Picker::handle_event (cognitive 27): Picker::handle_event has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ca675fdf123a10690b122b2a4a2579564999a48838056da9d5cdc2c34b7166"}},{"ruleId":"D2","level":"warning","message":{"text":"List::render (cognitive 27): List::render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 7 (10 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/widgets/list.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3951a6d39b954df98f3c92c816bc8f16faff0adeca54e8ee53f468874f3a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"WordWrapper::next_line (cognitive 27): WordWrapper::next_line has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/widgets/reflow.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0c9d69e3988a9a3da022d8baba84a8f1c82a1f8d99ced047a6e289dc85906"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeSetBuilder::process_hunk (cognitive 26): ChangeSetBuilder::process_hunk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/diff.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b85192160745e5eb64faa2659190926100fcd559a8984edd3c4b19306cbe0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Transform::apply (cognitive 26): Transform::apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (8 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/elaborate.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d143c5780015f612fde0c9f8c203ff78c074d87fb8a2b71b4853f790714675"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::join_selections_impl (cognitive 26): helix_term::commands::join_selections_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 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":"helix-term/src/commands.rs"},"region":{"startLine":5312}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ca3af80f8e378ff8020b5acf9fd4a2869ed1a4670f8b6edf336b7ce45c35f2"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::comment::find_block_comments (cognitive 25): helix_core::comment::find_block_comments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/comment.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8208066caa5d292f70ec81e84a8def9887e137e3f7138960adc1433ddf0a48"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::indent::indent_for_newline (cognitive 25): helix_core::indent::indent_for_newline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 1 (5 pts), loops 1 (4 pts) (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":"helix-core/src/indent.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1571e6cb2ae51f1cde0a57e8201946e2a4f82925ef4076cdaecc22b16d7966"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::position::visual_offset_from_anchor (cognitive 25): helix_core::position::visual_offset_from_anchor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd287526d20eaa8da6fdd04279de168fa60b11d9393f617686445b6f4c80cfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"PickerQuery::parse (cognitive 25): PickerQuery::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker/query.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436b75ec5cbeda2226d3c7da45d8d9cbf92c5bc5a1c91b2c11bbf3cec8f8ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"Picker::get_preview (cognitive 25): Picker::get_preview has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d112a3edca4a197e7e42506e8857033f443c944dab453c906dfb8b8c0862568"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::shell (cognitive 25): helix_term::commands::shell has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (6 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":"helix-term/src/commands.rs"},"region":{"startLine":6646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3567446352bb3b781c34a2e6b12ec24b53545e4054827f08031409f8ada3285b"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::jump_to_word (cognitive 25): helix_term::commands::jump_to_word has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":7092}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d8d40796ac612d83a8f22f641f99c0c609ed792b76a83820d7a8c5322a30a7"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::typed::write_all_impl (cognitive 25): helix_term::commands::typed::write_all_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"387afc5015684c077164c3f12a23d02134efb9fceea427133012d506fd2d565d"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::recalculate (cognitive 25): Tree::recalculate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (9 pts), match/switch 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/tree.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd4414a9611b91fdd12097f6efb57f0885320e5853491b7ce40bacffd3ee53a"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_stdx::path::normalize (cognitive 24): helix_stdx::path::normalize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (9 pts), 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":"helix-stdx/src/path.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c6ef1dd12e2f6b5d4dadcff8014f0bf8fd46af2cc4494b4f2f9aa097233af6"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::handlers::code_action_hint::register_hooks (cognitive 24): helix_term::handlers::code_action_hint::register_hooks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/code_action_hint.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e3a22db245714dc255573e3783decd611fbc1cb5d245be0786cb498c83d3de"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::ui::document::render_text (cognitive 24): helix_term::ui::document::render_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/document.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"18963bda25219cb0dceb2b9d52ddee3d6769a772dd98f1754ccd953033aa90ce"}},{"ruleId":"D2","level":"warning","message":{"text":"LineTruncator::next_line (cognitive 24): LineTruncator::next_line has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/widgets/reflow.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4a635a3913ec226bcfd88285e9c6a4f5204fc40a526956b848c3d1b9a92a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::doc_diagnostics_highlights_into (cognitive 23): EditorView::doc_diagnostics_highlights_into has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), loops 2 (3 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1571a56792486d9515087ead3be549ae77da5dd9e72fbf4f6641a3ab45a6ef4b"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::ui::markdown::highlighted_code_block (cognitive 23): helix_term::ui::markdown::highlighted_code_block has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f26e56ff4556dc16f27389f02431111f56103fd782a77da341e290a668fab1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::render_table (cognitive 23): Table::render_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/widgets/table.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9560012bc2326f0cf32e6d74ff6c062cfdee86e52bb618859df46d9f8bee0bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ThemePalette::parse_style (cognitive 23): ThemePalette::parse_style has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/theme.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c551bc0d94c33fa5485715d34f244dfcd07002f671085179336e161cf55da7ce"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::insert_mode (cognitive 22): EditorView::insert_mode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (6 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0225c1e74c4cbc11f79c8db91d9a28fbab0afc98320329d7f435ca8a4952e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::command_mode (cognitive 22): EditorView::command_mode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca54701bc6bc30233613f5804597e5400c293a10990a6b3cfae3aaf1a2a7bca"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::jump_to_label (cognitive 22): helix_term::commands::jump_to_label has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (22 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":7000}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc54a0151765e81272bd6e1c3cb47b1dac63034e122398cc8ba690ad6b07a40"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::ui::completers::filename_impl (cognitive 22): helix_term::ui::completers::filename_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 1 (3 pts), boolean chains 2 (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":"helix-term/src/ui/mod.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5a2fbee579261a71cf3dbac3bad51fc332b185f44e72193df77ad2d77f0b80"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminaBackend::draw (cognitive 22): TerminaBackend::draw has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b832ea3e50b63206f0c5c561a44ec760a9a5c1ffbe214b520d5c0d865efd01"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::switch (cognitive 22): Editor::switch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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":"helix-view/src/editor.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2136b9758cab141cd31c87b6fb712fbefacb523bfd3d127f2007fd6416edbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::auto_pairs::get_next_range (cognitive 21): helix_core::auto_pairs::get_next_range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, 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":"helix-core/src/auto_pairs.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2325bd9e3b02006d1593a643960e153ff4ca710f8d30a220915158aa64509a1"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_loader::merge_toml_values (cognitive 21): helix_loader::merge_toml_values has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (6 pts), loops 2 (6 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/lib.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a40bf31a0db8ea8d0fb63a0e4dc6e3a17f55caca8e7112f9966867e2d190416"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::changeset_to_changes (cognitive 21): Client::changeset_to_changes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 2, loops 2 (nesting depth added 9). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (traverse). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29a2e4a3f799cf5523d221ed7630aef469f94bc822d9595bff7a6a4ba67afc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Application::event_loop_until_idle (cognitive 21): Application::event_loop_until_idle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"115076530fed80a3a693105e7dffe00c861f39ac3c8a3b5acdf7e7c3cf31d991"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::health::languages (cognitive 21): helix_term::health::languages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 5 (7 pts), match/switch 4 (7 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":"helix-term/src/health.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02ddde51fb3a89414d6bcbd1e5ebebefbe3e3f5416788529017699b2a2b451f"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::apply_workspace_edit (cognitive 21): Editor::apply_workspace_edit has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (8 pts), if/else 2 (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":"helix-view/src/handlers/lsp.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cb0ca6cbe61b65feb20ca9a2d4d35b96f64b635c1bc73a92caf0c3a1a285cc"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::search::find_nth_char (cognitive 20): helix_core::search::find_nth_char has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/search.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d141c7dd17805e572b8a3c34b2874075a6660cb52cc90134c610c7afedac64a7"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_stdx::faccess::imp::eaccess (cognitive 20): helix_stdx::faccess::imp::eaccess has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (4 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":"helix-stdx/src/faccess.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4818214762ec4186d5abd4ce9145b9fc63704904373d129d8e0bc4a0fb9a71e"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRenderer::draw_grapheme (cognitive 20): TextRenderer::draw_grapheme has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/document.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f913c31eba6779f7b0c9be8545733aed76b9e106f02967b94f0df719172e297"}},{"ruleId":"D2","level":"warning","message":{"text":"Popup::render (cognitive 20): Popup::render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/popup.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2723a265b674bb6e0615febd14ba09ffc8480e08b703367c9b02236294e58d"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::typed::theme (cognitive 20): helix_term::commands::typed::theme has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 9). 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":"helix-term/src/commands/typed.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6521c49702fed320ff50dbdfa3ac9f177988b81c1819986fc9e7731c0f5c5a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::lsp_diagnostic_to_diagnostic (cognitive 20): Document::lsp_diagnostic_to_diagnostic has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (6 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":"helix-view/src/document.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0217f915799df9cadb6441cb2e01340cc0ba0fa0ea930df42dd29f7d1c58b"}},{"ruleId":"D2","level":"warning","message":{"text":"Syntax::rainbow_highlights (cognitive 19): Syntax::rainbow_highlights has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/syntax.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7c13401cdb42d4029203b15c68d7afddbfb9cc086b4433da57dea26876e088"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::wrap::reflow (cognitive 19): helix_core::wrap::reflow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/wrap.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e75a6cef044a082a510791f3eda484adeb5ecda6fb0da73e666904eada9525"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport::recv (cognitive 19): Transport::recv has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 2 (4 pts), if/else 1 (3 pts) (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":"helix-lsp/src/transport.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b342742e163c8ab3ee8d77735399633673ad0888c1e6d854d45749c5f860f3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Jobs::finish (cognitive 19): Jobs::finish has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/job.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"503de020da1fe4eac9468d9af9aa8a555ecf75f62e8e48f752a65a70173ea3e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Completion::render (cognitive 19): Completion::render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1aa4c040ef40a2262a600780479ed2ecc28e8d77b329d755341d40a9efab59"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::handlers::completion::request::request_completions (cognitive 19): helix_term::handlers::completion::request::request_completions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/request.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc1c45dae54f057b006c816e9bf7cf046fa0a7844be1a681755a5809b4320da"}},{"ruleId":"D2","level":"warning","message":{"text":"CrosstermBackend::draw (cognitive 19): CrosstermBackend::draw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c073e8a965672d28ab3fba13a9b7d5c39e857a0a40a20b346ef562031ecee19b"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::render (cognitive 19): Paragraph::render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 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":"helix-tui/src/widgets/paragraph.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"41663e85358bf81ce8ca77d8e0d4d85abd70a05d58496c0b31f67a2c19e7a5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_stdx::env::expand_impl (cognitive 18): helix_stdx::env::expand_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/env.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bec0db42d29cc8ee7039c4cbfcb23f1537164f1644cb722b2ce1147d307faa"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::find_char_line_ending_motion (cognitive 18): helix_term::commands::find_char_line_ending_motion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ac84542ca75db9a9cd8c0a9dfa7e58981bc32192d7bfc4c4df4e2cf2f42a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::search_impl (cognitive 18): helix_term::commands::search_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb25f080dcc0ca1dfe4fb64dee07d993866e901a3662d9bd362f9a1fc20c168"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::lsp::code_action_on_save_step (cognitive 18): helix_term::commands::lsp::code_action_on_save_step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa53d7ea90d0b3f3d76b3f94f6e35c7047c6695d4eee2ab1363d01d41c1dfba6"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::handlers::document_highlight::register_hooks (cognitive 18): helix_term::handlers::document_highlight::register_hooks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/document_highlight.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"09babea6eb9c26b607841815a33b91c08ef26d2014d297954a7e104ed7a6ea85"}},{"ruleId":"D2","level":"warning","message":{"text":"ModifierDiff::queue (cognitive 18): ModifierDiff::queue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6b063204e2f3e58700f77a7629cd28b5858ecc74dd32804858fd8d5572893b"}},{"ruleId":"D2","level":"warning","message":{"text":"Block::render (cognitive 18): Block::render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 4 (8 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/widgets/block.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f7a892164a4f9be06a154ae45e9d98201b15f3ac4685fa71457839f993e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_tui::backend::termina::diff_modifiers (cognitive 18): helix_tui::backend::termina::diff_modifiers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99d4226cd606c685f7caaadb4058fbf44660249d1df99b5d668e8466e82fd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"View::offset_coords_to_in_view_center (cognitive 18): View::offset_coords_to_in_view_center has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/view.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"264c2acabca09859f33b853ec52f5e21d7d0d7eb5586992c0142204d90b81887"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_view::input::parse_macro (cognitive 18): helix_view::input::parse_macro has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/input.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffafb7c60d58dcd0ab8d56c709ac88495eecca98c7af301873d375104131188"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::push (cognitive 17): Args::push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/command_line.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec629af14b8234ddff26df9a6138ad7fcdf6ee509ce930dbdcd5d0e2b0545e"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayHighlighter::advance (cognitive 17): OverlayHighlighter::advance has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 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":"helix-core/src/syntax.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"5076a8ae046d1ee8f7e34fccf49d408cec17a175112d0f229c663b5818baf9d0"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::match_brackets::find_matching_bracket_plaintext (cognitive 17): helix_core::match_brackets::find_matching_bracket_plaintext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/match_brackets.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c82525b7566aaebfa6267c76b03f215300f258f3ac09fe61f0047a4c60c33a"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::movement::reached_target (cognitive 17): helix_core::movement::reached_target has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 16, match/switch 1. 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":"helix-core/src/movement.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5792b1acaf4bbc08b73511b43f2623ed2d8a1ee6bfbe09c5ae7d08ce3ba1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Popup::render_info (cognitive 17): Popup::render_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 5 (7 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/popup.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc0c7a53d55198bab66db2a030a024380a42a53fb0cefd7a83312c3ffb09ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::ui::file_picker (cognitive 17): helix_term::ui::file_picker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/mod.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf3efa3084be4a207c42b26dc43871ed01e685a3bc86f0bc21539811102392"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminaBackend::new (cognitive 17): TerminaBackend::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd4b6c9054e5229ea0d1cef016fe114233aba2a166c04957d196bb5ed35122b"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::movement::move_prev_paragraph (cognitive 16): helix_core::movement::move_prev_paragraph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (helix_core::movement::move_next_paragraph) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/movement.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b814705654e9f17b1847070c4b7ad7acc46d5f7d64edffea8fb1c813eada6380"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::movement::move_next_paragraph (cognitive 16): helix_core::movement::move_next_paragraph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (helix_core::movement::move_prev_paragraph) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/movement.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c060623b634e36ed88b9357fa015b79c2ceb36051ddfbe80b8bbeb18dab9ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_core::surround::find_nth_closest_pairs_plain (cognitive 16): helix_core::surround::find_nth_closest_pairs_plain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/surround.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ead0d10955e72105f27a5dd63cddd63f4fa8425b40d32661044e6de1ff80be8"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport::recv (cognitive 16): Transport::recv has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 2 (4 pts), if/else 1 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/transport.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd44c35a166efa2ebcdce789c7a1f05fe28497b16ceafea45a382df3882eb7f"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::global_search (cognitive 16): helix_term::commands::global_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecceffbb924c21fdfc457b01b6a22a93270e9fd11c6e4f3545049077318483b"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::open (cognitive 16): helix_term::commands::open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdf50f4b9a17e49cc08daaeb1839d5ec904571368af76249e4b49daabb08f52"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::shell_impl_async (cognitive 16): helix_term::commands::shell_impl_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":6579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88a1de622906054110a15dfed6fd122c2a774eec751bf752e608174ace9d1c7"}},{"ruleId":"D2","level":"warning","message":{"text":"helix_term::commands::typed::lsp_restart (cognitive 16): helix_term::commands::typed::lsp_restart has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"799041d31297cb364be4e57cbab7598cc31b6a09f8008c066993b29d2201c4d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffer::set_string_anchored (cognitive 16): Buffer::set_string_anchored has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (7 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":"helix-tui/src/buffer.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"554083ce49fb04b667e1c1f48b352585d149cebd1a05bb74d0ae5b0034188fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffer::set_spans_truncated (cognitive 16): Buffer::set_spans_truncated has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/buffer.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"790989170317eca62873f4511656937b9cccde976c3fd52fff9ba8347b1576fe"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::docgen::lang_features (cognitive 16): xtask::docgen::lang_features has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 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":"xtask/src/docgen.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f0eb29ae919e7116e9a87f4e74c2c3338ee258dc5abded44b4a3294f961f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 4779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 347 free functions. The bar is 500 significant lines; this is 4279 over it, 9.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c1f4ae95e492ec18585db61cc98846db087376b900897cd317eaa66086f281"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/typed.rs: FileTooLong \u2014 3225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 131 free functions. The bar is 500 significant lines; this is 2725 over it, 6.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eebec87d6812673449a3222a33c593af4098ec0f55c83763650a2173260af4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Document: TooManyMethods \u2014 111 methods. The bar is 30 methods; this is 81 over it, 3.70\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":"helix-view/src/document.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5241c1dc4a320ac48927c28a68c3d1c8ee241187b2ea0d1c2b595ee3ab73fce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/editor.rs: FileTooLong \u2014 1650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1150 over it, 3.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21826e85d28090b2b0a67cae8481ccd6567f6b5937ea79f3c4f2176aab0dd9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/document.rs: FileTooLong \u2014 1572 significant 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 77% of them inside a single declaration: Document (3 blocks, 141-2540). The bar is 500 significant lines; this is 1072 over it, 3.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":"helix-view/src/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79261de89425244eed64e0ba655b81357cbe82b25558b5155a5d17b1cb1ab8a1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Document: ClassTooLong \u2014 1211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 111 methods, 3 blocks, lines 141-2540. The bar is 400 significant lines; this is 811 over it, 3.03\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":"helix-view/src/document.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0353e3af69979f4b98517bb7a23cde5532f13cd3afb491b1fac22ba68b843f02"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Client: ClassTooLong \u2014 1171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 69 methods, 2 blocks, lines 56-1816. The bar is 400 significant lines; this is 771 over it, 2.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"51049edab329467aa05b7c950d965031915df498cc36e0afeb1ef0e7e717b172"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: helix_core::indent::candidate_body_for_new_line: FunctionTooLong \u2014 helix_core::indent::candidate_body_for_new_line runs 282 significant 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 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b686f640d8f3103430bc4697539157ed8d171d297cdcd13d323655d03a79b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Editor.handle_debugger_message: MethodTooLong \u2014 handle_debugger_message runs 280 significant 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 180 over it, 2.80\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":"helix-view/src/handlers/dap.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b8c37cc8a27e141178f6d63cab391c9c60e395661d2a892652c86dd6cc0037"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorView: ClassTooLong \u2014 1101 significant 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, 4 blocks, lines 38-1746. The bar is 400 significant lines; this is 701 over it, 2.75\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":"helix-term/src/ui/editor.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d12f6251a80ae06d40778fa8f23e8b293f5ac3bb0279d6f2d4318184e4ec190"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Application.handle_language_server_message: MethodTooLong \u2014 handle_language_server_message runs 275 significant 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 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1da11425827f0feafa2503b9b1caf3546806b4067590fb00e18917f286f67da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1338 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 838 over it, 2.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd846952b6a14d91ec5a5c03770017c6d858f92a76d6562ffce32a6e4991c80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Editor: TooManyMethods \u2014 76 methods, declared across 4 files: src/editor.rs (69), handlers/lsp.rs (5), src/document.rs (1), handlers/dap.rs (1). The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/editor.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72d2578a95a885e3fd77c6807651ded8805bd4a1c482fc8a13fb8f5d8e72ef8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client.rs: FileTooLong \u2014 1214 significant 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: Client (2 blocks, 56-1816). The bar is 500 significant lines; this is 714 over it, 2.43\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":"helix-lsp/src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b78f2a8b7d40d4d728beeca92ccc92ba34b5c403f00433a196fbe0550b74b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6deacdd1b189754f4c0bce3da83dda7212340c3915d1f329d61d61dae3a82d80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/editor.rs: FileTooLong \u2014 1150 significant 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: EditorView (4 blocks, 38-1746). The bar is 500 significant lines; this is 650 over it, 2.30\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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f781c40cc814bda5f44d75f94fb2b4e4c78b5a528abc3cea229ccb3a619368"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Application: ClassTooLong \u2014 818 significant 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 70-1366. The bar is 400 significant lines; this is 418 over it, 2.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":"helix-term/src/application.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a98bd295e4625d64f6982646d2f54191390668387f78614d63e159640503dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/lsp.rs: FileTooLong \u2014 1006 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 506 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4c71d85e3176375aaaf68e7c9c4072e0625fdecb4bc41c9e0d585df19c6f03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Editor: ClassTooLong \u2014 799 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 76 methods, 2 blocks, lines 1249-2589. The bar is 400 significant lines; this is 399 over it, 2.00\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":"helix-view/src/editor.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c50b3d5d7131ff095483f9879d7fea7fe1db6b1347aa953f8b70637611d8349"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/application.rs: FileTooLong \u2014 882 significant 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 93% of them inside a single declaration: Application (2 blocks, 70-1366). The bar is 500 significant lines; this is 382 over it, 1.76\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":"helix-term/src/application.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88492b6f1d54e0d03d9de1150d6f3204b7d208e341d55471f198fa3fca88a833"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: helix_term::commands::syntax::syntax_workspace_symbol_picker: FunctionTooLong \u2014 helix_term::commands::syntax::syntax_workspace_symbol_picker runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/syntax.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4d1ade9e8cd7c883fe959105fa8f85118559d5c20111393a0c38e28c3a6150"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/indent.rs: FileTooLong \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 374 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc8f7db9d3efca165c836a7e441fa225a82523c9214aeb97df6d95370b0d999"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap-types/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"441e83b8cc03aec2dea3b28df0b8a70b2a44932666d694b42f7db0ade2bc7d18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::tasks::highlightcheck: FunctionTooLong \u2014 xtask::tasks::highlightcheck runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e3138c0d09d24da9366e7650907e60ad810e7b49f85d79d57775ad15004167"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Picker: ClassTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 4 blocks, lines 241-1205. The bar is 400 significant lines; this is 245 over it, 1.61\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":"helix-term/src/ui/picker.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdda5391c1c2a3bb5cf19dcd3e445d6fcb61ba859c1fb6921d91f001a6f0495a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: helix_term::commands::global_search: FunctionTooLong \u2014 helix_term::commands::global_search runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b87e3372e2be72a244311395ca3f81272a1f5128b275b041d262cc93d14322"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/picker.rs: FileTooLong \u2014 795 significant 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 81% of them inside a single declaration: Picker (4 blocks, 241-1205). The bar is 500 significant lines; this is 295 over it, 1.59\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":"helix-term/src/ui/picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71c639066bc0917abd959ee2a0452b9263d882b53f6946269001c1d7cfc8c80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.initialize: MethodTooLong \u2014 initialize runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"497ba19e10d4f700cc457a350ea7b689365a1282411cf5fe91902f381551fd06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Document: TooManyFields \u2014 45 stored fields beside 111 methods. The bar is 30 stored fields; this is 15 over it, 1.50\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":"helix-view/src/document.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd7dcd48f34e7aca35f4f0b50abeb1e1df1d8f7dffdbceba518162f541bebfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/syntax.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/syntax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfef5c1654b568cd1cdd71ba80dfc552bfca67a8f1bcbe8de3f8b0ed37715d2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorView.handle_mouse_event: MethodTooLong \u2014 handle_mouse_event runs 144 significant 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 44 over it, 1.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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8966608b9db22483ca36462bc62ede0b338ce57c13f01c633daf803f18a0dcbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: helix_loader::grammar::build_tree_sitter_library: FunctionTooLong \u2014 helix_loader::grammar::build_tree_sitter_library runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/grammar.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cb3bb7e2b7f3145cb843cbb3c26fa79322054637f9a785f35f703af31d85cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Prompt.render_prompt: MethodTooLong \u2014 render_prompt runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/prompt.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4ef24aa6d90df3801e8f878c82b02f12f353f9940323c0dc00e3bbcd6c4da8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::tasks::indentcheck: FunctionTooLong \u2014 xtask::tasks::indentcheck runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f70aa5a9641fcc6a23053eb823595d0fa1489dc66ab47a8f9c3e440c9cb5ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e256fd895e6232b293ccdbc32a5eaea017bf6b5447a5f37244dff280c27ef573"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Picker.render_picker: MethodTooLong \u2014 render_picker 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":"helix-term/src/ui/picker.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"9532360c5d63818c5f181c5284cad79748d2bc2191c01eac1baf3789ec190066"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Editor: TooManyFields \u2014 39 stored fields beside 76 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":"helix-view/src/editor.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6303fb051797f145769f798e9c0296c285fc71e336d52652720482ddfe8b913"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/client.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a7e043ce9f222303a2e80ea2e008f17e8457b73ce2ab6cba7bbd6727978c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DebuggerCapabilities: TooManyFields \u2014 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27\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":"helix-dap-types/src/lib.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6718d5a0a33768ef8ad75c4fa6177bef8756692e70ddeb830bb83508b1d6f309"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Document.apply_impl: MethodTooLong \u2014 apply_impl runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"edeaf32444029b4facaaac684bd71d9f4c050980d8c756ecb09c78cc691f3118"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Prompt: ClassTooLong \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 4 blocks, lines 31-800. The bar is 400 significant lines; this is 97 over it, 1.24\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":"helix-term/src/ui/prompt.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f85406ce58aa20982c4f97bc180eb8fcc10cd8ae3de5e0ffb8797aa7dcb2039"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Markdown.parse: MethodTooLong \u2014 parse runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ce1fed798ade5e56a4a90cefa76ba270c5cc9dd8b498ae7a2cde0afe681868"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorView.render_view: MethodTooLong \u2014 render_view runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a336a94ffc81a7294b1f21182a3bf6b82284fb0bec4b0c0c1c7d21ef7e441"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Application.new: MethodTooLong \u2014 new runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"110a9e5aed0ef4fd6b1fb0020a1fcedf257079241da0303c7eec425505fe3838"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ServerCapabilities: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\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":"helix-lsp-types/src/lib.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfff73387829bddeccfc1b0fa85d0704ddf7f2b1a20d2ae85df1e6a31dd4141a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Prompt.handle_event: MethodTooLong \u2014 handle_event runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/prompt.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bdf80f93c44393a7f22342cf396b89d78dff34326edaa8a864b3e6c3bf2391"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TerminaBackend.new: MethodTooLong \u2014 new runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba85047c9613b980b27aa85b6dec91ffea4c7aacb400c4f55de1dfbcf3fb79d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/mod.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e2788b7bcccf6e5c31e9682489a8263ca5879de277f82e08fe73b6d9110cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Completion.new: MethodTooLong \u2014 new runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2cb3596806d5e67e2d0d44a58c13b9cf091f07dfa46642912f580c6d6602bf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MappableCommand: ClassTooLong \u2014 433 significant 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, 7 blocks, lines 214-721. The bar is 400 significant lines; this is 33 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"77251f6feead20b101c5383617daf36a9dbe8c898029c9a233a77b2a0012af1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/prompt.rs: FileTooLong \u2014 541 significant 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: Prompt (4 blocks, 31-800). The bar is 500 significant lines; this is 41 over it, 1.08\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":"helix-term/src/ui/prompt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d7c8b62c028a51c0df3e2bb4f7058156ba260b6c90002589ad393d72bcd4fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input.rs: FileTooLong \u2014 538 significant 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 61% of them inside a single declaration: KeyEvent (10 blocks, 65-678). The bar is 500 significant lines; this is 38 over it, 1.08\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":"helix-view/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"624d3711527053820b4d7658d330d79c90693f7f6704d8e40b04d0ed23e93d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/dap.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a17165061fb3514e44b6dd5e61d14ade1b0935839cf1e7e52c70eea8515a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TextDocumentClientCapabilities: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\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":"helix-lsp-types/src/lib.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3298e97ca7e55d44559073acd2bcccb1d2dd8c584c7223cd3e6e07c8ece6d287"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transaction.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b2dfb5377027c3855abeb09f62a717e4efbcf285bce7bf11d91aa81385bc14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/request.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894c2e121c01239bc5f982e6dd41210456cfb3e3bb7f07d7d25d1e8a22d2e48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Document.format_with: MethodTooLong \u2014 format_with runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e711af534c9ad9b451fbd83f288e2918a4adaa87057d487a91a4d0198a9484"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: helix_term::commands::lsp::rename_symbol: FunctionTooLong \u2014 helix_term::commands::lsp::rename_symbol 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":"helix-term/src/commands/lsp.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe67bf3008eb2eac5c92bfa63f694f3aca1602259727d85f63747925060aa28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorView.handle_event: MethodTooLong \u2014 handle_event 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":"helix-term/src/ui/editor.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bfe82c4967829423681eaee49606eeaa4f4da3c440128e4c28ba13f7c4c3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Picker.render_preview: MethodTooLong \u2014 render_preview 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":"helix-term/src/ui/picker.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"471e9e68a9608637728a25781dd0f3bb3b6f76152dc45c7ac64528aeb306254f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): helix-term/src/commands/typed.rs:384-459 | helix-term/src/commands/typed.rs:859-959 \u2014 These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8ce1c4881b0426812918f05f20b1e7fb51e91b773480e6356e5b73d00c1688"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): helix-term/src/commands/dap.rs:655-694 | helix-term/src/commands/dap.rs:696-734 \u2014 These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34f2aa9669601f457e2f1bc794b6a7755a7d2f997c8bcdbae95dfc47746ad51"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): helix-term/src/commands.rs:5746-5766 | helix-term/src/commands.rs:5795-5807 | helix-term/src/commands.rs:5817-5838 | helix-term/src/commands.rs:5859-5868 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa89a32b6a0c1888f2aabcc28528213541aef2baab04fdbe8fe9b6b26833fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): helix-term/src/commands/typed.rs:1912-1939 | helix-term/src/commands/typed.rs:1945-2007 | helix-term/src/commands/typed.rs:2013-2057 | helix-term/src/commands/typed.rs:2511-2544 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"db831a01e605ded3db64037ca348e7982a4fdd3cace84f6c17d6a232227d3391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): helix-term/src/ui/statusline.rs:218-262 | helix-term/src/ui/statusline.rs:267-329 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/statusline.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a30b905bed8448e9e7e5e8ea3f5d81336c4f184e0a3b80497a112b68513d295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): helix-term/src/handlers/document_colors.rs:44-101 | helix-term/src/handlers/document_links.rs:44-109 \u2014 These two members are one piece of code written twice and then edited apart: 58 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":"helix-term/src/handlers/document_colors.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4509362b8fed1bfb762958d8b5c1f048d7b618fc5c51b8146d7da241eb009fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): helix-term/src/handlers/document_colors.rs:144-212 | helix-term/src/handlers/document_links.rs:125-173 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"helix-term/src/handlers/document_colors.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4bbe2aad3ff07bd3d4d1ca8246ada65e79a29f0687ea274bee3287b024dc22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): helix-view/src/keyboard.rs:459-491 | helix-view/src/keyboard.rs:532-564 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"helix-view/src/keyboard.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"de696f8d0ad5dc14dd5520429ef79072609ae17658dd89df6e7e01f18deece14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): helix-view/src/keyboard.rs:423-454 | helix-view/src/keyboard.rs:496-527 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d95a6bdb02d274f0cfe49a55757c447a86c11b2cfa3e90a1335a0bc1f2d890e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): helix-core/src/movement.rs:269-309 | helix-core/src/movement.rs:316-354 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/movement.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2269b58f9f121be2b0da2308c50031017700fabca6cc155ac02198675ef8c7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): helix-view/src/document.rs:470-552 | helix-view/src/document.rs:557-598 \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":"helix-view/src/document.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"25034c3f48f117117d44c880eb2664e965400e856ecc614a30227ed405203487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 44\u002B corresponding lines): helix-view/src/editor.rs:1609-1661 | helix-view/src/editor.rs:1663-1706 | helix-view/src/editor.rs:1708-1751 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 44 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":"helix-view/src/editor.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58cc6286a2eb6bd316beec4e4eae7685cf24e53ed65764209a3e1d68ebc646f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): helix-core/src/graphemes.rs:126-164 | helix-core/src/graphemes.rs:174-212 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/graphemes.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"777631b903dbe41a1ddb71ffb8944bc5eb99d4683f99f3bc6aef3c6dbe79cb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): helix-stdx/src/rope.rs:650-682 | helix-stdx/src/rope.rs:684-716 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"helix-stdx/src/rope.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bc5a34290c6bd097168ab0e9bdff3f1fc9921ba9600f28e168ae3263ff2abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): helix-dap/src/transport.rs:90-136 | helix-lsp/src/transport.rs:108-157 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/transport.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ce472bf4cf3abb11d7f6c86cba2a47266a0b414410eab49d31620705dfb109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): helix-core/src/transaction.rs:759-800 | helix-core/src/transaction.rs:823-863 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"helix-core/src/transaction.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da51b3228c0bb2667b4fab62d6bdef885ad54ca9bc973f8d5ae544590664559"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): helix-term/src/commands.rs:4161-4186 | helix-term/src/commands.rs:4188-4215 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96e50ca32b0dd3b970fa9d7995b46bd33af85d8d9381fb46ca6a2c99efacb70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): helix-term/src/health.rs:379-400 | helix-term/src/health.rs:403-421 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/health.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d659755cab31ad7d1e3039912200bbf24e44a34ac53e9ef5e2b427f01fa55bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): helix-lsp/src/lib.rs:337-370 | helix-lsp/src/lib.rs:381-409 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/lib.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffa29d87527aa0bede9e55e010ff78490e721f7fe50bea15ce8a150871e0480"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-event/src/hook.rs:33-52 | helix-event/src/hook.rs:54-74 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-event/src/hook.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1424d407f577b6725c8454fb64a436fffc5139efc612e6bdf849dfa4b744d72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): helix-core/src/selection.rs:818-850 | helix-core/src/selection.rs:852-880 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"38417da9a6e2dc3436ac83047fb62681ce5ece0dcad34067bd034d3e76fad709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): helix-stdx/src/range.rs:42-69 | helix-stdx/src/range.rs:75-106 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/range.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5b8120278cefcd061c8033982b3fdb6d90ca3098d0b53a68138ec128475b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): helix-term/src/commands.rs:4002-4021 | helix-term/src/commands.rs:4031-4048 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d31debfdfc86bd9f9a10954721c6f51bae58920b46ba00073afbda21ee5ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): helix-core/src/object.rs:3-25 | helix-core/src/object.rs:117-134 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/object.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d26704d2ec6dfe0cd29e5b7fdcd831a92303dcb0cfa0a64039ecf11171ac10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): helix-term/src/commands.rs:2191-2213 | helix-term/src/commands.rs:2215-2232 | helix-term/src/commands.rs:5414-5438 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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":"helix-term/src/commands.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"078bf49dac25e5987cf50367e2b23725c71e9a26ee28eddf88a466c71a78b291"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): helix-term/src/commands.rs:3180-3204 | helix-term/src/commands.rs:3229-3254 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d3331e8efd6e45106499b4d1d73f52bda4cbaf105a0bda1eef079cf42e73fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-view/src/keyboard.rs:267-286 | helix-view/src/keyboard.rs:315-334 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-view/src/keyboard.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e78988af09181ca08e0b46227477dc515713a27ff5e43ca118b0afae7f94dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-view/src/keyboard.rs:291-310 | helix-view/src/keyboard.rs:339-358 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-view/src/keyboard.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f2b419555a50cd7ba870568a4c84c7b4a7ddde581e4d40fa75457776b78548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): helix-loader/src/grammar.rs:248-275 | helix-loader/src/grammar.rs:277-301 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/grammar.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16f804f1f06aac959b25235a6062923237abc4b2b544a58e71e24f6e71deadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-view/src/input.rs:499-510 | helix-view/src/input.rs:607-618 \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":"helix-view/src/input.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"210804ccf1f9072e2b4f77b4da2056afe1e6d8cba803d8dbf87767058f31c1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): helix-core/src/auto_pairs.rs:345-371 | helix-core/src/auto_pairs.rs:393-417 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/auto_pairs.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e106b67babff15e65c595ed9835c206437617105032cf876d23e75bb19205f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-view/src/input.rs:550-569 | helix-view/src/input.rs:658-677 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-view/src/input.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"72250906c7344c252032f742686d0e7df7c525b71045eba3900e700dae3a005c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): helix-view/src/keyboard.rs:143-161 | helix-view/src/keyboard.rs:189-207 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2a80931ee680e6d4940629a4c2c40e2ea080da6c30ec0572fd5ae6e062cd29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): helix-view/src/keyboard.rs:166-184 | helix-view/src/keyboard.rs:212-230 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b73e5cf36f8188ef2e44e0af79d5edcd74082039f77b9e029f7f2bc60c23082"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-term/src/ui/picker.rs:278-297 | helix-term/src/ui/picker.rs:310-335 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-term/src/ui/picker.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"775f0982fb85b0c2d9e0e2d1effb097245df5688b78ab66c430482d299fd0c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): helix-core/src/surround.rs:223-258 | helix-core/src/surround.rs:266-297 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/surround.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c8b3a052f670597294b7e6733f2852f30916da0579b169e2c044b44c8e301a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): helix-vcs/src/diff.rs:176-200 | helix-vcs/src/diff.rs:203-228 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/diff.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe719041f0b719a6f67d0bd099a3cc6bc6d62804789da71e4d44c0c60a9828c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): helix-core/src/transaction.rs:535-568 | helix-core/src/transaction.rs:670-698 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c327e7322f5d816077e9a68b233b53721ee9406b189225e5a8124dd5466b9789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-core/src/history.rs:124-135 | helix-core/src/history.rs:213-224 \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":"helix-core/src/history.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1cfee47c37ca0c4966dee6e99369a64b9f47088d0270e1f07501173c18f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): helix-view/src/input.rs:463-475 | helix-view/src/input.rs:574-583 \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":"helix-view/src/input.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"49374a1aa403188e12e1ff0719d26885a9089d78bb4b4a47c8ce6a4963732c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): helix-core/src/selection.rs:560-587 | helix-core/src/selection.rs:597-620 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a726c3578fd7a5123f47d88fecba56fec3476c3bd3de06eb11cb7678aabfa7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): helix-term/src/ui/lsp/hover.rs:138-158 | helix-term/src/ui/lsp/signature_help.rs:71-94 \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":"helix-term/src/ui/lsp/hover.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f5761342b09b9c95844594d69b01c963c310af1999b3709afcfb5ef1cdc70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-stdx/src/path.rs:264-278 | helix-stdx/src/path.rs:284-295 \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":"helix-stdx/src/path.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8116744b418942f578e527be83f1ded3bde3b85cb87d73b652f3f5e28fa9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-view/src/keyboard.rs:41-60 | helix-view/src/keyboard.rs:89-108 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-view/src/keyboard.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3903e937ee9bd6e4d7ecfd14dfdd1d4d16da9f0291049fdeeb81ebd6e8aa3ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): helix-term/src/commands.rs:4833-4851 | helix-term/src/commands.rs:4901-4911 \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":"helix-term/src/commands.rs"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5f0d87cb5b148c1f3aef7b8c4363aae059312de851103938f8f86dbfa6b7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): helix-term/src/commands/typed.rs:744-758 | helix-term/src/commands/typed.rs:760-773 \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":"helix-term/src/commands/typed.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6907a3709e2d2af584ef54097f489d37e97d709ef613a799a49bc3aef0130756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): helix-view/src/graphics.rs:226-247 | helix-view/src/graphics.rs:250-271 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/graphics.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61909e4ba4ad16f8c05cbab28fa292bc9718102ada1f78a407d173826ef96de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): helix-term/src/commands.rs:4137-4147 | helix-term/src/commands.rs:4149-4159 \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":"helix-term/src/commands.rs"},"region":{"startLine":4137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d00abba1628643ee8dc133205d5df91e0f31a3c07616bb464b70cf20c38380a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): helix-lsp/src/client.rs:1349-1367 | helix-lsp/src/client.rs:1375-1394 | helix-lsp/src/client.rs:1427-1448 | helix-lsp/src/client.rs:1575-1599 | helix-lsp/src/client.rs:1604-1620 | helix-lsp/src/client.rs:1721-1737 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 17 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c5a3872fad1df3ce3fdc7c3b14f9380b2e0249ecc190d41134ab7e828b94fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): helix-term/src/commands.rs:820-833 | helix-term/src/commands.rs:853-863 | helix-term/src/commands.rs:883-894 | helix-term/src/commands.rs:1013-1027 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"420089deeb4de928a36572d6d503e609f79c4f18d932d58e659b12c877b9b104"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): helix-lsp/src/client.rs:1318-1340 | helix-lsp/src/client.rs:1626-1646 | helix-lsp/src/client.rs:1651-1669 | helix-lsp/src/client.rs:1674-1692 | helix-lsp/src/client.rs:1744-1765 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad216689c20c762c724a89a549716b09520bbed5cc05b38ac0e021513997e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-term/src/commands/typed.rs:2129-2140 | helix-term/src/commands/typed.rs:2146-2161 \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":"helix-term/src/commands/typed.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbb656dbc17ad81afbce26df00c8319ec3d02f62b861208e434cccb1ca9a1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): helix-event/src/cancel.rs:73-92 | helix-event/src/cancel.rs:94-113 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"helix-event/src/cancel.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38dac12cb898124ac2b9ae495f70261f2f057171140d8f81665d5da1655a59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): helix-view/src/tree.rs:692-705 | helix-view/src/tree.rs:709-722 \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":"helix-view/src/tree.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9f73b53aa423e045a13e90110cb87d7893aeed0bad4ba59b0c69489ac03b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): helix-view/src/tree.rs:548-566 | helix-view/src/tree.rs:568-585 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/tree.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb15526b1a68b644a462cc22fd271de847a9de9818589937af5dd010485c5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): helix-term/src/commands/dap.rs:441-458 | helix-term/src/commands/dap.rs:471-484 | helix-term/src/commands/dap.rs:486-498 | helix-term/src/commands/dap.rs:500-512 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"helix-term/src/commands/dap.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe3b376c6c6102bd3267b764e57d5ff3fbf15d0195f7e0e9d9a4e8fd8c07f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-term/src/ui/document.rs:527-542 | helix-term/src/ui/document.rs:569-580 \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":"helix-term/src/ui/document.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb5189afe0ed78dd0c31183d53c84814aeab92c41cd0a04642dd0148a3c4f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): helix-term/src/commands.rs:1198-1208 | helix-term/src/commands.rs:1297-1310 | helix-term/src/commands.rs:1320-1330 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84c44be2d6ffe1cf81624cfcfdd57d8921f7950990795053bf0ed37db8ac16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-term/src/ui/mod.rs:501-512 | helix-term/src/ui/mod.rs:561-575 \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":"helix-term/src/ui/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7295602c25d694ead8a475181d81615e84961b675bfd3dd7b98e1c4f4e789e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-view/src/document.rs:1988-1999 | helix-view/src/document.rs:2008-2022 \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":"helix-view/src/document.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1529d5971298168d352e8531988945248ca0a7ed3e18a3ab3cb13471fed960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): helix-core/src/command_line.rs:950-964 | helix-core/src/command_line.rs:970-984 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/command_line.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d451bdab0837761df8dcb6730a6c608646af65497ce700d4943ef1d9445a9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): helix-term/src/commands/typed.rs:71-89 | helix-term/src/commands/typed.rs:91-109 | helix-term/src/commands/typed.rs:563-580 | helix-term/src/commands/typed.rs:586-603 | helix-term/src/commands/typed.rs:775-791 | helix-term/src/commands/typed.rs:797-813 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 17 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42e40b0ad92dbb6ab205ddd7a1545ed369860a9ff9c56eed653b0d18709721b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-term/src/ui/statusline.rs:449-460 | helix-term/src/ui/statusline.rs:506-517 \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":"helix-term/src/ui/statusline.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"2610127d20b472f1c485d8410a699e6ac15e08af46bee2bf6e836cc5ca754931"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): helix-lsp/src/client.rs:1480-1494 | helix-lsp/src/client.rs:1501-1519 | helix-lsp/src/client.rs:1526-1543 | helix-lsp/src/client.rs:1550-1567 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 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":"helix-lsp/src/client.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"038e4ebf9ef944afc58c62a22806300e4a9ca98d17ed383c65ab5ab73ae51510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): helix-view/src/input.rs:530-545 | helix-view/src/input.rs:638-653 \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":"helix-view/src/input.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9ede9083494cf7cd36897aed25052268fdc43d297b002c4c8a3a8f12292311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): helix-lsp/src/client.rs:856-869 | helix-lsp/src/client.rs:871-882 | helix-lsp/src/client.rs:889-902 | helix-lsp/src/client.rs:904-916 | helix-lsp/src/client.rs:922-935 | helix-lsp/src/client.rs:937-948 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd5f1b95723b22aa67b9ac192bfb3262fe347675e93b9587426d0cfc3118722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): helix-lsp/src/client.rs:1201-1214 | helix-lsp/src/client.rs:1698-1715 \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":"helix-lsp/src/client.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"38006451b5a6e1d9ce39fba81aa4d7917511949c9f34ed7d0ca6109c21ea44a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): helix-term/src/commands/typed.rs:4505-4515 | helix-term/src/ui/mod.rs:726-738 \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":"helix-term/src/commands/typed.rs"},"region":{"startLine":4505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7570a8409dca25d187249db751a7d7c36d4e8e994c962e5e4099416db51e43c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-vcs/src/lib.rs:33-44 | helix-vcs/src/lib.rs:51-62 \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":"helix-vcs/src/lib.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75d25ae69aa0f0b77329668f66eb54cb9d53656f1bedb919ec3ce3e022c617e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): helix-core/src/syntax.rs:122-134 | helix-core/src/syntax.rs:152-164 | helix-core/src/syntax.rs:190-202 | helix-core/src/syntax.rs:220-232 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"helix-core/src/syntax.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea23375b352165408eacd7f61c5214fdbf34e2368ca65a42a81c60b9a0d8c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): helix-term/src/commands.rs:189-199 | helix-term/src/commands/dap.rs:101-114 \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":"helix-term/src/commands.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc0e2eab227c5dc7bfad774e716a7dfa0559fa43b9169b19fda670c9e458ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): helix-term/src/commands/typed.rs:1072-1084 | helix-term/src/commands/typed.rs:1086-1098 \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":"helix-term/src/commands/typed.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ddd8651ad9f031f6a3d68eab2602a75bc5102ebf9468ef1bb2b9a28ba5b385"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): helix-term/src/ui/menu.rs:99-105 | helix-term/src/ui/menu.rs:107-113 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/menu.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"550a3ccbcf8c08d636ab174f164f59d0bd6f8c7f5c30b8fc270aa20e102ded60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): helix-tui/src/buffer.rs:29-41 | helix-tui/src/buffer.rs:45-60 \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":"helix-tui/src/buffer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff9681a4d6ae4e4d5d3cd2d4d2894e11599d676a1a46a82b48e2f2f1ebf972b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): helix-view/src/tree.rs:272-281 | helix-view/src/tree.rs:283-294 \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":"helix-view/src/tree.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a135b0bf6e8c7220e6327ad81071b995541121da68b6535f566f8658ea89f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): helix-term/src/commands.rs:3217-3227 | helix-term/src/commands.rs:3256-3267 \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":"helix-term/src/commands.rs"},"region":{"startLine":3217}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d65cc78b4af2fad80fe16701cc7013cf7b199102ed979959379e2661529803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): helix-term/src/commands.rs:4783-4793 | helix-term/src/commands.rs:4795-4805 \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":"helix-term/src/commands.rs"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"775a523a2845fd8ccc66cc25d131fa61b7306fe1777ddf4c4c96bae3f0b92c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): helix-dap/src/transport.rs:169-183 | helix-lsp/src/transport.rs:199-213 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/transport.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d9231cb64a1196d9036e136d85205e1f5fa285c6323114ede6ebb360077ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): helix-core/src/transaction.rs:107-120 | helix-core/src/transaction.rs:144-158 \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":"helix-core/src/transaction.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00d841d068d7027b6e7514cf3479ef385302403259d9e9c64664e9f99103238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-term/src/commands/typed.rs:4488-4499 | helix-term/src/commands/typed.rs:4517-4532 \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":"helix-term/src/commands/typed.rs"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6ec756585448f0bc5647ff8c826da40fbad1686938be1a9077c49d4cf43121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): helix-term/src/commands.rs:3170-3178 | helix-term/src/commands.rs:3206-3215 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3170}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f4933f63794cb1fc9b61c11790eccb116bd601d90dde9b883453c023336d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): helix-view/src/handlers/lsp.rs:77-84 | helix-term/src/commands/lsp.rs:874-881 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/lsp.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"65702b5a7b1c5b3479b418ccc0ad7e8fc895375330edfb2170b6ed2d1bce5b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): helix-dap/src/lib.rs:147-157 | helix-dap/src/lib.rs:159-168 \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":"helix-dap/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7a19949e52e592f821af661cbad49398b5cdd6825733d07716772ae0e636d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): helix-lsp/src/transport.rs:355-368 | helix-dap/src/transport.rs:313-324 \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":"helix-lsp/src/transport.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9988f571493ee58a062f56088d3a95b40058ae10ee7f3dff1391e769192a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): helix-term/src/commands/typed.rs:543-557 | helix-term/src/commands/typed.rs:1001-1015 | helix-term/src/commands/typed.rs:1021-1035 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"helix-term/src/commands/typed.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff9c286639ad3642e579cf2e434e968a9f4b95e20c837548fccd235162f915e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): helix-dap/src/transport.rs:141-149 | helix-lsp/src/transport.rs:163-171 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/transport.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4d6347b1438d74f70d6ac0f5b58020236a8a3c4425c0b2950f500ca25a53a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): helix-dap/src/transport.rs:98-124 | helix-lsp/src/transport.rs:118-145 \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 \u0060helix-dap/src/transport.rs:98\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":"helix-dap/src/transport.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6ae131266da4bf510423ecb5a3359ab3755a55fd98e2d3969c42ba58f96926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): helix-term/src/ui/statusline.rs:236-262 | helix-term/src/ui/statusline.rs:303-329 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/ui/statusline.rs:236\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":"helix-term/src/ui/statusline.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8006592dc91a45f947055208a1a268d7dcbf2eb3e4fb6a5b91053321c05814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): helix-core/src/selection.rs:569-587 | helix-core/src/selection.rs:602-620 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-core/src/selection.rs:569\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":"helix-core/src/selection.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ffdbe41a170322f911697a020b67d1a4f124f2aabaf9a68af90a49b3020894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): helix-loader/src/grammar.rs:633-650 | helix-loader/src/grammar.rs:690-705 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-loader/src/grammar.rs:633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/grammar.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfd3298276ea5dab068d463bb26dd705373bf5087798f265bb2f0ada61dd235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): helix-term/src/commands/typed.rs:438-454 | helix-term/src/commands/typed.rs:933-949 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/typed.rs:438\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":"helix-term/src/commands/typed.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"726c61528f4f6c79ca51069559cd99dbb64e0a1a4b0d64f9d6a8058831138711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): helix-term/src/handlers/code_action_hint.rs:128-144 | helix-term/src/handlers/code_action_hint.rs:191-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/handlers/code_action_hint.rs:128\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":"helix-term/src/handlers/code_action_hint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1428d5c7f66c51135b84a4d7fef7d999d18959bdf67b526ec76c450febe5a70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): helix-view/src/handlers/lsp.rs:149-165 | helix-view/src/handlers/lsp.rs:186-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/lsp.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"193a9a26c7d23752abeafc8df5708a1d51a7165568b6e827f38ce459b3283613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): helix-view/src/keyboard.rs:44-60 | helix-view/src/keyboard.rs:92-108 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:44\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060val\u0060 to \u0060termina::event::Modifiers\u0060 in one and \u0060crossterm::event::KeyModifiers\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae564c0501b99153bd09689c3bf23b7e594626c6f9b00ea264178ebea826b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): helix-view/src/keyboard.rs:270-286 | helix-view/src/keyboard.rs:318-334 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:270\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":"helix-view/src/keyboard.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe2d8313a337e0db81293c0e1bb57e6647f355edb34847ebf0660aaca02b1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): helix-view/src/keyboard.rs:294-310 | helix-view/src/keyboard.rs:342-358 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:294\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060val\u0060 to \u0060termina::event::ModifierKeyCode\u0060 in one and \u0060crossterm::event::ModifierKeyCode\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95211c1efaeb743726476456fa1bd2fcaf6b363c3e7ae49904b6b303d7e287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): helix-term/src/commands.rs:3897-3911 | helix-term/src/commands.rs:4518-4533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3897}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd890b319315cc457f6c539f5514006de08dbc9f4e9fad1d4626188a2344648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): helix-term/src/commands.rs:4283-4297 | helix-term/src/commands.rs:6165-6180 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:4283\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2aee6e4a034808a42f8a444afeaf4a28a695cd7b35796fd5621a2fe437a61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): helix-term/src/keymap/default.rs:297-312 | helix-term/src/keymap/default.rs:314-329 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/keymap/default.rs:314\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":"helix-term/src/keymap/default.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff83f442de0c7270dd7f819ee6ede0c469c175b9d4fac24f6bc855c251d3476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): helix-view/src/keyboard.rs:146-161 | helix-view/src/keyboard.rs:192-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-view/src/keyboard.rs:146\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":"helix-view/src/keyboard.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e13eaab0ee71c490279f3567d2c567928f0bf31ebc2f695619a1cb4b7116f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): helix-view/src/keyboard.rs:169-184 | helix-view/src/keyboard.rs:215-230 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:169\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060val\u0060 to \u0060termina::event::MediaKeyCode\u0060 in one and \u0060crossterm::event::MediaKeyCode\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57b4eac67ba150cce5a3098c9efdf42cdb9cb0f219704336fddc97e56e2d36b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): helix-term/src/commands.rs:3181-3195 | helix-term/src/commands.rs:3230-3244 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:3181\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":"helix-term/src/commands.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed050391444d6395ff4193eb1e4f74c5c51e2bd64138cdbf55a1fc3ac1e0d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): helix-term/src/commands/typed.rs:390-404 | helix-term/src/commands/typed.rs:891-905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060WriteOptions\u0060 in one and \u0060WriteAllOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb47fbc25005bd02d9c250718ad459fc9acd76c410b92c23206513c94314de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): helix-term/src/health.rs:168-182 | helix-term/src/health.rs:289-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/health.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca5486eb50a4e368e3052937c3fc045738ade73bee452e81a71dca40765ee35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): helix-view/src/keyboard.rs:462-476 | helix-view/src/keyboard.rs:535-549 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:462\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060val\u0060 to \u0060termina::event::KeyCode\u0060 in one and \u0060crossterm::event::KeyCode\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/keyboard.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d933aa59957480ecd303642e1ba980931f3f899048193575b4328f5854c561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): helix-core/src/graphemes.rs:128-141 | helix-core/src/graphemes.rs:176-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-core/src/graphemes.rs:128\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":"helix-core/src/graphemes.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd637d25124de4dc428dbc6b739755571214d60a027e51e68031c8046297be3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): helix-core/src/graphemes.rs:151-164 | helix-core/src/graphemes.rs:199-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-core/src/graphemes.rs:151\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":"helix-core/src/graphemes.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59c659f60425b91ad336fa93d039a35d4d3f3d83cba5fe68a53c5e9fc0cb527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): helix-term/src/ui/menu.rs:407-420 | helix-term/src/ui/popup.rs:371-384 \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 \u0060helix-term/src/ui/menu.rs:407\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":"helix-term/src/ui/menu.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5657633644015259939c78f6ffda9d554c8c71abc5123377f68b9f43bd4aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): helix-view/src/keyboard.rs:426-439 | helix-view/src/keyboard.rs:499-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-view/src/keyboard.rs:426\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":"helix-view/src/keyboard.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f564ace1d3a376501de18bb065296999185ac3de4651f0cc5d6d257adb772e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): helix-core/src/movement.rs:603-615 | helix-core/src/textobject.rs:280-291 \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 \u0060helix-core/src/movement.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":"helix-core/src/movement.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c83729b0850e7c50ead6420c736b8919ecce46cbede8e764911811a092511f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): helix-core/src/selection.rs:819-831 | helix-core/src/selection.rs:853-864 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-core/src/selection.rs:819\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":"helix-core/src/selection.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"052e4d040919f74117fcc9c5c5ef67f058c81f60d03326f6b275e00116721342"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): helix-term/src/commands/typed.rs:564-576 | helix-term/src/commands/typed.rs:776-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"526bcdb0571416983ad537307430c818c838edb317e8e3945181fcbf7311f663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): helix-term/src/commands/typed.rs:587-599 | helix-term/src/commands/typed.rs:798-810 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b39068f49d68536c30f371879c7ec7e2a56c413e6198d58e50a39a0fd115b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): helix-view/src/input.rs:533-545 | helix-view/src/input.rs:641-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-view/src/input.rs:533\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":"helix-view/src/input.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45c8062a40f6d10928bca82a846e32c42b1fe67ded329e7a33e37c1091fa1ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): helix-term/src/commands/dap.rs:673-684 | helix-term/src/commands/dap.rs:714-724 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/dap.rs:673\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":"helix-term/src/commands/dap.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd494e332fb7a7765864b43cd7b643e83bcf256e9f1431c3dc12ba98cedbe25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): helix-term/src/commands/typed.rs:408-419 | helix-term/src/commands/typed.rs:907-915 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/typed.rs:408\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060WriteOptions\u0060 in one and \u0060WriteAllOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bda136dfbc0210bc141562f964d44e034746298dc904073701dbeac6f9e2e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): helix-term/src/handlers/document_colors.rs:81-92 | helix-term/src/handlers/document_links.rs:89-100 \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 \u0060helix-term/src/handlers/document_colors.rs:81\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":"helix-term/src/handlers/document_colors.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2076be2272f54c576a148107aaff78b2e739ba5ed89b93b85ddd5dd88a9ba199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): helix-term/src/keymap/default.rs:194-205 | helix-term/src/keymap/default.rs:261-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/keymap/default.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"28001accad136e3f7e529d19f1d8b6b059193ad65af2cbeeed81c1a277345d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): helix-view/src/tree.rs:610-618 | helix-view/src/tree.rs:641-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-view/src/tree.rs:610\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":"helix-view/src/tree.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"102cf443ff32bade1fd37330910f50f75c61bb3a0c7207f5e943cec5059e02d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): helix-term/src/commands/typed.rs:1929-1939 | helix-term/src/commands/typed.rs:1997-2007 | helix-term/src/commands/typed.rs:2047-2057 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/commands/typed.rs:1929\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":"helix-term/src/commands/typed.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8dd0f1985392ab103695ff4eccdbb7a20961aa80b651810ab5a3a6a47a45a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-term/src/application.rs:713-723 | helix-term/src/application.rs:750-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b6722fd6a068ef90990ae86e586befb407a2d7025cdaa32111b288b027920c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-term/src/commands.rs:4162-4172 | helix-term/src/commands.rs:4189-4199 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:4162\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":"helix-term/src/commands.rs"},"region":{"startLine":4162}}}],"partialFingerprints":{"codehealthFindingId/v1":"39475f4bccc3d54b1d92665dff83eb8617632720e8793316a7cc74c703c6190b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-term/src/commands.rs:6417-6427 | helix-term/src/commands.rs:6488-6498 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:6417\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":"helix-term/src/commands.rs"},"region":{"startLine":6417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492993c16396588622dc9111c025dccc695920725e37b3fd1ac9dde74be8451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): helix-term/src/ui/editor.rs:1466-1475 | helix-term/src/ui/editor.rs:1564-1574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d1bdc0c0546c685de2fab66c8adeefd183b3f6d673009a7113fdb56e28c3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-vcs/src/diff.rs:178-188 | helix-vcs/src/diff.rs:249-259 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-vcs/src/diff.rs:178\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":"helix-vcs/src/diff.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfeeccd67da6b07c11ad06cb26cd553a79211d986d04c849acf21b9daae9e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-view/src/keyboard.rs:444-454 | helix-view/src/keyboard.rs:517-527 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:444\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":"helix-view/src/keyboard.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a249c14dc5ac30ac0dbcfa970c24480ff58c8f7fdc683b51bbbbb931903db74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-view/src/keyboard.rs:481-491 | helix-view/src/keyboard.rs:554-564 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/keyboard.rs:481\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":"helix-view/src/keyboard.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fca89dd3b65967c88d70a246d06c481442fbf503e8bec85f137b2f9f24269d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): helix-view/src/tree.rs:123-134 | helix-view/src/tree.rs:161-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/tree.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb191c2b5e5df08e02015c9b5096eac5c97049cfe256428790cebbd1aafa4306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-core/src/textobject.rs:137-146 | helix-core/src/textobject.rs:170-179 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-core/src/textobject.rs:137\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":"helix-core/src/textobject.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a1f5b0fd199ceb05ffff8ca82f2de30fe6e0340b3c599a3a0b43ec1b34a236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): helix-term/src/commands/lsp.rs:928-935 | helix-term/src/commands/lsp.rs:1029-1038 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/lsp.rs:928\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":"helix-term/src/commands/lsp.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c805963d5d1b925e4ad5aa8a90a1e359944356781ce359cf6e29fb140745e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-term/src/commands/typed.rs:422-431 | helix-term/src/commands/typed.rs:917-926 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/typed.rs:422\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":"helix-term/src/commands/typed.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12804ae85b3de73f9b39b3f34867ed14143817bcaf1958dd312401d0caf732a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-term/src/commands/typed.rs:1175-1184 | helix-term/src/commands/typed.rs:1204-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a32a66137c2f12cfbe2388a3d199f79d0db753e7495be9c520c4ee5a9420df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-term/src/handlers/auto_save.rs:90-100 | helix-term/src/ui/editor.rs:1597-1606 \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 \u0060helix-term/src/handlers/auto_save.rs:90\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":"helix-term/src/handlers/auto_save.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"687586fe4ef72e43c4c9215c9e8f3ca846723cd30d77c6eec82702043148ad86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): helix-vcs/src/git.rs:31-40 | helix-vcs/src/git.rs:69-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/git.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"495788651493c3c656255a74203db054e5fe03d2b9138ed7c8b27f7e8a627b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-view/src/tree.rs:111-120 | helix-view/src/tree.rs:149-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/tree.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"812de4e1c21de9c7f06b963fbda5e1399074a8b4bc109646a97d7fa669e52605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): helix-term/src/commands/typed.rs:1925-1936 | helix-term/src/commands/typed.rs:1993-2004 | helix-term/src/commands/typed.rs:2043-2054 | helix-term/src/commands/typed.rs:2528-2539 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb69bb0d6f64f64aa147e35005665990b058f0fbe3d0bcbc7e32189cef8ae97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): helix-core/src/movement.rs:573-581 | helix-core/src/textobject.rs:267-272 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/movement.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30e8ba3ca4c7a09a6f798505fd8d1a633445cfc830d23fe9cb50f84a04d5d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-term/src/commands.rs:2514-2522 | helix-term/src/commands.rs:2554-2562 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:2514\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":"helix-term/src/commands.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a0dd82bd5e7ffe0ed1b6da751b78f8d4e7bbe909d199870bcaef00f30ecc75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): helix-term/src/commands.rs:2672-2680 | helix-term/src/commands/syntax.rs:367-374 \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 \u0060helix-term/src/commands.rs:2672\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060helix-term/src/commands/syntax.rs:365\u0060 calls \u0060clone\u0060 and \u0060helix-term/src/commands.rs:2671\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":"helix-term/src/commands.rs"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"878a5fcf915a6984b3ddb59e72c97f522f700de6c29b4f7f8b2dd18708680249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-term/src/commands.rs:3544-3552 | helix-term/src/ui/mod.rs:352-360 \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 \u0060helix-term/src/commands.rs:3544\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":"helix-term/src/commands.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7b693b201e68bdaa99b2c679af857429ffbd020906227695c52fb0c48c9ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): helix-term/src/commands.rs:5797-5804 | helix-term/src/commands.rs:5860-5868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060helix-term/src/commands.rs:5870\u0060 calls \u0060select_all_siblings\u0060, \u0060select_all_impl\u0060 and \u0060helix-term/src/commands.rs:5805\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":"helix-term/src/commands.rs"},"region":{"startLine":5797}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a23ec685485c69e207f7dcc866b4efc63977bf579d76743e89881fe6a9bf37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): helix-term/src/commands/lsp.rs:414-422 | helix-term/src/commands/lsp.rs:532-538 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/lsp.rs:414\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":"helix-term/src/commands/lsp.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62ecfbb571810bc3bc715fb061a09b92acd8d71fc39d3113b0a99a24260f317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-term/src/commands/lsp.rs:607-615 | helix-term/src/handlers/code_action_hint.rs:62-70 \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 \u0060helix-term/src/commands/lsp.rs:607\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":"helix-term/src/commands/lsp.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efcbad33fcd6ce1803e345922d66456143977e1c462a714fc760b7bf598d778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-term/src/commands/typed.rs:1073-1082 | helix-term/src/commands/typed.rs:1087-1095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb0ddf4f1b564091368b96df85f792461c3c35b0693173d797e1a31ed686c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-tui/src/buffer.rs:453-463 | helix-tui/src/buffer.rs:512-520 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-tui/src/buffer.rs:453\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":"helix-tui/src/buffer.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1339b08adadaf79079ffc54efab47c76269123d0c00ce574bd96f2986de0a517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-tui/src/widgets/list.rs:138-146 | helix-tui/src/widgets/paragraph.rs:166-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/widgets/list.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae135675e6328989d300a4180def31d0c2a0a2aba1e0a89e751eba92d2643c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): helix-term/src/commands.rs:2196-2203 | helix-term/src/commands.rs:2220-2227 | helix-term/src/commands.rs:5420-5427 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/commands.rs:2196\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":"helix-term/src/commands.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f5c69d4d48d2f245b8c4c2521907f90765313da0c6784dd03b361bbe5b19e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): helix-term/src/commands.rs:3543-3550 | helix-term/src/ui/mod.rs:281-288 | helix-term/src/ui/mod.rs:352-358 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/ui/mod.rs:352\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":"helix-term/src/commands.rs"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"955fbf5f570bcdc3cd24942a2406ce91e0468819f1a4a6b09ced922e58585a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): helix-term/src/commands.rs:4140-4147 | helix-term/src/commands.rs:4152-4159 | helix-term/src/commands.rs:4176-4182 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/commands.rs:4140\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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":"helix-term/src/commands.rs"},"region":{"startLine":4140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b900db0edcef93c072a4d78d3ceb74f34de2b9b9e4929c4913aa03ce2af2b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): helix-vcs/src/diff.rs:177-185 | helix-vcs/src/diff.rs:204-211 | helix-vcs/src/diff.rs:248-256 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/diff.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a81a7450ace1489ed9cc8565e8cc1f2001362ddb04e9931e99839f296bf91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-dap/src/client.rs:128-135 | helix-lsp/src/client.rs:238-245 \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 \u0060helix-dap/src/client.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060helix-lsp/src/client.rs:236\u0060 calls \u0060current_dir\u0060 and \u0060helix-dap/src/client.rs:126\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/client.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7fb9f0afaa82a101d0902d4324e5d2969f244c85537221c09f035176a53a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-loader/src/grammar.rs:617-624 | helix-loader/src/grammar.rs:669-676 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-loader/src/grammar.rs:617\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":"helix-loader/src/grammar.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5f4eaed0ac477964c66e97de1cd4099e5b569761f53764f422b50a9fce24b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-term/src/commands.rs:2906-2913 | helix-term/src/commands.rs:2923-2930 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:2906\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":"helix-term/src/commands.rs"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f86eceb944ed23e9f322323a6e8c55ac137131bca87d05f805fa482e075b58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-term/src/commands/dap.rs:664-671 | helix-term/src/commands/dap.rs:705-712 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/dap.rs:664\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":"helix-term/src/commands/dap.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"932cf18910500b6b63112e977667cf7c765f59ec24e557a834440a32dd4f815b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-term/src/commands/lsp.rs:402-409 | helix-term/src/commands/lsp.rs:630-638 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/lsp.rs:402\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":"helix-term/src/commands/lsp.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf6637b60268ee7a952396caaba3410fab31fafca7a7d0f84ad94e7ccffa0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-term/src/handlers/document_highlight.rs:132-139 | helix-term/src/handlers/document_highlight.rs:155-162 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/handlers/document_highlight.rs:132\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":"helix-term/src/handlers/document_highlight.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2e12da5fb916a60f704fef7ab8ede3d8d6279d43be9ad219fe8ed10a572dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): helix-term/src/ui/menu.rs:398-404 | helix-term/src/ui/popup.rs:361-368 \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 \u0060helix-term/src/ui/menu.rs:398\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":"helix-term/src/ui/menu.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8160309f948e864217357f8e6eeb0296c2e6a3e6baa5aeddc190ce43927a903c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): helix-view/src/tree.rs:693-700 | helix-view/src/tree.rs:710-717 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/tree.rs:693\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":"helix-view/src/tree.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f778a9e291f5d2b7d1860c5e626d1a90b45bae03b8158d858fb4b3b726e632a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-loader/src/grammar.rs:254-260 | helix-loader/src/grammar.rs:281-287 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-loader/src/grammar.rs:254\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":"helix-loader/src/grammar.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161333981f0151c2e06ed19fea4936db7e09310c20d3995dd4b68e97c477568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-lsp/src/lib.rs:355-361 | helix-lsp/src/lib.rs:392-398 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-lsp/src/lib.rs:355\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":"helix-lsp/src/lib.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b33898d1e895b3ffe3b09363af5f371ffaff4c0598f8d8f446952ae17dd2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-stdx/src/rope.rs:667-673 | helix-stdx/src/rope.rs:701-707 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-stdx/src/rope.rs:667\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":"helix-stdx/src/rope.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d852bb3617d7dfbff815a59ba4d9e36e84d3c4a5cfcce718af1917482e8e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/commands.rs:3852-3858 | helix-term/src/commands.rs:4969-4975 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:3852\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":"helix-term/src/commands.rs"},"region":{"startLine":3852}}}],"partialFingerprints":{"codehealthFindingId/v1":"08016e9ed1d097b154c206b4d0b2c0909d39da4907d1c888a58d07332079514d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/commands.rs:4005-4011 | helix-term/src/commands.rs:4033-4039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060helix-term/src/commands.rs:4012\u0060 calls \u0060min\u0060, \u0060get\u0060 and \u0060helix-term/src/commands.rs:4040\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84a4ed254be5860839f39cce5b51cb00bd15f1e49b6f701d8d5f47c5869eff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/commands/dap.rs:656-662 | helix-term/src/commands/dap.rs:697-703 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/dap.rs:656\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":"helix-term/src/commands/dap.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9546f7d15fe2ebd17b2bda58f6c60b7c75eed6cf1db101e5f764df5b7922b6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): helix-term/src/commands/typed.rs:745-751 | helix-term/src/commands/typed.rs:761-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c1664d909f63200859604e2002051397fab015deb8bcc96f65efeebe86156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/commands/typed.rs:1806-1812 | helix-term/src/commands/typed.rs:1885-1891 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands/typed.rs:1806\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":"helix-term/src/commands/typed.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cf65fb179745eb6c2504c9116f551cecad076318c027a95dd04d311b5f6e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/handlers/document_colors.rs:183-189 | helix-term/src/handlers/document_links.rs:145-151 \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 \u0060helix-term/src/handlers/document_colors.rs:183\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":"helix-term/src/handlers/document_colors.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdee19e5ff5db85ff7e1fa9b1e9622f6becccf4966a49844156610021e5553d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/ui/prompt.rs:179-185 | helix-term/src/ui/prompt.rs:206-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/prompt.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"460cabf032a7281e7cf4c5c1f0b1295d28ae6cb79079e8a5ed6c4decbb4e3ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-tui/src/backend/crossterm.rs:232-240 | helix-tui/src/backend/termina.rs:477-485 \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 \u0060helix-tui/src/backend/crossterm.rs:232\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":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5676789d4e74f8bc2e0c41de0b80c9b9de6016a99884f63c2d2471fa217f80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-tui/src/widgets/list.rs:221-227 | helix-tui/src/widgets/table.rs:447-454 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-tui/src/widgets/list.rs:221\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":"helix-tui/src/widgets/list.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"46230d2a1688390f8471b267912d2bf1c7bc236ef00e9a32839328258e1aaf42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): helix-term/src/commands.rs:1664-1669 | helix-term/src/commands.rs:1732-1737 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:1664\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":"helix-term/src/commands.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea222af77ee07696b830d47fcbcd619a675954ad02d7ad1d00768beefa36178d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): helix-term/src/commands.rs:3694-3699 | helix-term/src/commands.rs:3848-3853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3694}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff270dffe1fa9e48982601ded57b13b96cb673b943f8f842d1f1c304401c737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): helix-term/src/commands.rs:5796-5801 | helix-term/src/commands.rs:5818-5823 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:5796\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":"helix-term/src/commands.rs"},"region":{"startLine":5796}}}],"partialFingerprints":{"codehealthFindingId/v1":"63db807244c22ff915bbcb5bf4ff9748ed3d66cb698e6ce4ec09fc0ef18a5c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): helix-term/src/commands.rs:5748-5753 | helix-term/src/commands.rs:5797-5801 | helix-term/src/commands.rs:5819-5823 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/commands.rs:5748\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":"helix-term/src/commands.rs"},"region":{"startLine":5748}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedb34e108204fff2525390b1308685c61e6801025a8b8f1e072b02be2d6a1bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): helix-stdx/src/faccess.rs:161-165 | helix-stdx/src/faccess.rs:389-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/faccess.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"911bfbcc867de4912fe7037d9a243ab47f668578b164c0a6c7c8db195d4b390c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-term/src/commands.rs:1506-1512 | helix-term/src/commands.rs:1529-1535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-term/src/commands.rs:1506\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":"helix-term/src/commands.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcb65a0df354147293b1228ceba7b39f8bfb03954e31cd403d8e3d7721e4086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): helix-term/src/commands.rs:7037-7042 | helix-term/src/commands.rs:7054-7059 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:7037\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, \u0060helix-term/src/commands.rs:7043\u0060 calls \u0060remove_jump_labels\u0060 and \u0060helix-term/src/commands.rs:7060\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":"helix-term/src/commands.rs"},"region":{"startLine":7037}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cedfae0b57b9e0b7dbe24fa827d483125f2a33931f729ddd5dfba3c987724b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): helix-tui/src/backend/crossterm.rs:25-31 | helix-tui/src/backend/termina.rs:39-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab795b00e08ffe60c6d0496050fb176e9ed63287fd079a999f923c75e0aa986e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): helix-term/src/handlers/document_colors.rs:33-41 | helix-term/src/handlers/document_links.rs:32-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/document_colors.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aca48f8d468fd73d27a4c6ddfff532bef01dfdab492d3b2247b3e792af2bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-term/src/commands.rs:2630-2639 | helix-term/src/commands/syntax.rs:334-346 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"395f33a9b9d4784a8f5afaeadd4c8b7e30d696d012c2bd75bab640b3aefd9fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): helix-term/src/commands.rs:6065-6074 | helix-term/src/commands.rs:6082-6091 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-term/src/commands.rs:6065\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":6065}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a15c52c4c0aaca5671427ee09cb4191a3fda44a39eb0aa57ac4318268f5c269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): helix-view/src/editor.rs:1627-1636 | helix-view/src/editor.rs:1676-1685 | helix-view/src/editor.rs:1722-1731 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helix-view/src/editor.rs:1627\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":"helix-view/src/editor.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c22f84788191cc657ff724d4f045a2eca051c4be3a65d9ad5b83094d9aeffbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): helix-stdx/src/path.rs:265-270 | helix-stdx/src/path.rs:285-290 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-stdx/src/path.rs:265\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":"helix-stdx/src/path.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8738fa1a60173da7f9df12f4e2d923a777e67baac5414078ecb078a63c1b3e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): helix-term/src/commands.rs:6904-6908 | helix-term/src/ui/editor.rs:1142-1146 \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 \u0060helix-term/src/commands.rs:6904\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":"helix-term/src/commands.rs"},"region":{"startLine":6904}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa2a9693ad552c1615d9c709bcb52d3146e10908cde32db2db0f65b5a06e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): helix-view/src/handlers/lsp.rs:243-247 | helix-view/src/handlers/lsp.rs:272-276 \u2014 both copies are in the same file, so extract the block 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 \u0060helix-view/src/handlers/lsp.rs:243\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":"helix-view/src/handlers/lsp.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ac1e50d376ac76cb7aefd618c678391f2cca41179be0ae9ee845b35b85bd20"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: helix-dap-types: helix-dap-types: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"87b59a34f2f6eb582316fcd416ad11b9e28d1de4f44e621c2d2185793ad2b9d0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: helix-stdx: helix-stdx: abstractness 0.10, instability 0.00, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86e5618c17dbffd295ca633e569a8f153d30c1aad2a2a6f483da97a517a0beb9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: helix-event: helix-event: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a877e4ee4d3639db5c89dd4174ff5d476ec68d7d2f0662c8a423e4936be7bc50"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: helix-loader: helix-loader: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"09d9a16097226e20d2aecedd3dff8c6c3b1f1fdd5dcd1038660af493f2f98185"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Buffer (LCOM4 5): Buffer\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/buffer.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ba4e92b073712730fdcfb23610e428204ae0088c6285c868f6db6d8c8b9f2d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Layout (LCOM4 4): Layout\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/layout.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a627e106e12fbf041aa554edb4d456ce78c55624416a6ab60e18bb35793ed7"}},{"ruleId":"D12","level":"warning","message":{"text":"Yanked release: clipboard-win: \u0060clipboard-win\u0060 resolves to 5.4.1 in the committed Cargo.lock, and crates.io reports that release as YANKED. A yanked release is one the publisher has withdrawn and asked you to stop using; it keeps resolving only so existing locks do not break. The current stable release is 5.4.3. Run \u0060cargo update -p clipboard-win\u0060 and commit the updated lock."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b69d1fbeb6bb665dfc45cf39cbf56b3e4263da5762ce131eeca08db1a6269363"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: helix-core/src/indent.rs: helix-core/src/indent.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in helix_core::indent::containment_accounting at line 1070. 2 of those changes were fix/bug commits, 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 16:07:15 \u002B09:00\u0027 --until=\u00272026-11-12 16:07:15 \u002B09:00\u0027 --full-history --no-merges -- helix-core/src/indent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"97538e7e6b7294fe150687d956f2292713438e1e42bdc54251ec06af600ba421"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: helix-view/src/handlers/word_index.rs, helix-stdx/src/rope.rs, helix-view/src/action.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6fc58830f9c721aa747e4897bfc56346fe692f07284fc87cf5625432d1b67992"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (10 single-owned of 181 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 181 of the 221 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: helix-term/src/handlers/document_links.rs, helix-lsp/src/file_operations.rs, helix-event/src/cancel.rs, helix-term/src/handlers/code_action_hint.rs, helix-term/src/logging.rs, helix-core/src/case_conversion.rs, helix-term/src/ui/overlay.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check performance of is_exit_success \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/clipboard.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2005609421c7915c171402d4422119209ce1f2596df6e82ea21af688523d2663"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add timer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/clipboard.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e317050b5f1532b223d215b71d0413425d4812cefb4b380c14568d9a2c13de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: async fn? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c747245a1158f3533e398c814f8824050ab373b7501a896bd4483c87bccb903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: display a prompt asking the user if the directories should be created \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"b462c2d30495e8b6ed64e656057f83413651dfce3a7ab26050b852437e82f353"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a transaction? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfef8819b91066742be1c1ef29b5d57051730eaaaf08384f40def192d87654b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: all of that should likely just be hooks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74a8eb553012c76db3558cbf97a75a24d68e2690f1ba0c5e638f0e7f592c03e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: convert inside server \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d56884fe1b702ebf80cd167f0745ea930425572cd53f73385d3187f2f7dcce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: convert inside server \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d6e8aedf16fe07e3790ee44e8486ab6a9d59031bc8ca19c61f798d800b505"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: convert inside server \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cef1a5c6e7e097795591233619bf183fa89e0a6ea010626a67136ee3fcdaf2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO snippet variable resolution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/document.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"975a1b6d5801f4bdcf08ba7e1eff55d3991cdf93bd20bb6b8649fb9694b98006"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/editor.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52757bb9d3d9fd0e327abb02c9834edcd239060efa5dcb3b6a77815f1bcc217"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96313789f1f13c36f9bc8253958278caeacdbbfd1f2dae0e480b68d68498383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this now races with on_init code if the init happens too quickly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/editor.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aa3ec97fa89bc7e06bef0222fa75b875331bd7f403592ab4ffa449d5c71acb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there is no protection here against a shell command taking a long time. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/expansion.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1ab874b4cd8bd10ae220fead94e668dd64413d8596bd73d8f7ae114c9fe1b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: termina now supports kind \u0026 state if terminal supports kitty\u0027s extended protocol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/input.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0144df268b244850453973bb5ff2fb2b3ef0a56453e4841881d0330e4725dc00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: alert user of parsing failures in editor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/theme.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8555c74609f1d5a3d6262fe8317e249b6c3d25f400a529d271f5046345d82a96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: call f() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/tree.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9525082d866414e263d9931c5fbf99eee85e39b220dc41d96dbd419b568939b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reuse the one we use on update \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/tree.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c4b8de644ae40038e42000d931b81eefe94e57d8f916d47f9002fde9ac4f71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use actual sel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/view.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a76406c5febe82c8a524db1d3f84f90ca45cbc498bdb777dc7ce72804f18922"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could return width as well for the character width at cursor. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/view.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"19276d1a9969831d878d12209238f7f5d75aeee733a531abf9829124a5880201"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is probably utf-16 offsets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b9a99a096bbcede85dbe746edf06673b6790ff031372e3980639024c0c824"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // convert from 0-indexing to 1-indexing (TODO: could set debugger to 0-indexing on init) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f163c8514b6308db984010d70d22f9ca4ce7dd06e88221a5754857ec185b6b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle breakpoint.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":"helix-view/src/handlers/dap.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75a7f8e90e17bd688f595548a207ebbe2064b647c21bb64086c7f3763fc7d7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: verify source matches \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f1b71a6ed26d4449d3eefe4b18749bf30012e466db8655dc6f8df83bc3fca6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: no unwrap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da33601eec9b5fa4016fc9ce145db7d8bfc55978fd9325e74655397cc76d47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: verify end_linef/col instruction reference, offset \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a151fbb4377e567f3c52ce0dad664a874e2ac210e66b9f2241b74e4083b0dfae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dap uses \u0022type\u0022 || \u0022reason\u0022 here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"640611c652b0be64cbfd48f7ccd02baef2ecae8709a9ad1eb58b69225ad92a24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: call futures in parallel, await all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d5481f4703b737b924222038238cb2f8399c1d4e2d70a0bea42c8a5506f131"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fetch breakpoints (in case we\u0027re attaching) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/dap.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0d4bf85c06ab3a254f874fb33e14b103cbee18854972a8f1ece5a0cf7e4016"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check edits before applying and propagate failure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/lsp.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5e73147b8315de0d8a60aae1aa5389fda3c464543382f64b2b4c82553dbc62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check edits before applying and propagate failure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff5bfb98f60854e615fcb0f73954735be00ea55bb28556a3dc9f1e6760d42d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this transactional (and set failureMode to transactional) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/lsp.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3700b70eb6b73699de38f8a29fa4cf71342a8380113c7fca21c8c937202c1966"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: doing the cursor tracking here works well but is somewhat \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/annotations/diagnostics.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae618ab0e9b5910c33417b6a459df55348bfea93d8dd1318123c68fd41829d45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cache repository lookup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/git.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ba1e4abfd370bc13255d7f63742c1e9e54885d2da68e0203f0a55f29753a4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this configurable when more providers are added \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"649fb367f9807160333cf1823c4f6959262f93f0bdd9d3306b6e0b37e040e7ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enforce range 0 - 100 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/layout.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"011371a6a0cf9fe60493d52d559515ae63cce979ccae1bcf8d55688c06da26e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe use a fixed size cache ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/layout.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"433c3729671c6007a3d1d21fa043907e3eec48d63cf6d0fbe117a95fbae24c90"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: emitting OSC11 / OSC111 seems to break SGR and cause flickering in tmux. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f94ca54bec85e0f7d158f0e0f343b08074d9661dc42dcf10a897b038653edb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tune this poll constant? Does it need to be longer when on an SSH connection? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6558f0972ac10622b27f144c439abdc23f14d754710580fe6c94a4a306af60dd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: once WezTerm can support DECRQSS/DECRPSS for SGR we can remove this line. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/termina.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ce42077454f6732903e09d24041cda461ac5423b970f08ef40225b4c4eacca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adjust test when opening pair failure is fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/tests/test/movement.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c1ecc5e71762f429c28bf974d89100188ff73a7641f3a829b078b8a8a803c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adjust test when opening pair failure is fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/tests/test/movement.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96aa1fa2a59f5fcb959cc8234fac9a482741786f9f10e55a64c3ddff7397811"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Opening pair character is a known failure case that needs addressing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/tests/test/movement.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdfeef7e5efd25c3cf717f41b28dbc99a65d00932c9b106c05d6c1de80c1574"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Opening pair character is a known failure case that needs addressing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/tests/test/movement.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b84720fdb6e61f5f98cb971d0058f3b9f60d76fc45f5be4dbbb3570a4efa1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need to recalculate view tree if necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3a37f0d96ee195a6b9b4119ced34c6af5add36ec7584ae4e6d7f185efcb638"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: show multiple status messages at once to avoid clobbering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb055e064d97a44aa9c18c37687e8015bb465936f52b74957bdf129bdfc41152"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix being overwritten by lsp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/application.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda6e712386b668cae9d5aa821ef42d30ef8f2150b39be51b8ebe9f09aa95d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: count is reset to 1 before next key so we move it into the closure here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b44a3bc879fad4168fece3c5ae47ddab8a95afc9de8e7ac4cc2d6a815ecd7c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: count is reset to 1 before next key so we move it into the closure here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":6042}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a79114ee65d261b3efe33eceda1139bb0645daa4d43c0382eecc7b091f57748"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should this be done by grapheme rather than char?  For example, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91eabe5172f3338e86f08704c2db9c736b87656fe4043246e078f73728adad7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When inline diagnostics gets merged- 1. move_vertically_visual removes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5b56685aa65e017d6dc5aae6d5f2a4fb0ec5b0353edfb8a3566904165eb903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement a variant of that uses visual lines and respects virtual text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7441b41344c038b8f65e2c0735627418a1664799d25c40a35201fc347f5ecb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could probably share with select_on_matches? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"4070d83d8bfa5dec92e563406df55427dcf86a34c7bf397e01dd7446f0894190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: last picker does not seem to work well with buffer_picker \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0d6e65af1ccab97ae85796a71cde7efd12e61cc96496337529a11d538f0254"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide some way to cancel this, probably as part of a more general job cancellation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":3758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb5380528e9030a3ff9048453ef478bae92d60e96e7facea792d283fa6314f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is annoying, but we need to do it to properly calculate pos after edits \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d07ccdb9f8e015bd4fd25cb7f387fd05bb3d8d499a05814c5777741049c372"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: range replace or extend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4605}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b138e030aff8a8a762985555f80b04890d5893c55dec45d51bf28991e2f3bcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // [TODO] should this be fixed to get the auto pairs for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":4700}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a00940f088d53c5f7f59c740bfaafffd1539627f27c722c36d24027a35af7ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: else via tree-sitter indentation calculations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55f33ed3749b271054415c6b850fe226d0b68db810eccc381556fa1b481988f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO extra LanguageServerFeature::FormatSelections? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5244}}}],"partialFingerprints":{"codehealthFindingId/v1":"7249494c0aaff69a0f2ad8252a7792449f9cb630b7d003c5cc0256069116f1c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle fails \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dacc1bfa33faf9f1901b61be19022bb45250ae8aa941a0a3e5787bbd69a9df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: concurrent map over all ranges \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"50389e3858fa7974825dabfc5cca523f563e88322ce298d926bfa2fda43b6f60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle count \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71e42c5e986c4f11c7c016f9d338a535014a47d6ec856e425ef405dd686c313"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle count \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands.rs"},"region":{"startLine":5466}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b6cdc431bac0a4e6e85b9634933e091e30f3d551432a4108af29467e6bda7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: cancel new ranges if inconsistent surround matches across 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":"helix-term/src/commands.rs"},"region":{"startLine":6314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8daf5d2fde2edabc2e1ecb46c73f35fe2c2b0b1eb82c8c6fa9091b166832758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove the sticky part and look up manually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/keymap.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5eebb16107a0a435fcf5db80b9cee4eadadfe7e4d153b998ed758584d44d4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use the thread local executor to spawn the application task separately from the work pool \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/main.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"791eac9f55804f6b751acf96a09d7f84fb0b55b0264c4dcc2db8cafa9cdf3962"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move to helix-view/central handler struct in the future \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"02294c680b6615802ebe90efae012a0531bfcb8e680918c6477222d7d940cb69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO close the completion menu somehow, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9795487ef699e087a45ec512d4b8804fbc1057c933d9173b1c836915899512b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add additional _edits to completion_changes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc61b6def65c909816b3e496be149964d4bc6ab0d9aa568e2d550d78a86877d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should probably transcode in Client \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5b8eb4000f1ee27668fa9fe445a02020a1361ff31583f45949ac15802518b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expand nucleo api to allow moving straight to a Utf32String here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1160b221a28eb0efb18e493aa706682d37ab329132af5ebf5b7f09342decdd00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: convert to wrapped text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd32086b532890900c04ca2993f1ba6169dc5ace32688b52867b1ab566981eba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set language based on doc scope \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2b2214437508e33427536a2fbdd4517aa624bf075e5a74503ce047ccc2f9f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set language based on doc scope \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/completion.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"4440a72754b8efd90c7b84d3a4731d7468343bd2ba90811ed76f7c35a068d0fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is it correct to apply the whitspace style to all unicode white spaces? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/document.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2252003656e27d4e6c25b4bd9f99b636c9a3aa3c3cb4e7522c11d6f345a1e8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is it correct to apply the whitespace style to all unicode white spaces? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/document.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"332101b14720f2e2ccd5b4003a66f42c65ca96f62ecb91f277acacfcf877cc03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO special rendering for other whitespaces? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/document.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"145c69fad878d7c73c2e1abfc599d1c39fb68eef6c56f2df83dd39e615c42a32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle softwrap in gutters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"321d752e3f99ea1e44b5849301ae3e44c2ffcc9ead623bf8ab89ad6e73b3e51e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO only highlight the visual line that contains the cursor instead of the full visual line \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"63573baa71050d14154b1685843b4b7d2c0a761f700b7d8c375b57984f8d1512"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: edge case: 0j -\u003E reset to 1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0073263139d5ad1b2835edf181f710f5bd5298345b61012261c6537a455b0ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : propagate required size on resize to completion too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/editor.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79204544cc220b1443a1d5615285c23ed813a421dac0a5186d499bf0c755b0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need to handle all unicode line endings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf278b52fda45644de84f9bff52e446392e0ded4b33d67724b526d7f3f4489f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pre-render and self reference via Pin \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fbbf3e9b7335d3d5655e0592edf7f295933759155b7b99623452cf1570fc39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if possible, render links as terminal hyperlinks: https://gist.github.com/egmontkob/eb114294efbcd5adb1944c9f3cb5feda"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9dbc112f855d83ff37dc9b6ed2e284976c1aae27f65d24760b51ae60b5b669"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could push indent \u002B 2 or 3 spaces to align with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d94fec7d966e361b6cc2bb4c53d830aa14e5290473a27499018fd262efcfa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could push indent \u002B 2 or 3 spaces to align with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b54932d29460da76c1d815b23ea2365ebf5c92e531992c1d3c1ebcd911b28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: account for tab width \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/markdown.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae78a5cb1d8f5acf860d783507dcb5899874ffb5b92a9fa969ca9be73dab526"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it\u0027s like a slimmed down picker, share code? (picker = menu \u002B prompt with different \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/menu.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d63fa71f3f533ac5bc6b3da69e25318d19be922805f942510d3ca4df19d2af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could return an iter/lazy thing so it can fetch as many as it needs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbae5d681d892b617f0377ea8f74668b281e364c406f6a1497d71e62b17fb7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unwrap or skip \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"f020c0a649e2714121ac05e53990df9d4ed5bc688b14a7406c799e7c4ec23ed8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: complete to longest common match \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/mod.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14c2aac4be4b53e02921d52fce855245a5b77e6df2a9b962132c6348618d299"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: better track how the pattern has changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5651ef8af029cca6067e206e2434ebff5e87aa275265598d19fa65bd1faaab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: compute text annotations asynchronously here (like inlay hints) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"89edb6350189914b986be1d407fcfccc5da5c0d0ed613906659160c5cb7bbf0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: keybinds for scrolling preview \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"193a903eda348c2c6fa7385c9affb69b29cc0305eff8a365e2c842a7b3729f0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: share logic with Menu, it\u0027s essentially Popup(render_fn), but render fn needs to return \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/popup.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f59a7388d3fe367e8f6bcf327fd93abb02097738324331b9cdacd174affbee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calculate inner area, call component\u0027s handle_event with that area \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/popup.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6710e4f71492a0ff6767cd58ab709d6077c71f6a6b582734e2356b1837e56255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consistently style menu \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/popup.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f8255b2d2256e7a68079d80f6f2525d8ac12a89957be4a9e2627aebebc53ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: make this configurable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/signature_help.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d062cb06233f13b43bd56e9565662dfda0d5459dc6ef6bf9b2b0a842e37811d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO merge multiple language server signature help into one instead of just taking the first language server that supports it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/signature_help.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8eb6b02ca7497577a06834e3a97855f3631a1eecc700731d350eda0a6486f8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support multiple language servers (not just the first that is found), likely by merging UI somehow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/signature_help.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cacfa26638fac972a554b24b51800b651b8325104235cce191667970c26b0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: retrigger_characters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/signature_help.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"537117f08ca0933e9c425b0c8c431d0383d0971663a838405acf7ed23a8bd480"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should not be filtering and sorting incomplete completion list \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/item.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"458cc6e2417d47095cf2d195a1b779ada48c16316e42455ac74159e9a57ba2c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In a separate PR attempt the \u0060Box\u003CLspCompletionItem\u003E\u0060 pattern. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/item.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"271d48889da2ebda24ea6a1bfc9540da4bcb83f1e01e0d1aa5dc4baf5c766287"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle properly in the future \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/path.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"613ebee860e211a96fac0de2c04ae0e3396f6bd07d89b9b0360fe713138fb264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it would be great to be able to individually color the documentation, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/path.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed3524c7bb56a3b2e21b4c10654753adb9fc9cd50a1050db54726cafadf658f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid refetching all of this... pass a config in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80e919cb70ca8314120e23cb75d4592483deeb793199bac2026e41761771df7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: either await \u0022initialized\u0022 or buffer commands until event is received \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad20a94c8ba928e317779e2c4241cbd0d41adaa2046082382a8b5a4755228f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Now that we support multiple Clients, we could run multiple debuggers at once but for now keep this as is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7240f15b91b0901ba5611c805c181957f71e9b81ef79332557576fd3aa80349e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need to map breakpoints over edits and update them? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e450bb00f629b0d447f8558097022bd59ede5bb6824aff595dfa899934914a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: always keep breakpoints sorted and use binary search to determine insertion point \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"52feb930c70907cee821130caa837ed8fe60dd2fb874e5714b7bfaf0c6f75306"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow expanding variables into sub-fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"1721364154c8d3d54a73b5f56b706d5559fe5ad10675a844a6d32af5cbfac99e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: both edit condition and edit log need to be stable: we might get new breakpoints from the debugger which can change offsets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/dap.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1943b5c6d9df69c0a3732973257014f51f7a72e85c4fc127c3ab95cb7fe8e23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: drop current_path comparison and instead use workspace: bool flag? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40ee0e79f7206296238178655cea3bf3a9b177cdbb66e70f6ef4276c85e5ad7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO not yet filtered by LanguageServerFeature, need to do something similar as Document::shown_diagnostics here for all open documents \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"514617acc0331af8766924571b8ceffcf64d3c11657acf1412fd9124a0994332"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this should probably already been filtered in something like \u0022language_servers_with_feature\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df91b362586b987c5e0b65cd6cca932489e551cd7b64d028e2be68207f38910"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: factor out a doc.position_identifier() that returns lsp::TextDocumentPositionIdentifier \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/lsp.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a29a1c44ae0725a9e42adaf8456849e5af8c9bafb3017def536db6dbf27e7d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support no frame_id \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82d7dff717b43766953954676ab2bac5466ea22f719443acb1b96b80e750d60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: SHELL_SIGNATURE should specify var args for arguments, so that just completers::filename can be 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":"helix-term/src/commands/typed.rs"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e81fdbff093c6c9e81b99cd7baa3926608e682ebca2b6004308cdb5b87e2439"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: current UI can\u0027t display long doc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":3407}}}],"partialFingerprints":{"codehealthFindingId/v1":"41442f0cbf74b3056e1452f387ce00512889e1efa8056a89985a22122d2d62ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: current UI can\u0027t display long doc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0298f3ec963ec00c3ca35f69403ca7237ac1105553fabd1b3dc7553e284a6f56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for completion of the options value(s), when appropriate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":3807}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d8820d4ba36b68f7e355b78e777dbf4968122299350ba964fc5be51d9e6149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: completion should depend on the location of the cursor instead of the end of the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/commands/typed.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb6da172d8d8d4f49283f9dcc88d0634c85e435fb2bf9f734032a20bd4090e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support backslash path escape on windows (when using git bash for example) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/path.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"974e07f1d674a6635dad27936d56f76f604810a7e043fd65bb15b5bb393e3c52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In a separate PR attempt the \u0060Box\u003CCodeAction\u003E\u0060 pattern. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/code_action.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2f58dfee753b6bd6389ceb8a0aa105f8a3c7564282397236f64e6ac4ca94be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sno2): add tests once stabilized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/inlay_hint.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cca07c6e4c72d445b3d9e920ed2f167a1d7f5c528e33ca43e63ea8cc1037bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once https://github.com/serde-rs/serde/issues/912 is solved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/lib.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a29ca66077646e127ed2a444a54802f9efad505a5c39fee73316c71f9501711"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In the edgecase that a **new root** is added \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bd35b2be9b72083443d4c735809ef9988f4861c22225bd6f6699e6eef3429a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need bufreader/writer here? or do we use async wrappers on unblock? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca787338a05db69fc186e0b5e8771784627847d0a7be370b9db2ab5df2e0fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need bufreader/writer here? or do we use async wrappers on unblock? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/client.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"619e5b368570a9894a5d51d09cae45b7c9872aea863de111da633bd87bc6ebc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: delay other calls until initialize success \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a77cf3e8b0c3143260da3c1a2cf347b3f4e85ffaa2400ab1638be8d4a43495"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support these tokens by async receiving and updating the choice list \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/client.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc95d4a1149543beb08f2982960b4d743502381bcfc5a16590116643bb629a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support other url schemes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/file_operations.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd449f429306bd5fc0c586b727e5fa8a3f4065e473ca558c00c990d9dd3baa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Helix does not fully comply with the LSP spec for line terminators. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/lib.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8fa45715e8561e2396aff4f080e473a9bf095c72f2011ee3434fce3bec04e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO directly translate line index to char-idx \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aa4b5fa86c037a1a50a32f70d5b0217cbca5d0adf0c6c4efc86587c568f9fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also show the globset that should be matched: https://github.com/BurntSushi/ripgrep/issues/3274"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/lib.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94299e03f993776cf26b22898145f55914386e81c579abc044f88cb8a4f7824"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: reuse string \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/transport.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0f954d8e4fc8acf11c41c203404efa8b5533720c43000b713baff94217a3cf"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: inject a terminated notification so we trigger code that needs to happen after exit \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/transport.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f545b4f7d037782ca58151c654818efb15aab1c7bd9d992fc2b6b7e42e77d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: events that use capabilities need to do the right thing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/transport.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6fa8e870323a8bd994dd8fc86c1f34f6be2c3f1fa0d8ba24f558b6072141de"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: inject an initialized notification so we trigger code that needs to happen after init \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/transport.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7c726a13ed5a21e1550f7225375924aa750f349ce02418ab43ad273c7e57a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to display the git command using \u0060args\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/grammar.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"119d2fe5af300827bb78d5c2ae1b9338200cdf04e8138fbfc15709d7aefdcd7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow env var override \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fbf3d8cc0dc983b7635256d620839faf28568411f57f9be812a7eddbba8e51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow env var override \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-loader/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ce340d3d94a24c4b6ddc0daaac25433997f8886fd2a77265c89a7bacec0c9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use enum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap-types/src/lib.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"e900a658c9eeb45e5ccad7940f5ef329f11f5686d6a905ee5bcb34c6fe134402"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specifiable timeout, delay other calls until initialize success \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/client.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdaa344abc11408ad271d599b4c5f25284d031262fd197eae4cdaa51b27e148"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: You can have multiple active debuggers, so the concept of a single active debugger \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/registry.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1debb5f6e6c1ccd222780fbbdfa5de22cdf566ebf6851c6aef148778b04b6ddf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // [TODO] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/auto_pairs.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3431b16482f491cd0b20ea16be88a206f9efcb5a71e1e4691b0ac2ff6cdd3317"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: should this be grapheme aware? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/case_conversion.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50173b765f3ccd35cf6c96b01a7eb10da77b818c167e201fca6f69d4b480faa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a naive binary categorization of whitespace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/chars.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"65912eb7ea73664d459ce177954b5d2730ff8926a365eef7049dd51eb32c388b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: account for uncommenting with uneven comment indentation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/comment.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f72689728aa66293f97738dcf5f05eaa9359f718100b0f17778599d882e65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO adjust heuristic to detect large changes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/diff.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d541b8157acdcc48004b1863cd67f2efe7c65812470fdd69815f28f213b09b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use a tokenizer (word diff?) for improved performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/diff.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c922f0a9d5bb7c50e5fd1e25094eb34b201fcf3f6eb336fd8f2344be3ddce5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO divide long lines into blocks to avoid bad performance for long 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":"helix-core/src/doc_formatter.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9887bbc92a1d04850ad4da8487f7833b0fc4edcb0bebf65c6a5a7db4b276ab2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO currently word boundaries are used for softwrapping. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/graphemes.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a93f46d2b859a36df9120465fe54c1d612ef5cbe51e423e57cce3c2931f4320"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly handle unicode width for all codepoints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/graphemes.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b057778c5ba1a5a9d9d2cdbd611974eefccbb69a436ed8557bf74df3de75c330"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: do we care about validating the input more than this?  Probably not...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/indent.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb2430eaf8133df917759c159716c4a8e9a4ca499fefcc3a00096e00c22eecd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: multi char/non ASCII pairs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/match_brackets.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcf9f0f683631ef4d2a561bdb050e8ed23c9984d44ad048b934e9246869b63b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The behaviour captured in this test diverges from both Kakoune and Vim. These \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/movement.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9273324758482547ec181c1167fed392eedb1839f70e974ec7fb8ed0f09bbf97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: generalize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"883782e869670f526d7c1b89615c72f9a3d37db51866048d8872a6525f4f2a28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there should be a better way here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b6c7c7e75317053885a69cf3c272f3c8043904883ee08f54a1e14bf8a879ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: account for cluster. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f5ccb1d67247626650783caafeaa9f319f8e1fc6425273715f3e1e8b456c34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: account for cluster. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb5aef3162db6d950723a1eb1ef6d9b6579038c7a8d12d5c0cbd173ce422047"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: account for character width. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f57c5063dc23e618cf0d3b4b74b1c8cc1fc614640464a8fd73d603b2243baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: account for character width. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e336ce119e1d7378feb8c3a89aa7b18645714ea991986904cdf0969c8fc9e4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: delete handling as per https://news.ycombinator.com/item?id=20058454"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fb787d9182263f41bd74e994f2ce0a7b77ce68aa938531aa4f64b8f3ead993"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: delete handling as per https://news.ycombinator.com/item?id=20058454"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3506486fa3331ce9533fd9fceb9f12fa617e95755c2af70df2c79c6137ce25a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: account for tab stops. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/position.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4403fb70954dfffc6e194e62e0df60e09f74d91cffe8f355ea86545419029f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: switch to std::str::Pattern when it 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":"helix-core/src/search.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5914c0e51f9e0d87e429efdc9d8ec44f59cf595b08bc7affc1c7494bef278274"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: checkSelection -\u003E check if valid for doc length \u0026\u0026 sorted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f57481f53f24a276b8292ae69582213e15d41bcc093a6f635aacfbdce37c97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out a new primary index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8fd410013946a589185df149f1c7f2fbbbe9b0f038980ef5b59c74b39e0d40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out a new primary index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfffed5c92ff1883be2142aa89bb3ec621ee81618813448bdf11eeb019d8eed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out a new primary index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6caa84f255706b7b486601fecf3db4901a104f9cfa4af390fc54c8e51c92f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out a new primary index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ef1f623a2ac10e579a71842cd7e1f61561f0a7658f4a99d40ee0b959e19e5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support to split on capture #N instead of whole match \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a7c01a2db14330ce1410f079e4af85290bf7e48ab23a5082481f4670ca651d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: retain range direction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e501d19ed45a02f6669d2d509c2d7496151ac1d82bfa18574bb6636f44fe45b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: retain range direction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5681158e4846bd21c7dc073153585d425a9ae87637c2ac280ea2b8ea222bf9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: retain range direction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4fc6c8603b08ecc3d172706e2f9bfb7aedcdebf4530e519d58dd388fefabf7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rather than this behavior, maybe we want it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/selection.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66b17749fbfb27ab9ddce216a40ba2252c79c80d3fa204c75feb6d1c8f90ab6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: these predicates are allowed in tags.scm queries but not yet 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":"helix-core/src/syntax.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64f5f2f0b9e9aac1f056afe126bf0b203ca323249ab4ad3aa5c0222534ce814"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: content_regex handling conflict resolution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/syntax.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"306b58e25880ea0bf6476b09d128fa44bf9d34d90c0c47c81e5be174820ea6f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO; this is a lot easier with Change instead of Operation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/syntax.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"182dc031bc81d4f7914869e48508f8687308db3abf7d3b95b6ef9b4db49474a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the query for this works instead as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/syntax.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536ef87564e796eabc8396a3568e64756e9a8fef7e982c4e8c67a163ae66c9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pub(crate) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e76b83380962b7ee04994d3532b4700c9326a8da122d7075c80255a76284e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: from iter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5626511a4b6cd9c53ea44f257a28cc1d87329eb60808f41870589c7cdaee6088"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: max(a, b), shrink_to_fit() afterwards \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f782a951da57c675ff0c313eec8f898c0846959c32a0a0bc96bfb42714962186"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: cover this with a test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d5f4e6b9b5134a0240bf6d52e79aff290d4b64ff560bb5de8e7e2fea17ce41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: delete tracking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/transaction.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb08e1dd39bf1e10bda8d2fdd29d5cba886cef84674c3025fdbea2a89af6a104"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if the user removes the selection(s) in one snippet (but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/active.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e75398211cb82c93843b38c6f6bb5ab4386599d317398e73878136530994863"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error for invalid transforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/elaborate.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80e7effe0968ef5738ceca263280e456bd13514a774c333764265c5c563ead8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: proper 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":"helix-core/src/snippets/elaborate.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f5b14fa290509235afe863da994452fe56e1e3627c7ddc45a6d519d373466a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO parse as ECMAScript and convert to rust regex \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/parser.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98c6f11417f94b29e7ad22ff882aee351d846a05ffb3d14fa159c4b7e61553a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // invalid regex TODO: reneable tests once we actually parse this regex flavor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/parser.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a48e1260ca330aceae3874ef248fc546affcf20e2b59c0fc655e0bde44d0dc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO port more tests from https://github.com/microsoft/vscode/blob/dce493cb6e36346ef2714e82c42ce14fc461b15c/src/vs/editor/contrib/snippet/test/browser/snippetParser.test.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/parser.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2ef571f5e7663d9efe818bc373b76ce382d6acafe71dc81f9b76c814b2b4f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow resolve_var access to the doc and make it return rope slice \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/render.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59d3ebe687a23049bd1ca6c0810ea838388a97a8432ff8b3e2d3deda75176b2"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. The recognised ADR directories in this tree were read \u2014 \u0060runtime/queries/adl\u0060 \u2014 and none of their files is a decision record (a README, index or template page does not count). 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 \u0060helix-term/Cargo.toml\u0060 makes this repository a deployable product (line 39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/Cargo.toml"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54c2f03f4b65f80d3a7f8a6fb8b57548257b3cbfbfa3aaf8cf1fb95cf924831"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 15 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is \u0060helix-lsp-types\u0060 (8481 LoC, 501 module-visible types across 1 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","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":"1404bf6e991ac778c92dc72aca7cf2931e316a3203f5f47a471a391e743e7147"},"properties":{"commitSha":"cd972ae77da4c0976743ffdca48e268c195978f1"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"08ad21fade7b0959853923c6c0a887bdcb4b7efe0ffe4199b89ae3d784bfea99"},"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"ee6fe4db683eeb90935ad3bd5499654aacf9bc1cb68e47df1458236b0297ab31"},"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":"c5019c0e80b0c36835490896bf87a854a11c17f98ef01a5116ef35edfd85637a"},"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":"70683ec56cccab1d89999a47d3d4cf057dbeb67b035c400eb2b1f8b2d6c4750b"},"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":"bcc60520abe061cdb5130cf4f6224188e429315eeb32698edced308a049ee5ef"},"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":"b7cec80b8ba39c0dd5f694708334a814ceb009c290731526d42542c5b2795f3d"},"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":"096cb882082ee7926fcc4d9a5ad9318074a3de09fd30ca85b04255569b186782"},"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"63c4a093cd4d8270d8663d7b47af1062c73ee032c2d6873d217251d788ab2402"},"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":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"f96de53a9c41aa9762bf4bb7d8c6ceb5328ca215e45d4016e18c2ff1458e371c"},"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":"3643ff687baaf09e4fa86f24721b381bb8ec583e4fb1bc9174a893ca376bdfb1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49c16b6fbc91670e61b639ab9c9270b4df42b6b11889eae216a02e4dd9c52b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8259b8be486050d832e8cd0d3615cb14b1c44312ffed9c1274cb8979ba9ade8a"},"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":"7adc332f2d68b4a8e35c8868ce3df7038dc1a68ece15e2a5c16dee165f7a002c"},"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":"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":"6639faf0ac3cf89d7ab429c1328bdc07b80a97d1ce005ec4e73f499e1e95c384"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9cfc5f9a06b216dbbbd3407843e06a6206d00bc2e6e0260d5860112067213fa1"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c2196c686c088b67fad22801c0e652ce71505373973647e743a25f5a34644ed8"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"5cde887a6427c0e723e0418cff762ef9261ccc013f6e68aa2e6aaa4fc8282f18"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9ba9aa224bf0d1edb33905d7c425fddff74728653c52896bf755e3e22ad59ef8"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fe35ed57f6a92a4a51538a1805d3511e8485c631a0a0f2ee2333829f0389b17d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fbbece107cfb0f55d8f5030c83e7e0af2915af5c64a1ed004dff7ec5181cfbcb"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"2c12d860181e73c2d1b73d6ffc11880fdad392a9e10b91997ade484f388adc72"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"f98a5252cf643899a128d2b6f6d04b7713273d44fa70b088ba81df0a39c759a9"},"properties":{"dependency":{"package":"faster-hex","version":"0.10.0","advisory":"RUSTSEC-2026-0306","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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.9.10","advisory":"RUSTSEC-2026-0186","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":"64363d74ce1f052fae524dc374bd082dc62972fb05982f1a96c21eb7c322e135"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.4","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"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":"724dc287344d7132b72d1f16bb1fc253c8392cf978fd4bf6d454481b72775b59"},"properties":{"dependency":{"package":"rkyv","version":"0.8.16","advisory":"RUSTSEC-2026-0233","aliases":["RUSTSEC-2026-0234","RUSTSEC-2026-0235"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"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":"0897771ffd4e3ceb3419dde32bb5bb1ffcf0f4b413f8009f7ee61b96577e12ed"},"properties":{"dependency":{"package":"smartstring","version":"1.0.1","advisory":"RUSTSEC-2026-0249","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.50.0","advisory":"RUSTSEC-2026-0386","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, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/command_line.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d510d916ab71a266ccfd2cd626a8faf5f5b340cfb540291eba60d8eabe4f41"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99987ba97ae2352b535bf9282e09142436ba05f91fa051abbc97e64ddd01d197"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"560a038a2f846993dad4998168ff5ba9e9320ba5b2826a9fdadaeccacea20774"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28543dbe99df3c08397482b38b25c230561719301a00488c4fd4327a7425a200"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/semantic_tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc6d29ebe7881b19c0c38ed055730263813cbdf16abca2d412c2ccb8ab0fe7f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0527fb150bba9b7b507b278fe74b97c7b57b27768ee43d324bff45bad837ff9"}},{"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":"helix-view/src/keyboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eadef00322cbef86e041b8359f64f9149d3779c7f482ecb62629e54378f1144"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 71 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: helix-parsec/src/lib.rs, helix-core/src/text_annotations.rs, helix-stdx/src/faccess.rs, helix-core/src/surround.rs, helix-lsp-types/src/code_action.rs, helix-term/src/handlers/completion/request.rs, helix-term/src/keymap/default.rs, helix-core/src/auto_pairs.rs (and 63 more) (78 orphaned of 181 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 181 of the 221 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-parsec/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a18224129c2b2852929fa1d2fe50482a12009d858c03c7a43d4bcfe6815364"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/text_annotations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ab64a7a4f5715dbb3314526f70eaeaf00aa3a62a3cd9c1419121369e448331"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/faccess.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b975023137a95a9185ca7a440e2931daa5ecdf071d4d976c40eb813dc87d0f9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/surround.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2db93e2018a1746601d736a402f4485c79bf71ab20f0ac95465e5ee298a7628"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/code_action.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"195e8a776808765554d7815bd127bf0d55ca9882191d0a129689de9bcfba1b52"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bc0c5d8c1a5a028a9c5672087968f4cbde65c567fed5c3599114efded3848a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/keymap/default.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e9790fdaa28f5bc244556a384733ef12acc3a2d61d2d7a07d8862965d48cf4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/auto_pairs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06965cdd4ca09e1a3f915591a53728025373bee9f5efdb7c9e9a1f1fc944c59"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/elaborate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf833dc844a1a0c7163006ad0f726fa803322349c686e05cf481d874fa14832"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d147c042005e03bb368c06386af73ecf5bd17881637045f6167c00d3b34c6d93"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/notification.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff1dca479cc9e52b71b783e3a494a1d528b7d49725a34bc2e0e49899556d9b6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/signature_help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e24612e640a4646e3fb9a952b11661c0581c69827177b6347c071c15129f9de"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/expansion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e410bf13683e9e346492d960d0d5123f70d29fb91110229801263e9bcf2078a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/test.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85da5b813755154fb99251ba72ebd44c529c5e648507b91d0e0625ec049a6263"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/line_ending.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36ee005b44a0fb42904fb7ea8d921c758a52e14a02d58b172e6734605ab3994"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/snippets/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e34e223cf0a99c213c93b273a9bf8a8693956eb1b7815a1909125cbf0bce6a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/uri.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fcb975e3e34a0258455f4750c7d0fa191bd674982e9f9386d56be9a9aee857"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52075659e4b64137d1c54184207f030f88b45cc0e73c8758de5e80e90696f448"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/lsif.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0179f2b55fbb767b2624683704fc89cd39eaaa53a3b847f07abae320e8e25e3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/increment/date_time.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93749c3218f5e0b1f6ffe862b98f5b01a5ad48fe9c90396d02f513a303c6bce0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/annotations/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16757e19500326f72816303edf5eb2c2319acfcdb77f31d983bbab6518d9a00"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54f23715717cb814e3499182faec25b27751c266543e8fa912792abc5fd8434"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/inlay_hint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b33df00830807b28cf319cf75fce43342bf068162aa8354213ee9484f61546"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-event/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab82c85d930d1ded3cff5c5bd44581a8ec96678cda8f9c99eedc24955d6beb7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-event/src/cancel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc16dd23adc3387d9fd11d2078aa097b9fa8d8fcfe4f2dd23977758457596b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/signature_help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f1cb9783862ca8f0d8235c0cc285c879da562a753b4846b536f71984c2c23"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/increment/integer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"994a95f198f9df3d2ad2fc5d237cddd010982eb1c5b8a4fc00b9922a9e862beb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/file_operations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2699ca3951f7d03028192195d25e5b95ee6ddc7ad13fd1f3ccba1bd619359964"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/diff/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"764b74d607687f8d13625c1f41d81ccd1b2c28be173f1b8363b85488d57c0efd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8662712f741dbce926685aaad592e046ac24213549a86d289cc8198fe12758c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/inline_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad7210013936041e22452d670de80b6ce9a83c6c2fa1f40ba774b440437f81c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/lsp/signature_help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb433ae0245f227fd9f99719943101de4d88bab6ed4ae773c4b8847f5d5b2305"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp/src/file_event.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cfc6fbe3ae1d1f2be9aaaa60c160263a1494ddba42fc6666c5939c41d24ffa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/picker/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f285a213c3eef99bcdf3dd287435538853e01766f954207647f159d1073940"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/inline_completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f326b881a1932b3e0fdfa74df64d2406c7dcf75ea78b41727e41d986218fbabe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/doc_formatter/test.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d3e752cf764b408f6d3919b74733172a917312633057feebe5603c6b6659f3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"507be18b437f0af162e8ebd9bbea5fe8f3bfe830b18925d3b97b26e2d936f7f0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/diff/line_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2fd2f3df8a2326ad3d13d89ef5514d5ce392b6519a8431a6335eb8aff192d2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/lsp/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4d9407594e776541d640a359e80fdfee20c12dd0f654189436eab45be32397"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/docgen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"378bb5d81a319f6aee100c266676c4c9e68ecb625837f052e53f991191702e23"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/folding_range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ce75d422a2eac34aa9d91453ee7fd930b59f88b1ee75e9c259744022eef6af"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac65755b5b4377258d7b3bc65d1a909875007fd45a65d45e4195e3f4e730282"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/progress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9f6b9dd223ac06fa5349ae016d30e62cd780b47c37e0d14fd4c3b4d1fd39b5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/workspace_diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d7cb943646f0a9d3c7e24ab0639261c34fc380cd0e40abe32fdb93369c5905"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/formatting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da229c5bd336aa0fce7ea4acdcd16c2c3d787d28082042303ff4ab6be98483a8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/document_symbols.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b06e3cd4eca119969622d7ebb1f6aaba83717ab937c585c972f99298c1c84ea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-event/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16bfc416bce07c64b86225f81fdb87ee1018c8bd79a745bbbe5215e6e1ce4a5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/chars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87701e7f39d6bfc42e1afda80232a6dce5e299bfe9d3ce76fea5d77b5c71112"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/call_hierarchy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e154f9a8efaeacdb6a3d8b98cd563662f16a7b9aae184b9b4710f45da270aa5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/color.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"202a6e42a101f59fb1b4418621612e624077e26d891bf3cd04b4c1a0315c754e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-view/src/handlers/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e005d2e9ea144de0f86dd590936226d5c46bfd5d989945400c4f5ffee9ae2d78"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/word.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a9f1fad6ccd969c18cded53ea0f5913e5aeacfff6ecd457f50bac6c10222e4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-core/src/object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8b39d11e04e831804e6972f280f2ab20fbbda4e5382a0a31aa5ddadd3bce94"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/completion/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f4726d5b3c1912f755da9f382bb6910255c7316cc40baac4826c30d572b52"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/workspace_symbols.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac5aee210e5ef96ec24ebb00ee2d3e0c2124e9dd2fdb5281f9f629f5484c376"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/keymap/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baa3b155bb12c8cdb68f17f91ec4cf5c0893b59a6c533832c8ac73c3871fcb4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-vcs/src/diff/worker/test.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"659edf28befa365047e031d11bd99c266eebed49b3d70654cf3e9934d2035de8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-stdx/src/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d890c1d39aa48f860b2535a16d600da844154706f02f9059734388384e488ac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/ui/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9a38c6823de1fe022a98a0550c07a4a3842d9741d9ca6be1d24b0c4017e120"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-dap/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a974cdeeae20a8d701e6fcfe000390a64c3c5124f28f79ea25014fcb68bc58"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers/auto_save.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"490bd311d22de4c6ce5267f6ae0fd036a2cdb6fd867b1287bc761d2f2ad15d09"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-event/src/hook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a267ff817edcf322377ec17297a89b80affbc759b227c96c6ef9cbe78e75eaf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/type_hierarchy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9244ce183f600bcb59fb361ab3df5d4c06e8fbb78f84df971a77fa4b499f40e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/moniker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"267186839ac087054a64bd3f77f7268ec9a484f9e6b3ed6fb02a857df14ba716"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-event/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"890bd365b78955a280b089e12ae088622e8e70ffa66a71b9e84829f385bca9dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b543b99f6c3c4bb6e42d17bdda2ae05d5bc4fd8e5e1b932486ccf8926c53643a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-event/src/debounce.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"832cb424a742b76db481116575a2648ebbdd989160e201b06f2f804c031939e1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/selection_range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44045250875fd01fde80cd4d54a768ec984e78b20b66a3a4b18ca236e14a0e56"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65c263086c95fe01658b4b6ad3991932a1e342ad2e77ad8b9202d3432ac5658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/code_lens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443a92eef4cbb71aa020ded88cb8a0ae35de1cb2a79c28c4aa17bfc9cbcd85f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-lsp-types/src/document_link.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa866e0d76b44d482322e7929df6d2a2edf4224676bc146c8027b393839c1ac"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: handlers.rs \u2194 document.rs: \u0060helix-term/src/handlers.rs\u0060 (context helix-term) and \u0060helix-view/src/document.rs\u0060 (context helix-view) sit in DIFFERENT parts of the tree yet change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00609a07a826\u0060 feat(lsp): add indicator for code actions (#15820); \u0060e83e0d6b\u0060 feat(lsp): documentLink highlights (#15235); \u00609868e3dd\u0060 feat(lsp): automatic document highlight (#15221) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-term/src/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a8f8aacae8746adb5d5ee803da9f60ad2c84c216f12ffa38748a85b44a594"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: crossterm.rs \u2194 test.rs: \u0060helix-tui/src/backend/crossterm.rs\u0060 and \u0060helix-tui/src/backend/test.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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 7 shared commits counted here, the most recent 3 are \u00609bcdf4d7\u0060 tui: Adjust rendering to avoid flushing and render each frame atomically; \u0060c1040651\u0060 Emit OSC11 to update terminal background on theme change; \u006023a647ae\u0060 Support mode 2031 dark/light mode detection (#14356) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d813f1c09158a934dbd719ee623eb911dcda38bf7c59d8801cdd20f7450db0"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23242335439540a7f0752c9def5c038b557d1cb0f8e6f7b448b5f69adcab3c1d"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.90: rust-toolchain.toml declares Rust 1.90 as this project\u0027s toolchain file, and Rust 1.90, superseded by 1.91 on 2025-10-30 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-10-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b39d33b2be1670c0605c9fdd37076cc021281c31b7efef7866b9af2690558"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Ciframe\u003E without a title: An iframe with no title (or an empty one) is announced only as \u0022frame\u0022. Add a non-empty title describing its content, or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"book/theme/index.hbs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a450bac8c3321713de94c34391b350d5580bc6ece38a94c6ac033d72c0e8fd60"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 9/10 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"book/theme/index.hbs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcad7314bfea214b8fadd977049c4450ccdadcc495e035257df5c7ac774bee41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env_var_is_set(\u0022TMUX\u0022) \u0026\u0026 binary_exists(\u0022tmux\u0022)\u0060 appears character-identically in 2 files \u2014 helix-view/src/clipboard.rs, helix-view/src/editor.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":"helix-view/src/clipboard.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f057f7ff1f2b84108a58929763c1dddb0ca26185d8c14f087baac98488fcff8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060removed.contains(Modifier::SLOW_BLINK) || removed.contains(Modifier::RAPID_BLINK)\u0060 appears character-identically in 2 files \u2014 helix-tui/src/backend/crossterm.rs, helix-tui/src/backend/termina.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":"helix-tui/src/backend/crossterm.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"47936e1d37f23ba967def01be33771afba9ee84f1689e32069425db5d463591f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scroll_line \u003C= i \u0026\u0026 i \u003C scroll_line \u002B scroll_height\u0060 appears character-identically in 2 files \u2014 helix-term/src/ui/menu.rs, helix-term/src/ui/popup.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":"helix-term/src/ui/menu.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a5fd3bf62a2a25e9e778c4e742f65e4c2a8f55ad33a5a152141efe2a529486"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003E= self.area.left() \u0026\u0026 x \u003C self.area.right() \u0026\u0026 y \u003E= self.area.top() \u0026\u0026 y \u003C self.area.bottom()\u0060 appears character-identically in 2 files \u2014 helix-term/src/ui/popup.rs, helix-tui/src/buffer.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":"helix-term/src/ui/popup.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4e692257bb1e46c322e24e87a8f2bc780eba68c6489647d09516b0bdb97274"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060last_visual_line\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":"helix-view/src/view.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292819df5b0f74bcba71b5723e4ed78f8f56676e70dcdbd694b36f40b2d7506"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060capture_scopes\u0060 (in \u0060highlightcheck\u0060) turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bf46887f31daa652b6f5f8ab08bc870dc6a80bdf46d5f843f931b37adf2168"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":38,"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."]}]}